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

Full description

Bibliographic Details

Published in:	Applied soft computing Vol. 148; p. 110908
Main Authors:	Toaza, Bladimir, Esztergár-Kiss, Domokos
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 01.11.2023
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!