A combined vehicle loading and routing problem: a case study of fuel logistics Online publication date: Thu, 14-Mar-2019
by Abdelaziz Benantar; Rachid Ouafi; Jaouad Boukachour
International Journal of Logistics Systems and Management (IJLSM), Vol. 32, No. 3/4, 2019
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.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Logistics Systems and Management (IJLSM):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook