FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W4211036782> ?p ?o ?g. }

• W4211036782 endingPage "205" @default.
• W4211036782 startingPage "185" @default.
• W4211036782 abstract "Free Access Bibliography S. Mahdi Homayouni, S. Mahdi HomayouniSearch for more papers by this authorDalila B.M.M. Fontes, Dalila B.M.M. FontesSearch for more papers by this author Book Author(s):S. Mahdi Homayouni, S. Mahdi HomayouniSearch for more papers by this authorDalila B.M.M. Fontes, Dalila B.M.M. FontesSearch for more papers by this author First published: 16 April 2018 https://doi.org/10.1002/9781119483151.biblio AboutPDFPDF ToolsRequest permissionExport citationAdd to favoritesTrack citation ShareShareShare a linkShare onFacebookTwitterLinked InRedditWechat References Aarts E., Korst J., Kichiels W., “ Simulated annealing”, in E.K. Burke , G. Kendall (eds), Search Methodologies, Springer, Boston, 2005. Agra A., Christiansen M., Delgado A. et al., “A maritime inventory routing problem with stochastic sailing and port times”, Computers & Operations Research, vol. 61, pp. 18– 30, 2015. Agra A., Oliveira M., “MIP approaches for the integrated berth allocation and quay crane assignment and scheduling problem”, European Journal of Operational Research, vol. 264, no. 1, pp. 138– 148, 2018. Al-Dhaheri N., Diabat A., “The quay crane scheduling problem”, Journal of Manufacturing Systems, vol. 36, pp. 87– 94, 2015. Al-Dhaheri N., Jebali A., Diabat A., “A simulation-based genetic algorithm approach for the quay crane scheduling under uncertainty”, Simulation Modelling Practice and Theory, vol. 66, pp. 122– 138, 2016. Andersson H., Fagerholt K., Hobbesland K., “Integrated maritime fleet deployment and speed optimization: Case study from RoRo shipping”, Computers & Operations Research, vol. 55, pp. 233– 240, 2015. Angeline P.J., “Evolutionary optimization versus particle swarm optimization: Philosophy and performance differences”, Lecture Notes in Computer Science: Evolutionary Programming VII, vol. 1447, pp. 601– 610, 1998. Aydin N., Lee H., Mansouri S.A., “Speed optimization and bunkering in liner shipping in the presence of uncertain service times and time windows at ports”, European Journal of Operational Research, vol. 259, no. 1, pp. 143– 154, 2017. Bae H., Choe R., Park T. et al, “Comparison of operations of AGVs and ALVs in an automated container terminal”, Journal of Intelligent Manufacturing, vol. 22, no. 3, pp. 413– 426, 2011. Barros V.H., Costa T.S., Oliveira A.C.M. et al., “Model and heuristic for berth allocation in tidal bulk ports with stock level constraints”, Computers & Industrial Engineering, vol. 60, no. 4, pp. 606– 613, 2011. Bartošek A., Marek O., “Quay cranes in container terminals”, Transactions on Transport Sciences, vol. 6, no. 1, pp. 9– 18, 2013. Basu S., Sharma M., Ghosh P.S., “Efficient preprocessing methods for tabu search: an application on asymmetric travelling salesman problem”, Information Systems and Operational Research, vol. 55, no. 2, pp. 134– 158, 2017. Battiti R., Tecchiolli G., “The Reactive Tabu Search”, ORSA Journal of Computing, vol. 6, no. 2, pp. 126– 140, 1994. Bazzazi M., Safaei N., Javadian N., “A genetic algorithm to solve the storage space allocation problem in a container terminal”, Computers & Industrial Engineering, vol. 56, no. 1, pp. 44– 52, 2009. Bierwirth C., Meisel F., “A fast heuristic for quay crane scheduling with interference constraints”, Journal of Scheduling, vol. 12, no. 4, pp. 345– 360, 2009. Bierwirth C., Meisel F., “A survey of berth allocation and quay crane scheduling problems in container terminals”, European Journal of Operational Research, vol. 202, no. 3, pp. 615– 627, 2010. Bierwirth C., Meisel F., “A follow-up survey of berth allocation and quay crane scheduling problems in container terminals”, European Journal of Operational Research, vol. 244, no. 3, pp. 675– 689, 2015. Birattari M., Paquete L., Stutzle T. et al., “ Classification of metaheuristics and design of experiments for the analysis of components”, report, Darmstadt University of Technology, Germany, 2001. Blum C., Roli A., “Metaheuristics in combinatorial optimization: Overview and conceptual comparison”, ACM Computing Surveys, vol. 35, no. 3, pp. 268– 308, 2003. Bonyadi M.R., Michalewicz Z., “Particle swarm optimization for single objective continuous space problems: a review”, Evolutionary Computation, vol. 25, no. 1, pp. 1– 54, 2017. Boysen N., Briskorn D., Meisel F., “A generalized classification scheme for crane scheduling with interference”, European Journal of Operational Research, vol. 258, no. 1, pp. 343– 357, 2017. Branchini R.M., Armentano V.A., Morabito R., “Routing and fleet deployment in liner shipping with spot voyages”, Transportation Research Part C: Emerging Technologies, vol. 57, pp. 188– 205, 2015. Briskorn D., Angeloudis P., “Scheduling co-operating stacking cranes with predetermined container sequences”, Discrete Applied Mathematics, vol. 201, pp. 70– 85, 2016. Brouer B.D., Desaulniers G., Pisinger D., “A metaheuristic for the liner shipping network design problem”, Transportation Research Part E: Logistics and Transportation Review, vol. 72, pp. 42– 59, 2014. Buhrkal K., Zuglian S., Ropke S. et al., “Models for the discrete berth allocation problem: a computational comparison”, Transportation Research Part E: Logistics and Transportation Review, vol. 47, no. 4, pp. 461– 473, 2011. Bullnheimer B., Hartl R.F., Strauss C., “A new rank based version of the ant system - a computational study”, Central European Journal for Operations Research and Economics, vol. 7, pp. 25– 38, 1997. Cao J.X., Shi Q., Lee D.-H., “A decision support method for truck scheduling and storage allocation problem at container”, Tsinghua Science & Technology, vol. 13, suppl 1, pp. 211– 216, 2008. Carlo H.J., Vis I.F.A., Roodbergen K.J., “Transport operations in container terminals: literature overview, trends, research directions and classification scheme”, European Journal of Operational Research, vol. 236, no. 1, pp. 1– 13, 2014. Carlo H.J., Vis I.F.A., Roodbergen K.J., “Storage yard operations in container terminals: literature overview, trends, and research directions”, European Journal of Operational Research, vol. 235, no. 2, pp. 412– 430, 2014. Carnarius J., “ Modes of Transportation Explained. Which is the Best?”, Freight Hub, available at: https://freighthub.com/en/blog/modes-transportation-explained-best/, 2018. Caserta M., Voß S., “ Metaheuristics: intelligent problem solving”, in V. Maniezzo , Stützle T., Voß S. (eds), Metaheuristics: Annals of Information Systems, vol. 10, Springer, Boston, 2009. Chang D., Zuhua W.Y., Chen C.-H. et al., “A berth allocation strategy using heuristics algorithm and simulation optimisation”, International Journal of Computer Applications in Technology, vol. 32, no. 4, pp. 272– 281, 2008. Chang D., Jiang Z., Yan W. et al., “Integrating berth allocation and quay crane assignments”, Transportation Research Part E: Logistics and Transportation Review, vol. 46, no. 6, pp. 975– 990, 2010. Chao S.-L., Lin Y.-J., “Evaluating advanced quay cranes in container terminals”, Transportation Research Part E: Logistics and Transportation Review, vol. 47, no. 4, pp. 432– 445, 2011. Chaudhry I.A., Usman M., “Integrated process planning and scheduling using genetic algorithms”, Tehnički Vjesnik - Technical Gazette, vol. 24, no. 5, pp. 1401– 1409, 2017. Chelouah R., Siarry P., “Tabu search applied to global optimization”, European Journal of Industrial Engineering, vol. 123, no. 2, pp. 256– 270, 2000. Chen C., Huang S.Y., Hsu W.J. et al., “ Platform-based AS/RS for container storage”, IEEE International Conference on Robotics and Automation (ICRA'03), Taipei, Taiwan, pp. 181– 187, 2003. Cheng Y.-L., Sen H.-C., Natarajan K. et al., “Dispatching automated guided vehicles in a container terminal”, Supply Chain Optimization, vol. 98, pp. 355– 389, 2005. Chen L., Bostel N., Dejax P. et al., “A tabu search algorithm for the integrated scheduling problem of container handling systems in a maritime terminal”, European Journal of Operational Research, vol. 181, no. 1, pp. 40– 58, 2007. Chen L., Langevin A., “Multiple yard cranes scheduling for loading operations in a container terminal”, Engineering Optimization, vol. 43, no. 11, pp. 1205– 1221, 2011. Christensen C.G., Holst C.T., “ Berth allocation in container terminal”, PhD thesis, Technical University of Denmark, 2008. Christiansen M., Fagerholt K., Nygreen B. et al., “Ship routing and scheduling in the new millennium”, European Journal of Operational Research, vol. 228, no. 3, pp. 467– 483, 2013. Chu C.Y., Huang W.C., “Determining container terminal capacity on the basis of an adopted yard handling system”, Transport Reviews, vol. 25, no. 2, pp. 181– 199, 2005. Chung S.H., Choy K.L., “A modified genetic algorithm for quay crane scheduling operations”, Expert Systems with Applications, vol. 39, no. 4, pp. 4213– 4221, 2012. Chung S.H., Chan F.T.S., “A workload balancing genetic algorithm for the quay crane scheduling problem”, International Journal of Production Research, vol. 51, no. 16, pp. 4820– 4834, 2013. Collins N.E., Eglese R.W., Golden B.L., “Simulated annealing - an annotated bibliography”, American Journal of Mathematical and Management Sciences, vol. 8, nos 3–4, pp. 209– 307, 1988. Cordeau J.F., Laporte G., Legato P. et al., “Models and tabu search heuristics for the berth allocation problem”, Transportation Science, vol. 39, no. 4, pp. 526– 538, 2005. Correcher J.F., Alvarez-Valdes R., “A biased random-Key genetic algorithm for the time-invariant berth allocation and quay crane assignment problem”, Expert Systems with Applications, vol. 89, pp. 112– 128, 2017. Creutz M., “Microcanonical Monte Carlo simulation”, Physical Review Letters, vol. 50, no. 19, pp. 1411– 1414, 1983. črepinšek M., Liu S.-H., Mernik M., “Exploration and exploitation in evolutionary algorithms”, ACM Computing Surveys, vol. 45, no. 3, pp. 1– 33, 2013. Cvijovicacute D., Klinowski J., “Taboo search: an approach to the multiple minima problem”, Science, vol. 267, no. 5198, pp. 664– 666, 1995. Dabah A., Bendjoudi A., Aitzai A., “An efficient tabu search neighborhood based on reconstruction strategy to solve the blocking job shop scheduling problem”, Journal of Industrial and Management Optimization, vol. 13, no. 4, pp. 29– 29, 2017. Daganzo C.F., “The crane scheduling problem”, Transportation Research Part B, vol. 23, no. 3, pp. 159– 175, 1989. Das S.K., Spasovic L., “Scheduling material handling vehicles in a container terminal”, Production Planning and Control, vol. 14, no. 7, pp. 623– 633, 2003. De A., Mamanduru V.K.R., Gunasekaran A. et al., “Composite particle algorithm for sustainable integrated dynamic ship routing and scheduling optimization”, Computers & Industrial Engineering, vol. 96, pp. 201– 215, 2016. De A., Kumar S.K., Gunasekaran A. et al., “Sustainable maritime inventory routing problem with time window constraints”, Engineering Applications of Artificial Intelligence, vol. 61, pp. 77– 95, 2017. Deneubourg J.L., Aron S., Goss S. et al., “The self-organizing exploratory pattern of the argentine ant”, Journal of Insect Behavior, vol. 3, no. 2, pp. 159– 168, 1990. Dorigo M., Maniezzo V., Colorni A., Positive feedback as a search strategy, Technical Report no. 91-016, Politecnico di Milano, Italy, 1991. Dorigo M., Optimization, learning and natural algorithms, PhD thesis, Politecnico di Milano, Italy, 1992. Dorigo M., Maniezzo V., Colorni A., “Ant system: Optimization by a colony of cooperating agents”, IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics, vol. 26, no. 1, pp. 29– 41, 1996. Dorigo M., Gambardella L.M., “Ant colony system: A cooperative learning approach to the traveling salesman problem”, IEEE Transactions on Evolutionary Computation, vol. 1, no. 1, pp. 53– 66, 1997. Dorigo M., Di Caro G., “The ant colony optimization meta-heuristic”, New Ideas in Optimization, vol. 2, pp. 11– 32, 1999. Dorigo M., Di Caro G., Gambardella L.M., “Ant algorithms for discrete optimization”, Artificial Life, vol. 5, no. 2, pp. 137– 172, 1999. Dorigo M., Stutzle T., Ant Colony Optimization, MIT Press, 2004. Dueck G., Scheuer T., “Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing”, Journal of Computational Physics, vol. 90, no. 1, pp. 161– 175, 1990. Dulebenets M.A., “ Green vessel scheduling in liner shipping: Modeling carbon dioxide emission costs in sea and at ports of call”, International Journal of Transportation Science and Technology, available online: https://www.sciencedirect.com/science/article/pii/S204604301730045X, 2017. Eberhart R., Kennedy J., “ A new optimizer using particle swarm theory”, Proceedings of the Sixth International Symposium on Micro Machine and Human Science, pp. 39– 43, 1995. Eberhart R., Simpson P.K., Dobbins R.W., Computational Intelligence PC Tools, AP Professional, San Diego, 1996. Elmi A., Topaloglu S., “Cyclic job shop robotic cell scheduling problem: Ant colony optimization”, Computers & Industrial Engineering, vol. 111, pp. 417– 432, 2017. Engelbrecht A.P., “Particle swarm optimization with crossover: a review and empirical analysis”, Artificial Intelligence Review, vol. 45, no. 2, pp. 131– 165, 2016. Ernst A.T., Oguz C., Singh G. et al., “Mathematical models for the berth allocation problem in dry bulk terminals”, Journal of Scheduling, vol. 20, no. 5, pp. 1– 15, 2017. European Commission , Study on the analysis and evolution of international and EU shipping, report, University of Antwerp, Belgium, 2015. Fagerholt K., Gausel N.T., Rakke J.G. et al., “Maritime routing and speed optimization with emission control areas”, Transportation Research Part C: Emerging Technologies, vol. 52, pp. 57– 73, 2015. Fathi M., Rodríguez V., Fontes D.B.M.M. et al., “A modified particle swarm optimisation algorithm to solve the part feeding problem at assembly lines”, International Journal of Production Research, vol. 54, no. 3, pp. 878– 893, 2016. Fitzgerald J.M., Ryan C., Medernach D., “ An integrated approach to stage 1 breast cancer detection”, Proceedings of the 2015 Annual Conference on Genetic and Evolutionary Computation - GECCO'15, pp. 1199– 1206, 2015. Fontes D.B.M.M., Gonçalves J.F., “Heuristic solutions for general concave minimum cost network flow problems”, Networks, vol. 50, no. 1, pp. 67– 76, 2007. Fontes D.B.M.M., Gonçalves J.F., “A multi-population hybrid biased random key genetic algorithm for hop-constrained trees in nonlinear cost flow networks”, Optimization Letters, vol. 7, no. 6, pp. 1303– 1324, 2013. Fontes D.B.M.M., Gonçalves J.F., “ A genetic algorithm for scheduling alternative tasks subject to technical failure”, Proceedings in Mathematics and Statistics, Springer, Cham, Switzerland, pp. 139– 152, 2015. Ganji S.R.S., Babazadeh A., Arabshahi N., “Analysis of the continuous berth allocation problem in container ports using a genetic algorithm”, Journal of Marine Science and Technology, vol. 15, no. 4, pp. 408– 416, 2010. Gelareh S., Merzouki R., Mcginley K. et al., “Scheduling of intelligent and atonomous vehicles under pairing/unpairing collaboration strategy in container terminals”, Transportation Research Part C: Emerging Technologies, vol. 33, pp. 1– 21, 2013. Geman S., Geman D., “Stochastic relaxation, Gibbs distributions, and the bayesian restoration of images”, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 6, no. 6, pp. 721– 741, 1984. Gendreau M., “An introduction to tabu search”, Handbook of Metaheuristics, vol. 57, pp. 37– 54, July 2003. Gendreau M., Potvin J.-Y., “Tabu search”, Search Methodologies, Springer, Boston, pp. 243– 263, 2014. Gharehgozli A.H., Vernooij F.G., Zaerpour N., “A simulation study of the performance of twin automated stacking cranes at a seaport container terminal”, European Journal of Operational Research, vol. 261, no. 1, pp. 108– 128, 2017. Gilbert R., Irwin N., Hollingworth B. et al., “Sustainable transportation performance indicators”, Sustainable Development, pp. 1– 20, 2002. Glover F., “Future paths for integer programming and links to artificial intelligence”, Computers & Operations Research, vol. 13, no. 5, pp. 533– 549, 1986. Glover F., “Tabu Search – Part I”, ORSA Journal on Computing, vol. 21, no. 3, pp. 4– 32, 1989. Glover F., “Tabu Search – Part II”, ORSA Journal on Computing, vol. 2, no. 1, pp. 4– 32, 1990. Glover F., Laguna M., Modern Heuristic Techniques for Combinatorial Problems, Halsted Press, 1993. Glover F., “Tabu search for nonlinear and parametric optimization (with links to genetic algorithms)”, Discrete Applied Mathematics, vol. 49, nos 1–3, pp. 231– 255, 1994. Glover F., Laguna M., Tabu Search, Springer, 1997. Glover F., “Tabu search wellsprings and challenges”, European Journal of Operational Research, vol. 106, no. 5, pp. 221– 222, 1998. Glover F., “Tabu search – Uncharted domains”, Annals of Operations Research, vol. 149, no. 1, pp. 89– 98, 2007. Goodchild A., Daganzo C.F., “Crane double cycling in container ports: Planning methods and evaluation”, Transportation Research Part B: Methodological, vol. 41, no. 8, pp. 875– 891, 2007. Goss S., Deneuborg J.L., Pasteels J.M., “Self-organized shortcuts in the Argentine ant”, Naturwissenschaften, vol. 76, no. 1959, pp. 579– 581, 1989. Grunow M., Günther H.-O., Lehmann M., “Dispatching multi-load AGVs in highly automated seaport container terminals”, OR Spectrum, vol. 26, no. 2, pp. 211– 235, 2004. Grunow M., Günther H.-O., Lehmann M., “Strategies for dispatching AGVs at automated seaport container terminals”, OR Spectrum, vol. 28, no. 4, pp. 587– 610, 2006. Guan Y., Cheung R.K., “ The berth allocation problem: models and solution methods”, in H.-O. Günther , K.H. Kim (eds), Container Terminals and Automated Transport Systems, Springer, pp. 141– 158, 2005. Guan Y., Yang K.H., “Analysis of berth allocation and inspection operations in a container terminal”, Maritime Economics and Logistics, vol. 12, no. 4, pp. 347– 369, 2010. Guldogan E., “Simulation-based analysis for hierarchical storage assignment policies in a container terminal”, Simulation, vol. 87, no. 6, pp. 523– 537, 2011. Hajek B., “Cooling schedules for optimal annealing”, Mathematics of Operations Research, vol. 13, no. 2, pp. 311– 329, 1988. Hartmann S., “A general framework for scheduling equipment and manpower at container terminals”, OR Spectrum, vol. 26, no. 1, pp. 51– 74, 2004. He J., Chang D., Mi W. et al., “A hybrid parallel genetic algorithm for yard crane scheduling”, Transportation Research Part E: Logistics and Transportation Review, vol. 46, no. 1, pp. 136– 155, 2010. He J., Huang Y., Yan W., “Yard crane scheduling in a container terminal for the trade-off between efficiency and energy consumption”, Advanced Engineering Informatics, vol. 29, no. 1, pp. 59– 75, 2015. He J., Huang Y., Yan W. et al., “Integrated internal truck, yard crane and quay crane scheduling in a container terminal considering energy consumption”, Expert Systems with Applications, vol. 42, no. 5, pp. 2464– 2487, 2015. He J., “Berth allocation and quay crane assignment in a container terminal for the trade-off between time-saving and energy-saving”, Advanced Engineering Informatics, vol. 30, no. 3, pp. 390– 405, 2016. He R., Ma C., Jia X. et al., “Optimisation of dangerous goods transport based on the improved ant colony algorithm”, International Journal of Computing Science and Mathematics, vol. 8, no. 3, pp. 210– 217, 2017. Hertz A., De werra D., “The tabu search metaheuristic: How we used it”, Annals of Mathematics and Artificial Intelligence, vol. 1, nos 1–4, pp. 111– 121, 1990. Hillebrand J.F., “ Carbon Emissions Calculator: User Guide”, available at: https://www.jfhillebrand.com/SitePages/en/Carbon_calculator_readme.aspx, 2018. Holland . J.H., Adaptation in Natural and Artificial Systems, MIT Press, 1992. Homayouni S.M., Tang S.H., Ismail N., “Development of genetic fuzzy logic controllers for complex production systems”, Computers & Industrial Engineering, vol. 57, no. 4, pp. 1247– 1257, 2009. Homayouni S.M., Vasili M.R., Kazemi S.M. et al., “ Integrated scheduling of SP-AS/RS and handling equipment in automated container terminals”, Proceedings of the International Conference on Computers & Industrial Engineering, 2012. Homayouni S.M., Tang S.H., “ Multi objective optimization of coordinated scheduling of cranes and vehicles at container terminals”, Mathematical Problems in Engineering, Article ID 746781, p. 9, 2013. Homayouni S.M., Tang S.H., Motlagh O., “A genetic algorithm for optimization of integrated scheduling of cranes, vehicles, and storage platforms at automated container terminals”, Journal of Computational and Applied Mathematics, vol. 270, pp. 545– 556, 2014. Homayouni S.M., Tang S.H., “Optimization of integrated scheduling of handling and storage operations at automated container terminals”, WMU Journal of Maritime Affairs, vol. 15, no. 1, pp. 17– 39, 2016. Hsu H.P., “A HPSO for solving dynamic and discrete berth allocation problem and dynamic quay crane assignment problem simultaneously”, Swarm and Evolutionary Computation, vol. 27, pp. 156– 168, 2016. Hu Q.M., Hu Z.H., Du Y., “Berth and quay-crane allocation problem considering fuel consumption and emissions from vessels”, Computers & Industrial Engineering, vol. 70, no. 1, pp. 1– 10, 2014. Hu Y.H., Huang S.Y., Chen C. et al., “Travel time analysis of a new automated storage and retrieval system”, Computers & Operations Research, vol. 32, no. 6, pp. 1515– 1544, 2005. Hu Y.H., Zhu Z., Hsu W., “AS/RS based yard and yard planning”, Journal of Zhejiang University - Science A, vol. 9, no. 8, pp. 1083– 1089, 2008. Hu Z.H., “Multi-objective genetic algorithm for berth allocation problem considering daytime preference”, Computers & Industrial Engineering, vol. 89, pp. 2– 14, 2015. Hu Z.H., Sheu J.B., Luo J.X., “Sequencing twin automated stacking cranes in a block at automated container terminal”, Transportation Research Part C: Emerging Technologies, vol. 69, pp. 208– 227, 2016. Huang S.Y., Li Y., “Yard crane scheduling to minimize total weighted vessel loading time in container terminals”, Flexible Services and Manufacturing Journal, vol. 29, pp. 689– 720, 2017. Imai A., Nishimura E., Hattori M. et al., “Berth allocation at indented berths for mega-containerships”, European Journal of Operational Research, vol. 179, no. 2, pp. 579– 593, 2007. Imai A., Chen H.C., Nishimura E. et al., “The simultaneous berth and quay crane allocation problem”, Transportation Research Part E: Logistics and Transportation Review, vol. 44, no. 5, pp. 900– 920, 2008. IMO, “ International Convention for the Prevention of Pollution from Ships (MARPOL)”, available at: http://www.imo.org/en/about/conventions/listofconventions/pages/international-convention-for-the-prevention-of-pollution-from-ships-(marpol).aspx, 2018. Jeon S.M., Kim K.H., Kopfer H., “Routing automated guided vehicles in container terminals through the Q-learning technique”, Logistic Research, vol. 3, no. 1, pp. 19– 27, 2010. Jerald J., Asokan P., Saravanan R. et al., “Simultaneous scheduling of parts and automated guided vehicles in an FMS environment using adaptive genetic algorithm”, The International Journal of Advanced Manufacturing Technology, vol. 29, no. 5, pp. 584– 589, 2006. Kaddouri Z., Omary F., “Application of the tabusearch algorithm to cryptography”, International Journal of Advanced Computer Science and Applications, vol. 8, no. 7, pp. 82– 87, 2017. Kadri R.L., Boctor F.F., “An efficient genetic algorithm to solve the resource-constrained project scheduling problem with transfer times: The single mode case”, European Journal of Operational Research, vol. 265, no. 2, pp. 454– 462, 2018. Kemme N., Design and Operation of Automated Container Storage Systems, Springer-Verlag, Berlin Heidelberg, 2013. Kennedy J., Eberhart R.C., Swarm intelligence, Morgan Kaufmann Publishers, San Francisco, California, 2001. Kennedy J., Mendes R., “ Population structure and particle swarm performance”, Proceedings of the 2002 Congress on Evolutionary Computation, pp. 1671– 1676, 2002. Kim K.H., Park K.T., “A note on a dynamic space-allocation method for outbound containers”, European Journal of Operational Research, vol. 148, no. 1, pp. 92– 101, 2003. Kim K.H., Park Y.-M., “A crane scheduling method for port container terminals”, European Journal of Operational Research, vol. 156, no. 3, pp. 752– 768, 2004. Kirkpatrick S., Gelatt C.D., Vecchi M.P. et al., “Optimization by simulated annealing”, Science, vol. 220, no. 4598, pp. 671– 680, 1983. Kjeldsen K.H., “Classification of ship routing and scheduling problems in liner shipping”, INFOR: Information Systems and Operational Research, vol. 49, no. 2, pp. 139– 152, 2011. Klerides E., Hadjiconstantinou E., “Modelling and solution approaches to the multi-load AGV dispatching problem in container terminals”, Maritime Economics & Logistics, vol. 13, no. 4, pp. 371– 386, 2011. Kontovas C.A., Psaraftis A.H.N., “Reduction of emissions along the maritime intermodal container chain: Operational models and policies”, Maritime Policy and Management, vol. 38, no. 4, pp. 451– 469, 2011. Kontovas C.A., “The green ship routing and scheduling problem (GSRSP): a conceptual approach”, Transportation Research Part D: Transport and Environment, vol. 31, pp. 61– 69, 2014. Koo P.H., Lee W.S., Jang D.W., “ Fleet sizing and vehicle routing for container transportation in a static environment”, in H.-O. Günther , K.H. Kim (eds), Container Terminals and Automated Transport Systems, Springer-Verlag, Berlin, Heidelberg, pp. 123– 139, 2005. Kosmas O.T., Vlachos D.S., “Simulated annealing for optimal ship routing”, Computers & Operations Research, vol. 39, no. 3, pp. 576– 581, 2012. Kozan E., Preston P., “Mathematical modelling of container transfers and storage locations at seaport terminals”, OR Spectrum, vol. 28, no. 4, pp. 519– 537, 2006. Labadie N., Prins C., Prodhon C. et al., Metaheuristics for Vehicle Routing Problems, ISTE Ltd and John Wiley & Sons, Inc., 2016. Lalla-Ruiz E., Meliàn-Batista B., Marcos Moreno-Vega J.M., “Artificial intelligence hybrid heuristic based on tabu search for the dynamic berth allocation problem”, Engineering Applications of Artificial Intelligence, vol. 25, no. 6, pp. 1132– 1141, 2012. Lalla-Ruiz E., Gonzàlez-Velarde J.L., Meliàn-Batista B. et al., “Biased random key genetic algorithm for the tactical berth allocation problem”, Applied Soft Computing Journal, vol. 22, pp. 60– 76, 2014. Lalla-Ruiz E., Voß S., “POPMUSIC as a metaheuristic for the berth allocation problem”, Annals of Mathematics and Artificial Intelligence, vol. 76, no. 1, pp. 173– 189, 2016. Lau H.Y.K., Zhao Y., “Integrated scheduling of handling equipment at automated container terminals”, International Journal of Production Economics, vol. 112, no. 2, pp. 665– 682, 2008. Lee D.-H., Wang H.Q., Miao L., “Quay crane scheduling with non-interference constraints in port container terminals”, Transportation Research Part E: Logistics and Transportation Review, vol. 44, no. 1, pp. 124– 135, 2008. Lee Y., Chen C.-Y., “An optimization heuristic for the berth scheduling problem”, European Journal of Operational Research, vol. 196, no. 2, pp. 500– 508, 200" @default.
• W4211036782 created "2022-02-13" @default.
• W4211036782 date "2018-04-16" @default.
• W4211036782 modified "2023-10-12" @default.
• W4211036782 title "Bibliography" @default.
• W4211036782 cites W1196588918 @default.
• W4211036782 cites W1220400756 @default.
• W4211036782 cites W125070839 @default.
• W4211036782 cites W1477041543 @default.
• W4211036782 cites W1508826756 @default.
• W4211036782 cites W1526983948 @default.
• W4211036782 cites W1560921017 @default.
• W4211036782 cites W1659842140 @default.
• W4211036782 cites W1869490811 @default.
• W4211036782 cites W1911731270 @default.
• W4211036782 cites W1927383638 @default.
• W4211036782 cites W1967438518 @default.
• W4211036782 cites W1967944787 @default.
• W4211036782 cites W1968075052 @default.
• W4211036782 cites W1968350460 @default.
• W4211036782 cites W1968382295 @default.
• W4211036782 cites W1968490382 @default.
• W4211036782 cites W1969051995 @default.
• W4211036782 cites W1971828563 @default.
• W4211036782 cites W1972226854 @default.
• W4211036782 cites W1972431503 @default.
• W4211036782 cites W1975826221 @default.
• W4211036782 cites W1976473152 @default.
• W4211036782 cites W1977135124 @default.
• W4211036782 cites W1981426770 @default.
• W4211036782 cites W1983676580 @default.
• W4211036782 cites W1984150325 @default.
• W4211036782 cites W1985031570 @default.
• W4211036782 cites W1985183793 @default.
• W4211036782 cites W1985665328 @default.
• W4211036782 cites W1986567917 @default.
• W4211036782 cites W1988196959 @default.
• W4211036782 cites W1989353689 @default.
• W4211036782 cites W1989594682 @default.
• W4211036782 cites W1992052799 @default.
• W4211036782 cites W1993506538 @default.
• W4211036782 cites W1994650215 @default.
• W4211036782 cites W1996055338 @default.
• W4211036782 cites W1996157625 @default.
• W4211036782 cites W1997472486 @default.
• W4211036782 cites W1998016704 @default.
• W4211036782 cites W1998397737 @default.
• W4211036782 cites W1998748861 @default.
• W4211036782 cites W1999148642 @default.
• W4211036782 cites W1999659503 @default.
• W4211036782 cites W1999879912 @default.
• W4211036782 cites W2002602643 @default.
• W4211036782 cites W2002623185 @default.
• W4211036782 cites W2003811609 @default.
• W4211036782 cites W2004115473 @default.
• W4211036782 cites W2005228957 @default.
• W4211036782 cites W2009324453 @default.
• W4211036782 cites W2009331272 @default.
• W4211036782 cites W2011013887 @default.
• W4211036782 cites W2011198146 @default.
• W4211036782 cites W2011867040 @default.
• W4211036782 cites W2013972939 @default.
• W4211036782 cites W2014768038 @default.
• W4211036782 cites W2015944652 @default.
• W4211036782 cites W2017332073 @default.
• W4211036782 cites W2018957623 @default.
• W4211036782 cites W2019200365 @default.
• W4211036782 cites W2020999234 @default.
• W4211036782 cites W2024060531 @default.
• W4211036782 cites W2024900560 @default.
• W4211036782 cites W2025921980 @default.
• W4211036782 cites W2026545122 @default.
• W4211036782 cites W2027603927 @default.
• W4211036782 cites W2028022276 @default.
• W4211036782 cites W2028812472 @default.
• W4211036782 cites W2029838689 @default.
• W4211036782 cites W2031077466 @default.
• W4211036782 cites W2031236641 @default.
• W4211036782 cites W2031807869 @default.
• W4211036782 cites W2033413129 @default.
• W4211036782 cites W2033652861 @default.
• W4211036782 cites W2034238820 @default.
• W4211036782 cites W2035295931 @default.
• W4211036782 cites W2035782748 @default.
• W4211036782 cites W2037567262 @default.
• W4211036782 cites W2037915070 @default.
• W4211036782 cites W2039568841 @default.
• W4211036782 cites W2040579240 @default.
• W4211036782 cites W2044122946 @default.
• W4211036782 cites W2045193520 @default.
• W4211036782 cites W2045793973 @default.
• W4211036782 cites W2047449665 @default.
• W4211036782 cites W2047954155 @default.
• W4211036782 cites W2048282166 @default.
• W4211036782 cites W2049355060 @default.
• W4211036782 cites W2050854646 @default.
• W4211036782 cites W2051603269 @default.
• W4211036782 cites W2051928468 @default.

• next