The problem of scheduling is an area that has attracted a lot attention from researchers for many years. Its goal to optimize resources in the system. lecturer’s assigning task example timetabling problem, class scheduling. This study introduces mathematical model assign constrained tasks (the time and required skills) university lecturers. Our capable generating calendar maximizes faculty expe...

Abstract The pilgrimage to Mecca, which is called Hajj, the largest annual pedestrian crowd management problem in world. During pilgrims are accommodated camps. For safety reasons, exact times and directions given who moving between holy sites. Despite importance of complying with those schedules, violations can often be conjectured. Directing a small workforce camps monitor pilgrims’ complianc...

in this paper, a multi-objective reconfiguration problem has been solved simultaneously by a modified ant colony optimization algorithm. two objective functions, real power loss and energy not supplied index (ens), were utilized. multi-objective modified ant colony optimization algorithm has been generated by adding non-dominated sorting technique and changing the pheromone updating rule of ori...

In this paper, we propose a nonlinear multi-objective optimization problem whose parameters in the objective functions and constraints vary in between some lower and upper bounds. Existence of the efficient solution of this model is studied and gradient based as well as gradient free optimality conditions are derived. The theoretical developments are illustrated through numerical examples.

1 Graduate Student, Department of Knowledge Engineering and Computer Sciences, Doshisha University ,1-3 Tatara Miyakodani,Kyo-tanabe, Kyoto, 610-0321, JAPAN [email protected] http://mikilab.doshisha.ac.jp/~sin/ 2 Department of Knowledge Engineering and Computer Sciences, Doshisha University ,1-3 Tatara Miyakodani,Kyo-tanabe, Kyoto, 610-0321, JAPAN [email protected],[email protected]...

In this paper, we approach a multi-objectiveH problem with several H constraints from the Banach duality point of view. The problem is reduced to an abstract norm minimization problem, and the dual problem is derived using the classical Banach result. It completes the primal-dual pair which can be used to solve the problem numerically by finitedimensional approximations. While the approximation...