[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 …
[PDF][PDF] A review of metaheuristic algorithms for solving TSP-based scheduling optimization problems
B Toaza, D Esztergár-Kiss - Applied Soft Computing Journal, 2023 - researchgate.net
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 …
A review of metaheuristic algorithms for solving TSP-based scheduling optimization problems▪
B Toaza, D Esztergár-Kiss - 2023 - dl.acm.org
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 …