Cluster Computing

, Volume 22, Supplement 1, pp 859–870 | Cite as

Layered constraint united scheduling model of multi-line lock

  • Xiang PanEmail author


Inland river multi-line lock united scheduling is an important issue during navigation, and scheduling arrangement directly influences waterborne logistic efficiency. The research designs a kind of multi-line lock layered constraint united scheduling algorithm model. A three-layered scheduling constraint algorithm is created based on analyzing lock scheduling principle and influencing factors. The first layer builds lock chamber area matching ship branch lock model, distributing lock with lock chamber priority constraint algorithm model. The second layer builds single lock chamber quick schedule arrangement model, distributing ship to be locked of single lock chamber into lock chamber with constraint arrangement rule and algorithm process. The third layer builds time constraint lock passing model, constructing flexible lockage time algorithm based on size and speed of ship. Optimal solution of multi-line and multi-layer overall scheduling model can maximize utilization of multiple lock chambers and minimize lockage time. Actual measurement data of Changzhou four-line lock scheduling in Xijiang watershed Guangxi China shows that the mean lockage time decreases 37.50% and the mean utilization rate of lock chambers increases 31.31%. The multi-line lock layered constraint united scheduling model can effectively increase lock passing efficiency.


Multi-line lock Layered constraint United scheduling Optimization model 


  1. 1.
    Ji, B., Yuan, X., Yuan, Y.: Orthogonal design-based NSGA-III for the optimal lockage co-scheduling problem. In: IEEE Transactions on Intelligent Transportation Systems, vol. 99, pp. 1–11 (2016)Google Scholar
  2. 2.
    Yuan, Y., et al.: Lockage scheduling of Three Gorges-Gezhouba dams by hybrid of chaotic particle swarm optimization and heuristic-adjusted strategies. Appl. Math. Comput. 270, 74–89 (2015)MathSciNetzbMATHGoogle Scholar
  3. 3.
    Pang, Q.H., Wu, X.Y.: Optimization scheduling model of double line Shiplock based on nonlinear goal programming. J. Appl. Res. Technol. 12(2), 192–200 (2014)CrossRefGoogle Scholar
  4. 4.
    Hermans, J.: Optimization of inland shipping: a polynomial time algorithm for the single-ship single-lock optimization problem. J. Sched. 17(4), 305–319 (2014)MathSciNetCrossRefzbMATHGoogle Scholar
  5. 5.
    Nishi, T., Izuno, T.: Column generation heuristics for ship routing and scheduling problems in crude oil transportation with split deliveries. Comput. Chem. Eng. 60(2), 329–338 (2014)CrossRefGoogle Scholar
  6. 6.
    Nan, L.I., Gui-Hua, L.I., Yin, J.P.: Scheduling algorithm for Xiang river lock chamber. Port Waterw. Eng. 7(3), 171–175 (2013)Google Scholar
  7. 7.
    Zhang, X., et al.: Vessel scheduling model of a one-way port channel. J. Waterw. Port Coast. Ocean Eng. 143(5), 04017009 (2017)CrossRefGoogle Scholar
  8. 8.
    Verstichel, J., et al.: Exact and heuristic methods for placing ships in locks. Eur. J. Oper. Res. 235(2), 387–398 (2014)MathSciNetCrossRefzbMATHGoogle Scholar
  9. 9.
    Xu, J., et al.: Study on the squat of extra-large scale ship in the Three Gorges ship lock. Ocean Eng. 123, 65–74 (2016)CrossRefGoogle Scholar
  10. 10.
    de Armas, J., et al.: A hybrid GRASP-VNS for ship routing and scheduling problem with discretized time windows. Eng. Appl. Artif. Intell. 45, 350–360 (2015)CrossRefGoogle Scholar
  11. 11.
    Lin, J., et al.: Optimization of ship scheduling based on one-way fairway. In: International Conference on Algorithms and Architectures for Parallel Processing, pp. 479–486. Springer, Cham (2014)Google Scholar
  12. 12.
    Wang, X., et al.: An analysis on convergence of data-driven approach to ship lock scheduling. Math. Comput. Simul. 88(1), 31–38 (2013)MathSciNetCrossRefGoogle Scholar
  13. 13.
    Zhang, X., et al.: Vessel transportation scheduling optimization based on channel-berth coordination. Ocean Eng. 112, 145–152 (2016)CrossRefGoogle Scholar
  14. 14.
    Sluiman, F.J.: Transit vessel scheduling. Nav. Res. Logist. 64, 225–248 (2017)MathSciNetCrossRefzbMATHGoogle Scholar
  15. 15.
    Dulebenets, M.A., Ozguven, E.E.: Vessel scheduling in liner shipping: modeling transport of perishable assets. Int. J. Prod. Econ. 184, 141–156 (2017)CrossRefGoogle Scholar
  16. 16.
    Zhang, P., Yu, L.: Shipping organizing measures to improve the throughput capacity of the Three Gorges ship lock. J. Wuhan Univ. Technol. 007, 3 (2014)Google Scholar
  17. 17.
    Dulebenets, M. A.: The vessel scheduling problem in a liner shipping route with heterogeneous fleet. Int. J. Civ. Eng. (2016).
  18. 18.
    Dulebenets, M.A.: The green vessel scheduling problem with transit time requirements in a liner shipping route with Emission Control Areas. Alexandria Engineering Journal, Elseiver (2017)Google Scholar
  19. 19.
    Uchacz, W.: Comparison of the disjunctive graph model with the MILP class model for vessel scheduling applications. In: 2016 21st International Conference on Methods and Models in Automation and Robotics, pp. 525–530. IEEE (2016)Google Scholar
  20. 20.
    Zhang, G., et al.: Ship lock scheduling model based on vessel dynamics. Logist. Technol. 159–162 (2015)Google Scholar
  21. 21.
    Zhen, L., et al.: Models on ship scheduling in transshipment hubs with considering bunker cost. Int. J. Prod. Econ. 173, 111–121 (2016)CrossRefGoogle Scholar
  22. 22.
    Thiruvady, D., Ernst, A.T., Singh, G.: Parallel ant colony optimization for resource constrained job scheduling. Ann. Oper. Res. 242(2), 355–372 (2016)MathSciNetCrossRefzbMATHGoogle Scholar
  23. 23.
    Zhang, Y.Y., Chang, M.S., Fuller, S.W.: Statistical analysis of vessel waiting time and lockage time on the Upper Mississippi River. Marit. Econ. Logist. 17(4), 416–439 (2015)CrossRefGoogle Scholar
  24. 24.
    Shan-Shan, L.I., et al.: Relative utilization rate of lock chamber volume and its application. China Harb. Eng. 44, 1–3 (2014)Google Scholar
  25. 25.
    Kanović, Ž., Bugarski, V., Bačkalić, T.: hip lock control system optimization using GA, PSO and ABC: a comparative review. Promet Traffic Transp. 26(1), 23–31 (2014)Google Scholar

Copyright information

© Springer Science+Business Media, LLC, part of Springer Nature 2017

Authors and Affiliations

  1. 1.Department of Computer ScienceGuangxi Cadres University of Economics and ManagementNanningChina

Personalised recommendations