Sequential and parallel large neighborhood search algorithms for the periodic location routing problem

Hemmelmayr, Vera (2015) Sequential and parallel large neighborhood search algorithms for the periodic location routing problem. European Journal of Operational Research, 243 (1). pp. 52-60. ISSN 0377-2217

[img]
Preview
PDF
Hemmelmayr_2015_EJOR_Sequential-and-parallel.pdf
Available under License Creative Commons: Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0).

Download (270kB)

Abstract

We propose a large neighborhood search (LNS) algorithm to solve the periodic location routing problem (PLRP). The PLRP combines location and routing decisions over a planning horizon in which customers require visits according to a given frequency and the specific visit days can be chosen. We use parallelization strategies that can exploit the availability of multiple processors. The computational results show that the algorithms obtain better results than previous solution methods on a set of standard benchmark instances from the literature.

Item Type: Article
Keywords: location routing / large neighborhood search / parallel metaheuristics
Divisions: Departments > Welthandel > Transportwirtschaft und Logistik > Wakolbinger
Version of the Document: Accepted for Publication
Variance from Published Version: Typographical
Depositing User: Elena Simukovic
Date Deposited: 01 Jun 2017 13:15
Last Modified: 28 Nov 2017 16:38
Related URLs:
FIDES Link: https://bach.wu.ac.at/d/research/results/69642/
URI: https://epub.wu.ac.at/id/eprint/5572

Actions

View Item View Item

Downloads

Downloads per month over past year

View more statistics