Abstract
This paper investigates a distributed assembly permutation flow-shop scheduling problem with transportation and sequence-dependent set-up times (DAPFSP-TSDST). A hybrid genetic programming (HGP) algorithm is proposed to optimize the makespan of the assembly stage, which inherits the merits of genetic programming (GP) and neighbourhood search operators. In HGP, a hybrid problem-specific initialization heuristic is developed to make populations more diverse. Multiple neighbourhood search operators are employed as the leaf nodes, which are vital for the success of GP. A product shift strategy is proposed to strengthen its exploitability. In addition, a simulated annealing criterion is adopted to make the HGP explore more thoroughly. Finally, statistical and computational experiments are carried out on the benchmark instances. The results exhaustively identify the notable competitiveness of the HGP algorithm in coping with the DAPFSP-TSDST.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
