|
| Title: | The multi-period petrol station replenishment problem: Formulation and solution methods | | | Authors: | L. Boers, B. Atasoy, G. Correia, R.R. Negenborn |
| | Conference: | 11th International Conference on Computational Logistics (ICCL'20) | | Address: | Enschede, The Netherlands | | Date: | September 2020 |
| | Abstract: | We present a "rich" Petrol Station Replenishment Problem (PSRP) with real-life characteristics that represents the complexities involved in actual operations. The planning is optimised over multiple days and therefore, the new variant can be classified as the Multi-Period Petrol Station Replenishment Problem (MP-PSRP). A Mixed Integer Linear Programming (MILP) formulation is developed and a decomposition heuristic is proposed as a solution algorithm, which is evaluated with a case study from a real-life petrol distributor in Denmark. To determine delivery quantities, the heuristic uses the newly introduced simultaneous dry run inventory policy. A procedure is applied to improve the initial solution. A commercial solver is able to find feasible solutions only for instances with up to 20 stations and 7 days for the MILP model where optimality is guaranteed for instances up to 10 stations and 5 days. The heuristic on the other hand provides feasible solutions for the full case study of 59 stations and 14 days, within a time limit of 2 hours. |
| | Reference: | The multi-period petrol station replenishment problem: Formulation and solution methods. L. Boers, B. Atasoy, G. Correia, R.R. Negenborn. In Proceedings of the 11th International Conference on Computational Logistics (ICCL'20), Enschede, The Netherlands, pp. 600-615, September 2020. | | | Request: | A
copy of this publication. |
|
|
