Solving the mobile mapping van problem: a hybrid metaheuristic for capacitated arc routing with soft time windows

DOI10.1016/J.COR.2009.05.006MaRDI QIDQ975995zbMATH OpenOpenAlexFDO

Authors Pieter Vansteenwegen, Wouter Souffriau, K. Sörensen

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

zbMATH Keywords

vehicle routingarc routingsoft time windowsmobile mapping vanTele Atlas

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Transportation, logistics and supply chain management (90B06)

Recommendations

• A metaheuristic for the vehicle-routeing problem with soft time windows
• A hybrid metaheuristic approach for the capacitated arc routing problem
• A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows
• A two-phase hybrid metaheuristic for the vehicle routing problem with time windows
• A unified tabu search algorithm for vehicle routing problems with soft time windows
• Combining meta-heuristics to effectively solve the vehicle routing problems with time windows
• scientific article; zbMATH DE number 1488069
• A hybrid search method for the vehicle routing problem with time windows

Cites work

• A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows
• A constraint programming approach to the Chinese postman problem with time windows
• A deterministic tabu search algorithm for the capacitated arc routing problem
• A goal programming approach to vehicle routing problems with soft time windows
• Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
• An Evolutionary Algorithm with Distance Measure for the Split Delivery Capacitated Arc Routing Problem
• An Exchange Heuristic for Routeing Problems with Time Windows
• An iterated local search algorithm for the time-dependent vehicle routing problem with time windows
• Exact methods based on node-routing formulations for undirected arc-routing problems
• Introduction to algorithms
• Lower and upper bounds for the mixed capacitated arc routing problem
• Solving capacitated arc routing problems using a transformation to the CVRP
• The Vehicle Routing Problem with Time Windows: Minimizing Route Duration
• Transforming arc routing into node routing problems

Cited in

(10)

• An efficiency-based path-scanning heuristic for the capacitated arc routing problem
• Two-stage vehicle routing problem with arc time windows: a mixed integer programming formulation and a heuristic approach
• Solving large-scale time capacitated arc routing problems: from real-time heuristics to metaheuristics
• The mixed capacitated general routing problem with <scp>time‐dependent</scp> demands
• Transshipment service through crossdocks with both soft and hard time windows
• The windy rural postman problem with a time-dependent zigzag option
• An updated annotated bibliography on arc routing problems
• Arc routing problems: A review of the past, present, and future
• 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

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)