Research of pareto-based multi-objective optimization for multi-vehicle assignment problem based on MOPSO

  • Authors:

  • Ai Di-Ming;Zhang Zhe;Zhang Rui;Pan Feng

  • Affiliations:

  • Beijing Special Vehicles Research Institute, School of Automation, Beijing Institute of Technology, Haidian District Beijing, P.R.China;Beijing Special Vehicles Research Institute, School of Automation, Beijing Institute of Technology, Haidian District Beijing, P.R.China;Beijing Special Vehicles Research Institute, School of Automation, Beijing Institute of Technology, Haidian District Beijing, P.R.China;Beijing Special Vehicles Research Institute, School of Automation, Beijing Institute of Technology, Haidian District Beijing, P.R.China

  • Venue:
  • ICSI'11 Proceedings of the Second international conference on Advances in swarm intelligence - Volume Part II
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.