A mathematical programming-based heuristic for the production routing problem with transshipments
Yükleniyor...
Tarih
2020
Yazarlar
Dergi Başlığı
Dergi ISSN
Cilt Başlığı
Yayıncı
Pergamon-Elsevier Science Ltd
Erişim Hakkı
info:eu-repo/semantics/closedAccess
Özet
The production routing problem (PRP) is a difficult optimization problem which arises in the planning of integrated supply chains. The purpose of solving the PRP is the simultaneous optimization of the production, inventory, distribution, and routing decisions, which typically appears in vendor managed inventory systems. In this study, the classical PRP is extended by considering transshipments, either from supplier to retailers or between retailers, to further reduce the total cost. A mathematical programming-based heuristic is proposed to solve the problem. The algorithm is applied to two sets of randomly generated problem instances. The computational results show that the proposed approach is effective in solving the problem. Moreover, we conduct extensive numerical experiments to analyze the impact of the transshipments on the overall system. (C) 2020 Elsevier Ltd. All rights reserved.
Açıklama
Anahtar Kelimeler
Production routing, Heuristics, Transshipment, Integrated Production, Lateral Transshipments, Neighborhood Search, Inventory, Algorithm, Replenishment, Formulations, Management, Delivery, Policies
