Please use this identifier to cite or link to this item:
Title: Swarm intelligence algorithms for yard truck scheduling and storage allocation problems
Authors: Niu, B
Xie, T
Tan, LJ
Bi, Y
Wang, ZX
Keywords: Container terminal operations
Yard Truck Scheduling
Storage Allocation
Particle swarm optimization
Bacterial colony optimization
Issue Date: 2016
Publisher: Elsevier
Source: Neurocomputing, 5 May. 2016, v. 188, p. 284-293 How to cite?
Journal: Neurocomputing 
Abstract: In this paper we focus on two scheduling problems in container terminal: (i) the Yard Truck Scheduling Problem (YTSP) which assigns a fleet of trucks to transport containers between the QCs and the storage yard to minimize the makespan, (ii) the integrated Yard Truck Scheduling Problem and Storage Allocation Problem (YTS-SAP) which extends the first problem to consider storage allocation strategy for discharging containers. Its object is to minimize the total delay for all jobs. The second model is improved to consider the truck ready time. Due to the computational intractability, two recently developed solution methods, based on swarm intelligence technique, are developed for problem solution, namely, particle swarm optimization (PSO) and bacterial colony optimization (BCO). As these two algorithms are originally designed for continuous optimization problems, we proposed a particular mapping method to implement them for YTSP and YTS-SAP, both of which are discrete optimization problems. Through comparing the PSO algorithms and BCO algorithm with GA by an experiment conducted on different scale instances, we can draw a conclusion that LPSO perform best in YTSP while BCO perform best in YTS-SAP.
ISSN: 0925-2312
EISSN: 1872-8286
DOI: 10.1016/j.neucom.2014.12.125
Appears in Collections:Journal/Magazine Article

View full-text via PolyU eLinks SFX Query
Show full item record


Last Week
Last month
Citations as of Sep 21, 2017

Page view(s)

Last Week
Last month
Checked on Sep 17, 2017

Google ScholarTM



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.