| Abstract: | This paper addresses a classic problem in the container storage and transportation, the container relocation problem. For a given layout of a container bay, the containers should be retrieved in a predefined order, the best operation plan with fewest crane operations is going to be determined. We develop a greedy look-ahead heuristic for this particular purpose. Comparing with existing approaches presented from literature, our heuristic provides better solutions than best known solutions in shorter computational time. |
| Date: | 14 June 2013 |
| Time: | 11:30am - 12:00noon |
| Speaker: |
Mr Jin Bo PhD Student Department of Management Sciences City University of Hong Kong |
| Venue: | Room P7537, e-Logistics Laboratory, Department of Management Sciences, 7/F, Academic 1 Purple Zone, City University of Hong Kong |
[ Back ]
