首页> 外文期刊>Advanced engineering informatics >Yard crane scheduling in a container terminal for the trade-off between efficiency and energy consumption
【24h】

Yard crane scheduling in a container terminal for the trade-off between efficiency and energy consumption

机译:集装箱码头的堆场起重机调度在效率和能耗之间进行权衡

获取原文
获取原文并翻译 | 示例

摘要

Green transportation has recently been the focus of the transportation industry to sustain the development of global economy. Container terminals are key nodes in the global transportation network and energy-saving is a main goal for them. Yard crane (YC), as one type of handling equipment, plays an important role in the service efficiency and energy-saving of container terminals. However, traditional methods of YC scheduling solely aim to improve the efficiency of container terminals and do not refer to energy-saving. Therefore, it is imperative to seek an appropriate approach for YC scheduling that considers the trade-off between efficiency and energy consumption. In this paper, the YC scheduling problem is firstly converted into a vehicle routing problem with soft time windows (VRPSTW). This problem is formulated as a mixed integer programming (MIP) model, whose two objectives minimize the total completion delay of all task groups and the total energy consumption of all YCs. Subsequently, an integrated simulation optimization method is developed for solving the problem, where the simulation is designed for evaluating solutions and the optimization algorithm is designed for exploring the solution space. The optimization algorithm integrates the genetic algorithm (GA) and the particle swarm optimization (PSO) algorithm, where the GA is used for global search and the PSO is used for local search. Finally, computational experiments are conducted to validate the performance of the proposed method.
机译:最近,绿色运输已成为运输行业维持全球经济发展的重点。集装箱码头是全球运输网络中的关键节点,节能是其主要目标。堆场起重机(YC)作为一种装卸设备,对集装箱码头的服务效率和节能起着重要作用。然而,传统的YC调度方法仅旨在提高集装箱码头的效率,而不涉及节能。因此,必须为YC调度寻求一种适当的方法,该方法应考虑效率与能耗之间的权衡。本文首先将YC调度问题转换为带有软时间窗(VRPSTW)的车辆路径问题。此问题被公式化为混合整数规划(MIP)模型,其两个目标使所有任务组的总完成延迟和所有YC的总能耗最小。随后,开发了用于解决该问题的集成仿真优化方法,其中设计仿真用于评估解决方案,设计优化算法来探索解决方案空间。该优化算法集成了遗传算法(GA)和粒子群优化(PSO)算法,其中GA用于全局搜索,而PSO用于局部搜索。最后,进行了计算实验以验证所提出方法的性能。

著录项

  • 来源
    《Advanced engineering informatics》 |2015年第1期|59-75|共17页
  • 作者单位

    Engineering Research Center of Container Supply Chain Technology, Ministry of Education, Shanghai Maritime University, Shanghai 201306, PR China, 1550 Haigang Avenue, Lingang New Port City, School of Logistics Engineering, Shanghai Maritime University, Shanghai 201306, PR China;

    Engineering Research Center of Container Supply Chain Technology, Ministry of Education, Shanghai Maritime University, Shanghai 201306, PR China;

    Engineering Research Center of Container Supply Chain Technology, Ministry of Education, Shanghai Maritime University, Shanghai 201306, PR China;

  • 收录信息
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类
  • 关键词

    Yard crane scheduling; Energy consumption; Vehicle routing problem; Mixed integer programming; Simulation optimization; Hybrid algorithm;

    机译:堆场起重机调度;能源消耗;车辆路线问题;混合整数编程;仿真优化;混合算法;

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号