Iterated local search and column generation to solve arc-routing as a permutation set-covering problem
From MaRDI portal
Publication:1752200
DOI10.1016/j.ejor.2016.06.055zbMath1394.90577OpenAlexW2465704753MaRDI QIDQ1752200
Tienté Hsu, Gilles Goncalves, Hamid Allaoui, Daniel Cosmin Porumbel
Publication date: 24 May 2018
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2016.06.055
Programming involving graphs or networks (90C35) Mixed integer programming (90C11) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (3)
Alternative evaluation functions for the cyclic bandwidth sum problem ⋮ Using an exact bi-objective decoder in a memetic algorithm for arc-routing (and other decoder-expressible) problems ⋮ Orientational variable-length strip covering problem: a branch-and-price-based algorithm
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Improved bounds for large scale capacitated arc routing problem
- A set-covering based heuristic algorithm for the periodic vehicle routing problem
- Competitive memetic algorithms for arc routing problems
- A deterministic tabu search algorithm for the capacitated arc routing problem
- A variable neighborhood search for the capacitated arc routing problem with intermediate facilities
- Exploiting sparsity in pricing routines for the capacitated arc routing problem
- The fleet size and mix problem for capacitated arc routing
- A cutting plane algorithm for the capacitated arc routing problem
- A guided local search heuristic for the capacitated arc routing problem
- Improved lower bounds and exact algorithm for the capacitated arc routing problem
- Hybrid evolutionary algorithms for graph coloring
- Row-reduced column generation for degenerate master problems
- Stabilized column generation for highly degenerate multiple-depot vehicle scheduling problems
- A survey on matheuristics for routing problems
- Solving capacitated arc routing problems using a transformation to the CVRP
- Tour splitting algorithms for vehicle routing problems
- Exact methods based on node-routing formulations for undirected arc-routing problems
- A Decade of Capacitated Arc Routing
- A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows
- A Variable Neighborhood Descent Algorithm for the Undirected Capacitated Arc Routing Problem
- A Tabu Search Heuristic for the Capacitated arc Routing Problem
- Cut-First Branch-and-Price-Second for the Capacitated Arc-Routing Problem
- Ray projection for optimizing polytopes with prohibitively many constraints in set-covering column generation
This page was built for publication: Iterated local search and column generation to solve arc-routing as a permutation set-covering problem
