Belirsiz Ortamlarda Eşzamanlı Rıhtım Atama ve Vinç Çizelgeleme Problemlerine Çok Amaçlı Eniyileme Yaklaşımları
Loading...
Date
2015
Authors
Alper Emre YILDIRIM
Deniz Ateş ÖZDEMİR
Evrim URSAVAŞ GÜLDOĞAN
Journal Title
Journal ISSN
Volume Title
Publisher
Open Access Color
OpenAIRE Downloads
OpenAIRE Views
Abstract
Küresel tedarik zincirinin en önemli halkalarından olan konteyner terminallerindeki operasyonların verimliligi liman yönetimi içinde çok önemli bir yere sahiptir. Terminal operasyonları birbirleri ile iç içe geçmelerine karsın diger tüm operasyonları dogrudan etkileyen en önemli asama rıhtım operasyonlarıdır. Liman yönetimlerinin gelen gemilere en iyi hizmet verecek ve maliyetlerini en az indirecek sekilde karar almaları gerekmektedir. Bu bakımdan limana gelen gemilere rıhtım tahsis etme vinç atama ve çizelgeleme problemlerinden olusan rıhtım operasyonları yöneylem arastırması tekniklerinin kullanılmasına yönelik çok uygun bir alandır.Bu projede konteyner terminallerindeki rıhtım operasyonlarına iliskin karar problemlerinin çözümü için yeni yaklasımlar tasarlanmıstır. Bu yaklasımlarda rıhtım operasyonları bütüncül olarak ele alınarak karma tamsayılı ve stokastik programlama eniyileme modelleri gelistirilmistir. Gelistirilen çok amaçlı modeller sayesinde karar verici için limandaki yogunluga baglı olarak tercih edebilecegi çesitli çözüm seçenekleri elde edilebilmektedir. Bununla beraber bu çesitli seçeneklerden sadece en ise yarayacak olan Pareto etkin çözümleri sunulmaktadır. Öte yandan gerçek hayatta karsılasılabilecek belirsizligi dikkate alarak gelistirilen stokastik modeller sayesinde daha etkin planların yapılabilmesi saglanmaktadır.Proje kapsamında rıhtım operasyonları problemlerinin çözümüne iliskin tasarlanan yöntemlerin Izmir Alsancak Limanı?ndan alınan günlük ve haftalık gerçek veriler üzerinde denenerek elde dilen çözümlerinde liman yönetiminin yaptıgı planlara göre %60?lara varan iyilestirmeler sagladıgı görülmüstür. Gelistirilen çözüm yöntemlerinin dünyadaki diger konteyner liman ve terminallerinde uygulanabilecegi literatürdeki diger çalısmalarda kullanılan gerçek veriler ve gerçege yakın olarak üretilen veri örnekleri ile test edilerek kanıtlanmıstır. Bu yöntemler ile çözülen gerek günlük gerekse de haftalık problemlerin çözüm sürelerinin bir sonraki planlama zamanına kadar geçen süre dikkate alındıgında oldukça kabul edilebilir oldugu görülmüstür.
Description
Keywords
İşletme
Fields of Science
Citation
Ahmed S. Taw armalani M. & Sahinidis N. V. 2004. “A finite branch-and-bound algorithm\r\nfor tw o-stage stochastic integer programs” Mathematical Programming 100 (2) 355-377.1- Berth Allocation and Crane Assignment Planning Under Multiple Objectives (Bildiri -\r\nUluslararası Bildiri - Sözlü Sunum)Balas E. 1979. “Disjunctive programming” Annals of Discrete Mathematics 5 3-51.2- Berth Allocation and Crane Assignment Planning under Multiple Objectives (Bildiri -\r\nUluslararası Bildiri - Sözlü Sunum)Balas E. Ceria S. & Cornuéjols G. 1993. “A lif t-and-project cutting plane algorithm for\r\nmixed 0–1 programs” Mathematical programming 58 (1-3) 295-324.3- A Bi-objective Approach to Quayside Berth and Crane Operations (duzeltme) (Bildiri -\r\nUluslararası Bildiri - Sözlü Sunum)Benders J. F. (1962). “Partitioning procedures for solving mixed-variables programming\r\nproblems” Numerische mathematik 4 (1) 238-252.4- Bi-objective Berth-Crane Allocation Problem\r\n(duzeltme) (Bildiri - Uluslararası Bildiri - Sözlü Sunum)Bierw irth C. Meisel F. 2009 “A fast heuristic for quay crane scheduling w ith interference\r\nconstraints” Journal of Scheduling 12 (4) 345-360.5- A Bi-objective Approach to Quayside Berth and Crane Operations (duzeltme) (Bildiri -\r\nUluslararası Bildiri - Sözlü Sunum)Bierw irth C. Meisel F. 2010. “A survey of berth allocation and quay crane scheduling\r\nproblems in container terminals” European Journal of Operational Research 202 (3) 615-\r\n627.6- A Bi-objective Approach to Quayside Berth and Crane Operations (Bildiri - Uluslararası\r\nBildiri - Sözlü Sunum)Bierw irth C. Meisel F. 2015. “A follow -up survey of berth allocation and quay crane\r\nscheduling problems in container terminals” European Journal of Operational\r\nResearch 244 675-689.7- Bi-objective Berth-Crane Allocation Problem (Bildiri - Uluslararası Bildiri - Sözlü Sunum)Birge J. R. 1985. “Decomposition and partitioning methods for multistage stochastic linear\r\nprograms” Operations Research 33 (5) 989-1007.8- Global Logistics Management (Kitap - Kitapta Bölüm)Birge J. R. Louveaux F. V. 2011. Introduction to stochastic programming (2. Basım). New\r\nYork Dordrecht Heidelberg Londra: Springer.9- Simultaneous Berth Allocation and Quay Crane Assignment Problem (Tez (Arastırmacı\r\nYetistirilmesi) - Yüksek Lisans Tezi)Birge J. R. Louveaux F. V. 1988. “A multicut algorithm for tw o-stage stochastic linear\r\nprograms” European Journal of Operational Research 34 (3) 384-392.Beale E. M. 1955. “On minimizing a convex function subject to linear inequalities” Journal of\r\nthe Royal Statistical Society Series B (Methodological) 173-184.Blair C. E. Jeroslow R. G. 1978. “A converse for disjunctive constraints” Journal of\r\nOptimization Theory and Applications 25 (2) 195-206.Blair C. E. Jeroslow R. G. 1982. “The value function of an integer program” Mathematical\r\nProgramming 23 (1) 237-273.Buhrkal K. Zuglian S. Ropke S. Larsen J. Lusby R. 2011.” Models for the discrete berth\r\nallocation problem: a computational comparison” Transportation Research Part E: Logistics\r\nand Transportation Review 47 (4) 461-473.Carøe C. C. Schultz R. 1999. “Dual decomposition in stochastic integer\r\nprogramming” Operations Research Letters 24(1) 37-45.Carøe C. C. Tind J. 1997. “A cutting-plane approach to mixed 0–1 stochastic integer\r\nprograms” European Journal of Operational Research101 (2) 306-316.Carøe C. C. Tind J. 1998. “L-shaped decomposition of tw o-stage stochastic programs w ith\r\ninteger recourse” Mathematical Programming 83 (1-3) 451-464.Charnes A. Cooper W. W. 195). “Chance-constrained programming” Management\r\nscience 6 (1) 73-79.Chen J. H Lee D. Cao J.X. 2011. “Heuristics for quay crane scheduling at indented berth”\r\nTransportation Research Part E 47 1005–1020.Chen J. H. Lee D. Goh M. 2014. “An effective mathematical formulation for the\r\nunidirectional cluster-based quay crane scheduling problem”. European Journal of\r\nOperational Research 232 (1) 198-208.Christensen C.G. Holst C.T. 2008. “Berth Allocation in Container Terminals” Master’s\r\nThesis Department of Informatics and Mathematical Modeling Technical University of\r\nDenmark.Cordeau J. F. Laporte G. Legato P. Moccia L. 2005. “Models and tabu search heuristics\r\nfor the berth-allocation problem” Transportation Science 39 (4) 526-538.Dantzig G. B. 1955. “Linear programming under uncertainty” Management Science 1(3-4)\r\n197-206.Diabat A. Theodorou E. 2014. “An Integrated Quay Crane Assignment and Scheduling\r\nProblem” Computers & Industrial Engineering 73 115-123.Giallombardo G. Moccia L. Salani M. Vacca I. 2010. “Modeling and solving the tactical\r\nberth allocation problem” Transportation Research Part B: Methodological 44 (2) 232-245.Xu D. Li C. Joseph Y. Leung T. 2012. “ Berth allocation w ith time-dependent physical\r\nlimitations on vessels” European Journal of Operational Research 216 47–56.Golias M. Portal I. Konur D. Kaisar E. Kolomvos G. 2014. “Robust berth scheduling at\r\nmarine container terminals via hierarchical optimization” Computers &OperationsResearch\r\n41 412–422.Goodchild A. Zhao W. Wygonik E. 2010. “Decision Problems and Application of\r\nOperations Research at Marine Container Terminals”. Wiley Encyclopedia of Operations\r\nResearch and Management Science Cochran J.J. John Wiley & Sons.Han X. L. Lu Z. Q. Xi L. F. 2010. “A proactive approach for simultaneous berth and quay\r\ncrane scheduling problem w ith stochastic arrival and handling time” European Journal of\r\nOperational Research 207 (3) 1327-1340.Haneveld W. K. Van der Vlerk M. H. 1999. “Stochastic integer programming: General\r\nmodels and algorithms” Annals of Operations Research 85 39-57.Imai A. Nagaiw a K. I. Tat C. W. 1997. “Efficient planning of berth allocation for container\r\nterminals in Asia” Journal of Advanced Transportation31 (1) 75-94.Imai A. Nishimura E. Papadimitriou S. 2001. “The dynamic berth allocation problem for a\r\ncontainer port” Transportation Research Part B: Methodological 35 (4) 401-417.Imai A. Sun X. Nishimura E. Papadimitriou S. 2005. “Berth allocation in a container port:\r\nusing a continuous location space approach” Transportation Research Part B 39 (3) 199–\r\n221.Kall P. Wallace S. W. 1994. Stochastic Programming. John Wiley and Sons Ltd.Karafa J. Golias M. M. Ivey S. Saharidis G. K. Leonardos N. 2013. “The berth allocation\r\nproblem w ith stochastic vessel handling times” The International Journal of Advanced\r\nManufacturing Technology 65 (1-4) 473-484.Keller B. Bayraksan G. 2009. “Scheduling jobs sharing multiple resources under\r\nuncertainty: A stochastic programming approach” IIE Transactions 42 (1) 16-30.Kim K. H. Park Y. M. 2004. “A crane scheduling method for port container\r\nterminals. European Journal of operational research” 156 (3) 752-768.Laporte G. Louveaux F. V. 1993. “The integer L-shaped method for stochastic integer\r\nprograms w ith complete recourse” Operations research letters 13 (3) 133-142.Laporte G. Louveaux F. V. 1998. Sayfa 159-167. Solving Stochastic Routing Problems w ith\r\nthe Integer L-shaped Method. Springer US.Lee D. Wang H. Q. 2010. “Integrated discrete berth allocation and quay crane scheduling\r\nin port container terminals” Engineering Optimization 42 (8) 747-761.Legato P. Trunfio R. Meisel F. 2012. “Modeling and solving rich quay crane scheduling\r\nproblems” Computers & Operations Research 39 (9) 2063-2078.Li C. L. Cai X. Lee C. Y. 1998. “Scheduling w ith multiple-job-on-one-processor\r\npattern” IIE Transactions 30 (5) 433-445.Liang C. Yang Y. 2009. “A quay crane dynamic scheduling problem by hybrid evolutionary\r\nalgorithm for berth allocation planning” Computers & Industrial Engineering 56 (3) 1021–\r\n1028.Liang C. Guo J. Yang Y. 2011. “Multi-objective hybrid genetic algorithm for quay crane\r\ndynamic assignment in berth allocation planning” J Intell Manuf 22 471–479.Liu J. Wan Y. W. Wang L. 2006. “Quay crane scheduling at container terminals to\r\nminimize the maximum relative tardiness of vessel departures” Naval Research Logistics\r\n(NRL) 53 (1) 60-74.Lu Z. Han X. Xi L. Erera A.L. 2012. “A heuristic for the quay crane scheduling problem\r\nbased on contiguous bay crane operations” Computers & Operations Research 39 2915–\r\n2928.Luis E. Dolinskaya I. S. Smilow itz K. R. 2012. “The Stochastic Generalized Assignment\r\nProblem w ith Coordination Constraints”.\r\nhttp://users.iems.northw estern.edu/~dolira/delatoree-dolinskaya-12-03.pdf\r\nSon erişim tarihi: 25 Mayıs 2015.Meisel F. Bierw irth C. 2009. “Heuristics for the integration of crane productivity in the berth\r\nallocation problem” Transportation Research Part E 45 196–209.Meisel F. Bierw irth C. 2013. “A Framew ork for Integrated Berth Allocation and Crane\r\nOperations Planning in Seaport Container Terminals” Transportation Science 47 (2) 131–\r\n147.Mihalis M. Golias Maria Boile Sotirios Theofanis 2009. “Berth scheduling by customer\r\nservice differentiation: A multi-objective approach” Transportation Research Part E 45 878–\r\n892.Moccia L. Cordeau J. F. Gaudioso M. Laporte G. 2006. “A branch‐and‐cut algorithm for\r\nthe quay crane scheduling problem in a container terminal” Naval Research Logistics\r\n(NRL) 53 (1) 45-59.Nishimura E. Imai A. & Papadimitriou S. 2001. “Berth allocation planning in the public\r\nberth system by genetic algorithms” European Journal of Operational Research 131 (2)\r\n282-292.Ntaimo L. 2010. “Disjunctive decomposition for tw o-stage stochastic mixed-binary programs\r\nw ith random recourse”. Operations Research 58 (1) 229-243.Ntaimo L. Sen S. 2008. “A comparative study of decomposition algorithms for stochastic\r\ncombinatorial optimization” Computational Optimization and Applications 40 (3) 299-319.Ogryczak W. Ruszczyński A. 2002. “Dual stochastic dominance and quantile risk\r\nmeasures” International Transactions in Operational Research9 (5) 661-680.Ozdemir D. Ursavaş E. 2014. Bi-Objective berth-crane allocation problem in container\r\nterminals. Global Logistics Management. CRC Press (Taylor & Francis Group).Park Y. M. Kim K. H. 2005. Sayfa 159-181. A scheduling method for berth and quay\r\ncranes. Container Terminals and Automated Transport Systems. Springer Berlin Heidelberg.\r\nPrékopa A. 1995. Stochastic Programming. Hollanda: Springer.Riis M. Schultz R. 2003. “Applying the minimum risk criterion in stochastic recourse\r\nprograms” Computational Optimization and Applications 24 (2-3) 267-287.Sammarra M. Cordeau J. F. Laporte G. Monaco M. F. 2007. “A tabu search heuristic for\r\nthe quay crane scheduling problem” Journal of Scheduling10 (4-5) 327-336.Santoso T. Ahmed S. Goetschalckx M. Shapiro A. 2005. “A stochastic programming\r\napproach for supply chain netw ork design under uncertainty” European Journal of\r\nOperational Research 167 (1) 96-115.Schultz R. (1995). “On structure and stability in stochastic programs w ith random technology\r\nmatrix and complete integer recourse” Mathematical Programming 70 (1-3) 73-89.Schultz R. 2003. “Stochastic programming w ith integer variables” Mathematical\r\nProgramming 97(1-2) 285-309.Schultz R. Tiedemann S. 2003. “Risk aversion via excess probabilities in stochastic\r\nprograms w ith mixed-integer recourse” SIAM Journal on Optimization 14 (1) 115-138.Sen S. Sherali H. D. 1987. “Nondifferentiable reverse convex programs and facetial\r\nconvexity cuts via a disjunctive characterization” Mathematical Programming 37 (2) 169-\r\n183.Sen S. 2005. “Algorithms for stochastic mixed-integer programming models”. Handbooks in\r\nOperations Research and Management Science 12 515-558.Sen S. Higle J. L. 2005. “The C 3 theorem and a D 2 algorithm for large scale stochastic\r\nmixed-integer programming: set convexification”. Mathematical Programming 104 (1) 1-20.Sen S. Sherali H. D. 2006. “Decomposition w ith branch-and-cut approaches for tw o-stage\r\nstochastic mixed-integer programming” Mathematical Programming 106 (2) 203-223.Sherali H. D. Fraticelli B. M. 2002. “A modification of Benders' decomposition algorithm for\r\ndiscrete subproblems: An approach for stochastic programs w ith integer recourse” Journal\r\nof Global Optimization 22 (1-4) 319-342.Sherali H. D. Shetty C. M. 1980. Optimization w ith Disjunctive Constraints (181. Basım).\r\nBerlin: Springer-Verlag.Sherali H. D. Zhu X. 2009. Sayfa 405-435. Tw o-stage stochastic mixed-integer programs:\r\nAlgorithms and insights. In Advances in Applied Mathematics and Global Optimization.\r\nSpringer US.Steenken D. Voß S. Stahlbock R. 2004. “Container terminal operation and operations\r\nresearch: A classification and literature review ” OR Spectrum 26 (1) 3-49.Stahlbock R. Voß S. 2008. “Operations research at container terminals: A literature\r\nupdate” Or Spectrum 30 (1) 1-52.Stougie L. Van Der Vlerk M. H. 1996. Stochastic integer programming. Institute of Actuarial\r\nSciences & Econometrics University of Amsterdam.Takriti S. Ahmed S. 2004. “On robust optimization of tw o-stage systems” Mathematical\r\nProgramming 99 (1) 109-126.Umang N. Bierlaire M. Vacca I. 2013. “Exact and heuristic methods to solve the berth\r\nallocation problem in bulk ports” Transportation Research Part E: Logistics and\r\nTransportation Review 54 14-31.Vacca I. Salani M. Bierlaire M. 2013. “An exact algorithm for the integrated planning of\r\nberth allocation and quay crane assignment” Transportation Science 47 (2) 148-161.Van Slyke R. M. Wets R. 1969. “L-shaped linear programs w ith applications to optimal\r\ncontrol and stochastic programming” SIAM Journal on Applied Mathematics 17 (4) 638-\r\n663.Vis I. F. De Koster R. 2003. “Transshipment of containers at a container terminal: An\r\noverview ” European Journal of Operational Research 147 (1) 1-16.Wollmer R. D. 1980. “Tw o stage linear programming under uncertainty w ith 0–1 integer first\r\nstage variables” Mathematical Programming 19 (1) 279-288.Xu Y. Chen Q. & Quan X. (2012). Robust berth scheduling w ith uncertain vessel delay\r\nand handling time. Annals of Operations Research 192(1) 123-140.Yuan Y. Sen S. 2009. “Enhanced cut generation methods for decomposition-based branch\r\nand cut for tw o-stage stochastic mixed-integer programs” INFORMS Journal on\r\nComputing 21 (3) 480-487.Zeng Q. Yang Z. Hu X. 2011. “Disruption recovery model for berth and quay crane\r\nscheduling in container terminals” Engineering Optimization 43 (9) 967-983.Zhen L. Lee L.H. Chew E.P. 2011. “A decision model for berth allocation under\r\nuncertainty” European Journal of Operational Research 212 54–68.Zhen L. Chang D. 2012: “A bi-objective model for robust berth allocation scheduling”\r\nComputers & Industrial Engineering 63 262–273.Zhou P. Kang H. 2008. “Study on Berth and Quay-crane Allocation under Stochastic\r\nEnvironments in Container Terminal” Systems Engineering - Theory & Practice 28 (1) 161-\r\n169.
WoS Q
Scopus Q
Source
Volume
Issue
Start Page
End Page
Collections
