A Heuristic Algorithm for the Inner-City Multi-Drop: Container Loading Problem
文献类型:期刊论文
作者 | Li Pan; Sydney C. K. Chu; Guangyue Han; Joshua Zhexue Huang |
刊名 | International Journal of Operations Research and Information Systems
![]() |
出版日期 | 2011 |
卷号 | 2期号:3页码:1-19 |
英文摘要 | Economic globalization, increasing fuel cost, and environmental problems provide a strong stimulation for inner-city container carriers to utilize container space more efficiently in transporting goods for multiple clients during a single round trip. A wall-building heuristic algorithm based on the binary tree data structure is proposed to solve the container loading problem with multi-drop constraints. A dynamic space decomposition approach, together with a repacking and space amalgamation strategy, permits an efficient and effective loading plan to pack containers, illustrated by numerical experiments. |
收录类别 | EI |
原文出处 | http://www.igi-global.com/article/heuristic-algorithm-inner-city-multi/55858 |
语种 | 英语 |
源URL | [http://ir.siat.ac.cn:8080/handle/172644/3549] ![]() |
专题 | 深圳先进技术研究院_数字所 |
作者单位 | International Journal of Operations Research and Information Systems |
推荐引用方式 GB/T 7714 | Li Pan;Sydney C. K. Chu;Guangyue Han;Joshua Zhexue Huang. A Heuristic Algorithm for the Inner-City Multi-Drop: Container Loading Problem[J]. International Journal of Operations Research and Information Systems,2011,2(3):1-19. |
APA | Li Pan;Sydney C. K. Chu;Guangyue Han;Joshua Zhexue Huang.(2011).A Heuristic Algorithm for the Inner-City Multi-Drop: Container Loading Problem.International Journal of Operations Research and Information Systems,2(3),1-19. |
MLA | Li Pan;Sydney C. K. Chu;Guangyue Han;Joshua Zhexue Huang."A Heuristic Algorithm for the Inner-City Multi-Drop: Container Loading Problem".International Journal of Operations Research and Information Systems 2.3(2011):1-19. |
入库方式: OAI收割
来源:深圳先进技术研究院
浏览0
下载0
收藏0
其他版本
除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。