Berth allocation and quay crane-yard truck assignment considering carbon emissions in port area

被引:22
|
作者
Wang, Tingsong [1 ]
Li, Man [1 ]
Hu, Hongtao [2 ]
机构
[1] Wuhan Univ, Sch Econ & Management, Wuhan 430072, Hubei, Peoples R China
[2] Shanghai Maritime Univ, Coll Logist Engn, Shanghai 201306, Peoples R China
基金
国家教育部科学基金资助; 中国国家自然科学基金;
关键词
B-QC-YTAP; carbon emissions; service efficiency; NSGA-II; multi-objective; CONTAINER TERMINAL OPERATION; GENETIC ALGORITHM; SCHEDULING METHOD; FUEL CONSUMPTION; TRADE-OFF; EFFICIENCY; MODEL;
D O I
10.1504/IJSTL.2019.099275
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
As environmental issues become increasingly prominent, the green port has been the focus of marine industry to sustain the development of global economy. Carbon emissions of port area mainly come from water area and land area of port. The effective resource allocation and equipment assignment can not only reduce the carbon emissions, but also improve the service efficiency. Thus, this paper considers the berth-quay crane-yard truck allocation problem (B-QC-YTAP) and formulates it as a multi-objective model, where the objectives are to minimise the total carbon emissions in port area, and minimise the average waiting time in port and departure delay for each vessel. To solve the proposed model as well as obtain the Pareto optimal solutions, the non-dominated sorting genetic algorithm II (NSGA-II) is also introduced. Finally, a numerical experiment is conducted to test the effectiveness of model and algorithm, followed by the trade-off analysis between the two objectives.
引用
收藏
页码:216 / 242
页数:27
相关论文
共 50 条
  • [41] Integrated quay crane and yard truck scheduling problem at port of Tripoli-Lebanon
    Skaf, Ali
    Lamrous, Sid
    Hammoudan, Zakaria
    Manier, Marie-Ange
    [J]. COMPUTERS & INDUSTRIAL ENGINEERING, 2021, 159
  • [42] Integrated internal truck, yard crane and quay crane scheduling in a container terminal considering energy consumption
    He, Junliang
    Huan, Youfang
    Yan, Wei
    Wang, Shuaian
    [J]. EXPERT SYSTEMS WITH APPLICATIONS, 2015, 42 (05) : 2464 - 2487
  • [43] An almost robust optimization model for integrated berth allocation and quay crane assignment problem
    Xiang, Xi
    Liu, Changchun
    [J]. OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE, 2021, 104
  • [44] An optimization approach for coupling problem of berth allocation and quay crane assignment in container terminal
    Yang, Chunxia
    Wang, Xiaojun
    Li, Zhenfeng
    [J]. COMPUTERS & INDUSTRIAL ENGINEERING, 2012, 63 (01) : 243 - 253
  • [45] Optimal berth allocation and time-invariant quay crane assignment in container terminals
    Turkogullari, Yavuz B.
    Taskin, Z. Caner
    Aras, Necati
    Altinel, I. Kuban
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2014, 235 (01) : 88 - 101
  • [46] Discretization-Strategy-Based Solution for Berth Allocation and Quay Crane Assignment Problem
    Tang, Min
    Ji, Bin
    Fang, Xiaoping
    Yu, Samson S.
    [J]. JOURNAL OF MARINE SCIENCE AND ENGINEERING, 2022, 10 (04)
  • [47] Simultaneous waterway scheduling, berth allocation, and quay crane assignment: A novel matheuristic approach
    Fatemi-Anaraki, Soroush
    Tavakkoli-Moghaddam, Reza
    Abdolhamidi, Dorsa
    Vahedi-Nouri, Behdin
    [J]. INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2021, 59 (24) : 7576 - 7593
  • [48] Reactive strategy for discrete berth allocation and quay crane assignment problems under uncertainty
    Xiang, Xi
    Liu, Changchun
    Miao, Lixin
    [J]. COMPUTERS & INDUSTRIAL ENGINEERING, 2018, 126 : 196 - 216
  • [49] A Multi-objective Genetic Algorithm for Berth Allocation and Quay Crane Assignment Problem
    Ji Xiaotao
    Du Yuquan
    Chen Qiushuang
    [J]. 2011 CHINESE CONTROL AND DECISION CONFERENCE, VOLS 1-6, 2011, : 891 - 896
  • [50] The impacts of time segment modeling in berth allocation and quay crane assignment on terminal efficiency
    Ma, Hoi-Lam
    Wang, Zhengxu
    Chung, S. H.
    Chan, Felix T. S.
    [J]. INDUSTRIAL MANAGEMENT & DATA SYSTEMS, 2019, 119 (05) : 968 - 992