By Topic

Multiple trajectory search for multiobjective optimization

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)
Lin-Yu Tseng ; Nat. Chung Hsing Univ., Taichung ; Chun Chen

In recent years, many algorithms for solving multiobjective (MO) optimization problems were proposed. Some studies on the design of multiobjective test problems and the performance evaluation of algorithms were also suggested. In this paper, we proposed a novel searching algorithm called the multiple trajectory search (MTS). The MTS uses multiple agents to search the solution space concurrently. Each agent does an iterated local search using one of four candidate local search methods. By choosing a local search method that best fits the landscape of a solution's neighborhood, an agent may find its way to a local optimum or the global optimum. We applied the MTS to the multiobjective optimization and tested it on the 13 benchmark problems provided for competition in the Special Session & Competition on Performance Assessment of Multi-Objective Optimization Algorithms in CEC2007.

Published in:

Evolutionary Computation, 2007. CEC 2007. IEEE Congress on

Date of Conference:

25-28 Sept. 2007