Simulation and optimization for ship lock scheduling: A case study
暂无分享,去创建一个
[1] Frits C. R. Spieksma,et al. Exact and heuristic methods for placing ships in locks , 2014, Eur. J. Oper. Res..
[2] Edmund K. Burke,et al. The late acceptance Hill-Climbing heuristic , 2017, Eur. J. Oper. Res..
[3] Patrick De Causmaecker,et al. A Combinatorial Benders' decomposition for the lock scheduling problem , 2015, Comput. Oper. Res..
[4] Frits C. R. Spieksma,et al. The generalized lock scheduling problem: An exact approach , 2014 .
[5] Pierre Hansen,et al. Variable Neighborhood Search , 2018, Handbook of Heuristics.
[6] Franklin Farell. Roadmap to a Single European Transport Area: Towards a competitive and resource efficient transport system , 2014 .
[7] Greet Vanden Berghe,et al. A Guide-and-Observe Hyper-Heuristic Approach to the Eternity II Puzzle , 2013, J. Math. Model. Algorithms.
[8] Waldemar Uchacz. Optimum time scheduling of lock traffic , 2013, 2013 18th International Conference on Methods & Models in Automation & Robotics (MMAR).
[9] C. D. Gelatt,et al. Optimization by Simulated Annealing , 1983, Science.
[10] Stefan Voß,et al. The corridor method: a dynamic programming inspired metaheuristic , 2006 .
[11] Mario Cools,et al. Integration of inland waterway transport in the intermodal supply chain: a taxonomy of research challenges , 2014 .