登入選單

返回Google圖書搜尋

An Adaptive Memory Heuristic for a Class of Vehicle Routing Problems with Minmax Objective

Bruce L. GoldenGilbert LaporteÉric D. Taillard

出版	Université de Montréal, Centre de recherche sur les transports, 1995
URL	http://books.google.com.hk/books?id=8cG6GwAACAAJ&hl=&source=gbs_api

註釋

This paper proposes a tabu search based heuristic for a class of routing problems with minimax objective. It first describes the an algorithm for the minimax capacitated vehicle routing problem, consisting of determining a set of m vehicle routes of minimum total length, each starting and ending at a depot, such that each customer is visited exactly once and the total demand of any route does not exceed Q. The paper then shows the application of this algorithm to a special case of the above problem, the m-traveling salesman problem, in which Q is arbitrarily large, and also shows how the algorithm can be extended to solve the minimax version of the capacitated vehicle routing problem with multiple use of vehicles. Computational results are included.