Please use this identifier to cite or link to this item:
|Title:||Vehicle dispatching algorithms for container transshipment hubs||Authors:||Lee, L.H.
|Issue Date:||2010||Citation:||Lee, L.H., Chew, E.P., Tan, K.C., Wang, Y. (2010). Vehicle dispatching algorithms for container transshipment hubs. OR Spectrum 32 (3) : 663-685. ScholarBank@NUS Repository. https://doi.org/10.1007/s00291-010-0199-y||Abstract:||This paper seeks to address the dispatching problem for vehicles (or prime movers) in a transshipment hub by considering the quay cranes and yard cranes capacity. The objective of this paper is to minimize the makespan time at the quay side. This issue is particularly important for a port which uses information technology in making real time decision because the port can exploit information technology to make full use of the data in making good decision. A mixed integer programming (MIP) model is developed to formulate the problem. As the existing solver cannot solve the MIP model in reasonable time, we develop two heuristics to tackle the problem. The first method is based on the neighborhood search, while the second method is based on genetic algorithm (GA) and minimum cost flow (MCF) network model. Unlike the typical GA which usually represents the chromosome using job sequence, we use the ready time for jobs as the representation of the chromosome, and MCF model is then used to decode the chromosome to determine the job sequence for prime movers. The experiment results indicate the superiority of the GA-MCF-based algorithm over the neighborhood search algorithm. © 2010 Springer-Verlag.||Source Title:||OR Spectrum||URI:||http://scholarbank.nus.edu.sg/handle/10635/44219||ISSN:||01716468||DOI:||10.1007/s00291-010-0199-y|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.