Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
