A simulated annealing algorithm with the random compound move for the sequential partitioning problem of directed acyclic graphs

Author： Kaji T. Ohuchi A.

Publisher： Elsevier

ISSN： 0377-2217

Source： European Journal of Operational Research, Vol.112, Iss.1, 1999-01, pp. : 147-157

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

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

Application of the simulated annealing algorithm to the combinatorial optimisation problem with permutation property: An investigation of generation mechanism

By Tian P. Ma J. Zhang D.-M.

European Journal of Operational Research, Vol. 118, Iss. 1, 1999-10 ,pp. : 81-94

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

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

An application of simulated annealing to the cutting stock problem

By Faina L.

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

Elsevier

Access to resources Recommend Favorite