By Topic

Colony Location Algorithm for multiobjective assignment problem with application to e-Brokerage

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)
Dingwei Wang ; Inst. of Syst. Eng., Northeastern Univ., Shenyang

Trade matching problem of e-brokerage can be described by a multiobjective assignment model. To solve the problem, we propose a novel artificial-life based algorithm, colony location algorithm (CLA). It mimics the growth process with resource competition. By using fertilization operation, the growth of the colonies located at right fields can be encouraged. Thus, the optimal solution can be found when the colonies all locate on the right fields. The computational example from an experimental website of e-brokerage has proven that CLS can achieve a Pareto optimal solution without the information of the preference structure of decision makers. It provides an alternative method for multiobjective optimization problems.

Published in:

Control and Decision Conference, 2008. CCDC 2008. Chinese

Date of Conference:

2-4 July 2008