An Archive-Based Multi-Objective Simulated Annealing Algorithm for the Time/Weight-Balanced Cluster Problem in Delivery Logistics

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

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:2023 IEEE Congress on Evolutionary Computation (CEC) S. 1 - 8
Hauptverfasser: Ceja-Cruz, Eduardo Manuel, Menchaca-Mendez, Adriana, Montero, Elizabeth, Zapotecas-Martinez, Saul
Format: Tagungsbericht
Sprache:Englisch
Veröffentlicht: IEEE 01.07.2023
Schlagworte:
Clustering algorithms
clustering problem
Computational efficiency
Evolutionary computation
Linear programming
Logistics
multi-objective optimization
Simulated annealing
Sorting
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Abstract 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.
AbstractList 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.
Author Montero, Elizabeth
Zapotecas-Martinez, Saul
Ceja-Cruz, Eduardo Manuel
Menchaca-Mendez, Adriana
Author_xml – sequence: 1
  givenname: Eduardo Manuel
  surname: Ceja-Cruz
  fullname: Ceja-Cruz, Eduardo Manuel
  email: lalitoceja@gmail.com
  organization: UNAM Morelia,Technologies for Information in Sciences ENES Unidad Morelia,Michoacán,Mexico
– sequence: 2
  givenname: Adriana
  surname: Menchaca-Mendez
  fullname: Menchaca-Mendez, Adriana
  email: amenchaca@enesmorelia.unam.mx
  organization: UNAM Morelia,Technologies for Information in Sciences ENES Unidad Morelia,Michoacán,Mexico
– sequence: 3
  givenname: Elizabeth
  surname: Montero
  fullname: Montero, Elizabeth
  email: elizabeth.montero@usm.cl
  organization: Universidad Técnica Federico Santa Mariá,Departamento de Informática,Valparaiso,Chile
– sequence: 4
  givenname: Saul
  surname: Zapotecas-Martinez
  fullname: Zapotecas-Martinez, Saul
  email: szapotecas@inaoep.mx
  organization: Instituto Nacional de Astrofisica Óptica y Electrónica Tonantzintla,Computer Science Department,Puebla,Mexico
BookMark eNo1kN1KwzAcxSPohc69gUheoFu-uiaXtc4pTCY48XKk6b9tJE0lzYRd-uYG1KvDOYfzuzhX6NyPHhC6pWRBKVHLal3lnCXHCOMLSljOlWJnaK4KJXlOOBW5lJfou_S4DKa3X5Dd6Qka_Hx00Wa7-gNMTCl-tcPR6Zia0nvQzvoOl64bg439gNsx4NgD3tsBlu9guz4mjtPepEHljlOEgF_CWDsYsPX4HlyChhPejp2dojXTNbpotZtg_qcz9Paw3leP2Xa3earKbWYpVTHTktPVSivdMi6blmnTMFKIQhZMFLxecaaL3FDNFJOC1yRPoWqFaYEYIRrOZ-jml2sB4PAZ7KDD6fD_DP8B-bVedQ
ContentType Conference Proceeding
DBID 6IE
6IL
CBEJK
RIE
RIL
DOI 10.1109/CEC53210.2023.10253992
DatabaseName IEEE Electronic Library (IEL) Conference Proceedings
IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume
IEEE Xplore All Conference Proceedings
IEEE Xplore
IEEE Proceedings Order Plans (POP All) 1998-Present
DatabaseTitleList
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Xplore
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
EISBN 9798350314588
EndPage 8
ExternalDocumentID 10253992
Genre orig-research
GroupedDBID 6IE
6IL
CBEJK
RIE
RIL
ID FETCH-LOGICAL-i119t-a83166a9af238df2acd20747872473b632a75c1a292843b0573b9f4cfe0c44d33
IEDL.DBID RIE
IngestDate Wed Oct 04 09:12:47 EDT 2023
IsPeerReviewed false
IsScholarly false
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-i119t-a83166a9af238df2acd20747872473b632a75c1a292843b0573b9f4cfe0c44d33
PageCount 8
ParticipantIDs ieee_primary_10253992
PublicationCentury 2000
PublicationDate 2023-July-1
PublicationDateYYYYMMDD 2023-07-01
PublicationDate_xml – month: 07
  year: 2023
  text: 2023-July-1
  day: 01
