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


RIS


BibTeX

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.

Tags

Press 'enter' for creating the tag

Publication's profile

Status of publication Published
Affiliation WU
Type of publication Journal article
Journal European Journal of Operational Research (EJOR)
Citation Index SCI
WU Journalrating 2009 A
WU-Journal-Rating new FIN-A, INF-A, STRAT-A, WH-A
Language English
Title Sequential and parallel large neighborhood search algorithms for the periodic location routing problem
Volume 243
Number 1
Year 2015
Page from 52
Page to 60
Reviewed? Y
DOI http://dx.doi.org/10.1016/j.ejor.2014.11.024

Associations

People
Hemmelmayr, Vera (Details)
Organization
Institute for Transport and Logistics Management (Details)
Google Scholar: Search