The fleet size and mix location-routing problem with time windows: Formulations and a heuristic algorithm
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, sa.1, ss.33-51, 2016 (SCI-Expanded, Scopus)
- Yayın Türü: Makale / Tam Makale
- Basım Tarihi: 2016
- Doi Numarası: 10.1016/j.ejor.2015.06.082
- Dergi Adı: EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
- Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus
- Sayfa Sayıları: ss.33-51
- Açık Arşiv Koleksiyonu: AVESİS Açık Erişim Koleksiyonu
- Hacettepe Üniversitesi Adresli: Hayır
Özet
This paper introduces the fleet size and mix location-routing problem with time windows (FSMLRPTW) which extends the location-routing problem by considering a heterogeneous fleet and time windows. The main objective is to minimize the sum of vehicle fixed cost, depot cost and routing cost. We present mixed integer programming formulations, a family of valid inequalities and we develop a powerful hybrid evolutionary search algorithm (HESA) to solve the problem. The HESA successfully combines several metaheuristics and offers a number of new advanced efficient procedures tailored to handle heterogeneous fleet dimensioning and location decisions. We evaluate the strengths of the proposed formulations with respect to their ability to find optimal solutions. We also investigate the performance of the HESA. Extensive computational experiments on new benchmark instances have shown that the HESA is highly effective on the FSMLRPTW. (C) 2015 Elsevier B.V. and Association of European Operational Research Societies (EURO) within the International Federation of Operational Research Societies (IFORS). All rights reserved.