Extreme Learning Machine-based Genetic Algorithm for the facility location problem with distributed demands on network edges

This study scrutinizes a facility location problem with uniformly distributed demands along the network edges. The objective is to determine the best locations for establishing facilities such that the aggregate traveling time is minimized. Each network edge is divided into two segments, each assign...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:2023 IEEE Congress on Evolutionary Computation (CEC) s. 1 - 8
Hlavní autoři: Golabi, Mahmoud, Essaid, Mokhtar, Sulaman, Muhammad, Idoumghar, Lhassane
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 01.07.2023
Témata:
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Abstract This study scrutinizes a facility location problem with uniformly distributed demands along the network edges. The objective is to determine the best locations for establishing facilities such that the aggregate traveling time is minimized. Each network edge is divided into two segments, each assigned to its closest open facility. Finding the best combination for establishing facilities and using them as a basis for decomposing network edges form the main decision variables. Due to the NP-hardness of this problem, a Genetic Algorithm is used as the optimization method. This algorithm is known as one of the best metaheuristics for solving this problem. To accelerate the optimization process considering the computationally expensive fitness evaluation of the edge-based location problems, an extreme learning machine is hybridized with the implemented genetic algorithm to serve as a surrogate model for approximating the fitness of the majority of individuals. The results obtained from solving generated instances indicate that while keeping the same quality of solutions, the developed surrogate model-based genetic algorithm significantly reduces the required computational time.
AbstractList This study scrutinizes a facility location problem with uniformly distributed demands along the network edges. The objective is to determine the best locations for establishing facilities such that the aggregate traveling time is minimized. Each network edge is divided into two segments, each assigned to its closest open facility. Finding the best combination for establishing facilities and using them as a basis for decomposing network edges form the main decision variables. Due to the NP-hardness of this problem, a Genetic Algorithm is used as the optimization method. This algorithm is known as one of the best metaheuristics for solving this problem. To accelerate the optimization process considering the computationally expensive fitness evaluation of the edge-based location problems, an extreme learning machine is hybridized with the implemented genetic algorithm to serve as a surrogate model for approximating the fitness of the majority of individuals. The results obtained from solving generated instances indicate that while keeping the same quality of solutions, the developed surrogate model-based genetic algorithm significantly reduces the required computational time.
Author Idoumghar, Lhassane
Sulaman, Muhammad
Essaid, Mokhtar
Golabi, Mahmoud
Author_xml – sequence: 1
  givenname: Mahmoud
  surname: Golabi
  fullname: Golabi, Mahmoud
  email: mahmoud.golabi@uha.fr
  organization: University of Haute-Alsace,Mulhouse,France,F-68100
– sequence: 2
  givenname: Mokhtar
  surname: Essaid
  fullname: Essaid, Mokhtar
  email: mokhtar.essaid@uha.fr
  organization: University of Haute-Alsace,Mulhouse,France,F-68100
– sequence: 3
  givenname: Muhammad
  surname: Sulaman
  fullname: Sulaman, Muhammad
  email: muhammad.sulaman@uha.fr
  organization: University of Haute-Alsace,Mulhouse,France,F-68100
– sequence: 4
  givenname: Lhassane
  surname: Idoumghar
  fullname: Idoumghar, Lhassane
  email: lhassane.idoumghar@uha.fr
  organization: University of Haute-Alsace,Mulhouse,France,F-68100
