A two-phase tabu search approach to the location routing problem |
| |
| Institution: | 1. School of Statistics and Mathematics, Zhongnan University of Economics and Law, Wuhan 430073, China;2. School of Information Engineering, Wuchang University of Technology, Wuhan 430223, China;3. Hubei Key Laboratory of Applied Mathematics, Faculty of Mathematics and Statistics, Hubei University, Wuhan 430062, China;4. Institute of Uncertain Systems, Huanggang Normal University, Huanggang 438000, China;1. Interuniversity Research Centre on Enterprise Networks, Logistics and Transportation (CIRRELT), Université Laval, 2325, Rue de la Terrasse, Quebec G1V 0A6, Canada;2. Department of Economics and Management, University of Brescia, Contrada Santa Chiara 50, 25122 Brescia, Italy;3. Canada Research Chair in Integrated Logistics, Université Laval, 2325, Rue de la Terrasse, Quebec G1V 0A6, Canada |
| |
| Abstract: | In many distribution systems, the location of the distribution facilities and the routing of the vehicles from these facilities are interdependent. Although this interdependence has been recognized by academics and practitioners alike, attempts to integrate these two decisions have been limited. The location routing problem (LRP), which combines the facility location and the vehicle routing decisions, is NP-hard. Due to the problem complexity, simultaneous solution methods are limited to heuristics. This paper presents a two-phase tabu search architecture for the solution of the LRP. First introduced in this paper, the two-phase approach offers a computationally efficient strategy that integrates facility location and routing decisions. This two-phase architecture makes it possible to search the solution space efficiently, thus producing good solutions without excessive computation. An extensive computational study shows that the TS algorithm achieves significant improvement over a recent effective LRP heuristic. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
