Multiobjective optimization for autonomous straddle carrier scheduling at automated container terminals

Cai, B; Huang, S; Liu, D; Yuan, S; Dissanayake, G; Lau, H; Pagac, D

Multiobjective optimization for autonomous straddle carrier scheduling at automated container terminals

Cai, B

Huang, S

Liu, D

Yuan, S Dissanayake, G

Lau, H Pagac, D

Permalink

Publication Type:: Journal Article
Citation:: IEEE Transactions on Automation Science and Engineering, 2013, 10 (3), pp. 711 - 725
Issue Date:: 2013-07-01

Closed Access

	Filename	Description	Size
	2011005754OK.pdf		2.56 MB	Adobe PDF	View/Open

Copyright Clearance Process

Recently Added
In Progress
Closed Access

This item is closed access and not available.

Full metadata record

Field	Value	Language
dc.contributor.author	Cai, B https://orcid.org/0000-0002-0348-0690	en_US
dc.contributor.author	Huang, S https://orcid.org/0000-0002-6124-4178	en_US
dc.contributor.author	Liu, D https://orcid.org/0000-0002-1581-5582	en_US
dc.contributor.author	Yuan, S	en_US
dc.contributor.author	Dissanayake, G https://orcid.org/0000-0002-7992-0680	en_US
dc.contributor.author	Lau, H	en_US
dc.contributor.author	Pagac, D	en_US
dc.date.issued	2013-07-01	en_US
dc.identifier.citation	IEEE Transactions on Automation Science and Engineering, 2013, 10 (3), pp. 711 - 725	en_US
dc.identifier.issn	1545-5955	en_US
dc.identifier.uri	http://hdl.handle.net/10453/26108
dc.description.abstract	A multiobjective optimization model is presented in this paper for the Autonomous Straddle Carriers Scheduling (ASCS) problem in automated container terminals, which is more practical than the single objective model. The model considers three objectives [ i.e., Straddle Carriers (SCs) traveling time, SC waiting time and finishing time of high-priority container-transferring jobs], and their weighted sum is investigated as the representative example. The presented model is formulated as a pickup and delivery problem with time windows in the form of binary integer programming. An exact algorithm based on Branch-and-Bound with Column Generation (BBCG) is employed for solving the multiobjective ASCS problem. Based on the map of an actual fully automated container terminal, simulation results are compared with the single-objective scheduling to demonstrate the effectiveness and flexibility of the presented multiobjective model, as well as the efficacy of the BBCG algorithm for autonomous SC scheduling. © 2012 IEEE.	en_US
dc.relation	http://purl.org/au-research/grants/arc/LP0882745
dc.relation.ispartof	IEEE Transactions on Automation Science and Engineering	en_US
dc.relation.isbasedon	10.1109/TASE.2012.2210417	en_US
dc.subject.classification	Industrial Engineering & Automation	en_US
dc.title	Multiobjective optimization for autonomous straddle carrier scheduling at automated container terminals	en_US
dc.type	Journal Article
utslib.citation.volume	3	en_US
utslib.citation.volume	10	en_US
utslib.for	0913 Mechanical Engineering	en_US
utslib.for	0910 Manufacturing Engineering	en_US
utslib.for	0906 Electrical and Electronic Engineering	en_US
dc.location.activity	Sydney
pubs.embargo.period	Not known	en_US
pubs.organisational-group	/University of Technology Sydney
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology/School of Mechanical and Mechatronic Engineering
pubs.organisational-group	/University of Technology Sydney/Strength - CAS - Centre for Autonomous Systems
utslib.copyright.status	closed_access
pubs.issue	3	en_US
pubs.publication-status	Published	en_US
pubs.volume	10	en_US

Abstract:

A multiobjective optimization model is presented in this paper for the Autonomous Straddle Carriers Scheduling (ASCS) problem in automated container terminals, which is more practical than the single objective model. The model considers three objectives [ i.e., Straddle Carriers (SCs) traveling time, SC waiting time and finishing time of high-priority container-transferring jobs], and their weighted sum is investigated as the representative example. The presented model is formulated as a pickup and delivery problem with time windows in the form of binary integer programming. An exact algorithm based on Branch-and-Bound with Column Generation (BBCG) is employed for solving the multiobjective ASCS problem. Based on the map of an actual fully automated container terminal, simulation results are compared with the single-objective scheduling to demonstrate the effectiveness and flexibility of the presented multiobjective model, as well as the efficacy of the BBCG algorithm for autonomous SC scheduling. © 2012 IEEE.

Please use this identifier to cite or link to this item:

http://hdl.handle.net/10453/26108