Cart (Loading....) | Create Account
Close category search window
 

A memetic algorithm for the probabilistic traveling salesman problem

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Yu-Hsin Liu ; Dept. of Civil Eng., Nat. Chi Nan Univ., Puli

The probabilistic traveling salesman problem (PTSP) is an important theoretica and practical topic in the study of stochastic network problems. It provides researchers with a modeling framework for exploring the stochastic effects in routing problems. This paper focuses on developing a memetic algorithm (MA) by incorporating the nearest neighbor algorithm to generate initial solutions, 1-shift and/or 2-opt exchanges for local search and edge recombination (ER) crossover to efficiently and effectively solve the PTSP. In addition, a mixed local search strategy by randomly selecting two different local search methods (i.e., 1-shift and 2-opt exchanges) is introduced to further enhance the effectiveness of the proposed MA for solving the PTSP. A set of numerical experiments based on both heterogeneous and homogeneous PTSP instances were conducted to test the validity of the proposed MA. The numerical results showed that the newly proposed MA enhanced the performance in terms of objective function value and/or computation time in most of the tested cases as compared to existing methods tested in previous studies. Moreover, the results indicated that incorporating mixed local search strategy into the MA can significantly increase the solution quality. These findings show the potential of the proposed MA in effectively and efficiently solving the large-scale PTSP.

Published in:

Evolutionary Computation, 2008. CEC 2008. (IEEE World Congress on Computational Intelligence). IEEE Congress on

Date of Conference:

1-6 June 2008

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.