Research of Pareto-Based Multi-Objective Optimization for Multi-Vehicle Assignment Problem Based on MOPSO

被引:0
作者
Ai Di-Ming [1 ]
Zhang Zhe [1 ]
Zhang Rui [1 ]
Pan Feng [1 ]
机构
[1] Beijing Inst Technol, Sch Automat, Beijing Special Vehicles Res Inst, Beijing 100081, Peoples R China
来源
ADVANCES IN SWARM INTELLIGENCE, PT II | 2011年 / 6729卷
关键词
Multi-objective vehicle assignment problem; Pareto; Multi-objective Particle swarm optimizer (MOPSO);
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
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.
引用
收藏
页码:10 / 16
页数:7
相关论文
共 6 条
  • [1] [Anonymous], P 14 INT C COMP APPL
  • [2] [Anonymous], OPTIMIZATION AIR VEH
  • [3] Arulselvan A., 2007, NAVAL RES LOGISTICS
  • [4] Chandler PR, 2002, P AMER CONTR CONF, V1-6, P1831, DOI 10.1109/ACC.2002.1023833
  • [5] Pan F., 2008, IEEE SWARM INT S SIS
  • [6] Pan F., 2008, INT C HUM SYST 2008