An Exact Method for the Capacitated Location-Routing Problem

DOI10.1287/OPRE.1110.0989zbMath1233.90060OpenAlexW2120968967MaRDI QIDQ2879523

Roberto Wolfler Calvo, Aristide Mingozzi, Roberto Baldacci

Publication date: 26 March 2012

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.1110.0989

zbMATH Keywords

dynamic programmingdual ascentset partitioninglocation routing

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Dynamic programming (90C39)

Related Items (32)

A new formulation approach for location-routing problems ⋮ A survey of recent research on location-routing problems ⋮ Solving the dynamic capacitated location-routing problem with fuzzy demands by hybrid heuristic algorithm ⋮ A survey of variants and extensions of the location-routing problem ⋮ A variable neighborhood search based matheuristic for a waste cooking oil collection network design problem ⋮ Sequential and parallel large neighborhood search algorithms for the periodic location routing problem ⋮ A distribution network design problem in the automotive industry: MIP formulation and heuristics ⋮ A memetic algorithm for the capacitated location-routing problem with mixed backhauls ⋮ Battery swap station location-routing problem with capacitated electric vehicles ⋮ A simple and effective evolutionary algorithm for the capacitated location-routing problem ⋮ A column generation approach for the location-routing problem with time windows ⋮ Lower and upper bounds for the two-echelon capacitated location-routing problem ⋮ An adaptive large neighborhood search heuristic for two-echelon vehicle routing problems arising in city logistics ⋮ Evolutionary hyperheuristics for location-routing problem with simultaneous pickup and delivery ⋮ A memetic algorithm for a multi-objective obnoxious waste location-routing problem: a case study ⋮ A concise guide to existing and emerging vehicle routing problem variants ⋮ The location routing problem with facility sizing decisions ⋮ Model and algorithm for bilevel multisized terminal location‐routing problem for the last mile delivery ⋮ The two-echelon stochastic multi-period capacitated location-routing problem ⋮ Electric vehicles fast charger location-routing problem under ambient temperature ⋮ A survey of the standard location-routing problem ⋮ An Exact Algorithm Based on Cut-and-Column Generation for the Capacitated Location-Routing Problem ⋮ Optimization of a two-echelon location lot-sizing routing problem with deterministic demand ⋮ Combined location and routing problems for drug distribution ⋮ A column generation approach for location-routing problems with pickup and delivery ⋮ Selective capacitated location-routing problem with incentive-dependent returns in designing used products collection network ⋮ A branch-and-cut algorithm for the two-echelon capacitated vehicle routing problem with grouping constraints ⋮ Many-to-many location-routing with inter-hub transport and multi-commodity pickup-and-delivery ⋮ A unified solution framework for multi-attribute vehicle routing problems ⋮ A computational comparison of flow formulations for the capacitated location-routing problem ⋮ A new exact algorithm for the multi-depot vehicle routing problem under capacity and route length constraints ⋮ A location-or-routing problem with partial and decaying coverage

This page was built for publication: An Exact Method for the Capacitated Location-Routing Problem