A new formulation and an exact approach for the many-to-many hub location-routing problem

DOI10.1016/J.APM.2013.02.035zbMath1426.90175OpenAlexW2041764896MaRDI QIDQ1789047

Ricardo Saraiva de Camargo, Arne Løkketangen, Gilberto~jun. de Miranda

Publication date: 9 October 2018

Published in: Applied Mathematical Modelling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.apm.2013.02.035

zbMATH Keywords

hub-and-spoke networksfreight transportationlocation-routing problemsBenders decomposition methodmany-to-many hub location routing problemparcel delivery network design

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Deterministic network models in operations research (90B10) Discrete location and assignment (90B80)

Related Items (17)

A survey of variants and extensions of the location-routing problem ⋮ A branch-and-cut algorithm for the hub location and routing problem ⋮ Routing and scheduling decisions in the hierarchical hub location problem ⋮ The electric location-routing problem with heterogeneous fleet: formulation and Benders decomposition approach ⋮ Planning and design of intermodal hub networks: a literature review ⋮ Adaptive large neighborhood decomposition search algorithm for multi-allocation hub location routing problem ⋮ Exact algorithms for the robust uncapacitated multiple allocation \(p\)-hub median problem ⋮ A fuzzy correlation based heuristic for dual-mode integrated location routing problem ⋮ A biased random-key genetic algorithm for the two-level hub location routing problem with directed tours ⋮ Multi-period single-allocation hub location-routing: models and heuristic solutions ⋮ The p-hub centre routing problem with emissions budget: formulation and solution procedure ⋮ HUBBI: iterative network design for incomplete hub location problems ⋮ Heuristic algorithms for the single allocation \(p\)-hub center problem with routing considerations ⋮ Benders decomposition algorithms for two variants of the single allocation hub location problem ⋮ A continuous approximation approach to the planar hub location-routing problem: modeling and solution algorithms ⋮ Perspectives on modeling hub location problems ⋮ Formulations and decomposition methods for the incomplete hub location network design problem with and without hop-constraints

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Stochastic uncapacitated hub location
• A branch-and-cut algorithm for the partitioning-hub location-routing problem
• A tabu-search based heuristic for the hub covering problem over incomplete hub networks
• Multiple allocation hub-and-spoke network design under hub congestion
• The \(p\)-hub center allocation problem
• Location-routing: issues, models and methods
• An integrated model for logistics network design
• Benders decomposition for the uncapacitated multiple allocation hub location problem
• Integrated airline scheduling
• A comparative analysis of several asymmetric traveling salesman problem formulations
• Practical enhancements to the Magnanti-Wong method
• An improved Benders decomposition applied to a multi-layer network design problem
• The tree of hubs location problem
• Partitioning procedures for solving mixed-variables programming problems
• Tight linear programming relaxations of uncapacitated \(p\)-hub median problems
• Planning models for freight transportation
• The many-to-many location-routing problem
• Exact and heuristic algorithms for the uncapacitated multiple allocation \(p\)-hub median problem
• Combined location-routing problems: A synthesis and future research directions
• Integer programming formulations of discrete hub location problems
• Restructuring of Swiss parcel delivery services
• The capacitated multiple allocation hub location problem: Formulations and algorithms
• Service network design in freight transportation
• Planning models for long-haul operations of postal and express shipment companies
• A survey on Benders decomposition applied to fixed-charge network design problems
• A computational study of Benders decomposition for the integrated aircraft routing and crew scheduling problem
• Network hub location problems: The state of the art
• A note on the selection of Benders' cuts
• Benders Decomposition for Large-Scale Uncapacitated Hub Location
• The Latest Arrival Hub Location Problem
• Hub Arc Location Problems: Part I—Introduction and Results
• Hub Arc Location Problems: Part II—Formulations and Optimal Algorithms
• A hub covering network design problem for cargo applications in Turkey
• A New Formulation for the Travelling Salesman Problem
• Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria
• Efficient algorithms for the uncapacitated single allocation p-hub median problem
• The Ring Star Problem: Polyhedral analysis and exact algorithm
• A Benders Decomposition for Hub Location Problems Arising in Public Transport
• Solving the hub location problem in a star–star network

This page was built for publication: A new formulation and an exact approach for the many-to-many hub location-routing problem