TAILIEUCHUNG - A novel two-phase approach for solving the multi-compartment vehicle routing problem with a heterogeneous fleet of vehicles: a case study on fuel delivery

This paper is motivated by the fuel delivery problem where the main objective of this research is to minimize the total driving distance using a minimum number of vehicles. | A novel two-phase approach for solving the multi-compartment vehicle routing problem with a heterogeneous fleet of vehicles a case study on fuel delivery Decision Science Letters 9 2020 77 90 Contents lists available at GrowingScience Decision Science Letters homepage dsl A novel two-phase approach for solving the multi-compartment vehicle routing problem with a heterogeneous fleet of vehicles a case study on fuel delivery Wasana Chowmalia and Seekharin Suktoa a Department of Industrial Engineering Faculty of Engineering Khon Kaen University Khon Kaen 40002 Thailand CHRONICLE ABSTRACT Article history Distribution of goods is one of the main issues that directly affect the performance of the Received June 15 2019 companies since efficient distribution of goods saves energy costs and also leads to reduced Received in revised format environmental impact. The multi-compartment vehicle routing problem MCVRP with a June 20 2019 heterogeneous fleet of vehicles is encountered when dealing with this situation in many practical Accepted July 27 2019 Available online cases. This paper is motivated by the fuel delivery problem where the main objective of this July 30 2019 research is to minimize the total driving distance using a minimum number of vehicles. Based Keywords on a case study of twenty petrol stations in northeastern Thailand a novel two-phase heuristic Multi-compartment vehicle which is a variant of the Fisher and Jaikumar Algorithm FJA is proposed. The study first routing problem formulates an MCVRP model and then a mixed-integer linear programming MILP model is Vehicle routing problem formulated for selecting the numbers and types of vehicles. A new clustering-based model is also General assignment problem developed in order to select the seed nodes and all customer nodes are considered as candidate Fisher and Jaikumar Algorithm seed nodes. The new Generalized Assignment Problem model GAP model is formulated to Heuristic allocate the .

• Năng lượng
• Multi compartment vehicle routing problem
• Vehicle routing problem
• General assignment problem
• Fisher and Jaikumar Algorithm Heuristic
• Heterogeneous fleet of vehicle
• Metaheuristic algorithm for the multi depot vehicle routing problem
• The multi depot vehicle routing problem with heterogeneous fleet
• High quality solutions
• Obtain high quality solutions