A review of metaheuristic algorithms for solving TSP-based scheduling optimization problems

Activity-based scheduling optimization is a combinatorial problem built on the traveling salesman problem intending to optimize people schedules considering their trips and the available transportation network. Due to the difficulty of scheduling, traditional and exact methods are unable to provide...

Celý popis

Podrobná bibliografia

Vydané v:	Applied soft computing Ročník 148; s. 110908
Hlavní autori:	Toaza, Bladimir, Esztergár-Kiss, Domokos
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier B.V 01.11.2023
Predmet:	Bibliometric analysis Metaheuristic algorithms Optimization problems Scheduling optimization Traveling salesman problem Traveling salesman problem Bibliometric analysis Optimization problems Scheduling optimization Metaheuristic algorithms
ISSN:	1568-4946, 1872-9681
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!