A variable neighborhood search for the capacitated arc routing problem with intermediate facilities
From MaRDI portal
Publication:953311
DOI10.1007/S10732-007-9050-2zbMATH Open1211.90314OpenAlexW2075691918WikidataQ59195732 ScholiaQ59195732MaRDI QIDQ953311FDOQ953311
Authors: Michael Polacek, K. 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
Recommendations
- A Variable Neighborhood Descent Algorithm for the Undirected Capacitated Arc Routing Problem
- The capacitated arc routing problem with intermediate facilities
- A variable neighborhood search algorithm for the capacitated vehicle routing problem
- Tabu search heuristics for the arc routing problem with intermediate facilities under capacity and length restrictions
- Variants of the capacitated arc routing problem
- Efficient local search strategies for the mixed capacitated arc routing problems under time restrictions with intermediate facilities
- An approximation algorithm for the capacitated arc routing problem
- Approximate solutions for the capacitated arc routing problem
- A variable neighborhood search for the capacitated vehicle routing problem with two-dimensional loading constraints
variable neighborhood searchcapacitated arc routing problemintermediate facilitiestour length restriction
Approximation methods and heuristics in mathematical programming (90C59) Transportation, logistics and supply chain management (90B06)
Cites Work
- Title not available (Why is that?)
- A reactive variable neighborhood search for the vehicle-routing problem with time windows
- A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows
- Variable neighborhood search
- Variable neighborhood search: Principles and applications
- A guided local search heuristic for the capacitated arc routing problem
- Capacitated arc routing problems
- Title not available (Why is that?)
- Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing
- The capacitated arc routing problem: Valid inequalities and facets
- A cutting plane algorithm for the capacitated arc routing problem
- Lower and upper bounds for the mixed capacitated arc routing problem
- The capacitated arc routing problem with intermediate facilities
- A Tabu Search Heuristic for the Capacitated arc Routing Problem
- Title not available (Why is that?)
- The fleet size and mix problem for capacitated arc routing
- Routeing winter gritting vehicles
- Title not available (Why is that?)
- Exact methods based on node-routing formulations for undirected arc-routing problems
- A Variable Neighborhood Descent Algorithm for the Undirected Capacitated Arc Routing Problem
- Competitive memetic algorithms for arc routing problems
- A deterministic tabu search algorithm for the capacitated arc routing problem
- An approximate procedure for determining the number, capacities and locations of solid waste transfer-stations in an urban region
- Multiple center capacitated arc routing problems: A tabu search algorithm using capacitated trees
- Evolutionary algorithms for periodic arc routing problems
- New lower bound for the capacitated arc routing problem
- A scatter search for the periodic capacitated arc routing problem
- Title not available (Why is that?)
- Tabu search heuristics for the arc routing problem with intermediate facilities under capacity and length restrictions
- Scheduling periodic customer visits for a traveling salesperson
- Title not available (Why is that?)
Cited In (36)
- A guided local search procedure for the multi-compartment capacitated arc routing problem
- A multi-level capacitated arc routing problem with intermediate facilities in waste collection
- Heuristic and exact algorithms for the multi-pile vehicle routing problem
- New large-scale data instances for CARP and new variations of CARP
- Efficient local search strategies for the mixed capacitated arc routing problems under time restrictions with intermediate facilities
- Variants of the capacitated arc routing problem
- Variable neighbourhood search: Methods and applications
- Divide-and-conquer large scale capacitated arc routing problems with route cutting off decomposition
- Heuristics for the multi-period orienteering problem with multiple time windows
- Solving vehicle routing problems with intermediate stops using VRPSolver models
- Variable neighbourhood search: methods and applications
- Iterated local search and column generation to solve arc-routing as a permutation set-covering problem
- Using mixed integer programming for solving the capacitated arc routing problem with vehicle/site dependencies with an application to the routing of residential sanitation collection vehicles
- An efficiency-based path-scanning heuristic for the capacitated arc routing problem
- Location-arc routing problem: heuristic approaches and test instances
- Multi-start iterated local search for the periodic vehicle routing problem with time windows and time spread constraints on services
- Variable neighborhood search for location routing
- A Variable Neighborhood Descent Algorithm for the Undirected Capacitated Arc Routing Problem
- A variable neighborhood descent algorithm for a real waste collection problem with mobile depots
- An adaptive VNS algorithm for vehicle routing problems with intermediate stops
- A hybrid metaheuristic approach for the capacitated arc routing problem
- Improved bounds for large scale capacitated arc routing problem
- GRASP with evolutionary path-relinking for the capacitated arc routing problem
- A memetic algorithm for the travelling salesperson problem with hotel selection
- A fast metaheuristic for the travelling salesperson problem with hotel selection
- 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
- Tabu search heuristics for the arc routing problem with intermediate facilities under capacity and length restrictions
- Crossover iterated local search for SDCARP
- Fast upper and lower bounds for a large‐scale real‐world arc routing problem
- Ant colony optimization for the arc routing problem with intermediate facilities under capacity and length restrictions
- Heuristics for routing heterogeneous unmanned vehicles with fuel constraints
- Two phased hybrid local search for the periodic capacitated arc routing problem
- A multi-population cooperative coevolutionary algorithm for multi-objective capacitated arc routing problem
- Capacitated arc routing problem with deadheading demands
- The capacitated arc routing problem with intermediate facilities
Uses Software
This page was built for publication: A variable neighborhood search for the capacitated arc routing problem with intermediate facilities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q953311)
