Bacterial Memetic Algorithms for Order Picking Routing Problem with Loading Constraints

作者：

Highlights：

• Bacterial Memetic Algorithm (BMA) is proposed for Order Picking Routing Problem.

• The Order Picking Routing Problem is investigated based on Pallet Loading Feature.

• Confirmed operability of applying Simulated Annealing methodology in BMA operators.

• Allowing unit load reconstruction during order picking can decrease the lead time.

摘要

•Bacterial Memetic Algorithm (BMA) is proposed for Order Picking Routing Problem.•The Order Picking Routing Problem is investigated based on Pallet Loading Feature.•Confirmed operability of applying Simulated Annealing methodology in BMA operators.•Allowing unit load reconstruction during order picking can decrease the lead time.

论文关键词：Order picking,Routing,Pallet Loading,Bacterial Memetic Algorithm,Simulated Annealing

论文评审过程：Received 27 June 2017, Revised 5 January 2018, Accepted 22 March 2018, Available online 29 March 2018, Version of Record 24 April 2018.

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