Multi-commodity location-routing: flow intercepting formulation and branch-and-cut algorithm

DOI10.1016/J.COR.2017.08.013MaRDI QIDQ1652448zbMATH OpenOpenAlexFDO

Authors Maurizio Boccia, Teodor Gabriel Crainic, Claudio Sterle, Antonio 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

zbMATH Keywords

branch-and-cutcity logisticsflow intercepting facility locationmulti-commodity location-routing

Mathematics Subject Classification ID

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

Recommendations

• A Branch-and-Cut method for the Capacitated Location-Routing Problem
• Many-to-many location-routing with inter-hub transport and multi-commodity pickup-and-delivery
• A new formulation approach for location-routing problems
• scientific article; zbMATH DE number 4051316
• A survey of recent research on location-routing problems

Cites work

• scientific article; zbMATH DE number 4051316 (Why is no real title available?)
• scientific article; zbMATH DE number 1471488 (Why is no real title available?)
• A Branch-and-Cut method for the Capacitated Location-Routing Problem
• A computational comparison of flow formulations for the capacitated location-routing problem
• A generalized model for locating facilities on a network with flow-based demand
• A math-heuristic for the warehouse location-routing problem in disaster relief
• A survey of recent research on location-routing problems
• A survey of variants and extensions of the location-routing problem
• A survey on two-echelon routing problems
• Flow intercepting facility location: Problems, models and heuristics
• Formulations and Branch-and-Cut Algorithms for Multivehicle Production and Inventory Routing Problems
• Lifted and local reachability cuts for the vehicle routing problem with time windows
• Locating active sensors on traffic networks
• Location-routing: issues, models and methods
• 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
• Optimal Location of Discretionary Service Facilities
• Reachability cuts for the vehicle routing problem with time windows
• Single-item reformulations for a vendor managed inventory routing problem: computational experience with benchmark instances
• Solving school bus routing using the multiple vehicle traveling purchaser problem: a branch-and-cut approach
• Solving the Orienteering Problem through Branch-and-Cut
• The many-to-many location-routing problem

Cited in

(10)

• Combining facility location and routing decisions in sustainable urban freight distribution under horizontal collaboration: how can shippers be benefited?
• Optimization of two-echelon last-mile delivery via cargo tunnel and a delivery person
• Branch-and-cut for a 2-commodity flow relocation model with time constraints
• A branch-and-cut algorithm for the inventory routing problem with pickups and deliveries
• A new MILP formulation for the flying sidekick traveling salesman problem
• An integrated <scp>user‐system</scp> approach for shelter location and evacuation routing
• Location‐routing problem: a classification of recent research
• Designing sustainable mid-haul logistics networks with intra-route multi-resource facilities
• Special issue on: Optimization methods for decision making: advances and applications
• Many-to-many location-routing with inter-hub transport and multi-commodity pickup-and-delivery

This page was built for publication: Multi-commodity location-routing: flow intercepting formulation and branch-and-cut algorithm

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