Cart (Loading....) | Create Account
Close category search window
 

Integrated quay crane and yard truck schedule problem in container terminals

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

The purchase and pricing options are temporarily unavailable. Please try again later.
3 Author(s)
Cao, Jinxin ; Department of Civil Engineering, Tsinghua University, Beijing 100084, China Department of Transportation Engineering, Inner Mongolia University, Hohhot 010070, China ; Shi, Qixin ; Lee, Der-Horng

Quay crane and yard truck scheduling are two important subproblems in container terminal operations which have been studied separately in previous research. This paper proposes a new problem for the integrated quay crane and yard truck scheduling for inbound containers. The problem is formulated as a mixed integer programming (MIP) model. Due to the intractability, a genetic algorithm (GA) and a modified Johnson's Rule-based heuristic algorithm (MJRHA) are used for the problem solution. In addition, two closed form lower bounds are given to evaluate the solution accuracy. Computational experiments show that the solution algorithm can efficiently handle the scheduling problem and that the integrated methods are very useful.

Published in:

Tsinghua Science and Technology  (Volume:15 ,  Issue: 4 )

Date of Publication:

Aug. 2010

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.