A variable neighborhood search for the capacitated arc routing problem with intermediate facilities
From MaRDI portal
Publication:953311
DOI10.1007/s10732-007-9050-2zbMath1211.90314WikidataQ59195732 ScholiaQ59195732MaRDI QIDQ953311
Michael Polacek, Karl F. Doerner, Richard F. Hartl, Vittorio Maniezzo
Publication date: 17 November 2008
Published in: Journal of Heuristics (Search for Journal in Brave)
Full work available at URL: http://amsacta.unibo.it/2132/1/polacek_carpif.pdf
variable neighborhood search; capacitated arc routing problem; intermediate facilities; tour length restriction
90B06: Transportation, logistics and supply chain management
90C59: Approximation methods and heuristics in mathematical programming
Related Items
New large-scale data instances for CARP and new variations of CARP, A hybrid metaheuristic approach for the capacitated arc routing problem, A memetic algorithm for the travelling salesperson problem with hotel selection, Improved bounds for large scale capacitated arc routing problem, GRASP with evolutionary path-relinking for the capacitated arc routing problem, Multi-start iterated local search for the periodic vehicle routing problem with time windows and time spread constraints on services, Location-arc routing problem: heuristic approaches and test instances, Variable neighborhood search for location routing, Constructive heuristics for the mixed capacity arc routing problem under time restrictions with intermediate facilities, An adaptive large neighborhood search for an E-grocery delivery routing problem, Crossover iterated local search for SDCARP, A multi-population cooperative coevolutionary algorithm for multi-objective capacitated arc routing problem, Heuristic and exact algorithms for the multi-pile vehicle routing problem, Heuristics for the multi-period orienteering problem with multiple time windows, Variable neighbourhood search: methods and applications, Variable neighbourhood search: Methods and applications, An efficiency-based path-scanning heuristic for the capacitated arc routing problem, Two phased hybrid local search for the periodic capacitated arc routing problem, Heuristics for routing heterogeneous unmanned vehicles with fuel constraints, Iterated local search and column generation to solve arc-routing as a permutation set-covering problem, Capacitated arc routing problem with deadheading demands, Divide-and-conquer large scale capacitated arc routing problems with route cutting off decomposition, A guided local search procedure for the multi-compartment capacitated arc routing problem, A fast metaheuristic for the travelling salesperson problem with hotel selection
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Competitive memetic algorithms for arc routing problems
- Tabu search heuristics for the arc routing problem with intermediate facilities under capacity and length restrictions
- Scheduling periodic customer visits for a traveling salesperson
- Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing
- A deterministic tabu search algorithm for the capacitated arc routing problem
- The fleet size and mix problem for capacitated arc routing
- An approximate procedure for determining the number, capacities and locations of solid waste transfer-stations in an urban region
- Routeing winter gritting vehicles
- Variable neighborhood search
- The capacitated arc routing problem: Valid inequalities and facets
- Multiple center capacitated arc routing problems: A tabu search algorithm using capacitated trees
- Evolutionary algorithms for periodic arc routing problems
- A cutting plane algorithm for the capacitated arc routing problem
- A guided local search heuristic for the capacitated arc routing problem
- Lower and upper bounds for the mixed capacitated arc routing problem
- New lower bound for the capacitated arc routing problem
- A scatter search for the periodic capacitated arc routing problem
- The capacitated arc routing problem with intermediate facilities
- A Reactive Variable Neighborhood Search for the Vehicle-Routing Problem with Time Windows
- Exact methods based on node-routing formulations for undirected arc-routing problems
- Capacitated arc routing problems
- 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
- Variable neighborhood search: Principles and applications
