Efficient solutions to the cell-formation problem with multiple routings via a double-loop genetic algorithm

Author： Gravel M.   Luntala Nsakanda A.   Price W.  

Publisher： Elsevier

ISSN： 0377-2217

Source： European Journal of Operational Research, Vol.109, Iss.2, 1998-09, pp. : 286-298

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

An efficient genetic algorithm for the traveling salesman problem with precedence constraints

By Moon C.   Kim J.   Choi G.   Seo Y.  

European Journal of Operational Research, Vol. 140, Iss. 3, 2002-08 ,pp. : 606-617

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 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

An efficient algorithm for a generalized joint replenishment problem

By Frenk J.B.G.   Kleijn M.J.   Dekker R.  

European Journal of Operational Research, Vol. 118, Iss. 2, 1999-10 ,pp. : 413-428

Elsevier

Access to resources Recommend Favorite

A note on efficient solutions for the linear bilevel programming problem

By Soismaa M.  

European Journal of Operational Research, Vol. 112, Iss. 2, 1999-01 ,pp. : 427-431

Elsevier

Access to resources Recommend Favorite