A Block-based genetic algorithm for disassembly sequence planning

作者：

Highlights：

• A block-based genetic algorithm for disassembly sequence planning is proposed.

• Novel crossover and mutation mechanism are explored.

• Solution quality is efficient in improving as complexity of problems increase.

摘要

•A block-based genetic algorithm for disassembly sequence planning is proposed.•Novel crossover and mutation mechanism are explored.•Solution quality is efficient in improving as complexity of problems increase.

论文关键词：Disassembly sequence planning,Block-based genetic algorithms,Kongar and Gupta's genetic algorithms,Dijkstra's algorithms

论文评审过程：Received 12 July 2017, Revised 31 October 2017, Accepted 1 November 2017, Available online 2 November 2017, Version of Record 5 January 2018.

论文官网地址：https://doi.org/10.1016/j.eswa.2017.11.004