By Topic

Task allocation using inherited area density multiobjective particle Swarm Optimization

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Rabil, B.S. ; Mentor Graphics Egypt, Cairo ; Fahmy, M.A. ; Aly, G.M.

In this paper, we present a new approach that helps managers to optimize task allocation and work load distribution using multiobjective particle swarm optimization (MOPSO). A new algorithm has been introduced to increase number of nondominated solutions (Pareto front size), by using inheritance of nondominated solutions density estimators and modifying density estimation algorithm. The performance of the new algorithm is evaluated on test functions and metrics from literature. The results show that the proposed algorithm is competitive in converging towards the Pareto front and generates a well distributed set of nondominated solutions. The new approach helps managers to avoid juggling many objectives to develop a project plan. These include minimizing cost, defects, and completion time; and maximizing worker utilization and customer satisfaction. Many of these objectives are conflicting. For example, a demand to decrease completion time clashes with a goal to minimize defects.

Published in:

Evolutionary Computation, 2007. CEC 2007. IEEE Congress on

Date of Conference:

25-28 Sept. 2007