A memetic random-key genetic algorithm for a symmetric multi-objective traveling salesman problem

Authors:
Funda Samanlioglu;William G. Ferrell, Jr.;Mary E. Kurz
Affiliations:
Kadir Has University, Department of Industrial Engineering, Kadir Has Campus, 34083 Cibali, Istanbul, Turkey;Clemson University, Department of Industrial Engineering, 110 Freeman Hall, Clemson, SC 29634-0920, USA;Clemson University, Department of Industrial Engineering, 110 Freeman Hall, Clemson, SC 29634-0920, USA
Venue:
Computers and Industrial Engineering
Year:
2008

Citing 8
Cited 6

Crossover on intensive search and traveling salesman problem

ICC&IE-94 Selected papers from the 16th annual conference on Computers and industrial engineering
Film-copy deliverer problem using genetic algorithms

ICC&IE '94 Proceedings of the 17th international conference on Computers and industrial engineering
Virus-evolutionary genetic algorithm for a self-organizing manufacturing system

Computers and Industrial Engineering
Genetic Algorithms in Search, Optimization and Machine Learning

Genetic Algorithms in Search, Optimization and Machine Learning
Use of Substitute Scalarizing Functions to Guide a Local Search Based Heuristic: The Case of moTSP

Journal of Heuristics
Genetic Algorithms for Multiobjective Optimization: FormulationDiscussion and Generalization

Proceedings of the 5th International Conference on Genetic Algorithms
An evolutionary algorithm for manufacturing cell formation

Computers and Industrial Engineering
A fast and elitist multiobjective genetic algorithm: NSGA-II

IEEE Transactions on Evolutionary Computation

The wise experiencing traveling salesman (WETS): introduction to a simple evolutionary solution for the problem

CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
A 2-Opt based differential evolution for global optimization

Applied Soft Computing
Extended tabu search on fuzzy traveling salesman problem in multi-criteria analysis

AAIM'10 Proceedings of the 6th international conference on Algorithmic aspects in information and management
A new geometric shape-based genetic clustering algorithm for the multi-depot vehicle routing problem

Expert Systems with Applications: An International Journal
BRKGA Algorithm for the Capacitated Arc Routing Problem

Electronic Notes in Theoretical Computer Science (ENTCS)
The evolutionary random interval fingerprint for a more secure wireless communication

Mobile Information Systems

Quantified Score

Hi-index	0.00

Visualization

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.