A computational comparison of flow formulations for the capacitated location-routing problem
From MaRDI portal
Publication:1799384
DOI10.1016/j.disopt.2013.07.005zbMath1474.90373OpenAlexW1970402125MaRDI QIDQ1799384
Claudio Contardo, Jean-François Cordeau, Bernard Gendron
Publication date: 18 October 2018
Published in: Discrete Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disopt.2013.07.005
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)
Related Items
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 ⋮ A survey on two-echelon routing problems ⋮ A simple and effective evolutionary algorithm for the capacitated location-routing problem ⋮ Multi-commodity location-routing: flow intercepting formulation and branch-and-cut algorithm ⋮ A column generation approach for the location-routing problem with time windows ⋮ Evolutionary hyperheuristics for location-routing problem with simultaneous pickup and delivery ⋮ Multi-period location routing: an application to the planning of mobile clinic operations in Iraq ⋮ The two-echelon stochastic multi-period capacitated location-routing problem ⋮ The effect of different mathematical formulations on a matheuristic algorithm for the production routing problem ⋮ A survey of the standard location-routing problem ⋮ An Exact Algorithm Based on Cut-and-Column Generation for the Capacitated Location-Routing Problem ⋮ Improved branch-and-cut for the inventory routing problem based on a two-commodity flow formulation ⋮ 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 ⋮ Two-echelon vehicle routing problems: a literature review ⋮ An improved branch-cut-and-price algorithm for the two-echelon capacitated 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
- An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts
- A result on projection for the vehicle routing problem
- A heuristic solution to the warehouse location-routing problem
- Easy and difficult objective functions for max cut
- Heuristic solutions to multi-depot location-routing problems
- A two-phase tabu search approach to the location routing problem
- A new branch-and-cut algorithm for the capacitated vehicle routing problem
- Improved lower bounds and exact algorithm for the capacitated arc routing problem
- Robust branch-and-cut-and-price for the capacitated vehicle routing problem
- An Exact Method for the Capacitated Location-Routing Problem
- On the symmetric travelling salesman problem I: Inequalities
- An Exact Algorithm for the Pickup and Delivery Problem with Time Windows
- Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
- Symmetry in Integer Linear Programming
- Multi-Terminal Network Flows
- Optimal Solution of Vehicle Routing Problems Using Minimum K-Trees
- An Exact Algorithm for the Capacitated Vehicle Routing Problem Based on a Two-Commodity Network Flow Formulation
- Edmonds polytopes and weakly hamiltonian graphs
- Unnamed Item
