Journal
ELECTRONICS
Volume 10, Issue 24, Pages -Publisher
MDPI
DOI: 10.3390/electronics10243147
Keywords
vehicle routing problem; traveling salesman problem; metaheuristic; genetic algorithms; optimization
Ask authors/readers for more resources
The TSP involves finding the shortest path connecting all cities, while the VRP focuses on defining routes for vehicles in logistics transportation. Optimizing the VRP can reduce total costs, with economic benefits in more open markets.
The traveling salesman problem (TSP) consists of finding the shortest way between cities, which passes through all cities and returns to the starting point, given the distance between cities. The Vehicle Routing Problem (VRP) is the issue of defining the assumptions and limitations in mapping routes for vehicles performing certain operational activities. It is a major problem in logistics transportation. In specific areas of business, where transportation can be perceived as added value to the product, it is estimated that its optimization can lower costs up to 25% in total. The economic benefits for more open markets are a key point for VRP. This paper discusses the metaheuristics usage for solving the vehicle routing problem with special attention toward Genetic Algorithms (GAs). Metaheuristic algorithms are selected to solve the vehicle routing problem, where GA is implemented as our primary metaheuristic algorithm. GA belongs to the evolutionary algorithm (EA) family, which works on a survival of the fittest mechanism. This paper presents the idea of implementing different genetic operators, modified for usage with the VRP, and performs experiments to determine the best combination of genetic operators for solving the VRP and to find optimal solutions for large-scale real-life examples of the VRP.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available