A routing model and solution approach for alternative fuel vehicles with consideration of the fixed fueling time. (April 2020)

• Record Type: Journal Article
• Authors: Shao, Yihuan; Dessouky, Maged
• Is Part Of: Computers & industrial engineering. Volume 142(2020)
• Publication Date: 2020-04
• Subjects: Green VRP -- Alternative fuel vehicles -- Fuel stations -- Branch-and-cut algorithm -- ALNS; Engineering -- Data processing -- Periodicals; Industrial engineering -- Periodicals; 620.00285
• DOI: 10.1016/j.cie.2020.106364
• Languages: English
• ISSNs: 0360-8352

Abstract

Highlights: Model vehicle routing problem for CNG trucks including the choice of fueling stations. Develop a mixed integer programming model with effective preprocessing and valid inequalities. Propose a new hybrid heuristic method to get high quality solutions for large scale problems quickly. Explore some meaningful insights from the experimental results. Abstract: In this paper, we introduce the Vehicle Routing Problem for Alternative Fuel Vehicles with Fixed Fueling Time (VRPAFVFFT) to model decisions to be made with regards to the vehicle routes cons, dering fuel stations. A Mixed Integer Programming (MIP) model is proposed with improving methods, which includes an adaptive branch-and-cut algorithm. To solve large scale problems, we present a hybrid heuristic method, which combines an Adaptive Large Neighborhood Search (ALNS) with a local search and a MIP model. We conduct experiments to show the efficiency of our solving methods as well as insights from real world cases.