We present the Pareto Late Acceptance Hill Climbing algorithm, a multi-objective optimization algorithm based on the Late Acceptance Hill Climbing. We propose an initial experimental analysis of its behavior applying it to different formulations of the bi-objective Permutation Flowshop Scheduling Problem.
Local Search Strategies for Multi-Objective Flowshop Scheduling: Introducing Pareto Late Acceptance Hill Climbing
Da Ros F.;Di Gaspero L.
2023-01-01
Abstract
We present the Pareto Late Acceptance Hill Climbing algorithm, a multi-objective optimization algorithm based on the Late Acceptance Hill Climbing. We propose an initial experimental analysis of its behavior applying it to different formulations of the bi-objective Permutation Flowshop Scheduling Problem.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