BookMark eNo1kMtKAzEYhSPoQmvfQCQvMDWXycxkWYaxChU3ui65_GmDM0nJRGrBhzegwoHDgY9vcW7QZYgBELqnZEUpkQ_90AvOymKE8RUlTNRUNhdoKVvZcUE4rUXXXaPv4SsnmABvQaXgwx6_KHPwASqtZrB4AwGyN3g97mPy-TBhFxPOB8BOGT_6fMZjNCr7GPAxRT3ChE-Fw9bPOXn9mYvEwqSCnXFhiu0U0wcGu4f5Fl05Nc6w_OsFen8c3vqnavu6ee7X28pTKnNlWNMZ4zSlvAYtHHO25US3QpnairJAKkIFsa6RisqaddpRaMC1JZ1q-QLd_Xo9AOyOyU8qnXf_p_AfK5BfSQ
ContentType Conference Proceeding
DBID 6IE
6IL
CBEJK
RIE
RIL
DOI 10.1109/CEC53210.2023.10254196
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 Electronic Library (IEL)
IEEE Proceedings Order Plans (POP All) 1998-Present
DatabaseTitleList
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Electronic Library (IEL)
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
EISBN 9798350314588
EndPage 8
ExternalDocumentID 10254196
Genre orig-research
GroupedDBID 6IE
6IL
CBEJK
RIE
RIL
ID FETCH-LOGICAL-i119t-c268ccfb1134eb5f2fd730b75ac4d52fde9a0150df69a19428bf1e6ef7ef78a73
IEDL.DBID RIE
IngestDate Wed Oct 04 09:12:47 EDT 2023
IsPeerReviewed false
IsScholarly false
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-i119t-c268ccfb1134eb5f2fd730b75ac4d52fde9a0150df69a19428bf1e6ef7ef78a73
PageCount 8
ParticipantIDs ieee_primary_10254196
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.8366121
Snippet This study scrutinizes a facility location problem with uniformly distributed demands along the network edges. The objective is to determine the best locations...
SourceID ieee
SourceType Publisher
StartPage 1
SubjectTerms Aggregates
Approximation algorithms
Computational modeling
continuous demands
Evolutionary computation
extreme learning machine
Extreme learning machines
Facility location problem
genetic algorithm
Metaheuristics
Optimization methods
surrogate model
Title Extreme Learning Machine-based Genetic Algorithm for the facility location problem with distributed demands on network edges
URI https://ieeexplore.ieee.org/document/10254196
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LS8NAEF6sePCkYsU3c_Ca2jSb3exRSosXSw8KvZXs7mwt2FTaVBT88c4kqeLBg5BDEpYE5pHZmcw3nxA3OpVee6ci9BlGFG9llCdK0sfQOJknnkxAVmQTejTKJhMzbsDqFRYGEavmM-zwafUv3y_dhktl5OGUzpDJtERLa1WDtRrUb9w1t_1BP2VISocpwTvbxb9oU6qoMTz45_sORfsHfwfj78hyJHawOBafg_eSi3nQjESdwUPVCIkRRyIPPECarADuXmZLyvifF0D7UaD9HYTccQfsB3DgYkVAQyMDXIUFz7NzmfaKHuJxwdhfoDVF3SAOXHBbt8XTcPDYv48a7oRoHsemjFxPZc4FG8eJRJuGXvDky1anuZM-pSs0ORc7fFAmjw0lITbEqDBoOrJcJydit1gWeCqAJCqdJ8-XNpWovE2dcd1Ea8uTcVR2JtosuulrPR5jupXa-R_3L8Q-K6jueb0Uu-Vqg1diz72V8_XqulLqF2yZpuw
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LS8NAEF60CnpSseLbOXhNbZrdbPYopaViW3qo0FtJdie1YFtpU1HwxzuTpIoHD0IOSVgSmEdmZzLffELcaiWddjb00EXoUbyVXhyEkj6Gxso4cGQCMieb0P1-NBqZQQlWz7EwiJg3n2GNT_N_-W5h11wqIw-ndIZMZlvsKCkb9QKuVeJ-_bq5a7aaikEpNSYFr22W_yJOyeNG--CfbzwU1R8EHgy-Y8uR2ML5sfhsvWdczoNyKOoEenkrJHocixzwCGmyA7h_mSwo53-eAe1IgXZ4kMaWe2A_gEMXqwJKIhngOiw4np7LxFf0EIczRv8CrZkXLeLAJbdVVTy1W8NmxyvZE7yp75vMs40wsjZNfD-QmKi0kTry5kSr2Eqn6ApNzOUOl4Ym9g2lIUnqY4ippiOKdXAiKvPFHE8FkESldeT7MlESQ5coa2w90Drh2ThhdCaqLLrxazEgY7yR2vkf92_EXmfY6467D_3HC7HPyio6YC9FJVuu8Urs2rdsulpe5wr-AkRzqjM
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=Extreme+Learning+Machine-based+Genetic+Algorithm+for+the+facility+location+problem+with+distributed+demands+on+network+edges&rft.au=Golabi%2C+Mahmoud&rft.au=Essaid%2C+Mokhtar&rft.au=Sulaman%2C+Muhammad&rft.au=Idoumghar%2C+Lhassane&rft.date=2023-07-01&rft.pub=IEEE&rft.spage=1&rft.epage=8&rft_id=info:doi/10.1109%2FCEC53210.2023.10254196&rft.externalDocID=10254196