Metaheuristic for solving routing problem in logistics management

Metaheuristic for solving routing problem in logistics management

0.00 Avg rating0 Votes
Article ID: iaor200968870
Country: United Kingdom
Volume: 6
Issue: 2
Start Page Number: 223
End Page Number: 246
Publication Date: Jun 2009
Journal: International Journal of Operational Research
Authors: ,
Keywords: heuristics
Abstract:

Multi Depot Vehicle Routing Problem with Time Windows (MDVRPTW) is one of the major logistics problems. In this paper a two phase heuristics is proposed in which the customers are assigned to the depot in the first phase. The routes are constructed with modified ant colony optimisation procedure and are improved using 2-Opt procedure in phase two. The proposed heuristic has been applied to Cordeau MDVRPTW benchmark problems. It is found that the proposed heuristic gives promising and better results, on an average, as compared to those solutions given by the existing heuristic for the MDVRPTW.

Reviews

Required fields are marked *. Your email address will not be published.