期刊
COMPUTERS & OPERATIONS RESEARCH
卷 38, 期 6, 页码 931-941出版社
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.cor.2010.09.019
关键词
Location Routing Problem; Branch and Cut; Vehicle routing; Facility location
类别
资金
- Ministeno de Ciencia y Tecnologia of Spain [DPI2005-04796, MTM2006-14961-C05-02]
Recent researches in the design of logistic networks have shown that the overall distribution cost may be excessive if routing decisions are ignored when locating depots The Location-Routing Problem (LRP) overcomes this drawback by simultaneously tackling location and routing decisions The aim of this paper is to propose an exact approach based on a Branch-and-Cut algorithm for solving the LRP with capacity constraints on depots and vehicles The proposed method is based on a zero-one linear model strengthened by new families of valid inequalities The computational evaluation on three sets of instances (34 instances in total) with 5-10 potential depots and 20-88 customers shows that 26 instances with five depots are solved to optimality including all instances with up to 40 customers and three with 50 customers (C) 2010 Elsevier Ltd All rights reserved
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据