Selected Genetic Algorithms for Vehicle Routing Problem Solving

• DOI: 10.3390/electronics10243147
• Publication Date: 2021-12-20T01:41:55Z
• Authors: Joanna Ochelska-M...; Aneta Poniszewska...; Witold Marańda
• Keywords: Vehicle Routing Problem

The traveling salesman problem (TSP) consists of finding the shortest way between cities, which passes through all cities and returns to starting point, given distance cities. Vehicle Routing Problem (VRP) is issue defining assumptions limitations in mapping routes for vehicles performing certain operational activities. It a major logistics transportation. In specific areas business, where transportation can be perceived as added value product, it estimated that its optimization lower costs up 25% total. economic benefits more open markets are key point VRP. This paper discusses metaheuristics usage solving vehicle routing with special attention toward Genetic Algorithms (GAs). Metaheuristic algorithms selected solve problem, GA implemented our primary metaheuristic algorithm. belongs evolutionary algorithm (EA) family, works on “survival fittest” mechanism. presents idea implementing different genetic operators, modified VRP, performs experiments determine best combination operators VRP find optimal solutions large-scale real-life examples