On the potentials of parallelizing large neighbourhood search for rich vehicle routing problems

Authors:
Paul Bartodziej;Ulrich Derigs;Ulrich Vogel
Affiliations:
University of Cologne, Department of Information Systems and Operations Research, Köln, Germany;University of Cologne, Department of Information Systems and Operations Research, Köln, Germany;University of Cologne, Department of Information Systems and Operations Research, Köln, Germany
Venue:
LION'10 Proceedings of the 4th international conference on Learning and intelligent optimization
Year:
2010

Citing 2
Cited 0

A Tabu-Search Hyperheuristic for Timetabling and Rostering

Journal of Heuristics
An Adaptive Large Neighborhood Search Heuristic for the Pickup and Delivery Problem with Time Windows

Transportation Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we present preliminary results on parallelizing the Large Neighbourhood Search heuristic (LNS) for the Vehicle Routing Problem with Pickup and Delivery and Time Windows (VRPPDTW) using pb.net, a framework for easy and efficient parallelization of problem solving heuristics.