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.
| Identifer | oai:union.ndltd.org:VIENNA/oai:epub.wu-wien.ac.at:5572 |
| Date | 05 1900 |
| Creators | Hemmelmayr, Vera |
| Publisher | Elsevier |
| Source Sets | Wirtschaftsuniversität Wien |
| Language | English |
| Detected Language | English |
| Type | Article, PeerReviewed |
| Format | application/pdf |
| Rights | Creative Commons: Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0) |
| Relation | http://dx.doi.org/10.1016/j.ejor.2014.11.024, https://www.journals.elsevier.com/european-journal-of-operational-research, https://www.elsevier.com/journals/european-journal-of-operational-research/0377-2217/open-access-options, http://epub.wu.ac.at/5572/ |
Page generated in 0.0011 seconds