首页 | 本学科首页   官方微博 | 高级检索  
     


A simulated annealing heuristic for the open location-routing problem
Affiliation:1. Department of Economics and Management, Università di Brescia, Brescia, Italy;2. Department of Statistics and Operations Research, Universitat Politècnica de Catalunya, Barcelona Graduate School of Mathematics, Barcelona, Spain;3. Department of Statistics and Operations Research, Universitat Politècnica de Catalunya, Barcelona, Spain;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 Electronic Commerce, Jiu Jiang University, 551 Qianjin East Road, Jiu Jiang City 332005 JiangXi Province, China;2. Department of Industrial Engineering, Pennsylvania State University, The Behrend College Erie, PA 16563, United States;3. School of Economics and Management, Jiujiang University, 551 Qianjin East Road, Jiu Jiang City 332005 JiangXi Province, China
Abstract:This paper introduces the open location-routing problem (OLRP) that is a variant of the capacitated location-routing problem (CLRP). OLRP is motivated from the rise in contracting with third-party logistic (TPL) companies and is different from CLRP in that vehicles do not return to the distribution center after servicing all customers. The goal of OLRP is to minimize the total cost, consisting of facility operation costs, vehicle fixed costs, and traveling costs. We propose a simulated annealing (SA)-based heuristic for solving OLRP, which is tested on OLRP instances that have been adopted from three sets of well-known CLRP benchmark instances with up to 318 customers and 4 potential depots. The computational results indicate that the proposed heuristic efficiently solves OLRP.
Keywords:Capacitated location-routing problem  Open location-routing problem  Simulated annealing  Third-party logistics
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号