Solving the mobile mapping van problem: a hybrid metaheuristic for capacitated arc routing with soft time windows
DOI10.1016/J.COR.2009.05.006zbMATH Open1188.90042OpenAlexW2122658204MaRDI QIDQ975995FDOQ975995
K. Sörensen, Pieter Vansteenwegen, Wouter Souffriau
Publication date: 11 June 2010
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2009.05.006
Approximation methods and heuristics in mathematical programming (90C59) Transportation, logistics and supply chain management (90B06)
Cites Work
- Introduction to algorithms
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
- The Vehicle Routing Problem with Time Windows: Minimizing Route Duration
- A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows
- An Exchange Heuristic for Routeing Problems with Time Windows
- An iterated local search algorithm for the time-dependent vehicle routing problem with time windows
- Lower and upper bounds for the mixed capacitated arc routing problem
- Solving capacitated arc routing problems using a transformation to the CVRP
- Exact methods based on node-routing formulations for undirected arc-routing problems
- A goal programming approach to vehicle routing problems with soft time windows
- A deterministic tabu search algorithm for the capacitated arc routing problem
- Transforming arc routing into node routing problems
- An Evolutionary Algorithm with Distance Measure for the Split Delivery Capacitated Arc Routing Problem
- A constraint programming approach to the Chinese postman problem with time windows
Cited In (10)
- Solving large-scale time capacitated arc routing problems: from real-time heuristics to metaheuristics
- Approximation algorithms for the min-max mixed rural postmen cover problem and its variants
- An efficiency-based path-scanning heuristic for the capacitated arc routing problem
- An updated annotated bibliography on arc routing problems
- Arc routing problems: A review of the past, present, and future
- Transshipment service through crossdocks with both soft and hard time windows
- The mixed capacitated general routing problem with <scp>time‐dependent</scp> demands
- Two-stage vehicle routing problem with arc time windows: a mixed integer programming formulation and a heuristic approach
- The windy rural postman problem with a time-dependent zigzag option
- Approximation algorithms for the min-max mixed rural postmen cover problem and its variants
Recommendations
- A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows 👍 👎
- A metaheuristic for the vehicle-routeing problem with soft time windows 👍 👎
- A two-phase hybrid metaheuristic for the vehicle routing problem with time windows 👍 👎
- A hybrid metaheuristic approach for the capacitated arc routing problem 👍 👎
- A unified tabu search algorithm for vehicle routing problems with soft time windows 👍 👎
- A hybrid search method for the vehicle routing problem with time windows 👍 👎
- Combining meta-heuristics to effectively solve the vehicle routing problems with time windows 👍 👎
- Title not available (Why is that?) 👍 👎
This page was built for publication: Solving the mobile mapping van problem: a hybrid metaheuristic for capacitated arc routing with soft time windows
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q975995)
