\`x^2+y_1+z_12^34\`
Advanced Search
Advanced Search
Advanced Search
This issue Previous Article Next Article
Article Contents
Article Contents
2010, Volume 6, Issue 2: 435-451. Doi: 10.3934/jimo.2010.6.435
This issue Previous Article On the optimal replenishment in a finite planning horizon with learning effect of setup costs Next Article

A two-stage hybrid meta-heuristic for pickup and delivery vehicle routing problem with time windows

  • 1.

    Economics and Trade College, Hunan University, 410079

  • 2.

    School of Management, Hunan University of Commerce, 410205

  • 3.

    Mathematics and Computing Science College, Changsha University of Science and Technology, 410076

Received:  March 31, 2009
Revised:  December 31, 2009
Published:  March 2010
Abstract Related Papers Cited by
    Abstract
  • A two-stage hybrid meta-heuristic for pickup and delivery vehicle routing problem with time windows and multiple vehicles is considered in this paper. The first stage uses simulated annealing algorithm to decrease the number of used vehicles, the second stage uses tabu search to decrease the total travel cost. Experimental results show the effectiveness of the algorithm which has produced many new best solutions on problems within 600 customers. In particular, it has improved 45% and 81.7% of the best solutions on the 200 and 600-customer benchmarks, sometimes by as much as 3 vehicles. These results further confirm the benefits of two-stage approaches in vehicle routing problems.
    Mathematics Subject Classification: Primary: 58F15, 58F17; Secondary: 53C35.

    Citation:
    shu

    \begin{equation} \\ \end{equation}
    • Related Papers
  • Cited by
  • Access History
  • 加载中
PDF
XML
Export Citation
SHARE
Email to a Friend

Article Metrics

HTML views() PDF downloads(184) Cited by(0)

Access History

Other Articles By Authors

Catalog

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return
    Site map Copyright © 2023 American Institute of Mathematical Sciences