登入選單

返回Google圖書搜尋

A Simple and Efficient Perturbation Heuristic to Solve the Vehicle Routing Problem

Fayez Fouad BoctorSylvain GirardJacques RenaudUniversité Laval. Faculté des sciences de l'administration. Direction de la recherche

出版	Faculté des sciences de l'administration, Université Laval, 2005
ISBN	28952423809782895242383
URL	http://books.google.com.hk/books?id=Cw2aAAAACAAJ&hl=&source=gbs_api

註釋

Many efficient meta-heuristics were developed to solve the vehicle routing problem (VRP). However, these heuristics often require large computation times and significant effort to implement. In this paper we propose a simple and efficient heuristic that only uses the Clarke and Wright[alpha]s savings heuristic, the 2-opt and the 3-opt improvement heuristics. It will be shown that the proposed heuristic yields solutions almost as good as those of most efficient meta-heuristics published previously. The proposed heuristic, for 34 benchmark instances, yielded solutions whose values lie on average within 0.97% of the best known solutions.