Multi-commodity location-routing: flow intercepting formulation and branch-and-cut algorithm
From MaRDI portal
Publication:1652448
DOI10.1016/j.cor.2017.08.013zbMath1391.90045OpenAlexW2750190423MaRDI QIDQ1652448
Maurizio Boccia, Teodor Gabriel Crainic, Claudio Sterle, Aantonio Sforza
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.013
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Transportation, logistics and supply chain management (90B06) Discrete location and assignment (90B80)
Related Items (7)
An integrated <scp>user‐system</scp> approach for shelter location and evacuation routing ⋮ Location‐routing problem: a classification of recent research ⋮ A new MILP formulation for the flying sidekick traveling salesman problem ⋮ Optimization of two-echelon last-mile delivery via cargo tunnel and a delivery person ⋮ Combining facility location and routing decisions in sustainable urban freight distribution under horizontal collaboration: how can shippers be benefited? ⋮ A branch-and-cut algorithm for the inventory routing problem with pickups and deliveries ⋮ Special issue on: Optimization methods for decision making: advances and applications
Cites Work
- Unnamed Item
- Unnamed Item
- A survey of recent research on location-routing problems
- Lifted and local reachability cuts for the vehicle routing problem with time windows
- A math-heuristic for the warehouse location-routing problem in disaster relief
- A survey on two-echelon routing problems
- A generalized model for locating facilities on a network with flow-based demand
- A Branch-and-Cut method for the Capacitated Location-Routing Problem
- Locating active sensors on traffic networks
- Flow intercepting facility location: Problems, models and heuristics
- Location-routing: issues, models and methods
- The many-to-many location-routing problem
- Solving school bus routing using the multiple vehicle traveling purchaser problem: a branch-and-cut approach
- A computational comparison of flow formulations for the capacitated location-routing problem
- Reachability cuts for the vehicle routing problem with time windows
- Many-to-many location-routing with inter-hub transport and multi-commodity pickup-and-delivery
- Models and algorithms for the screen line-based traffic-counting location problems
- A survey of variants and extensions of the location-routing problem
- Formulations and Branch-and-Cut Algorithms for Multivehicle Production and Inventory Routing Problems
- Optimal Location of Discretionary Service Facilities
- Solving the Orienteering Problem through Branch-and-Cut
- Single‐item reformulations for a vendor managed inventory routing problem: Computational experience with benchmark instances
This page was built for publication: Multi-commodity location-routing: flow intercepting formulation and branch-and-cut algorithm
