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

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Applied soft computing Jg. 148; S. 110908
Hauptverfasser:	Toaza, Bladimir, Esztergár-Kiss, Domokos
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Elsevier B.V 01.11.2023
Schlagworte:	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
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!