Benders decomposition applied to a robust multiple allocation incomplete hub location problem

DOI10.1016/j.cor.2017.08.001zbMath1391.90386OpenAlexW2742361935WikidataQ57719338 ScholiaQ57719338MaRDI QIDQ1652441

Reinaldo Morabito, Elisangela Martins de Sá, Ricardo Saraiva de Camargo

Publication date: 11 July 2018

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2017.08.001

zbMATH Keywords

robust optimizationdemand uncertaintybenders decomposition methodfixed setup cost uncertaintyhub network design problemils-vnd heuristic

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Discrete location and assignment (90B80)

Related Items (17)

Benders decomposition applied to profit maximizing hub location problem with incomplete hub network ⋮ Stochastic hub location problems with Bernoulli demands ⋮ An efficient matheuristic for the robust multiple allocation \(p\)-hub median problem under polyhedral demand uncertainty ⋮ Planning and design of intermodal hub networks: a literature review ⋮ Multiple allocation tree of hubs location problem for non-complete networks ⋮ Exact algorithms for the robust uncapacitated multiple allocation \(p\)-hub median problem ⋮ Hub location problem considering spoke links with incentive-dependent capacities ⋮ Ils-based algorithms for the profit maximizing uncapacitated hub network design problem with multiple allocation ⋮ Machine learning augmented approaches for hub location problems ⋮ An efficient environmentally friendly transportation network design via dry ports: a bi-level programming approach ⋮ An alternative approach to address uncertainty in hub location ⋮ Robust solution for a minimax regret hub location problem in a fuzzy-stochastic environment ⋮ HUBBI: iterative network design for incomplete hub location problems ⋮ Adjustable robust balanced hub location problem with uncertain transportation cost ⋮ Perspectives on modeling hub location problems ⋮ The capacitated directed cycle hub location and routing problem under congestion ⋮ Reliable hub-and-spoke systems with multiple capacity levels and flow dependent discount factor

Uses Software

• Concorde

Cites Work

• Unnamed Item
• Robust optimization approach to capacitated single and multiple allocation hub location problems
• Exact and heuristic algorithms for the design of hub networks with multiple lines
• A tabu-search based heuristic for the hub covering problem over incomplete hub networks
• Benders decomposition for the uncapacitated multiple allocation hub location problem
• A quadratic integer program for the location of interacting hub facilities
• Partitioning procedures for solving mixed-variables programming problems
• Integer programming formulations of discrete hub location problems
• Robust discrete optimization and network flows
• General network design: a unified view of combined location and network design problems
• An improved Benders decomposition algorithm for the tree of hubs location problem
• Network hub location problems: The state of the art
• Benders Decomposition for Large-Scale Uncapacitated Hub Location
• The Latest Arrival Hub Location Problem
• Hub Arc Location Problems: Part I—Introduction and Results
• A hub covering network design problem for cargo applications in Turkey
• Efficient algorithms for the uncapacitated single allocation p-hub median problem

This page was built for publication: Benders decomposition applied to a robust multiple allocation incomplete hub location problem