Advertisement

Optimization of Special Vehicle Routing Problem Based on Ant Colony System

  • Xia Liu
  • Huan Qi
  • Yingchun Chen
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4114)

Abstract

In emergent airdropping, there are some special requirements for the vehicle routing problem. The airdropping personnel and equipment, geographically scattered, should be delivered simultaneously to an assigned place by a fleet of vehicles as soon as possible. In this case the objective is not to minimize the total distance traveled or the number of vehicles as usual, but to minimize the time of all personnel and equipment delivered with a given vehicle number. Ant colony system with maximum-minimum limit is adopted to solve these problems. The distance of each route is computed and the route with maximum distance is chosen. The objective is to minimize the maximum distance. The algorithm is implemented and tested on some instances. The results demonstrate the effectiveness of the method.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Xia Liu
    • 1
    • 2
  • Huan Qi
    • 1
  • Yingchun Chen
    • 1
  1. 1.Dept. of Control Science & Engineering, Huazhong University of Science & Technology, Wuhan 430074China
  2. 2.School of Physics and Information Engineering, Jianghan University, Wuhan 430056China

Personalised recommendations