Repository logoGCRIS
  • English
  • Türkçe
  • Русский
Log In
New user? Click here to register. Have you forgotten your password?
Home
Communities
Browse GCRIS
Entities
Overview
GCRIS Guide
  1. Home
  2. Browse by Author

Browsing by Author "Kurz,M.E."

Filter results by typing the first few letters
Now showing 1 - 1 of 1
  • Results Per Page
  • Sort Options
  • Loading...
    Thumbnail Image
    Article
    Citation - Scopus: 75
    A Memetic Random-Key Genetic Algorithm for a Symmetric Multi-Objective Traveling Salesman Problem
    (2008) Samanlioglu,F.; Ferrell,Jr. W.G.; Kurz,M.E.
    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.
Repository logo
Collections
  • Scopus Collection
  • WoS Collection
  • TrDizin Collection
  • PubMed Collection
Entities
  • Research Outputs
  • Organizations
  • Researchers
  • Projects
  • Awards
  • Equipments
  • Events
About
  • Contact
  • GCRIS
  • Research Ecosystems
  • Feedback
  • OAI-PMH

Log in to GCRIS Dashboard

Powered by Research Ecosystems

  • Privacy policy
  • End User Agreement
  • Feedback