Earticle

초록

영어

To minimize the length of travelling distance of the longest sub-route in vehicle routing problem, the max-min ant system with parameter adaptation is adopted, which can be applied to different datasets in practice. Routes are constructed by sequential and parallel methods for the customers with clustering and random distribution respectively. Since the behavior of ant colony algorithm depends strongly on the given parameter values, these parameters include expectation heuristic factor, choice probability, level of pheromone persistence, and the number of ants, are self-adaptive at different stages in the course of algorithm execution, which help to accelerate convergence and enhance the searching around optimal solution, as well as to guarantee the diversity of solution to avoid falling into local optimization. Seven classical instances are tested for min-max vehicle routing problem; the results demonstrate that max-min ant system with parameter adaptation has high effectiveness, fast convergence speed, and robustness in solving these problems．

목차

Abstract
 1. Introduction
 2. The Min-max Vehicle Routing Problem
 3. The Max-min Ant System with Adaptive Parameter
  3.1. Line building
  3.2. Pheromone update
  3.3. Parameter selection
  3.4. Local search
 4. Calculation results
 5. Conclusion
 References

키워드

저자

• Lingxia Liu [ Anyang Normal University ]
• Qiang Song [ Anyang Normal University, Wuhang University of Technology ]

참고문헌

발행기관

간행물

표지보기 관심저널 등록

• 간행물명

  International Journal of Hybrid Information Technology

• 간기

  격월간

• pISSN

  1738-9968

• 수록기간

  2008~2016

• 십진분류

  KDC 505 DDC 605