scientific article

zbMath0978.68566MaRDI QIDQ2770548

Philippe Lacomme, Christian Prins, Wahiba Ramdane-Cherif

Publication date: 13 February 2002

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2037/20370473

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items

A simple and effective evolutionary algorithm for the vehicle routing problem, Local search heuristics for sectoring routing in a household waste collection context, New heuristic algorithms for the windy rural postman problem, Hybrid genetic algorithm for the open capacitated arc routing problem, Arc routing problems with time-dependent service costs, Integration of routing into a resource-constrained project scheduling problem, A strategic oscillation simheuristic for the time capacitated arc routing problem with stochastic demands, Efficient frameworks for greedy split and new depth first search split procedures for routing problems, An improved multi-objective framework for the rich arc routing problem, Memetic algorithm based on extension step and statistical filtering for large-scale capacitated arc routing problems, Solving large-scale time capacitated arc routing problems: from real-time heuristics to metaheuristics, A Decade of Capacitated Arc Routing, A variable neighborhood search for the capacitated arc routing problem with intermediate facilities, Iterated local search and column generation to solve arc-routing as a permutation set-covering problem, Expected runtimes of evolutionary algorithms for the Eulerian cycle problem, Solving an urban waste collection problem using ants heuristics, Evolutionary algorithms for periodic arc routing problems, A guided local search procedure for the multi-compartment capacitated arc routing problem, Lower and upper bounds for the mixed capacitated arc routing problem, A tabu search algorithm for the Min-Max \(k\)-Chinese postman problem, A genetic algorithm for a bi-objective capacitated arc routing problem, The open capacitated arc routing problem, Heuristic methods for the sectoring arc routing problem, A scatter search for the periodic capacitated arc routing problem, A cutting plane algorithm for the capacitated arc routing problem