A study of drift analysis for estimating computation time of evolutionary algorithms

ISSN： 1567-7818

Source： Natural Computing, Vol.3, Iss.1, 2004-01, pp. : 21-35

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

Abstract

Related content

A Case Study in Real-Time Parallel Computation: Correcting Algorithms

By Bruda S.D. Akl S.G.

Journal of Parallel and Distributed Computing, Vol. 61, Iss. 5, 2001-05 ,pp. : 688-708

Academic Press

Access to resources Recommend Favorite

AN ANALYSIS OF MULTIOBJECTIVE EVOLUTIONARY ALGORITHMS FOR OPTIMIZATION PROBLEMS WITH TIME CONSTRAINTS

By Cámara M. de Toro F. Ortega J.

Applied Artificial Intelligence, Vol. 27, Iss. 9, 2013-10 ,pp. : 851-879

Taylor & Francis Ltd

Access to resources Recommend Favorite

Running time analysis of evolutionary algorithms on a simplified multiobjective knapsack problem

By Laumanns Marco Thiele Lothar Zitzler Eckart

Natural Computing, Vol. 3, Iss. 1, 2004-01 ,pp. : 37-51

Springer Publishing Company

Access to resources Recommend Favorite

Evolutionary Algorithms for the Vehicle Routing Problem with Time Windows

By Bräysy Olli Dullaert Wout Gendreau Michel

Journal of Heuristics, Vol. 10, Iss. 6, 2004-12 ,pp. : 587-611

Springer Publishing Company

Access to resources Recommend Favorite

Quantum-inspired evolutionary algorithms: a survey and empirical study

By Zhang Gexiang

Journal of Heuristics, Vol. 17, Iss. 3, 2011-06 ,pp. : 303-351

Springer Publishing Company

Access to resources Recommend Favorite