摘要
The artificial bee colony algorithm (ABC) hybrid two loading heuristics for the three-dimensional loading capacitated vehicle routing problem (3L-CVRP) is presented in the paper. The 3L-CVRP is a combination of two well-known NPhard problems, the capacitated vehicle routing problem, and the three-dimensional bin packing problem. It is very difficult to get a good performance solution in practice for these problems. The problem is solved by different heuristics for the loading part, and by artificial bee colony algorithm for the overall optimization. To solve the representation problem of the solution, a novel real encoding method is presented to represent the solution for ABC. The effectiveness of the proposed algorithm is tested, and proven by extensive computational experiments on benchmark instances.
| 源语言 | 英语 |
|---|---|
| 页 | 815-825 |
| 页数 | 11 |
| DOI | |
| 出版状态 | 已出版 - 2013 |
| 活动 | 20th International Conference on Industrial Engineering and Engineering Management, IEEM 2013 - Baotou, 中国 期限: 10 12月 2013 → 13 12月 2013 |
会议
| 会议 | 20th International Conference on Industrial Engineering and Engineering Management, IEEM 2013 |
|---|---|
| 国家/地区 | 中国 |
| 市 | Baotou |
| 时期 | 10/12/13 → 13/12/13 |
