Solving the mobile mapping van problem: a hybrid metaheuristic for capacitated arc routing with soft time windows
From MaRDI portal
Publication:975995
DOI10.1016/j.cor.2009.05.006zbMath1188.90042OpenAlexW2122658204MaRDI QIDQ975995
Kenneth 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
Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (9)
An efficiency-based path-scanning heuristic for the capacitated arc routing problem ⋮ Arc routing problems: A review of the past, present, and future ⋮ The mixed capacitated general routing problem with <scp>time‐dependent</scp> demands ⋮ Approximation algorithms for the min-max mixed rural postmen cover problem and its variants ⋮ Approximation algorithms for the min-max mixed rural postmen cover problem and its variants ⋮ Solving large-scale time capacitated arc routing problems: from real-time heuristics to metaheuristics ⋮ The windy rural postman problem with a time-dependent zigzag option ⋮ Transshipment service through crossdocks with both soft and hard time windows ⋮ Two-stage vehicle routing problem with arc time windows: a mixed integer programming formulation and a heuristic approach
Cites Work
- Unnamed Item
- A goal programming approach to vehicle routing problems with soft time windows
- A deterministic tabu search algorithm for the capacitated arc routing problem
- An iterated local search algorithm for the time-dependent vehicle routing problem with time windows
- Transforming arc routing into node routing problems
- Lower and upper bounds for the mixed capacitated arc routing problem
- A constraint programming approach to the Chinese postman problem with time windows
- Solving capacitated arc routing problems using a transformation to the CVRP
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
- Exact methods based on node-routing formulations for undirected arc-routing problems
- An Evolutionary Algorithm with Distance Measure for the Split Delivery Capacitated Arc Routing Problem
- 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
This page was built for publication: Solving the mobile mapping van problem: a hybrid metaheuristic for capacitated arc routing with soft time windows