PublicationDecade 2020
PublicationTitle 2023 IEEE Congress on Evolutionary Computation (CEC)
PublicationTitleAbbrev CEC
PublicationYear 2023
Publisher IEEE
Publisher_xml – name: IEEE
Score 1.8367364
Snippet This paper introduces an archive-based multi- objective algorithm based on simulated annealing to deal with the time/weight-balanced cluster problem. In the...
SourceID ieee
SourceType Publisher
StartPage 1
SubjectTerms Clustering algorithms
clustering problem
Computational efficiency
Evolutionary computation
Linear programming
Logistics
multi-objective optimization
Simulated annealing
Sorting
Title An Archive-Based Multi-Objective Simulated Annealing Algorithm for the Time/Weight-Balanced Cluster Problem in Delivery Logistics
URI https://ieeexplore.ieee.org/document/10253992
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV07T8MwELZoxcAEiCLe8sCaNn7k4bGEVgyoVAJEt8qvQFCaoj6QGPnnnJ0UxMDAFiVWLN3pfGf7vu9D6JLklOtYEYhvEwXcchKoHBxioHZ29FiCSePFJpLRKJ1MxLgBq3ssjLXWN5_Zrnv0d_lmrtfuqAwinHoi1RZqJUlcg7Ua1C8JRS8bZJGDpHSdJHh3M_iXbIrPGsPdf863hzo_-Ds8_s4s-2jLVgfos1_hhic2uILcY7AHzwZ36rVetPB9MXNiXPClD6undEBz3C-f57D_f5lhqE4xVHvYgT56T_5EFP5T-g4AnJVrx5jgZnX6Mrio8LUtXc_GB771IKFCLzvocTh4yG6CRkAhKAgRq0CmjMSxFDKHxGxyKrWhnjA_oTxhKmZUJpEmkgpIUkw5bkQlcq5zG2rODWOHqF3NK3uEsJLc0bRASCnGTSpUaNMwBTOoiMB4eow6zn7Tt5ojY7ox3ckf70_RjvNS3fh6htqrxdqeo239viqWiwvv2S8W3abF
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LSwMxEA5aBT2pWPFtDl633Tz2kWNdWyrWWrBibyWv1ZXtVtqt4NF_bpJtFQ8evC3ZkMAMkxmS-b4PgEuUYipDgUx8q8CjmiJPpMYhytTOlh6LEa6c2ETU78ejERssweoOC6O1ds1numE_3Vu-msqFvSozEY4dkeo62AgoxX4F11rifpHPmkk7CSwopWFFwRur6b-EU1ze6Oz8c8ddUP9B4MHBd27ZA2u62AefrQIumWK9K5N9FHTwWe9evFbHFnzIJlaOy_xpmfOTW6g5bOXP01lWvkygqU-hqfeghX00n9ydqFkndz0AMMkXljPB7moVZmBWwGud266ND9hzMKFMzuvgsdMeJl1vKaHgZQix0uMxQWHIGU9NalYp5lJhR5kfYRoRERLMo0AijplJU0RYdkTBUipT7UtKFSEHoFZMC30IoODUErWYoBKEqpgJX8d-bMwgAmTm4yNQt_Ybv1UsGeOV6Y7_GL8AW93hXW_cu-nfnoBt67GqDfYU1MrZQp-BTfleZvPZufPyF-6bqgw
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=2023+IEEE+Congress+on+Evolutionary+Computation+%28CEC%29&rft.atitle=An+Archive-Based+Multi-Objective+Simulated+Annealing+Algorithm+for+the+Time%2FWeight-Balanced+Cluster+Problem+in+Delivery+Logistics&rft.au=Ceja-Cruz%2C+Eduardo+Manuel&rft.au=Menchaca-Mendez%2C+Adriana&rft.au=Montero%2C+Elizabeth&rft.au=Zapotecas-Martinez%2C+Saul&rft.date=2023-07-01&rft.pub=IEEE&rft.spage=1&rft.epage=8&rft_id=info:doi/10.1109%2FCEC53210.2023.10253992&rft.externalDocID=10253992