An Improved Branch and Bound Algorithm for Location-routing Problems
An important limitation of the fixed charge location model,is the assumption that full truckload quantities are shipped from a facility to a customer. In many contexts, shipments are made in less-thantruckload (LTL) quantities from a facility to customers along a multiple-stop route. The different location decision is made from the different cost of delivery.In this paper we are concerned with a particular type of facility location problem in which there exist two echelons of facilities. To make the location decision ,the delivery cost of a multiplestop route are caculated. We note that this is an NPhard problem and use a Lagrangian relaxation-based branch and bound algorithm to solve this locationrouting problem. We present numerical results for various size test problems.Results indicates the method is efficient.
three-layer distribution network Branch and bound Lagrangian heuristic location-routing problem Optimization
Jin Li Zhu Yunlong Shen Hai
Shenyang Institute of Automation, Chinese Academy of Sciences, Shenyang 110016, China Graduate Schoo Shenyang Institute of Automation, Chinese Academy of Sciences, Shenyang 110016, China
国际会议
重庆
英文
58-63
2009-12-25（万方平台首次上网日期，不代表论文的发表时间）