A compact model and tight bounds for a combined location-routing problem |
| |
| Affiliation: | 1. College of Information Science and Technology, Donghua University, Shanghai 201620, China;2. Faculty of Engineering, University of Toyama, Toyama-shi 930-8555, Japan;3. The Key Laboratory of Embedded System and Service Computing, Ministry of Education, Tongji University, Shanghai 200092, China;1. School of Industrial Engineering, College of Engineering, University of Tehran, Tehran, Iran;2. Department of Industrial Engineering, Iran University of Science & Technology, Tehran, Iran |
| |
| Abstract: | This paper considers a combined location-routing problem. We define an auxiliary network and give a compact formulation of the problem in terms of finding a set of paths in the auxiliary network that fulfill additional constraints. The LP solution to the considered model provides an initial lower bound and is also used in a rounding procedure that provides the initial solution for a Tabu search heuristic. Additionally, we propose a different lower bound based on the structure of the problem. The results of computational testing on a set of randomly generated instances are promising. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
