Relationship between problem characteristics and the optimal number of genetic algorithm generations

Author： Gibbs M. S.   Maier H. R.   Dandy G. C.  

Publisher： Taylor & Francis Ltd

ISSN： 0305-215X

Source： Engineering Optimization, Vol.43, Iss.4, 2011-04, pp. : 349-376

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 genetic algorithm for the set covering problem

By Beasley J.E.   P. C.C.  

European Journal of Operational Research, Vol. 94, Iss. 2, 1996-10 ,pp. : 392-404

Elsevier

Access to resources Recommend Favorite

Optimal new product positioning: A genetic algorithm approach

By Gruca T.S.   Klemz B.R.  

European Journal of Operational Research, Vol. 146, Iss. 3, 2003-05 ,pp. : 621-633

Elsevier

Access to resources Recommend Favorite

Hybrid Approach to Optimal Packing Using Genetic Algorithm and Coulomb Potential Algorithm

By Mahanty Biswajit   Agrawal Rajneesh Kumar   Shrin Shrikrishna   Chakravarty Sourish  

Materials and Manufacturing Processes, Vol. 22, Iss. 5, 2007-06 ,pp. : 668-677

Taylor & Francis Ltd

Access to resources Recommend Favorite

A hybrid genetic algorithm for the open shop scheduling problem

By Liaw C.-F.  

European Journal of Operational Research, Vol. 124, Iss. 1, 2000-07 ,pp. : 28-42

Elsevier

Access to resources Recommend Favorite

An optimal algorithm for solving the 1-median problem on weighted 4-cactus graphs

By Lan Y.-F.   Wang Y.-L.  

European Journal of Operational Research, Vol. 122, Iss. 3, 2000-05 ,pp. : 602-610

Elsevier

Access to resources Recommend Favorite