Particle swarm optimization for task assignment problem

2002 ◽  
Vol 26 (8) ◽  
pp. 363-371 ◽  
Author(s):  
Ayed Salman ◽  
Imtiaz Ahmad ◽  
Sabah Al-Madani
Keyword(s):  
Particle Swarm Optimization ◽  
Assignment Problem ◽  
Particle Swarm ◽  
Task Assignment ◽  
Swarm Optimization ◽  
Task Assignment Problem

Particle Swarm Optimization Applied To Task Assignment Problem

2016 ◽  
Author(s):  
Jean L. Pierobom ◽  
Myriam R. Delgado ◽  
Celso A. A. Kaestner
Keyword(s):  
Particle Swarm Optimization ◽  
Assignment Problem ◽  
Particle Swarm ◽  
Task Assignment ◽  
Swarm Optimization ◽  
Task Assignment Problem

scholarly journals Particle Swarm Optimization Using Neighborhood-Based Mutation Operator and Intermediate Disturbance Strategy for Outbound Container Storage Location Assignment Problem

2019 ◽  
Vol 2019 ◽  
pp. 1-13 ◽  
Author(s):  
Yuyan He ◽  
Aihu Wang ◽  
Hailiang Su ◽  
Mengyao Wang
Keyword(s):  
Particle Swarm Optimization ◽  
Assignment Problem ◽  
Particle Swarm ◽  
Local Solution ◽  
Mutation Operator ◽  
Swarm Optimization ◽  
Intermediate Disturbance ◽  
Storage Location ◽  
Location Assignment ◽  
Container Storage Location Assignment

Outbound container storage location assignment problem (OCSLAP) could be defined as how a series of outbound containers should be stacked in the yard according to certain assignment rules so that the outbound process could be facilitated. Considering the NP-hard nature of OCSLAP, a novel particle swarm optimization (PSO) method is proposed. The contributions of this paper could be outlined as follows: First, a neighborhood-based mutation operator is introduced to enrich the diversity of the population to strengthen the exploitation ability of the proposed algorithm. Second, a mechanism to transform the infeasible solutions into feasible ones through the lowest stack principle is proposed. Then, in the case of trapping into the local solution in the search process, an intermediate disturbance strategy is implemented to quickly jump out of the local solution, thereby enhancing the global search capability. Finally, numerical experiments have been done and the results indicate that the proposed algorithm achieves a better performance in solving OCSLAP.

A Hybrid Swarm Optimization Algorithm for Complex Assignment Problem

2010 ◽  
Vol 26-28 ◽  
pp. 1151-1154
Author(s):  
Zong Li Liu ◽  
Jie Cao ◽  
Zhan Ting Yuan
Keyword(s):  
Assignment Problem ◽  
Production Scheduling ◽  
Large Scale ◽  
Optimization Problems ◽  
Graph Model ◽  
Task Assignment ◽  
Hybrid Swarm ◽  
Swarm Optimization ◽  
Computing Technique ◽  
Task Assignment Problem

The optimization of complex systems, such as production scheduling systems and control systems, often encounters some difficulties, such as large-scale, hard to model, time consuming to evaluate, NP-hard, multi-modal, uncertain and multi-objective, etc. It is always a hot research topic in academic and engineering fields to propose advanced theory and effective algorithms. As a novel evolutionary computing technique, particle swarm optimization (PSO) is characterized by not being limited by the representation of the optimization problems, and by global optimization ability, which has gained wide attentation and research from both academic and industry fields. The task assignment problem in the enterprise with directed graph model is presented. Task assignment problem with buffer zone is solved via a hybrid PSO algorithm. Simulation result shows that the model and the algorithm are effective to the problem.

Sign in / Sign up

Export Citation Format

Share Document