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

DOI10.1016/J.COR.2014.04.014MaRDI QIDQ337094zbMATH OpenOpenAlexFDO

Authors Inmaculada Rodríguez-Martín, Juan-José Salazar-González, Hande Yaman

Publication date 10 November 2016

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

Full work available at URL http://hdl.handle.net/11693/26461

zbMATH Keywords

branch-and-cuthub locationroutingvalid inequalities

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Discrete location and assignment (90B80) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• A branch and cut algorithm for hub location problems with single assignment
• A branch-and-cut algorithm for the partitioning-hub location-routing problem
• The hub location and routing problem
• New formulation and a branch-and-cut algorithm for the multiple allocation p-hub median problem
• The tree of hubs location problem

Cites work

• A branch and cut algorithm for hub location problems with single assignment
• A branch-and-cut algorithm for the partitioning-hub location-routing problem
• A branch-and-cut algorithm for the plant-cycle location problem
• A Branch-and-Cut method for the Capacitated Location-Routing Problem
• A compact model and tight bounds for a combined location-routing problem
• A new approach to the maximum-flow problem
• A new formulation and an exact approach for the many-to-many hub location-routing problem
• A quadratic integer program for the location of interacting hub facilities
• A tabu-search based heuristic for the hub covering problem over incomplete hub networks
• A unified exact method for solving different classes of vehicle routing problems
• Allocation strategies in hub networks
• An exact algorithm for minimizing routing and operating costs in depot location
• An Exact Solution Approach Based on Shortest-Paths for p-Hub Median Problems
• Benders decomposition for large-scale uncapacitated hub location
• Efficient algorithms for the uncapacitated single allocation p-hub median problem
• scientific article; zbMATH DE number 1803765 (Why is no real title available?)
• scientific article; zbMATH DE number 3883903 (Why is no real title available?)
• Hub arc location problems: I. Introduction and results
• Hub Arc Location Problems: Part II—Formulations and Optimal Algorithms
• Hub location problems in urban traffic networks
• Integer programming formulations of discrete hub location problems
• Many-to-many location-routing with inter-hub transport and multi-commodity pickup-and-delivery
• Multistars, partial multistars and the capacitated vehicle routing problem
• Network cost minimization using threshold-based discounting
• Network hub location problems: The state of the art
• Projecting the flow variables for hub location problems
• Restructuring of Swiss parcel delivery services
• Solving a Family of Multi-Depot Vehicle Routing and Location-Routing Problems
• Solving large single allocation p-hub problems with two or three hubs
• Solving the hub location problem in a star–star network
• Star p-hub center problem and star p-hub median problem with bounded path lengths
• Star p-hub median problem with modular arc capacities
• The hub location and network design problem with fixed and variable arc costs: formulation and dual-based solution heuristic
• The hub location and routing problem
• The many-to-many location-routing problem
• The tree of hubs location problem
• Tight linear programming relaxations of uncapacitated p-hub median problems

Cited in

(40)

• A linear program for the two-hub location problem
• The hub location and routing problem
• Preprocessing and cutting for multiple allocation hub location problems.
• The ring spur assignment problem: new formulation, valid inequalities and a branch-and-cut approach
• Routing and scheduling decisions in the hierarchical hub location problem
• An endosymbiotic evolutionary algorithm for the hub location-routing problem
• A tabu search heuristic for the uncapacitated single allocation p-hub maximal covering problem
• Exact and heuristic approaches for the cycle 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
• Branch-and-price-and-cut for a service network design and hub location problem
• A branch and cut algorithm for hub location problems with single assignment
• A continuous approximation approach to the planar hub location-routing problem: modeling and solution algorithms
• A new formulation and an exact approach for the many-to-many hub location-routing problem
• Perspectives on modeling hub location problems
• The capacitated directed cycle hub location and routing problem under congestion
• An efficient heuristic for a hub location routing problem
• Solving partitioning-hub location-routing problem using DCA
• A survey of variants and extensions of the location-routing problem
• A capacitated hub location problem in freight logistics multimodal networks
• Planning and design of intermodal hub networks: a literature review
• Adaptive large neighborhood decomposition search algorithm for multi-allocation hub location routing problem
• A fuzzy correlation based heuristic for dual-mode integrated location routing problem
• Hub location problem considering spoke links with incentive-dependent capacities
• Hierarchical survivable network design problems
• A branch-and-cut algorithm for two-level survivable network design problems
• A generalized model and a heuristic algorithm for the large-scale covering tour problem
• A branch-and-cut algorithm for the plant-cycle location problem
• Scalable vertiport hub location selection for air taxi operations in a metropolitan region
• A branch-and-cut algorithm for the one-commodity pickup and delivery location routing problem
• Location‐routing problem: a classification of recent research
• Ils-based algorithms for the profit maximizing uncapacitated hub network design problem with multiple allocation
• Multi-period single-allocation hub location-routing: models and heuristic solutions
• Modeling and solving the two-level generalized median tour problem
• Machine learning-enriched distributionally robust optimization and hybrid decomposition to joint optimization of transportation hub network design and pricing
• 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
• Round-trip hub location problem
• A branch-and-cut algorithm for the partitioning-hub location-routing problem
• Mathematical model and hybrid meta-heuristic solution approaches for hub location problem with hybrid drone-airplane delivery mode

This page was built for publication: A branch-and-cut algorithm for the hub location and routing problem

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