A Memetic Random-Key Genetic Algorithm for a Symmetric Multi-Objective Traveling Salesman Problem

dc.authorscopusid 23012602800
dc.authorscopusid 7006910592
dc.authorscopusid 7102592312
dc.contributor.author Samanlioglu,F.
dc.contributor.author Samanlıoğlu, Funda
dc.contributor.author Ferrell,Jr. W.G.
dc.contributor.author Kurz,M.E.
dc.contributor.other Industrial Engineering
dc.date.accessioned 2024-10-15T19:41:19Z
dc.date.available 2024-10-15T19:41:19Z
dc.date.issued 2008
dc.department Kadir Has University en_US
dc.department-temp Samanlioglu F., Kadir Has University, Department of Industrial Engineering, Istanbul, Kadir Has Campus, 34083 Cibali, Turkey; Ferrell Jr. W.G., Clemson University, Department of Industrial Engineering, Clemson, SC 29634-0920, 110 Freeman Hall, United States; Kurz M.E., Clemson University, Department of Industrial Engineering, Clemson, SC 29634-0920, 110 Freeman Hall, United States en_US
dc.description.abstract This paper proposes a methodology to find weakly Pareto optimal solutions to a symmetric multi-objective traveling salesman problem using a memetic random-key genetic algorithm that has been augmented by a 2-opt local search. The methodology uses a "target-vector approach" in which the evaluation function is a weighted Tchebycheff metric with an ideal point and the local search is randomly guided by either a weighted sum of the objectives or a weighted Tchebycheff metric. The memetic algorithm has several advantages including the fact that the random keys representation ensures that feasible tours are maintained during the application of genetic operators. To illustrate the quality of the methodology, experiments are conducted using Euclidean TSP examples and a comparison is made to one example found in the literature. © 2008 Elsevier Ltd. All rights reserved. en_US
dc.identifier.citationcount 66
dc.identifier.doi 10.1016/j.cie.2008.01.005
dc.identifier.endpage 449 en_US
dc.identifier.issn 0360-8352
dc.identifier.issue 2 en_US
dc.identifier.scopus 2-s2.0-50349096056
dc.identifier.scopusquality Q1
dc.identifier.startpage 439 en_US
dc.identifier.uri https://doi.org/10.1016/j.cie.2008.01.005
dc.identifier.uri https://hdl.handle.net/20.500.12469/6428
dc.identifier.volume 55 en_US
dc.identifier.wosquality Q1
dc.language.iso en en_US
dc.relation.ispartof Computers and Industrial Engineering en_US
dc.relation.publicationcategory Makale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanı en_US
dc.rights info:eu-repo/semantics/closedAccess en_US
dc.scopus.citedbyCount 71
dc.subject Genetic algorithms en_US
dc.subject Hybrid algorithms en_US
dc.subject Memetic algorithms en_US
dc.subject Multi-objective traveling salesman problem en_US
dc.subject Random-key en_US
dc.title A Memetic Random-Key Genetic Algorithm for a Symmetric Multi-Objective Traveling Salesman Problem en_US
dc.type Article en_US
dspace.entity.type Publication
relation.isAuthorOfPublication 4e74c274-0592-4792-ac57-00061bd273aa
relation.isAuthorOfPublication.latestForDiscovery 4e74c274-0592-4792-ac57-00061bd273aa
relation.isOrgUnitOfPublication 28868d0c-e9a4-4de1-822f-c8df06d2086a
relation.isOrgUnitOfPublication.latestForDiscovery 28868d0c-e9a4-4de1-822f-c8df06d2086a

Files