The berth scheduling problem with customer differentiation: A new methodological approach based on hierarchical optimization

International Journal of Advanced Manufacturing Technology

Volumn 46, Issue 1-4, 2010, Pages 377-393

  Saharidis, G K D ^a   Golias, M M ^b   Boile, M ^c   Theofanis, S ^a   Ierapetritou, M G ^a  

^a RUTGERS UNIVERSITY   (United States)

^b UNIVERSITY OF MEMPHIS   (United States)

^c the state University of New Jersey   (United States)

Author keywords

Berth scheduling; Bi level; Container terminal operations; Hierarchical optimization; K th best algorithm; Multi objective optimization

Indexed keywords

CONTAINER TERMINAL; CONTAINER TERMINAL OPERATION; CONTAINER TERMINAL OPERATIONS; DISCRETE SPACES; HIERARCHICAL OPTIMIZATION; INTERACTIVE ALGORITHMS; K-TH BEST ALGORITHM; METHODOLOGICAL APPROACH; MULTI-OBJECTIVE FUNCTIONS; NEAR-OPTIMAL SOLUTIONS; SCHEDULING PROBLEM; SINGLE LEVEL; TERMINAL OPERATORS;

CONTAINERS; MATHEMATICAL OPERATORS; MULTIOBJECTIVE OPTIMIZATION; PORT TERMINALS; RAILROAD YARDS AND TERMINALS;

ALGORITHMS;

EID: 74249113831     PISSN: 02683768     EISSN: 14333015     Source Type: Journal    
DOI: 10.1007/s00170-009-2068-x     Document Type: Article

References (46)

