Solving the mobile mapping van problem: a hybrid metaheuristic for capacitated arc routing with soft time windows
type: Item
instance of: scholarly article
title: Solving the mobile mapping van problem: a hybrid metaheuristic for capacitated arc routing with soft time windows
zbMATH Open document ID: 1188.90042
author: Pieter Vansteenwegen
author: Wouter Souffriau
author: K. Sörensen
published in: Computers \& Operations Research
publication date: 2010-06-11T00:00:00Z
Mathematics Subject Classification ID: 90B06
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 5720286
zbMATH Keywords: vehicle routing
zbMATH Keywords: arc routing
zbMATH Keywords: mobile mapping van
zbMATH Keywords: Tele Atlas
zbMATH Keywords: soft time windows
MaRDI profile type: Publication
full work available at URL: j.cor.2009.05.006
OpenAlex ID: W2122658204
cites work: A constraint programming approach to the Chinese postman problem with time windows
cites work: Exact methods based on node-routing formulations for undirected arc-routing problems
cites work: Lower and upper bounds for the mixed capacitated arc routing problem
cites work: A deterministic tabu search algorithm for the capacitated arc routing problem
cites work: A goal programming approach to vehicle routing problems with soft time windows
cites work: Introduction to algorithms
cites work: An iterated local search algorithm for the time-dependent vehicle routing problem with time windows
cites work: An Evolutionary Algorithm with Distance Measure for the Split Delivery Capacitated Arc Routing Problem
cites work: Solving capacitated arc routing problems using a transformation to the CVRP
cites work: Transforming arc routing into node routing problems
cites work: An Exchange Heuristic for Routeing Problems with Time Windows
cites work: The Vehicle Routing Problem with Time Windows: Minimizing Route Duration
cites work: Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
cites work: A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows
DOI: 10.1016/J.COR.2009.05.006
Recommended article: A metaheuristic for the vehicle-routeing problem with soft time windows
Recommended article: A hybrid metaheuristic approach for the capacitated arc routing problem
Recommended article: A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows
Recommended article: A two-phase hybrid metaheuristic for the vehicle routing problem with time windows
Recommended article: A unified tabu search algorithm for vehicle routing problems with soft time windows
Recommended article: Combining meta-heuristics to effectively solve the vehicle routing problems with time windows
Recommended article: Q4495169
Recommended article: A hybrid search method for the vehicle routing problem with time windows
description: scientific article; zbMATH DE number 5720286