Multiperiod Location-Routing with Decoupled Time Scales

被引:41
作者
Albareda-Sambola, Maria [1 ]
Fernandez, Elena [2 ]
Nickel, Stefan [3 ,4 ]
机构
[1] Univ Politecn Cataluna, Dept Estadist & Invest Operat, Terrassa 08022, Spain
[2] Univ Politecn Cataluna, Dept Estadist & Invest Operat, Barcelona 08034, Spain
[3] Karlsruhe Inst Technol, Inst Operat Res, D-76128 Karlsruhe, Germany
[4] Fraunhofer ITWM, Kaiserslautern, Germany
关键词
Location; Routing; Multiperiod; FACILITY LOCATION; NETWORK DESIGN; FORMULATIONS;
D O I
10.1016/j.ejor.2011.09.022
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
This paper focuses on a multiperiod discrete facility location problem where transportation costs are considered together with location costs to design the operating facility pattern along a time horizon. The problem captures the difference in the scope of the location and routing decisions by considering different scales within the time horizon. Thus, solutions to this problem reflect the stability of locational decisions along time. The high complexity of this problem makes it impossible to be solved in practice with commercial software. For this reason, an approximation based on replacing vehicle routes by spanning trees is proposed, and its capability for providing good quality solutions is assessed in a series of computational experiments. (C) 2011 Elsevier B.V. All rights reserved.
引用
收藏
页码:248 / 258
页数:11
相关论文
共 39 条
[1]   The capacity and distance constrained plant location problem [J].
Albareda-Sambola, Maria ;
Fernandez, Elena ;
Laporte, Gilbert .
COMPUTERS & OPERATIONS RESEARCH, 2009, 36 (02) :597-611
[2]   The multi-period incremental service facility location problem [J].
Albareda-Sambola, Maria ;
Fernandez, Elena ;
Hinojosa, Yolanda ;
Puerto, Justo .
COMPUTERS & OPERATIONS RESEARCH, 2009, 36 (05) :1356-1375
[3]  
[Anonymous], 1976, WORST CASE ANAL NEW
[4]   The capacitated m-ring-star problem [J].
Baldacci, R. ;
Dell'Amico, M. ;
Gonzalez, J. Salazar .
OPERATIONS RESEARCH, 2007, 55 (06) :1147-1162
[5]   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
[6]  
Carpaneto G, 1995, ACM T MATH SOFTWARE, V21, P410, DOI 10.1145/212066.212084
[7]  
Cornuejols G., 1990, Discrete Location Theory, P119
[8]   IMPROVEMENTS AND EXTENSIONS TO THE MILLER-TUCKER-ZEMLIN SUBTOUR ELIMINATION CONSTRAINTS [J].
DESROCHERS, M ;
LAPORTE, G .
OPERATIONS RESEARCH LETTERS, 1991, 10 (01) :27-36
[9]   A GRASPxELS approach for the capacitated location-routing problem [J].
Duhamel, Christophe ;
Lacomme, Philippe ;
Prins, Christian ;
Prodhon, Caroline .
COMPUTERS & OPERATIONS RESEARCH, 2010, 37 (11) :1912-1923
[10]   OPTIMAL SOLUTION OF VEHICLE-ROUTING PROBLEMS USING MINIMUM K-TREES [J].
FISHER, ML .
OPERATIONS RESEARCH, 1994, 42 (04) :626-642