An Improved Shuffled Frog-Leaping Algorithm for Solving the Dynamic and Continuous Berth Allocation Problem (DCBAP)
暂无分享,去创建一个
[1] Xin Zhao,et al. Optimal Local Dimming Based on an Improved Shuffled Frog Leaping Algorithm , 2018, IEEE Access.
[2] Chung-lun Li,et al. Scheduling with multiple-job-on-one-processor pattern , 1998 .
[3] Christian Bierwirth,et al. A follow-up survey of berth allocation and quay crane scheduling problems in container terminals , 2015, Eur. J. Oper. Res..
[4] Martin Middendorf,et al. A hierarchical particle swarm optimizer and its adaptive variant , 2005, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).
[5] Daofang Chang,et al. Integrating Berth Allocation and Quay Crane Assignments , 2010 .
[6] Akio Imai,et al. BERTH ALLOCATION IN A CONTAINER PORT: USING A CONTINUOUS LOCATION SPACE APPROACH , 2005 .
[7] Akio Imai,et al. Berth allocation planning in the public berth system by genetic algorithms , 2001, Eur. J. Oper. Res..
[8] Guang-Yu Zhu,et al. An improved Shuffled Frog-leaping Algorithm to optimize component pick-and-place sequencing optimization problem , 2014, Expert Syst. Appl..
[9] Hsien-Pin Hsu,et al. A HPSO for solving dynamic and discrete berth allocation problem and dynamic quay crane assignment problem simultaneously , 2016, Swarm Evol. Comput..
[10] Kap Hwan Kim,et al. Berth scheduling for container terminals by using a sub-gradient optimization technique , 2002, J. Oper. Res. Soc..
[11] Gerald G. Brown,et al. Optimizing Submarine Berthing with a Persistence Incentive , 1997 .
[12] Bin Hu,et al. Feature Selection for Optimized High-Dimensional Biomedical Data Using an Improved Shuffled Frog Leaping Algorithm , 2018, IEEE/ACM Transactions on Computational Biology and Bioinformatics.
[13] Yusin Lee,et al. An optimization heuristic for the berth scheduling problem , 2009, Eur. J. Oper. Res..
[14] Kevin E Lansey,et al. Optimization of Water Distribution Network Design Using the Shuffled Frog Leaping Algorithm , 2003 .
[15] Christine Solnon,et al. A study of ACO capabilities for solving the maximum clique problem , 2006, J. Heuristics.
[16] Donald E. Grierson,et al. A modified shuffled frog-leaping optimization algorithm: applications to project management , 2007 .
[17] Luca Maria Gambardella,et al. Ant colony system: a cooperative learning approach to the traveling salesman problem , 1997, IEEE Trans. Evol. Comput..
[18] Andrew Lim,et al. A stochastic beam search for the berth allocation problem , 2007, Decis. Support Syst..
[19] Chung-Lun Li,et al. A multiprocessor task scheduling model for berth allocation: heuristic and worst-case analysis , 2002, Oper. Res. Lett..
[20] Akio Imai,et al. Berth allocation with service priority , 2003 .
[21] Andrew Lim,et al. The berth planning problem , 1998, Oper. Res. Lett..
[22] Iris F. A. Vis,et al. Transshipment of containers at a container terminal: An overview , 2003, Eur. J. Oper. Res..
[23] Li-feng Xi,et al. A proactive approach for simultaneous berth and quay crane scheduling problem with stochastic arrival and handling time , 2010, Eur. J. Oper. Res..
[24] Xia Li,et al. A novel hybrid shuffled frog leaping algorithm for vehicle routing problem with time windows , 2015, Inf. Sci..
[25] Damodar Reddy Edla,et al. An Efficient Load Balancing of Gateways Using Improved Shuffled Frog Leaping Algorithm and Novel Fitness Function for WSNs , 2017, IEEE Sensors Journal.
[26] Marc Gravel,et al. Scheduling continuous casting of aluminum using a multiple objective ant colony optimization metaheuristic , 2002, Eur. J. Oper. Res..
[27] Christian Bierwirth,et al. A survey of berth allocation and quay crane scheduling problems in container terminals , 2010, Eur. J. Oper. Res..
[28] Yoshikazu Fukuyama,et al. A particle swarm optimization for reactive power and voltage control considering voltage security assessment , 2000 .
[29] Richard F. Hartl,et al. An improved Ant System algorithm for theVehicle Routing Problem , 1999, Ann. Oper. Res..
[30] Mario Rodríguez-Molins,et al. A decision support system for managing combinatorial problems in container terminals , 2012, Knowl. Based Syst..
[31] K. K. Lai,et al. A STUDY OF CONTAINER BERTH ALLOCATION. , 1992 .
[32] Akio Imai,et al. Efficient planning of berth allocation for container terminals in Asia , 1997 .
[33] Sarada Prasad Sarmah,et al. Shuffled frog leaping algorithm and its application to 0/1 knapsack problem , 2014, Appl. Soft Comput..
[34] Loo Hay Lee,et al. A decision model for berth allocation under uncertainty , 2011, Eur. J. Oper. Res..
[35] Yang Yang,et al. Multi-objective hybrid genetic algorithm for quay crane dynamic assignment in berth allocation planning , 2011, J. Intell. Manuf..
[36] Zhipeng Liu,et al. Underwater Sonar Image Detection: A Novel Quantum-Inspired Shuffled Frog Leaping Algorithm , 2018 .
[37] Gerald G. Brown,et al. Optimizing Ship Berthing , 1994 .
[38] Jorge Puente,et al. A genetic algorithm for robust berth allocation and quay crane assignment , 2014, Progress in Artificial Intelligence.
[39] Akio Imai,et al. The Dynamic Berth Allocation Problem for a Container Port , 2001 .
[40] Kap Hwan Kim,et al. Berth scheduling by simulated annealing , 2003 .
[41] Muzaffar Eusuff,et al. Shuffled frog-leaping algorithm: a memetic meta-heuristic for discrete optimization , 2006 .