Multilevel variable neighborhood search for periodic routing problems

Authors:
Sandro Pirkwieser;Günther R. Raidl
Affiliations:
Institute of Computer Graphics and Algorithms, Vienna University of Technology, Vienna, Austria;Institute of Computer Graphics and Algorithms, Vienna University of Technology, Vienna, Austria
Venue:
EvoCOP'10 Proceedings of the 10th European conference on Evolutionary Computation in Combinatorial Optimization
Year:
2010

Citing 2
Cited 2

A Multilevel Approach to the Travelling Salesman Problem

Operations Research
An improved heuristic for the period traveling salesman problem

Computers and Operations Research

Hybrid metaheuristics in combinatorial optimization: A survey

Applied Soft Computing
A Hybrid Genetic Algorithm for Multidepot and Periodic Vehicle Routing Problems

Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this work we present the extension of a variable neighborhood search (VNS) with the multilevel refinement strategy for periodic routing problems. The underlying VNS was recently proposed and performs already well on these problems. We apply a path based coarsening scheme by building fixed (route) segments of customers accounting for the periodicity. Starting at the coarsest level the problem is iteratively refined until the original problem is reached again. This refinement is smoothly integrated into the VNS. Further a suitable solution-based recoarsening is proposed. Results on available benchmark test data as well as on newly generated larger instances show the advantage of the multilevel VNS compared to the standard VNS, yielding better results in usually less CPU time. This new approach is especially appealing for large instances.