Strategic oscillation for the capacitated hub location problem with modular links

被引:19
作者
Corberan, Angel [1 ]
Peiro, Juanjo [1 ]
Campos, Vicente [1 ]
Glover, Fred [2 ]
Marti, Rafael [1 ]
机构
[1] Univ Valencia, Dept Estadist & Invest Operat, Valencia, Spain
[2] OptTek Syst, Boulder, CO USA
关键词
Hub location problem; Modular link costs; Tabu search; Strategic oscillation; Iterated greedy; ITERATED GREEDY; SEARCH;
D O I
10.1007/s10732-016-9308-7
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
The capacitated single assignment hub location problem with modular link capacities is a variant of the classical hub location problem in which the cost of using edges is not linear but stepwise, and the hubs are restricted in terms of transit capacity rather than in the incoming traffic. We propose a metaheuristic algorithm based on strategic oscillation, a methodology originally introduced in the context of tabu search. Our method incorporates several designs for constructive and destructive algorithms, together with associated local search procedures, to balance diversification and intensification for an efficient search. Computational results on a large set of instances show that, in contrast to exact methods that can only solve small instances optimally, our metaheuristic is able to find high-quality solutions on larger instances in short computing times. In addition, the new method, which joins tabu search strategies with strategic oscillation, outperforms the previous tabu search implementation.
引用
收藏
页码:221 / 244
页数:24
相关论文
共 50 条
[21]   Optimization of the Collaborative Hub Location Problem with Metaheuristics [J].
Gargouri, Mohamed Amine ;
Hamani, Nadia ;
Mrabti, Nassim ;
Kermad, Lyes .
MATHEMATICS, 2021, 9 (21)
[22]   A Hybrid Strategic Oscillation with Path Relinking Algorithm for the Multiobjective k-Balanced Center Location Problem [J].
Sanchez-Oro, Jesus ;
Lopez-Sanchez, Ana D. ;
Martinez-Gavara, Anna ;
Hernandez-Diaz, Alfredo G. ;
Duarte, Abraham .
MATHEMATICS, 2021, 9 (08)
[23]   Strategic oscillation for the quadratic multiple knapsack problem [J].
Carlos García-Martínez ;
Fred Glover ;
Francisco J. Rodriguez ;
Manuel Lozano ;
Rafael Martí .
Computational Optimization and Applications, 2014, 58 :161-185
[24]   Strategic oscillation for the quadratic multiple knapsack problem [J].
Garcia-Martinez, Carlos ;
Glover, Fred ;
Rodriguez, Francisco J. ;
Lozano, Manuel ;
Marti, Rafael .
COMPUTATIONAL OPTIMIZATION AND APPLICATIONS, 2014, 58 (01) :161-185
[25]   LOWER BOUNDS FOR THE HUB LOCATION PROBLEM [J].
OKELLY, M ;
SKORINKAPOV, D ;
SKORINKAPOV, J .
MANAGEMENT SCIENCE, 1995, 41 (04) :713-721
[26]   Discretized formulations for capacitated location problems with modular distribution costs [J].
Correia, Isabel ;
Gouveia, Luis ;
Saldanha-da-Gama, Francisco .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2010, 204 (02) :237-244
[27]   Robust optimization approach to capacitated single and multiple allocation hub location problems [J].
Fereidoon Habibzadeh Boukani ;
Babak Farhang Moghaddam ;
Mir Saman Pishvaee .
Computational and Applied Mathematics, 2016, 35 :45-60
[28]   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
[29]   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
[30]   The capacitated plant location problem with customers and suppliers matching [J].
Zhu, Zhanguo ;
Chu, Feng ;
Sun, Linyan .
TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW, 2010, 46 (03) :469-480