A variable neighborhood search algorithm for the bin packing problem with compatible categories
作者：
Highlights：
• A new variant of the Bin Packing Problem is introduced.
• It is motivated by last mile delivery to tiny stores.
• Items to be delivered belong to categories that may not be transported together in the same vehicle.
• Extensive computational tests are performed on instances derived from the literature.
• Results show that our VNS algorithm can effectively solve the BPCC in very short CPU times.
摘要
•A new variant of the Bin Packing Problem is introduced.•It is motivated by last mile delivery to tiny stores.•Items to be delivered belong to categories that may not be transported together in the same vehicle.•Extensive computational tests are performed on instances derived from the literature.•Results show that our VNS algorithm can effectively solve the BPCC in very short CPU times.
论文关键词：Bin packing problem with compatible categories,Last mile distribution,Nanostores,Variable neighborhood search
论文评审过程：Received 8 November 2018, Revised 16 January 2019, Accepted 23 January 2019, Available online 24 January 2019, Version of Record 31 January 2019.
论文官网地址：https://doi.org/10.1016/j.eswa.2019.01.052
