®®®® SIIA Público

Título del libro: 2023 Ieee Congress On Evolutionary Computation, Cec 2023
Título del capítulo: An Archive-Based Multi-Objective Simulated Annealing Algorithm for the Time/Weight-Balanced Cluster Problem in Delivery Logistics

Autores UNAM:
EDUARDO MANUEL CEJA CRUZ; ADRIANA MENCHACA MENDEZ;
Autores externos:

Idioma:

Año de publicación:
2023
Palabras clave:

Clustering algorithms; Genetic algorithms; Multiobjective optimization; Annealing algorithm; Clustering problems; Computational costs; Delivery logistics; Multi objective; Multi objective algorithm; Multi-objectives optimization; Objective functions; Parallelizations; Time weights; Simulated annealing


Resumen:

This paper introduces an archive-based multi- objective algorithm based on simulated annealing to deal with the time/weight-balanced cluster problem. In the presented paper, we adapted the necessary components into the Archive Multi- Objective Simulated Annealing (AMOSA) framework to deal appropriately with the clustering problem. Due to the computational cost of the objective functions, we introduced a parallelization of such objectives to reduce the algorithm's running time, achieving an improvement of 13%. The introduced algorithm was evaluated in a real-world scenario, and its parameters were tuned using the Iterated Local Search in Parameter Configuration Space (ParamILS) method. AMOSA, using its best configuration, was compared concerning a popular Pareto-based multi-objective evolutionary algorithm. The preliminary results indicate the viability of using the proposed approach to deal with the type of problem tackled in this study. The proposed method outperformed the Nondominated Sorting Genetic Algorithm II (NSGA II) concerning the quality of the solutions and the execution time, as will be seen later on. © 2023 IEEE.


Entidades citadas de la UNAM: