Study on Improved Tabu Search Algorithm for Min-Max Vehicle Routing Problem

Abstract:

Article Preview

The paper is focused on the Min-Max Vehicle Routing Problem. And solve this type of problems utilizing improved tabu search algorithm from the overall situation. According to the features of the problem, the essay centered the longest route to construct neighborhood structure. For the operation, 1-exchange and 2-opt* were applied, it can also fasten the speed of convergence, and boost the search efficiency. Finally, the good performance of this algorithm can be proved by experiment calculation and concrete examples.

Info:

Periodical:

Edited by:

Ford Lumban Gaol, Mehdi Roopaei, Svetlana Perry and Jessica Xu

Pages:

178-181

DOI:

10.4028/www.scientific.net/AMM.87.178

Citation:

C. Y. Ren "Study on Improved Tabu Search Algorithm for Min-Max Vehicle Routing Problem", Applied Mechanics and Materials, Vol. 87, pp. 178-181, 2011

Online since:

August 2011

Authors:

Export:

Price:

$35.00

In order to see related information, you need to Login.

In order to see related information, you need to Login.