Selected Genetic Algorithms for Vehicle Routing Problem Solving

Selected Genetic Algorithms for Vehicle Routing Problem Solving

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...

Full description

Bibliographic Details
Main Authors: Joanna Ochelska-Mierzejewska, Aneta Poniszewska-Marańda, Witold Marańda
Format: Article
Language:English
Published: MDPI AG 2021-12-01
Series:Electronics
Subjects:
vehicle routing problem
traveling salesman problem
metaheuristic
genetic algorithms
optimization
Online Access:https://www.mdpi.com/2079-9292/10/24/3147

Similar Items

Similar Items