Abstract
In this paper, we introduce a model and solve a multi-compartment vehicle routing and loading problem with time windows (MCVRLP-TW). This problem originates from a real-life application arising in the fuel distribution, where a specific attention is paid to integrate the loading process in the routing problem. The main objective is to satisfy all petrol station demands at a minimal routing and service cost. For the MCVRLP-TW, we begin by describing the problem, providing its mathematical models and proposing an efficient tabu search to solve it. Within the framework of the tabu search, we introduce an efficient feature based on the Kolmogorov-Smirnov statistic to restrict the search process to a set of elite neighbouring solutions. We evaluate the performance of the approach by means of extensive numerical experiments. Furthermore, we analyse a real case under different datasets to demonstrate to our industrial partner the effectiveness of the proposed approach.
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 callMore From: International Journal of Logistics Systems and Management
Disclaimer: 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.
