An Exact Algorithm Based on Cut-and-Column Generation for the Capacitated Location-Routing Problem
From MaRDI portal
Publication:2967616
DOI10.1287/ijoc.2013.0549zbMath1356.90070OpenAlexW2120930954MaRDI QIDQ2967616
Claudio Contardo, Bernard Gendron, Jean-François Cordeau
Publication date: 1 March 2017
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.2013.0549
Applications of mathematical programming (90C90) Transportation, logistics and supply chain management (90B06) Discrete location and assignment (90B80)
Related Items (39)
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 ⋮ Branch-and-price algorithms for the solution of the multi-trip vehicle routing problem with time windows ⋮ The latency location-routing problem ⋮ A memetic algorithm for the capacitated location-routing problem with mixed backhauls ⋮ Skewed general variable neighborhood search for the location routing scheduling problem ⋮ A simple and effective evolutionary algorithm for the capacitated location-routing problem ⋮ A column generation approach for the location-routing problem with time windows ⋮ A two-phase hybrid heuristic algorithm for the capacitated location-routing problem ⋮ 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 ⋮ The multi-zone location-routing problem with pricing: a flow-based formulation and two heuristic approaches ⋮ A branch-and-price algorithm for location-routing problems with pick-up stations in the last-mile distribution system ⋮ 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 ⋮ The electric location-routing problem with heterogeneous fleet: formulation and Benders decomposition approach ⋮ A concise guide to existing and emerging vehicle routing problem variants ⋮ Hybrid adaptive large neighborhood search for vehicle routing problems with depot location decisions ⋮ Multi-period location routing: an application to the planning of mobile clinic operations in Iraq ⋮ A branch-and-price algorithm for the multi-depot heterogeneous-fleet pickup and delivery problem with soft time windows ⋮ 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 ⋮ Stabilized branch-price-and-cut for the commodity-constrained split delivery vehicle routing problem ⋮ Solving the two-echelon location routing problem by a GRASP reinforced by a learning process and path relinking ⋮ A survey of the standard location-routing problem ⋮ Alternative formulations and improved bounds for the multi-depot fleet size and mix vehicle routing problem ⋮ Optimization of a two-echelon location lot-sizing routing problem with deterministic demand ⋮ 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 ⋮ Branch-and-price-and-cut for the multiple traveling repairman problem with distance constraints ⋮ Hybrid heuristic for the optimal design of photovoltaic installations considering mismatch loss effects ⋮ Exact algorithms for the multi-compartment vehicle routing problem with flexible compartment sizes ⋮ Exact and Heuristic Algorithms for Capacitated Vehicle Routing Problems with Quadratic Costs Structure ⋮ Many-to-many location-routing with inter-hub transport and multi-commodity pickup-and-delivery ⋮ A New Branch-and-Price-and-Cut Algorithm for One-Dimensional Bin-Packing Problems ⋮ Asymmetric Multidepot Vehicle Routing Problems: Valid Inequalities and a Branch-and-Cut Algorithm ⋮ Addressing Orientation Symmetry in the Time Window Assignment Vehicle 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
Uses Software
Cites Work
- A Branch-and-Cut method for the Capacitated Location-Routing Problem
- Solving the capacitated location-routing problem by a GRASP complemented by a learning process and a path relinking
- An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts
- An exact solution framework for a broad class of vehicle routing problems
- Stabilized column generation
- A heuristic solution to the warehouse location-routing problem
- Heuristic solutions to multi-depot location-routing problems
- A two-phase tabu search approach to the location routing problem
- A computational comparison of flow formulations for the capacitated location-routing problem
- A new branch-and-cut algorithm for the capacitated vehicle routing problem
- Designing radio-mobile access networks based on synchronous digital hierarchy rings
- Robust branch-and-cut-and-price for the capacitated vehicle routing problem
- Accelerated label setting algorithms for the elementary resource constrained shortest path problem
- An Exact Method for the Capacitated Location-Routing Problem
- Subset-Row Inequalities Applied to the Vehicle-Routing Problem with Time Windows
- A combined terminal location and ship routing problem
- New dynamic programming algorithms for the resource constrained elementary shortest path problem
- Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations
- A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows
- Set Partitioning: A survey
This page was built for publication: An Exact Algorithm Based on Cut-and-Column Generation for the Capacitated Location-Routing Problem
