International Symposium on Information Engineering and Electronic Commerce, 3rd (IEEC 2011)
7 Ship Loading Scheduling Strategy of Container Terminal with Heuristic Greedy Algorithm
Download citation file:
- Ris (Zotero)
- Reference Manager
To reduce the conflict of yard, vehicles and quay crane in the process of loading container, this paper took minimizing reshuffle times in yard and the total moving distance of quay crane as optimization objective, guaranteeing balance of the ship and liquidity of vehicles as basic condition, built a ship loading scheduling model of container terminal. The model propounded a ship loading scheduling strategy with heuristic greedy algorithm. The heuristic information in the heuristic greedy algorithm is the number and losses of pressed container, bonus and fitness of the target container. The whole loading plan of container terminal was worked out by choosing the container having the least cost from yard during every scheduling. At the last of this paper, many experiments proved the validity and practicality of the loading scheduling strategy with heuristic greedy algorithm.