• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Transportation research, Part D. Transport and environment >A Bi-objective green tugboat scheduling problem with the tidal port time windows
【24h】

A Bi-objective green tugboat scheduling problem with the tidal port time windows

机译：A Bi-objective green tugboat scheduling problem with the tidal port time windows

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相关主题

摘要

Tugboat assistance is essential when large ships are berthing and unberthing, and requires ports to produce efficient tugboat schedules considering various constraints. Few studies optimize tugboat scheduling from multiple vectors simultaneously, however. This paper thus constructs a bi-objective, mixed-integer linear programming, green tugboat scheduling model in order to minimize the maximum completion time and total fuel consumption, which improves port service levels, decreases tugboat company operating expenditures and thus environmental pollution emissions. The proposed model also considers the time window characteristics of the tidal port. We use the non-dominated sorting genetic algorithm Ⅱ (NSGA-Ⅱ) framework integrating the characteristics of tugboat scheduling to solve the model. Finally, we make a case study about Guangzhou Port to validate the model and the algorithm via a comparison of results solved by NSGA-Ⅱ and CPLEX solver. The Pareto fronts obtained show the trade-off relationship between the two objectives, and provide a basis for port tugboat scheduling plans.

著录项

获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号