Strategic oscillation for the capacitated hub location problem with modular links

被引:18
|
作者
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 条
  • [1] Strategic oscillation for the capacitated hub location problem with modular links
    Ángel Corberán
    Juanjo Peiró
    Vicente Campos
    Fred Glover
    Rafael Martí
    Journal of Heuristics, 2016, 22 : 221 - 244
  • [2] Heuristics for the capacitated modular hub location problem
    Hoff, Arild
    Peiro, Juanjo
    Corberan, Angel
    Marti, Rafael
    COMPUTERS & OPERATIONS RESEARCH, 2017, 86 : 94 - 109
  • [3] A parallel adaptive memory algorithm for the capacitated modular hub location problem
    Wu, Qinghua
    Sun, Zhe
    Benlic, Una
    Lu, Yongliang
    COMPUTERS & OPERATIONS RESEARCH, 2023, 153
  • [4] Solving a capacitated hub location problem
    Rodriguez-Martin, Inmaculada
    Salazar-Gonzalez, Juan Jose
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2008, 184 (02) : 468 - 479
  • [5] Less is more: General variable neighborhood search for the capacitated modular hub location problem
    Mikic, Marija
    Todosijevic, Raca
    Urosevic, Dragan
    COMPUTERS & OPERATIONS RESEARCH, 2019, 110 : 101 - 115
  • [6] On solution of the capacitated single allocation hub location problem
    Chen, Jeng-Fung
    IMECS 2007: International Multiconference of Engineers and Computer Scientists, Vols I and II, 2007, : 2353 - 2356
  • [7] A Lagrangean heuristic for a modular capacitated location problem
    Correia, I
    Captivo, ME
    ANNALS OF OPERATIONS RESEARCH, 2003, 122 (1-4) : 141 - 161
  • [8] A Lagrangean Heuristic for a Modular Capacitated Location Problem
    Isabel Correia
    M. Eugénia Captivo
    Annals of Operations Research, 2003, 122 : 141 - 161
  • [9] Improved Benders Decomposition for Capacitated Hub Location Problem with Incomplete Hub Networks
    Xu, Yifan
    Dai, Weibin
    Sun, Xiaoqian
    Wandelt, Sebastian
    2017 IEEE SYMPOSIUM SERIES ON COMPUTATIONAL INTELLIGENCE (SSCI), 2017,
  • [10] Solution algorithms for the capacitated single allocation hub location problem
    Ernst, AT
    Krishnamoorthy, M
    ANNALS OF OPERATIONS RESEARCH, 1999, 86 (0) : 141 - 159