Volume 7 Number 4 (Apri. 2012)
Home > Archive > 2012 > Volume 7 Number 4 (Apri. 2012) >
JCP 2012 Vol.7(4): 918-922 ISSN: 1796-203X
doi: 10.4304/jcp.7.4.918-922

Heuristic Algorithm for Min-max Vehicle Routing Problems

Chunyu Ren
Heilongjiang University /School of Information science and technology, Harbin, China
Abstract—In order to satisfy with the individual and various demand of customer, the present study is focused on the Min-Max Vehicle Routing Problem (MMVRP). According to the characteristics of model, new tabu search algorithm is used to get the optimization solution. It applies newly improved insertion method to construct initial solution, to improve the feasibility of the solution; centers the longest route to design dual layered random operation to construct its neighborhood, to realize the strategy of optimizing between and within the route, to boost the efficiency and quality of the searching. Applies auto adaptive tabu length to control the searching capability dynamically; At last, it uses simulated experiments to prove the effectiveness and feasibility of this algorithm, and provides clues for massively solving practical problems.

Index Terms—MMVRP, new tabu search algorithm, improved insertion method, dual layered random operation, auto adaptive tabu length.

[PDF]

Cite: Chunyu Ren, "Heuristic Algorithm for Min-max Vehicle Routing Problems," Journal of Computers vol. 7, no. 4, pp. 918-922, 2012.

General Information

ISSN: 1796-203X
Abbreviated Title: J.Comput.
Frequency: Monthly
Editor-in-Chief: Prof. Liansheng Tan
Executive Editor: Ms. Nina Lee
Abstracting/ Indexing: DBLP, EBSCO,  ProQuest, INSPEC, ULRICH's Periodicals Directory, WorldCat, CNKI,etc
E-mail: jcp@iap.org
  • Jul 19, 2019 News!

    Vol 14, No 7 has been published with online version   [Click]

  • Jun 21, 2019 News!

    Vol 14, No 6 has been published with online version   [Click]

  • Apr 28, 2019 News!

    Vol 14, No 5 has been published with online version 7 papers are published in this issue after peer review   [Click]

  • Mar 20, 2019 News!

    Vol 14, No 3 has been published with online version   [Click]

  • Feb 22, 2019 News!

    Vol 14, No 2 has been published with online version 8 papers are published in this issue after peer review   [Click]

  • Read more>>