TY - GEN
T1 - Research of Pareto-based multi-objective optimization for multi-vehicle assignment problem based on MOPSO
AU - Di-Ming, Ai
AU - Zhe, Zhang
AU - Rui, Zhang
AU - Feng, Pan
PY - 2011
Y1 - 2011
N2 - The purpose of a multi-vehicle assignment problem is to allocate vehicles to complete various missions at different destinations, meanwhile it is required to satisfy all constrains and optimize overall criteria. Combined with MOPSO algorithm, a Pareto-based multi-objective model is proposed, which includes not only the time-cost tradeoff, but also a "Constraint-First-Objective- Next" strategy which handles constraints as an additional objective. Numerical experimental results illustrate that it can efficiently achieve the Pareto front and demonstrate the effectiveness.
AB - The purpose of a multi-vehicle assignment problem is to allocate vehicles to complete various missions at different destinations, meanwhile it is required to satisfy all constrains and optimize overall criteria. Combined with MOPSO algorithm, a Pareto-based multi-objective model is proposed, which includes not only the time-cost tradeoff, but also a "Constraint-First-Objective- Next" strategy which handles constraints as an additional objective. Numerical experimental results illustrate that it can efficiently achieve the Pareto front and demonstrate the effectiveness.
KW - Multi-objective Particle swarm optimizer (MOPSO)
KW - Multi-objective vehicle assignment problem
KW - Pareto
UR - http://www.scopus.com/inward/record.url?scp=79958197713&partnerID=8YFLogxK
U2 - 10.1007/978-3-642-21524-7_2
DO - 10.1007/978-3-642-21524-7_2
M3 - Conference contribution
AN - SCOPUS:79958197713
SN - 9783642215230
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 10
EP - 16
BT - Advances in Swarm Intelligence - Second International Conference, ICSI 2011, Proceedings
T2 - 2nd International Conference on Swarm Intelligence, ICSI 2011
Y2 - 12 June 2011 through 15 June 2011
ER -