2021
DOI: 10.3390/electronics10243147
|View full text |Cite
|
Sign up to set email alerts
|

Selected Genetic Algorithms for Vehicle Routing Problem Solving

Abstract: 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 e… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
8
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
8
1
1

Relationship

0
10

Authors

Journals

citations
Cited by 26 publications
(15 citation statements)
references
References 38 publications
0
8
0
Order By: Relevance
“…To solve an NPhard problem avoiding complex and time-consuming computations, several metaheuristics can be used. In recent years, the scope of the application of fuzzy set theory [44] and genetic algorithms for solving routing problems [37,[45][46][47] have grown significantly.…”
Section: Optimisation Methods In Distribution Systemsmentioning
confidence: 99%
“…To solve an NPhard problem avoiding complex and time-consuming computations, several metaheuristics can be used. In recent years, the scope of the application of fuzzy set theory [44] and genetic algorithms for solving routing problems [37,[45][46][47] have grown significantly.…”
Section: Optimisation Methods In Distribution Systemsmentioning
confidence: 99%
“…Replace old population with the new one 9: until convergence or maximum number of iterations is reached Fujdiak et al [50] and Ikram et al [51] use GAs applied to the smart waste management problem. Ochelska-Mierzejewska et al [52] discuss the usage of GAs for solving the routing problem.…”
Section: Genetic Algorithms (Gas)mentioning
confidence: 99%
“…), we strive to achieve certain goals (e.g., shortest total vehicle miles driven, lowest total transportation costs, vehicles arriving at a certain time, minimum number of vehicles used, and so on.) [68][69][70][71].…”
Section: Modeling Capacitated Vehicle Routingmentioning
confidence: 99%