An Improved Branch and Bound Algorithm for Location-routing Problems
文献类型：会议论文
| 作者 | Jin L(金莉); Zhu YL(朱云龙) ; Shen H(申海)
|
| 出版日期 | 2009 |
| 会议名称 | International Forum on Computer Science-Technology and Applications |
| 会议日期 | December 25-27, 2009 |
| 会议地点 | Chongqing, China |
| 关键词 | three-layer distribution network Branch and bound Lagrangian heuristic location-routing problem Optimization |
| 页码 | 58-63 |
| 中文摘要 | 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-than-truckload (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 multiple-stop route are caculated. We note that this is an NP-hard problem and use a Lagrangian relaxation-based branch and bound algorithm to solve this location-routing problem. We present numerical results for various size test problems. Results indicates the method is efficient. |
| 收录类别 | EI ; CPCI（ISTP） |
| 产权排序 | 1 |
| 会议主办者 | Int Informat Techn & Applicat Assoc |
| 会议录 | 2009 INTERNATIONAL FORUM ON COMPUTER SCIENCE-TECHNOLOGY AND APPLICATIONS, VOL 1, PROCEEDINGS
 |
| 会议录出版者 | IEEE COMPUTER SOC |
| 会议录出版地 | LOS ALAMITOS |
| 语种 | 英语 |
| ISBN号 | 978-0-7695-3930-0 |
| WOS记录号 | WOS:000276906700015 |
| 源URL | [http://ir.sia.cn/handle/173321/8324]  |
| 专题 | 沈阳自动化研究所_工业信息学研究室 |
| 推荐引用方式 GB/T 7714 | Jin L,Zhu YL,Shen H. An Improved Branch and Bound Algorithm for Location-routing Problems[C]. 见:International Forum on Computer Science-Technology and Applications. Chongqing, China. December 25-27, 2009. |
入库方式： OAI收割
来源：沈阳自动化研究所
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。