Many-to-many location-routing with inter-hub transport and multi-commodity pickup-and-delivery

被引:76
作者
Rieck, Julia [1 ]
Ehrenberg, Carsten [1 ]
Zimmermann, Juergen [1 ]
机构
[1] Tech Univ Clausthal, Inst Management & Econ, Operat Res Grp, D-38678 Clausthal Zellerfeld, Germany
关键词
Location-routing; Inter-hub transport; Multi-commodity pickup-and-delivery; Mixed-integer linear programming; Fix-and-optimize; Genetic algorithm; TABU SEARCH; EVOLUTIONARY ALGORITHM; DEPOT; BOUNDS; MODEL;
D O I
10.1016/j.ejor.2013.12.021
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
In this paper, we consider a variant of the many-to-many location-routing problem, where hub facilities have to be located and customers with either pickup or delivery demands have to be combined in vehicle routes. In addition, several commodities and inter-hub transport processes are taken into account. A practical application of the problem can be found in the timber-trade industry, where companies provide their services using hub-and-spoke networks. We present a mixed-integer linear model for the problem and use CPLEX 12.4 to solve small-scale instances. Furthermore, a multi-start procedure based on a fix-and-optimize scheme and a genetic algorithm are introduced that efficiently construct promising solutions for medium- and large-scale instances. A computational performance analysis shows that the presented methods are suitable for practical application. (C) 2013 Elsevier B.V. All rights reserved.
引用
收藏
页码:863 / 878
页数:16
相关论文
共 50 条
[1]   A Branch-and-Price Algorithm for Combined Location and Routing Problems Under Capacity Restrictions [J].
Akca, Z. ;
Berger, R. T. ;
Ralphs, T. K. .
OPERATIONS RESEARCH AND CYBER-INFRASTRUCTURE, 2009, :309-+
[2]   A compact model and tight bounds for a combined location-routing problem [J].
Albareda-Sambola, M ;
Díaz, JA ;
Fernández, E .
COMPUTERS & OPERATIONS RESEARCH, 2005, 32 (03) :407-428
[3]   Distribution network design:: New problems and related models [J].
Ambrosino, D ;
Scutellà, MG .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2005, 165 (03) :610-624
[4]   A heuristic based on multi-exchange techniques for a regional fleet assignment location-routing problem [J].
Ambrosino, Daniela ;
Sciomachen, Anna ;
Scutella, Maria Grazia .
COMPUTERS & OPERATIONS RESEARCH, 2009, 36 (02) :442-460
[5]  
[Anonymous], 1988, Vehicle routing: Methods and studies
[6]   An Exact Method for the Capacitated Location-Routing Problem [J].
Baldacci, Roberto ;
Mingozzi, Aristide ;
Calvo, Roberto Wolfler .
OPERATIONS RESEARCH, 2011, 59 (05) :1284-1296
[7]   Using clustering analysis location-routing in a capacitated problem [J].
Barreto, Sergio ;
Ferreira, Carlos ;
Paixao, Jose ;
Sousa Santos, Beatriz .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2007, 179 (03) :968-977
[8]   A Branch-and-Cut method for the Capacitated Location-Routing Problem [J].
Belenguer, Jose-Manuel ;
Benavent, Enrique ;
Prins, Christian ;
Prodhon, Caroline ;
Calvo, Roberto Wolfler .
COMPUTERS & OPERATIONS RESEARCH, 2011, 38 (06) :931-941
[9]   Restructuring of Swiss parcel delivery services [J].
Bruns A. ;
Klose A. ;
Stähly P. .
OR-Spektrum, 2000, 22 (2) :285-302
[10]   Solving a multiobjective location routing problem with a metaheuristic based on tabu search.: Application to a real case in Andalusia [J].
Caballero, Rafael ;
Gonzalez, Mercedes ;
Guerrero, Flor M. ;
Molina, Julian ;
Paralera, Concepcion .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2007, 177 (03) :1751-1763