شماره ركورد كنفرانس :
4325
عنوان مقاله :
Solving sequencing problem using a cuckoo based algorithm and levy flight
پديدآورندگان :
Maadi Mansoureh M_moadi@du.ac.ir School of EngineerigDamghan University,Damghan, Iran؛ , Ramezani Rohollah r_ramezani@du.ac.ir Department Of Statistics, School of Mathematics and ComputerDamghan University,Damghan, Iran
كليدواژه :
Precedence constrained sequencing problem , Mixed integer programming , Cuckoo search algorithm.
عنوان كنفرانس :
اولين كنفرانس بين المللي بهينه سازي سيستم ها و مديريت كسب و كار
چكيده فارسي :
Precedence constrained sequencing problem (PCSP) is related to locate the optimal sequence with the shortest traveling time
among all feasible sequences. In this paper we propose a cuckoo search algorithm (CSA) for effectively solving PCSP. CSA is inspired
by the life of a bird named cuckoo. To evaluate the performance of proposed algorithm, several instances from the literature are tested
in this paper. Computational results show the good performance of the proposed algorithm in comparison with other algorithms of the
literature.