A two-level evolutionary algorithm for solving the petrol station replenishment problem with periodicity constraints and service choice
- 45 Downloads
This paper addresses the petrol station replenishment problem with periodicity constraints and introduces the frequency service choice as a decision variable. We present a mathematical optimization model for the problem and we develop first a simple heuristic method that is able to handle the complexity of the problem and then two metaheuristic approaches based on a novel two-level evolutionary algorithm. The first level deals with the periodicity and frequency selection of the visits to the petrol stations. The second level of evolution assigns the stations to the tank-trucks such that the total traveled distance is minimized. The effectiveness of the proposed approaches has been tested by means of a comprehensive experimental study by using first a set of randomly generated test cases and then a real-life problem.
KeywordsMulti-period planning Petrol station replenishment Tank-trucks scheduling and routing Periodicity and frequency service choice
The authors would like to acknowledge the financial support from Sultan Qaboos University through the internal Grant IG/ENG/MIED/14/04. Moreover, the work of the second author has been partially carried out during his research visit to the University of Tsukuba (Japan) under the Matsumae International Foundation (MIF) fellowship program. The author would like to thank both the MIF and the University of Tsukuba for such opportunity.
- Ben Abdelaziz, F., Roucairol, C., & Bacha, C. (2002). Deliveries of liquid fuels to SNDP gas stations using vehicles with multiple compartments. In System management and cyber IEEE international conference, Hammamet, Tunisia.Google Scholar
- Huang, C. F., Bieniawski, S., Wolpert, D. H., & Strauss, C. E. M. (2005). A comparative study of probability collective based multi-agent systems and genetic algorithms. In Proceedings of the conference on genetic and evolutionary computing (pp. 751–752).Google Scholar
- Malépart, V., Boctor, F., Renaud, J., & Labilois, S. (2003). Nouvelles approches pour l’approvisionnement des stations d’essence. Revue Franaise de Gestion Industrielle, 22, 15–31.Google Scholar
- Matei, O., Pop, P. C., Sas, J. L., & Chira, C. (2015). An improved immigration memetic algorithm for solving the heterogeneous fixed fleet vehicle routing problem. Neuro-computing, 150, 58–66.Google Scholar
- Morris, P. (1993). The breakout method for escaping from local minima. In Proceedings of the 11th national conference on artificial intelligence (AAAI-93) (pp. 40–45). AAI Press/MIT Press.Google Scholar
- Rizzoli, A., Casagrande, N., Donati, A., Gambardella, L., Lepori, D., Montemanni, R., Pina, P., & Zaffalon, M. (2003). Planning and optimization of vehicle routes for fuel oil distribution. In MODSIM international conference on modelling and simulation. Townsville, Australia.Google Scholar
- Rothenbächer, A. K. (2017). Branch-and-price-and-cut for the periodic vehicle routing problem with flexible schedule structures. Johannes Gutenberg University Mainz, Discussion paper number 1714. http://www.macro.economics.uni-mainz.de/RePEc/pdf/Discussion_Paper_1714.pdf. Accessed 1 Dec 2018.
- Taqa Allah, D., Renaud, J., & Boctor, F. F. (2000). Le probleme d’approvisionnement des stations d’essence. APII-JESA Journal Europeen des Systemes Automatises, 34, 11–33.Google Scholar
- Triki, C., Al-Hinai, N., Kaabachi, I., & Krichen, S. (2016). An optimization framework for combining the petroleum replenishment problem with the optimal bidding in combinatorial auctions. International Journal of Supply and Operations Management, 3(2), 1318–1331.Google Scholar