Dergi makalesi Açık Erişim

A genetic algorithm integrated with the initial solution procedure and parameter tuning for capacitated P-median problem

Öksüz, Mehmet Kürşat; Büyüközkan, Kadir; Bal, Alperen; Satoğlu, Şule Itır


Dublin Core

<?xml version='1.0' encoding='utf-8'?>
<oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:creator>Öksüz, Mehmet Kürşat</dc:creator>
  <dc:creator>Büyüközkan, Kadir</dc:creator>
  <dc:creator>Bal, Alperen</dc:creator>
  <dc:creator>Satoğlu, Şule Itır</dc:creator>
  <dc:date>2023-04-12</dc:date>
  <dc:description>The capacitated p-median problem is a well-known location-allocation problem that is NP-hard. We proposed an advanced
Genetic Algorithm (GA) integrated with an Initial Solution Procedure for this problem to solve the medium and large-size
instances. A 33 Full Factorial Design was performed where three levels were selected for the probability of mutation,
population size, and the number of iterations. Parameter tuning was performed to reach better performance at each
instance. MANOVA and Post-Hoc tests were performed to identify significant parameter levels, considering both computational
time and optimality gap percentage. Real data of Lorena and Senne (2003) and the data set presented by
Stefanello et al. (2015) were used to test the proposed algorithm, and the results were compared with those of the other
heuristics existing in the literature. The proposed GA was able to reach the optimal solution for some of the instances in
contrast to other metaheuristics and the Mat-heuristic, and it reached a solution better than the best known for the largest
instance and found near-optimal solutions for the other cases. The results show that the proposed GA has the potential to
enhance the solutions for large-scale instances. Besides, it was also shown that the parameter tuning process might improve
the solution quality in terms of the objective function and the CPU time of the proposed GA, but the magnitude of
improvement may vary among different instances.</dc:description>
  <dc:identifier>https://aperta.ulakbim.gov.trrecord/263031</dc:identifier>
  <dc:identifier>oai:aperta.ulakbim.gov.tr:263031</dc:identifier>
  <dc:rights>info:eu-repo/semantics/openAccess</dc:rights>
  <dc:rights>https://creativecommons.org/licenses/by-nc-nd/4.0/</dc:rights>
  <dc:source>Neural Computing and Applications 35(14467)</dc:source>
  <dc:subject>Location-Allocation</dc:subject>
  <dc:subject>Capacitated p-median problem</dc:subject>
  <dc:subject>Facility location</dc:subject>
  <dc:subject>Genetic algorithm</dc:subject>
  <dc:subject>Initial solution algorithm</dc:subject>
  <dc:subject>Parameter tuning</dc:subject>
  <dc:title>A genetic algorithm integrated with the initial solution procedure and parameter tuning for capacitated P-median problem</dc:title>
  <dc:type>info:eu-repo/semantics/article</dc:type>
  <dc:type>publication-article</dc:type>
</oai_dc:dc>
51
51
görüntülenme
indirilme
Tüm sürümler Bu sürüm
Görüntülenme 5151
İndirme 5151
Veri hacmi 48.3 MB48.3 MB
Tekil görüntülenme 4747
Tekil indirme 5151

Alıntı yap