A branch-and-cut algorithm for the hub location and routing problem

被引：70
|
作者：
Rodriguez-Martin, Inmaculada [1 ]
Salazar-Gonzalez, Juan-Jose [1 ]
Yaman, Hande [2 ]
机构：
[1] Univ Laguna, Fac Matemat, DEIOC, Tenerife, Spain
[2] Bilkent Univ, Dept Ind Engn, Ankara, Turkey
来源：
COMPUTERS & OPERATIONS RESEARCH | 2014年 / 50卷
关键词：
Hub location; Routing; Valid inequalities; Branch-and-cut; MEDIAN PROBLEM; FORMULATIONS; COSTS; MODEL;
D O I：
10.1016/j.cor.2014.04.014
中图分类号：
TP39 [计算机的应用];
学科分类号：
081203 ; 0835 ;
摘要：
We study the hub location and routing problem where we decide on the location of hubs, the allocation of nodes to hubs, and the routing among the nodes allocated to the same hubs, with the aim of minimizing the total transportation cost. Each hub has one vehicle that visits all the nodes assigned to it on a cycle. We propose a mixed integer programming formulation for this problem and strengthen it with valid inequalities. We devise separation routines for these inequalities and develop a branch-and-cut algorithm which is tested on CAB and AP instances from the literature. The results show that the formulation is strong and the branch-and-cut algorithm is able to solve instances with up to 50 nodes. (C) 2014 Elsevier Ltd. All rights reserved.
引用
收藏
页码：161 / 174
页数：14
相关论文
共 50 条
  • [1] A branch-and-cut algorithm for the partitioning-hub location-routing problem
    Catanzaro, Daniele
    Gourdin, Eric
    Labbe, Martine
    Ozsoy, F. Aykut
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2011, 38 (02) : 539 - 549
  • [2] A branch-and-cut algorithm for an assembly routing problem
    Chitsaz, Masoud
    Cordeau, Jean-Francois
    Jans, Raf
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2020, 282 (03) : 896 - 910
  • [3] A Branch-and-Cut Algorithm for the Alternative Fuel Refueling Station Location Problem with Routing
    Arslan, Okan
    Karasan, Oya Ekin
    Mahjoub, A. Ridha
    Yaman, Hande
    [J]. TRANSPORTATION SCIENCE, 2019, 53 (04) : 1107 - 1125
  • [4] A branch-and-cut algorithm for the routing and spectrum allocation problem
    Bianchetti, Marcelo
    Marenco, Javier
    [J]. DISCRETE APPLIED MATHEMATICS, 2023, 339 : 107 - 126
  • [5] A branch-and-cut algorithm for the vehicle routing problem with drones
    Tamke, Felix
    Buscher, Udo
    [J]. TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 2021, 144 : 174 - 203
  • [6] A Branch-and-Cut method for the Capacitated Location-Routing Problem
    Belenguer, Jose-Manuel
    Benavent, Enrique
    Prins, Christian
    Prodhon, Caroline
    Calvo, Roberto Wolfler
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2011, 38 (06) : 931 - 941
  • [7] A branch-and-cut algorithm for the Orienteering Arc Routing Problem
    Archetti, Claudia
    Corberan, Angel
    Plana, Isaac
    Sanchis, Jose M.
    Grazia Speranza, M.
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2016, 66 : 95 - 104
  • [8] A branch-and-cut algorithm for the one-commodity pickup and delivery location routing problem
    Dominguez-Martin, Bencomo
    Hernandez-Perez, Hipolito
    Riera-Ledesma, Jorge
    Rodriguez-Martin, Inmaculada
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2024, 161
  • [9] A Branch-and-Cut Algorithm for the Inventory Routing Problem with Product Substitution
    Mahmutogullari, Ozlem
    Yaman, Hande
    [J]. OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE, 2023, 115
  • [10] A branch-and-cut algorithm for the inventory routing problem with pickups and deliveries
    Archetti, Claudia
    Speranza, M. Grazia
    Boccia, Maurizio
    Sforza, Antonio
    Sterle, Claudio
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2020, 282 (03) : 886 - 895
12345