An iterated local search heuristic for multi-capacity bin packing and machine reassignment problems

作者：

Highlights：

• We propose a simple metaheuristic algorithm for solving both the MRP and the MCBPP.

• A mathematical formulation for the MRP is presented.

• We introduce a simple approach that computes efficient lower bounds for the MRP.

• The method is tested on MRP instances from the ROADEF Challenge and MCBPP instances.

摘要

•We propose a simple metaheuristic algorithm for solving both the MRP and the MCBPP.•A mathematical formulation for the MRP is presented.•We introduce a simple approach that computes efficient lower bounds for the MRP.•The method is tested on MRP instances from the ROADEF Challenge and MCBPP instances.

论文关键词：Metaheuristics,Iterated local search,Multi-capacity bin packing,Machine reassignment

论文评审过程：Available online 27 March 2013.

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