1. MA Abo-Sinna IA Baky 2007 Interactive balance space approach for solving multi-level multi-objective programming problems Inf Sci 177 16 3397 3410 10.1016/j.ins.2007.02.005 05174390 10.1016/j.ins.2007.02.005 (Pubitemid 46823981)
2. JF Bard 1983 An efficient point algorithm for a linear two-stage optimization problem Oper Res 31 4 670 684 10.1287/opre.31.4.670 0525.90086 10.1287/opre.31.4.670 720514
3. FW Bialas HM Karwan 1984 Two-level linear programming Manage Sci 30 8 1004 1020 10.1287/mnsc.30.8.1004 0559.90053 10.1287/mnsc.30.8.1004 763843
4. Bialas W, Karwan M (1978) Multilevel linear programming. Technical Report 78-1, State University of New York at Buffalo. Operations Research Program
5. Boile M, Theofanis S, Golias MM (2008) A λ-opt based heuristic for the discrete berth scheduling problem. In proceedings of the 10th International Conference on Application of Advanced Technologies in Transportation. Athens, Greece
6. Chankong V, Haimes YY (1983) Multi-objective decision making theory and methodology. North-Holland Amsterdam
7. SJ Chang LR Mackett 2006 A bi-level model of the relationship between transport and residential location Transp Res Part B Methodological 40 2 123 146 10.1016/j.trb.2005.02.002 10.1016/j.trb.2005.02.002
8. Eiben AE, Smith JE (2003) Introduction to evolutionary computing. Springer, New York
9. Elster K-H (1993) Modern mathematical methods of optimization. Akademie, Berlin
10. EA Galperin 1992 Non scalarized multi-objective global optimization J Optim Theory Appl 75 1 69 85 10.1007/BF00939906 0795.90055 10.1007/BF00939906 1189267
11. EA Galperin 1997 Pareto analysis vis-à-vis balance space approach in multi-objective global optimization J Optim Theory Appl 93 3 533 545 10.1023/A:1022639028824 0872.90078 10.1023/A:1022639028824 1449791
12. Z Gao J Wu H Sun 2005 Solution algorithm for the bi-level discrete network design problem Transp Res Part B Methodological 39 6 479 495 10.1016/j.trb.2004.06.004 10.1016/j.trb.2004.06.004 (Pubitemid 40058815)
13. Goldberg DE (1989) Genetic algorithms in search, optimization, and machine-learning. Addison-Wesley, Reading
14. Golias MM (2007) The discrete and continuous berth allocation problem: models and algorithms. Dissertation, Rutgers University
15. Golias MM, Theofanis S, Boile M, Taboada HA (2009) A multi-objective decision and analysis approach for the berth scheduling problem. Int. J. Inf Technol Project Manage (Forthcoming)
16. Golias MM, Boile M, Theofanis S (2009) An adaptive time window partitioning based algorithm for the discrete and dynamic berth scheduling problem. J Transp Res Rec (Forthcoming)
17. Y Guan RK Cheung 2004 The berth allocation problem: models and solution methods OR-Spectrum 26 1 75 92 10.1007/s00291-003-0140-8 1161.90430 10.1007/s00291-003-0140-8 2044881 (Pubitemid 40549580)
18. Y Guan W-Q Xiao RK Cheung C-L Li 2002 A multiprocessor task scheduling model for berth allocation: heuristic and worst case analysis Oper Res Lett 30 5 343 350 10.1016/S0167-6377(02) 00147-5 1010.90026 10.1016/S0167-6377(02)00147-5 1932883
19. ZH Gümus CA Floudas 2005 Global optimization of mixed-integer bilevel programming problems Comput Manage Sci 2 3 181 212 10.1007/s10287-005- 0025-1 10.1007/s10287-005-0025-1 (Pubitemid 41051519)
20. P Hansen C Oguz N Mladenovic 2008 Variable neighborhood search for minimum cost berth allocation Eur J Oper Res 191 3 636 649 10.1016/j.ejor.2006. 12.057 1160.90497 10.1016/j.ejor.2006.12.057 (Pubitemid 351778608)
21. Hooker NJ (1998) Constraint satisfaction methods for generating valid cuts. Available Online as: http://citeseer.ist.psu.edu/163317.html.
22. A Imai E Nishimura S Papadimitriou 2001 The dynamic berth allocation problem for a container port Transp Res Part B 35 401 417 10.1016/S0191-2615(99) 00057-0 10.1016/S0191-2615(99)00057-0
23. A Imai E Nishimura S Papadimitriou 2003 Berth allocation with service priority Transp Res Part B 37 437 457 10.1016/S0191-2615(02)00023-1 10.1016/S0191-2615(02)00023-1 (Pubitemid 36380812)
24. A Imai J-T Zhang E Nishimura S Papadimitriou 2007 The berth allocation problem with service time and delay time objectives Marit Econ Logistics 9 269 290 10.1057/palgrave.mel.9100186 10.1057/palgrave.mel.9100186
25. A Imai HC Chen E Nishimura S Papadimitriou 2008 The simultaneous berth and quay crane allocation problem Transp Res Part E 44 5 900 920 10.1016/j.tre.2007.03.003 10.1016/j.tre.2007.03.003
26. KH Kim KC Moon 2003 Berth scheduling by simulated annealing Transp Res Part B 37 541 560 10.1016/S0191-2615(02) 00027-9 10.1016/S0191-2615(02)00027-9
27. S Lin BW Kernighan 1973 An effective heuristic algorithm for the traveling-salesman problem Oper Res 21 498 516 10.1287/opre.21.2.498 0256.90038 10.1287/opre.21.2.498 359742
28. F Miesel C Bierwirth 2009 Heuristics for the integration of crane productivity in the berth allocation problem Transp Res Part E 45 1 196 209 10.1016/j.tre.2008.03.001 10.1016/j.tre.2008.03.001
29. FM Monaco M Samara 2007 The berth allocation problem: a strong formulation solved by a lagrangean approach Transport Sci 41 2 265 280 10.1287/trsc.1060.0171 10.1287/trsc.1060.0171
30. R Moorthy C-P Teo 2006 Berth management in container terminal: the template design problem OR-Spectrum 28 4 495 518 10.1007/s00291-006-0036-5 1098.90510 10.1007/s00291-006-0036-5 (Pubitemid 44386728)
31. I Nishizaki M Sakawa 1999 Stackelberg solutions to multiobjective two level linear programming problems J Optim Theory Appl 103 1 161 182 10.1023/A:1021729618112 0945.90057 10.1023/A:1021729618112 1714988
32. Pardalos MP, Du D-Z (1998) Handbook of combinatorial optimization: Vol: 1-3, Springer, New York
33. MY Park HK Kim 2003 A scheduling method for berth and quay cranes Oper Res Spectr 25 1 1 23 10.1007/s00291-002-0109-z 1012.90011 10.1007/s00291-002- 0109-z Springer
34. Pinedo LM (2008) Scheduling: Theory, Algorithms, and Systems, 3rd edn. Springer, New York
35. G Rabadi GC Anagnostopoulos M Mollaghasemi 2007 A heuristic algorithm for the just-in-time single machine scheduling problem with setups: a comparison with simulated annealing Int J Adv Manuf Technol 32 326 335 10.1007/s00170-005- 0333-1 10.1007/s00170-005-0333-1 (Pubitemid 46327363)
36. Rao JR, Papalambros PY (1989) A non-linear programming continuation strategy for one parameter design optimization problems. Proceedings of ASME Design Automation Conference, Montreal, Quebec, Canada, Sept. 17-20: 77-89.
37. Remde S, Cowling P, Dahal K, Colledge N (2007) Exact/Heuristic Hybrids Using rVNS and Hyperheuristics for Workforce Scheduling. Evolutionary Computation in Combinatorial Optimization. Springer Berlin/Heidelberg, pp.188-197
38. GK Saharidis MG Ierapetritou 2009 Resolution method for mixed integer bi-level linear problems based on decomposition technique J Glob Optim 44 1 29 51 10.1007/s10898-008-9291-0 1172.90451 10.1007/s10898-008-9291-0 2496065
39. C Shi J Lu G Zhang 2005 An extended Kuhn-Tucker approach for linear bi-level programming Appl Math Comput 162 1 51 63 10.1016/j.amc.2003.12.089 1090.90175 10.1016/j.amc.2003.12.089 2107259
40. X Shi H Xia 1997 Interactive bi-level multi-objective decision making J Oper Res Soc 48 943 949 0892.90200 10.1057/palgrave.jors.2600435
41. M Simaan JB Cruz 1973 On the Stackelberg strategy in non-zero-sum games J Optim Theory Appl 11 533 555 10.1007/BF00935665 0243.90056 10.1007/BF00935665 332207
42. Taboada HA (2007) Multi-objective optimization algorithms considering objective preferences and solution clusters. Dissertation, Rutgers University
43. Theofanis S, Boile M, Golias MM (2009) Container terminal berth planning: critical review of research approaches and practical challenges. J Transp Res Rec
44. LN Vicente PH Calamai 1994 Bilevel and multilevel programming: a bibliography review J Glob Optim 5 3 291 306 10.1007/BF01096458 0822.90127 10.1007/BF01096458 1299018
45. Xia H, Iz PH, Shi X (1996) Bi-level group decision and negotiation based on multi-criteria optimization and game theory, IEEE 2029-2034.
46. G Zhang J Lu T Dillon 2007 Decentralized multi-objective bilevel decision making with fuzzy demands Knowl Base Syst 20 495 507 10.1016/j.knosys.2007.01. 003 10.1016/j.knosys.2007.01.003 (Pubitemid 46719941)