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

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.

[1]  Pierre Hansen,et al.  The Assignment Problem with Seniority and Job Priority Constraints , 1999, Oper. Res..

[2]  Tsuyoshi Okita,et al.  Distributed Optimization by Using Artificial Life , 1996 .

[3]  Dingwei Wang.  Colony location algorithm for combinatorial optimization , 2004, 2004 IEEE International Conference on Systems, Man and Cybernetics (IEEE Cat. No.04CH37583).

[4]  Robert G. Reynolds,et al.  Learning the parameters for a gradient-based approach to image segmentation from the results of a region growing approach using cultural algorithms , 1995, Proceedings of 1995 IEEE International Conference on Evolutionary Computation.

[5]  GeunSik Jo,et al.  Brokerage between buyer and seller agents using Constraint Satisfaction Problem models , 2000, Decis. Support Syst..

[6]  David R. Jefferson,et al.  Artificial Life as a Tool for Biological Inquiry, in Artificial Life: an Overview , 1993 .

[7]  Peter J. Fleming,et al.  Multiobjective optimization and multiple constraint handling with evolutionary algorithms. II. Application example , 1998, IEEE Trans. Syst. Man Cybern. Part A.

[8]  Xavier Gandibleux,et al.  Use of a Genetic Heritage for Solving the Assignment Problem with Two Objectives , 2003, EMO.

[9]  Dingwei Wang,et al.  Colony location algorithm for assignment problems , 2004 .

[10]  Ashish Tiwari,et al.  A greedy genetic algorithm for the quadratic assignment problem , 2000, Comput. Oper. Res..

[11]  Thomas Bäck,et al.  Evolutionary computation: comments on the history and current state , 1997, IEEE Trans. Evol. Comput..

[12]  Éric D. Taillard,et al.  Robust taboo search for the quadratic assignment problem , 1991, Parallel Comput..

[13]  T. L. Ward,et al.  Solving Quadratic Assignment Problems by ‘Simulated Annealing’ , 1987 .

[14]  Michael J. Shaw,et al.  Research opportunities in electronic commerce , 1997, Decis. Support Syst..

[15]  Marco Laumanns,et al.  Performance assessment of multiobjective optimizers: an analysis and review , 2003, IEEE Trans. Evol. Comput..

[16]  J. J. Hopfield,et al.  “Neural” computation of decisions in optimization problems , 1985, Biological Cybernetics.

[17]  James Kennedy,et al.  Particle swarm optimization , 2002, Proceedings of ICNN'95 - International Conference on Neural Networks.

[18]  Alexandre Linhares,et al.  Synthesizing a predatory search strategy for VLSI layouts , 1999, IEEE Trans. Evol. Comput..