Fuzzy programming model and algorithm of port tugboat scheduling

被引：0
|
作者：
Li B. [1 ]
Wang Z. [1 ]
Zhou H. [1 ]
Ren Y. [2 ]
机构：
[1] Department of Port & Shipping Management, Guangzhou Maritime University, Guangzhou
[2] School of Economics & Management, Shanghai Maritime University, Shanghai
来源：
Jisuanji Jicheng Zhizao Xitong/Computer Integrated Manufacturing Systems, CIMS | 2021年 / 27卷 / 05期
关键词：
Fuzzy programming; Multi-berthing bases; Tugboat scheduling; Whale optimization algorithm;
D O I：
10.13196/j.cims.2021.05.027
中图分类号：
学科分类号：
摘要：
To solve the problem of port tugboat dispatching optimization under uncertain environment, considering its fuzziness and decision-making of port tugboat operation allocation plan, an integrated fuzzy programming model for port tugboat scheduling was established with minimum total fuel cost and multiple berthing bases conditions of tugboat. According to the characteristics of the problem, whale optimization-genetic hybrid algorithm based on scheduling plan coding was designed, and the results of several examples were compared and analyzed by using hybrid algorithm, CPLEX and Memetic algorithm. The results validated the feasibility of the proposed hybrid algorithm, and the change of credibility level was analyzed to show the applicability of fuzzy programming model. © 2021, Editorial Department of CIMS. All right reserved.
引用
收藏
页码：1518 / 1530
页数：12
相关论文
共 30 条
  • [1] PENTICO D W., Assignment problems: A golden anniversary survey, European Journal of Operational Research, 176, 2, pp. 774-793, (2007)
  • [2] KUHN H W., The Hungarian method for the assignment problem, Naval Research Logistics, 52, 1-2, pp. 7-27, (2005)
  • [3] ZHANG Z, DAIGLE J., Analysis of job assignment with batch arrivals among heterogeneous servers, European Journal of Operational Research, 217, 1, pp. 149-161, (2012)
  • [4] PISINGER D., An exact algorithm for large multiple knapsack problems, European Journal of Operational Research, 114, 3, pp. 528-541, (1999)
  • [5] LAALAOUI Y, M'HALLAH R., A binary multiple knapsack model for single machine scheduling with machine unavailability, Computers & Operations Research, 72, pp. 71-82, (2016)
  • [6] DIMITROV N B, SOLOW D, SZMEREKOVSKY J, Et al., Emergency relocation of items using single trips: Special cases of the multiple knapsack assignment problem, European Journal of Operational Research, 258, 3, pp. 938-942, (2017)
  • [7] KATAOKA S, YAMADA T., Upper and lower bounding procedures for the multiple knapsack assignment problem, European Journal of Operational Research, 237, 2, pp. 440-447, (2014)
  • [8] ZHEN L., Tactical berth allocation under uncertainty, European Journal of Operational Research, 247, 3, pp. 928-944, (2015)
  • [9] ZHEN L, WANG S, WANG K., Terminal allocation problem in a transshipment hub considering bunker consumption, Naval Research Logistics, 63, 7, pp. 529-548, (2016)
  • [10] LIU Zhixiong, WANG Shaomei, Research on bi-objectives parallel machines scheduling problem with special process constraint, Computer Integrated Manufacturing Systems, 11, 11, pp. 1616-1620, (2005)
123