Solving sequencing problem using a cuckoo based based algorithm and levy flight

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

کلیدواژه ها:

Precedence constrained sequencing problem ، Mixed integer programming ، Cuckoo search algorithm