By Topic

A Parallel Procedure for Dynamic Multi-objective TSP

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

2 Author(s)
Weiqi Li ; Univ. of Michigan-Flint, Flint, MI, USA ; Mingyuan Feng

This paper proposes a new parallel search procedure for dynamic multi-objective traveling salesman problem. We design a multi-objective TSP in a stochastic dynamic environment. The proposed procedure first uses parallel processors to identify the extreme solutions of the search space for each of k objectives individually at the same time. These solutions are merged into a matrix E. The solutions in E are then searched by parallel processors and evaluated for dominance relationship. The proposed procedure was implemented in two different ways: a master-worker architecture and a pipeline architecture.

Published in:

Parallel and Distributed Processing with Applications (ISPA), 2012 IEEE 10th International Symposium on

Date of Conference:

10-13 July 2012