The latest arrival hub location problem for cargo delivery systems with stopovers

被引:81
作者
Yaman, Hande [1 ]
Kara, Bahar Y. [1 ]
Tansel, Barbaros C. [1 ]
机构
[1] Bilkent Univ, Dept Ind Engn, TR-06800 Ankara, Turkey
关键词
hub location; modeling; stopovers; sequential lifting; valid inequalities;
D O I
10.1016/j.trb.2007.03.003
中图分类号
F [经济];
学科分类号
02 ;
摘要
In this paper, we concentrate on the service structure of ground-transportation based cargo delivery companies. The transient times that arise from nonsimultaneous arrivals at hubs (typically spent for unloading, loading, and sorting operations) can constitute a significant portion of the total delivery time for cargo delivery systems. The latest arrival hub location problem is a new minimax model that focuses on the minimization of the arrival time of the last item to arrive, taking into account journey times as well as the transient times at hubs. We first focus on a typical cargo delivery firm operating in Turkey and observe that stopovers are essential components of a ground-based cargo delivery system. The existing formulations of the hub location problem in the literature do not allow stopovers since they assume direct connections between demand centers and hubs. In this paper, we propose a generic mathematical model, which allows stopovers for the latest arrival hub location problem. We improve the model using valid inequalities and lifting. We present computational results using data from the US and Turkey. (c) 2007 Elsevier Ltd. All rights reserved.
引用
收藏
页码:906 / 919
页数:14
相关论文
共 26 条
[1]   Preprocessing and cutting for multiple allocation hub location problems [J].
Boland, N ;
Krishnamoorthy, M ;
Ernst, AT ;
Ebery, J .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2004, 155 (03) :638-653
[2]   INTEGER PROGRAMMING FORMULATIONS OF DISCRETE HUB LOCATION-PROBLEMS [J].
CAMPBELL, JF .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1994, 72 (02) :387-405
[3]   Hub location and the p-hub median problem [J].
Campbell, JF .
OPERATIONS RESEARCH, 1996, 44 (06) :923-935
[4]  
CAMPBELL JF, 2002, FACILITY LOCATION AP
[5]   Solving the Hub Location Problem in Telecommunication Network Design: A local search approach [J].
Carello, G ;
Della Croce, F ;
Ghirardi, M ;
Tadei, R .
NETWORKS, 2004, 44 (02) :94-105
[6]  
ERNST A, 2002, UNCAPACITATED SINGLE
[7]  
Ernst A. T., 1996, Location Science, V4, P139, DOI 10.1016/S0966-8349(96)00011-3
[8]   Exact and heuristic algorithms for the uncapacitated multiple allocation p-hub median problem [J].
Ernst, AT ;
Krishnamoorthy, M .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1998, 104 (01) :100-112
[9]   Adapting polyhedral properties from facility to hub location problems [J].
Hamacher, HW ;
Labbé, M ;
Nickel, S ;
Sonneborn, T .
DISCRETE APPLIED MATHEMATICS, 2004, 145 (01) :104-116
[10]   The single-assignment hub covering problem: Models and linearizations [J].
Kara, BY ;
Tansel, BC .
JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2003, 54 (01) :59-64