Diversity-adaptive parallel memetic algorithm for solving large scale combinatorial optimization problems

ISSN： 1432-7643

Source： Soft Computing, Vol.11, Iss.9, 2007-07, pp. : 873-888

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Related content

Searching for Backbones-a high-performance parallel algorithm for solving combinatorial optimization problems

By Schneider J.

Future Generation Computer Systems, Vol. 19, Iss. 1, 2003-01 ,pp. : 121-131

Elsevier

Access to resources Recommend Favorite

A memetic algorithm with adaptive hill climbing strategy for dynamic optimization problems

By Wang Hongfeng

Soft Computing, Vol. 13, Iss. 8-9, 2009-07 ,pp. : 763-780

Springer Publishing Company

Access to resources Recommend Favorite

Solving Large-Scale Fuzzy and Possibilistic Optimization Problems

By Lodwick Weldon Bachman Katherine

Fuzzy Optimization and Decision Making, Vol. 4, Iss. 4, 2005-10 ,pp. : 257-278

Springer Publishing Company

Access to resources Recommend Favorite

A Dual-based Combinatorial Algorithm for Solving Cyclic Optimization Problems

Recent Patents on Computer Science, Vol. 5, Iss. 3, 2012-12 ,pp. : 188-196

Bentham Science Publishers

Access to resources Recommend Favorite

Solving Large-Scale QAP Problems in Parallel with the Search Library ZRAM

By Brungger A. Marzetta A. Clausen J. Perregaard M.

Journal of Parallel and Distributed Computing, Vol. 50, Iss. 1, 1998-01 ,pp. : 157-169

Academic Press

Access to resources Recommend Favorite