A unified-adaptive large neighborhood search metaheuristic for periodic location-routing problems

KOÇ, ÇAĞRI

doi:10.1016/j.trc.2016.04.013

A unified-adaptive large neighborhood search metaheuristic for periodic location-routing problems

KOÇ Ç.

TRANSPORTATION RESEARCH PART C-EMERGING TECHNOLOGIES, ss.265-284, 2016 (SCI-Expanded, SSCI, Scopus)

Yayın Türü: Makale / Tam Makale
Basım Tarihi: 2016
Doi Numarası: 10.1016/j.trc.2016.04.013
Dergi Adı: TRANSPORTATION RESEARCH PART C-EMERGING TECHNOLOGIES
Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Social Sciences Citation Index (SSCI), Scopus
Sayfa Sayıları: ss.265-284
Hacettepe Üniversitesi Adresli: Hayır

Özet

This paper introduces three variants of the Periodic Location-Routing Problem (PLRP): the Heterogeneous PLRP with Time Windows (HPTW), the Heterogeneous PLRP (HP) and the homogeneous PLRP with Time Windows (PTW). These problems extend the well-known location-routing problem by considering a homogeneous or heterogeneous fleet, multiple periods and time windows. The paper develops a powerful Unified-Adaptive Large Neighborhood Search (U-ALNS) metaheuristic for these problems. The U-ALNS successfully uses existing algorithmic procedures and also offers a number of new advanced efficient procedures capable of handling a multi-period horizon, fleet composition and location decisions. Computational experiments on benchmark instances show that the U-ALNS is highly effective on PLRPs. The U-ALNS outperforms previous methods on a set of standard benchmark instances for the PLRP. We also present new benchmark results for the PLRP, HPTW, HP and PTW. (C) 2016 Elsevier Ltd. All rights reserved.