The Vehicle Routing Problem (VRP) is a common logistics problem. The problem was first published in 1959 as the Truck Dispatching Problem. In the basic problem, vehicles deliver the products from a given depot and then return to the depot. The objective function is to minimise the distance travelled by the vehicles. Since the first published paper, a number of variants have been developed that adapt to real logistics demands. This article investigates the optimisation of a complex Vehicle Routing Problem. The following multi-objective optimisation techniques are investigated in the article: weighted-sum method, weighted-exponential sum method, weighted global criterion method, exponentially weighted criterion, weighted product method, bounded objective function method, pareto ranking, Non-dominated Sorting Genetic Algorithm II, Strength Pareto Evolutionary Algorithm, Niched Pareto Genetic Algorithm. The article provides a detailed analysis with the following heuristic algorithms: Ant Colony System, Genetic Algorithm, Tabu Search, Firefly Algorithm, Simulated Annealing.
Analysis of the Multi-Objective Optimisation Techniques in Solving a Complex Vehicle Routing Problem
Lect.Notes Mechanical Engineering
Vehicle and Automotive Engineering ; 2022 ; MISKOLC, Hungary September 08, 2022 - September 09, 2022
2022-09-10
16 pages
Article/Chapter (Book)
Electronic Resource
English
Multi-objective green mixed vehicle routing problem under rough environment
DOAJ | 2021
|Optimization of Vehicle Routing Problem Based on Multi-Objective Genetic Algorithm
British Library Conference Proceedings | 2013
|