Academic
Publications
An Iterated Local Search for Solving A Location-Routing Problem

An Iterated Local Search for Solving A Location-Routing Problem,10.1016/j.endm.2010.05.111,Electronic Notes in Discrete Mathematics,Houda Derbel,Basse

An Iterated Local Search for Solving A Location-Routing Problem   (Citations: 1)
BibTex | RIS | RefWorks Download
This paper focuses on a location routing problem with multiple capacitated depots. Our aim is to deal with this problem by considering the decisions of location and routing simultaneously. We develop an iterative local search to deal with this problem. The fundamental feature is to improve the solution successively by intensifying the solution space with the local search. A computational study is provided to compare our approach with the tabu search heuristic.
Journal: Electronic Notes in Discrete Mathematics , vol. 36, pp. 875-882, 2010
Cumulative Annual
View Publication
The following links allow you to view full publications. These links are maintained by other sources not affiliated with Microsoft Academic Search.
Sort by: