Integrated scheduling of handling equipment at automated container terminals
AbstractTo improve the productivities of an automated container terminal, it is important to schedule different types of handling equipment in an integrated way. A mixed-integer programming model, which considers various constraints related to the integrated operations between different types of handling equipment, is formulated. This study proposes a heuristic method, called multi-layer genetic algorithm (MLGA) to obtain the near-optimal solution of the integrated scheduling problem and an improved heuristic algorithm, called genetic algorithm plus maximum matching (GAPM), to reduce the computation complexity of the MLGA method. The performance of GAPM is also compared with that of the MLGA method.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Bibliographic InfoArticle provided by Elsevier in its journal International Journal of Production Economics.
Volume (Year): 112 (2008)
Issue (Month): 2 (April)
Contact details of provider:
Web page: http://www.elsevier.com/locate/ijpe
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Nishimura, Etsuko & Imai, Akio & Papadimitriou, Stratos, 2001. "Berth allocation planning in the public berth system by genetic algorithms," European Journal of Operational Research, Elsevier, vol. 131(2), pages 282-292, June.
- Van Hee, K. M. & Huitink, B. & Leegwater, D. K., 1988. "PORTPLAN, decision support system for port terminals," European Journal of Operational Research, Elsevier, vol. 34(3), pages 249-261, March.
- Young Kim, Ki & Hwan Kim, Kap, 1999. "A routing algorithm for a single straddle carrier to load export containers onto a containership," International Journal of Production Economics, Elsevier, vol. 59(1-3), pages 425-433, March.
- Nishimura, Etsuko & Imai, Akio & Papadimitriou, Stratos, 2005. "Yard trailer routing at a maritime container terminal," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 41(1), pages 53-76, January.
- Vis, Iris F. A. & de Koster, Rene, 2003. "Transshipment of containers at a container terminal: An overview," European Journal of Operational Research, Elsevier, vol. 147(1), pages 1-16, May.
- Longo, Francesco, 2010. "Design and integration of the containers inspection activities in the container terminal operations," International Journal of Production Economics, Elsevier, vol. 125(2), pages 272-283, June.
- Zeng, Qingcheng & Yang, Zhongzhen & Lai, Luyuan, 2009. "Models and algorithms for multi-crane oriented scheduling method in container terminals," Transport Policy, Elsevier, vol. 16(5), pages 271-278, September.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Wendy Shamier).
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.