A complete and an incomplete algorithm for automated guided vehicle scheduling in container terminals

Computers and Mathematics with Applications

Volumn 61, Issue 3, 2011, Pages 630-641

  Rashidi, Hassan ^a   Tsang, Edward P K ^b  

^a ALLAMEH TABATABA'I UNIVERSITY   (Iran)

^b UNIVERSITY OF ESSEX   (United Kingdom)

Author keywords

Container terminals; Network Simplex Algorithm; Optimization; Scheduling problems; Search methods

Indexed keywords

AUTOMATED GUIDED VEHICLES; CONTAINER TERMINAL; DYNAMIC SCHEDULING; MINIMUM COST FLOWS; NOVEL ALGORITHM; OPTIMALITY; POLYNOMIAL TIME COMPLEXITY; RELATIVE STRENGTH; SCHEDULING PROBLEM; SCHEDULING PROBLEMS; SEARCH METHOD; SIMPLEX ALGORITHM;

CONTAINERS; COST ACCOUNTING; OPTIMIZATION; POLYNOMIAL APPROXIMATION; PORT TERMINALS; RAILROAD YARDS AND TERMINALS;

ALGORITHMS;

EID: 78951488887     PISSN: 08981221     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.camwa.2010.12.009     Document Type: Article

References (29)

1. P. Baptiste, C. Le Pape, and W. Nuijten Constraint-Based Scheduling, Applying Constraint Programming to Scheduling Problems Kluwer's International Series 2001
2. P. Baptiste, C. Le Pape, W. Nuijten, Incorporating efficient operations research algorithms in constraint-based scheduling, in: First International Workshop on Artificial Intelligence and Operations Research, Timberline Lodge, Oregon, 1995.
3. J. Bse, T. Reiners, D. Steenken, and S. Voß Vehicle dispatching at seaport container terminals using evolutionary algorithms Proceedings of the 33rd Annual Hawaii International Conference on System Sciences 2000 IEEE 1 10
4. Y. Cheng, H. Sen, K. Natarajan, C. Teo, K. Tan, Dispatching automated guided vehicles in a container terminal, Technical Report, National University of Singapore, 2003.
5. Y. Huang, W.J. Hsu, Two equivalent integer programming models for dispatching vehicles at a container terminal, CAIS, Technical Report, School of Computer Engineering, Nanyang Technological University, Singapore 639798, 2002.
6. J.M. Patrick, R. Dekker, Operations research supports container handling, Technical Report EI 2001-22, Erasmus University of Rotterdam, Econometric Institute, 2003.
7. H. Sen, Dynamic AGV-container job deployment, Technical Report, HPCES Programme, Singapore-MIT Alliance, 2001.
8. K.G. Murty, L. Jiyin, W. Yat-Wah, C. Zhang, Maria C.L. Tsang, and Richard J. Linn DSS (decision support system) for operations in a container terminal Decision Support System 39 2002 309 332
9. R.K. Ahuja, T.L. Magnanti, and J.B. Orlin Network Flows: Theory, Algorithms and Applications 1993 Prentice Hall
10. A.V. Goldberg, R. Kennedy, An efficient cost scaling algorithm for the assignment problem, Technical Report, Stanford University, 1993.
11. J.M. Mulvey Pivot strategies for primal simplex network codes Journal of the Association for Computing Machinery 25 1978 266 270
12. M.D. Grigoriadis An efficient implementation of the network simplex method Mathematical Programming Study 26 1983 83 111
13. G. Bradley, G. Brown, and G. Graves Design and implementation of large scale primal transhipment algorithms Management Science 24 1977 1 38
14. D. Eppstein, Clustering for faster network simplex pivots, in: Proc. 5th ACMSIAM Symposium, Discrete Algorithms, 1999, pp. 160166.
15. A. Lbel, A network simplex implementation, Technical Report, Konrad-Zuse-Zentrum fr Informationstechnik Berlin, ZIB, 2000.
16. I. Maros, A general pricing scheme for the simplex method, Technical Report, Department of Computing, Imperial College, London, 2003.
17. M. Masakazu On network simplex method using primaldual symmetric pivoting rule Journal of Operations Research of Japan 43 1999 149 161
18. J.W. Bae, and K.H. Kim A pooled dispatching strategy for automated guided vehicles in port container terminals International Journal of Management Science 6 2 2000 47 60
19. L. Qiu, W.-J. Hsu, S.-Y. Huang, and H. Wang Scheduling and routing algorithms for AGVs: a survey International Journal of Production Research 40 3 2002 745 760 Taylor & Francis Ltd.
20. D.J. Kelly, G.M. ONeill, The minimum cost flow problem and the network simplex solution method, Master Degree Dissertation, University College, Dublin, 1993.
21. R. Helgason, and J. Kennington Primal simplex algorithms for minimum cost network flows Handbook on Operations Research and Management Science vol. 7 1995 North-Holland Amsterdam 85 133
22. W.H. Cunningham Theoretical properties of the network simplex method Mathematics of Operations Research 4 2 1979 196 208
23. H. Rashidi, Dynamic scheduling of automated guided vehicles in container terminals, Ph.D. Thesis, Department of Computer Science, University of Essex, 2006.
24. G.B. Dantzig Linear Programming and Extensions 1963 Princeton University Press Princeton, New Jersey
25. R.K. Ahuja, J.B. Orlin, M.S. Giovanni, and P. Zuddas Algorithms for the simple equal flow problem Management Science 45 10 1999 1440 1455
26. V.G. Andrew An efficient implementation of a scaling minimum-cost flow algorithm Journal of Algorithms 22 1997 1 29
27. R.K. Ahuja, J.B. Orlin, P. Sharma, and P.T. Sokkalingam A network simplex algorithm with O (N ) consecutive degenerate pivots Operations Research 30 3 2002 141 148
28. S. Voß, Meta-heuristic: the state of the art, in: Local Search for Planning and Scheduling: ECAI 2000 Workshop, Berlin, Germany, 2000.
29. E.P.K. Tsang Scheduling techniquesa comparative study British Telecom Technology Journal 13 1 1995 16 28 Martlesham Heath, Ipswich, UK