Iterated local search and column generation to solve arc-routing as a permutation set-covering problem
type: Item
instance of: scholarly article
title: Iterated local search and column generation to solve arc-routing as a permutation set-covering problem
zbMATH Open document ID: 1394.90577
author: Gilles Goncalves
author: Hamid Allaoui
author: Tienté Hsu
author: Daniel Cosmin Porumbel
published in: European Journal of Operational Research
publication date: 2018-05-24T00:00:00Z
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C11
zbMATH DE Number: 6872211
zbMATH Keywords: column generation
zbMATH Keywords: iterated local search
zbMATH Keywords: arc routing
MaRDI profile type: Publication
full work available at URL: j.ejor.2016.06.055
OpenAlex ID: W2465704753
cites work: A survey on matheuristics for routing problems
cites work: Exact methods based on node-routing formulations for undirected arc-routing problems
cites work: Improved lower bounds and exact algorithm for the capacitated arc routing problem
cites work: A cutting plane algorithm for the capacitated arc routing problem
cites work: A guided local search heuristic for the capacitated arc routing problem
cites work: Cut-First Branch-and-Price-Second for the Capacitated Arc-Routing Problem
cites work: A deterministic tabu search algorithm for the capacitated arc routing problem
cites work: A set-covering based heuristic algorithm for the periodic vehicle routing problem
cites work: Introduction to algorithms
cites work: Row-reduced column generation for degenerate master problems
cites work: Q4510100
cites work: Hybrid evolutionary algorithms for graph coloring
cites work: A Tabu Search Heuristic for the Capacitated arc Routing Problem
cites work: A Variable Neighborhood Descent Algorithm for the Undirected Capacitated Arc Routing Problem
cites work: Q2770548
cites work: Competitive memetic algorithms for arc routing problems
cites work: Exploiting sparsity in pricing routines for the capacitated arc routing problem
cites work: Solving capacitated arc routing problems using a transformation to the CVRP
cites work: Improved bounds for large scale capacitated arc routing problem
cites work: Stabilized column generation for highly degenerate multiple-depot vehicle scheduling problems
cites work: A variable neighborhood search for the capacitated arc routing problem with intermediate facilities
cites work: Ray projection for optimizing polytopes with prohibitively many constraints in set-covering column generation
cites work: Tour splitting algorithms for vehicle routing problems
cites work: A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows
cites work: The fleet size and mix problem for capacitated arc routing
cites work: A Decade of Capacitated Arc Routing
DOI: 10.1016/J.EJOR.2016.06.055
Recommended article: Iterative Column Generation Algorithm for Generalized Multi-Vehicle Covering Tour Problem
Recommended article: Two phased hybrid local search for the periodic capacitated arc routing problem
Recommended article: A guided local search procedure for the multi-compartment capacitated arc routing problem
Recommended article: Solving the team orienteering arc routing problem with a column generation approach
Recommended article: A guided local search heuristic for the capacitated arc routing problem
Recommended article: Local search for the undirected capacitated arc routing problem with profits
Recommended article: An iterated local search for solving a location-routing problem
Recommended article: A scatter search for the periodic capacitated arc routing problem
Recommended article: Solving arc routing problems with turn penalties
description: scientific article; zbMATH DE number 6872211