[HTML][HTML] A review of metaheuristic algorithms for solving TSP-based scheduling optimization problems
B Toaza, D Esztergár-Kiss - Applied Soft Computing, 2023 - Elsevier
Activity-based scheduling optimization is a combinatorial problem built on the traveling
salesman problem intending to optimize people schedules considering their trips and the …
salesman problem intending to optimize people schedules considering their trips and the …
Minimum dose path planning for facility inspection based on the discrete Rao-combined ABC algorithm in radioactive environments with obstacles
KR Hong, SI O, RH Kim, TS Kim, JS Kim - Nuclear Science and …, 2023 - Springer
Workers who conduct regular facility inspections in radioactive environments will inevitably
be affected by radiation. Therefore, it is important to optimize the inspection path to ensure …
be affected by radiation. Therefore, it is important to optimize the inspection path to ensure …
Design and Implementation of the Shortest Path Navigation in Samosir District using Branch and Bound Algorithm
R Chandra, TA Prasetyo - Jurnal RESTI (Rekayasa Sistem dan …, 2024 - jurnal.iaii.or.id
Samosir has a large area and several tourist attractions, making it difficult for visitors to
explore the island. Unknowing the route can make the journey less fun and waste time. In …
explore the island. Unknowing the route can make the journey less fun and waste time. In …
The study of depot position effect on travel distance in order picking problem
Research of travel distance on single-depot position in warehouse is tremendous. This study
focuses more on the effect of two-depot position on travel distance in order picking problem …
focuses more on the effect of two-depot position on travel distance in order picking problem …
Grey Wolf Optimizer for enhancing local search based on population
C Gao, X Duan, X Li - 2023 9th International Conference on …, 2023 - ieeexplore.ieee.org
To improve the convergence rate and avoid early maturity when using Grey Wolf Optimizer
(GWO) to solve the Traveling Salesman Problem (TSP), a Grey Wolf Optimizer for enhancing …
(GWO) to solve the Traveling Salesman Problem (TSP), a Grey Wolf Optimizer for enhancing …
[PDF][PDF] A COMPARATIVE STUDY OF OPTIMIZATION METHODS FOR TRAVELING SALESMAN PROBLEM.
In this study, we compare 10 (ten) optimization methods both exact algorithm (B&B) and
approximate algorithm: GA, SA, TS, ACO, PSO, ABC, A3, NN, 2-Opt for symmetric traveling …
approximate algorithm: GA, SA, TS, ACO, PSO, ABC, A3, NN, 2-Opt for symmetric traveling …
NATURE INSPIRED METAHEURISTICS COMPARATIVE STUDY TO SOLVE TRAVELING SALESMAN PROBLEM
A Chandra - JEMIS (Journal of Engineering & Management in …, 2021 - jemis.ub.ac.id
There are numerous optimization method to solve the traveling salesman problem, TSP.
One of methods is metaheuristics which is the state of the art algorithm that can solve the …
One of methods is metaheuristics which is the state of the art algorithm that can solve the …