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

DOI10.1016/J.APM.2013.02.035MaRDI QIDQ1789047zbMATH OpenOpenAlexFDO

Authors 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

Benders decomposition methodfreight transportationhub-and-spoke networkslocation-routing problemsmany-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)

Recommendations

• Many-to-many location-routing with inter-hub transport and multi-commodity pickup-and-delivery
• Adaptive large neighborhood decomposition search algorithm for multi-allocation hub location routing problem
• A continuous approximation approach to the planar hub location-routing problem: modeling and solution algorithms
• The many-to-many location-routing problem
• A branch-and-cut algorithm for the hub location and routing problem

Cites work

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

Cited in

(27)

• The many-to-many location-routing problem
• The q-ad hoc hub location problem for multi-modal networks
• Routing and scheduling decisions in the hierarchical hub location problem
• HUBBI: iterative network design for incomplete hub location problems
• Heuristic algorithms for the single allocation p-hub center problem with routing considerations
• A continuous approximation approach to the planar hub location-routing problem: modeling and solution algorithms
• Benders decomposition algorithms for two variants of the single allocation hub location problem
• Perspectives on modeling hub location problems
• Formulations and decomposition methods for the incomplete hub location network design problem with and without hop-constraints
• Many-to-many location-routing with inter-hub transport and multi-commodity pickup-and-delivery
• A survey of variants and extensions of the location-routing 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 Note on “The Latest Arrival Hub Location Problem”
• A branch-and-cut algorithm for the hub location and routing problem
• HubLocator: An exact solution method for the multiple allocation hub location 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
• Capacitated hub location routing problem with time windows and stochastic demands for the design of intra-city express systems
• A literature review on hub location-routing models and their solution techniques
• Recent developments in location-routing problems. Deterministic single-echelon, single-objective, single-period problems
• A robust optimization approach for designing multi-period airport hub network with uncertain capacity
• New formulations for the uncapacitated multiple allocation hub location problem

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1789047)