Capacitated single-allocation hub location model for a flood relief distribution network

被引:5
作者
Sangsawang, Ornurai [1 ]
Chanta, Sunarin [1 ]
机构
[1] King Mongkuts Univ Technol, Dept Ind Management, North Bangkok, Prachinburi, Thailand
关键词
flood; hub location; optimization; Tabu search; variable neighborhood search; VARIABLE NEIGHBORHOOD SEARCH; ROUTING PROBLEM; TABU SEARCH; FORMULATIONS; HEURISTICS; ALGORITHMS; SERVICE; TIME;
D O I
10.1111/coin.12374
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
In disaster management, the logistics for disaster relief must deal with uncontrolled variables, including transportation difficulties, limited resources, and demand variations. In this work, an optimization model based on the capacitated single-allocation hub location problem is proposed to determine an optimal location of flood relief facilities with the advantage of economies of scale to transport commodities during a disaster. The objective is to minimize the total transportation cost, which depends on the flood severity. The travel time is bounded to ensure that survival packages will be delivered to victims in a reasonable time. Owing to complexity of the problem, a hybrid algorithm is developed based on a variable neighborhood search and tabu search (VNS-TS). The computational results show that the VNS found the optimal solutions within a 2% gap, while the proposed VNS-TS found the optimal solution with a 0% gap. A case study of severe flooding in Thailand is presented with consideration of related parameters such as water level, hub capacity, and discount factors. Sensitivity analyses on the number of flows, discount factors, capacity, and bound length are provided. The results indicated that demand variation has an impact on the transportation cost, number of hubs, and route patterns.
引用
收藏
页码:1320 / 1347
页数:28
相关论文
共 55 条
[31]   An evolutionary-based approach for solving a capacitated hub location problem [J].
Kratica, Jozef ;
Milanovic, Marija ;
Stanimirovic, Zorica ;
Tosic, Dusan .
APPLIED SOFT COMPUTING, 2011, 11 (02) :1858-1866
[32]   THE HUB NETWORK DESIGN PROBLEM WITH STOPOVERS AND FEEDERS - THE CASE OF FEDERAL EXPRESS [J].
KUBY, MJ ;
GRAY, RG .
TRANSPORTATION RESEARCH PART A-POLICY AND PRACTICE, 1993, 27 (01) :1-12
[33]   A hybrid hub-and-spoke postal logistics network with realistic restrictions: A case study of Korea Post [J].
Lee, Jeong-Hun ;
Moon, Ilkyeong .
EXPERT SYSTEMS WITH APPLICATIONS, 2014, 41 (11) :5509-5519
[34]   Hub location under competition [J].
Mahmutogullari, Ali Irfan ;
Kara, Bahar Y. .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2016, 250 (01) :214-225
[35]  
Maric M., 2013, SERDICA J COMPUT, V7, P343
[36]   An efficient memetic algorithm for the uncapacitated single allocation hub location problem [J].
Maric, Miroslav ;
Stanimirovic, Zorica ;
Stanojevic, Predrag .
SOFT COMPUTING, 2013, 17 (03) :445-466
[37]   Less is more: General variable neighborhood search for the capacitated modular hub location problem [J].
Mikic, Marija ;
Todosijevic, Raca ;
Urosevic, Dragan .
COMPUTERS & OPERATIONS RESEARCH, 2019, 110 :101-115
[38]   Reliable single-allocation hub location problem with disruptions [J].
Mohammadi, Mehrdad ;
Jula, Payman ;
Tavakkoh-Moghaddam, Reza .
TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW, 2019, 123 :90-120
[39]   Airline hub-and-spoke network design based on airport capacity envelope curve: A practical view [J].
Mohri, Seyed Sina ;
Karimi, Hossein ;
Kordani, Ali Abdi ;
Nasrollahi, Mandi .
COMPUTERS & INDUSTRIAL ENGINEERING, 2018, 125 :375-393
[40]  
O'Kelly M.E., 1992, Papers in Regional Science, V71, P293, DOI DOI 10.1007/BF01434269