Scheduling programs with repetitive projects: A comparison of a simulated annealing, a genetic and a pair-wise swap algorithm

Author： Shtub A.   LeBlanc L.J.   Cai Z.  

Publisher： Elsevier

ISSN： 0377-2217

Source： European Journal of Operational Research, Vol.88, Iss.1, 1996-01, pp. : 124-138

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

Optimization of neural networks: A comparative analysis of the genetic algorithm and simulated annealing

By Sexton R.S.   Dorsey R.E.   Johnson J.D.  

European Journal of Operational Research, Vol. 114, Iss. 3, 1999-05 ,pp. : 589-601

Elsevier

Access to resources Recommend Favorite

A new efficient simulated annealing algorithm for the resource-constrained project scheduling problem and its multiple mode version

By Bouleimen K.   Lecocq H.  

European Journal of Operational Research, Vol. 149, Iss. 2, 2003-09 ,pp. : 268-281

Elsevier

Access to resources Recommend Favorite

Application of a mixed simulated annealing-genetic algorithm heuristic for the two-dimensional orthogonal packing problem

By Leung T.W.   Chan C.K.   Troutt M.D.  

European Journal of Operational Research, Vol. 145, Iss. 3, 2003-03 ,pp. : 530-542

Elsevier

Access to resources Recommend Favorite

Optimization of transit network layout and headway with a combined genetic algorithm and simulated annealing method

By Zhao F.  

Engineering Optimization, Vol. 38, Iss. 6, 2006-09 ,pp. : 701-722

Taylor & Francis Ltd

Access to resources Recommend Favorite

A modification of the simulated annealing algorithm for discrete stochastic optimization

By Ahmed Mohamed A.  

Engineering Optimization, Vol. 39, Iss. 6, 2007-09 ,pp. : 701-714

Taylor & Francis Ltd

Access to resources Recommend Favorite