基于公平原则的泊位-岸桥联合调度研究  

Joint Scheduling of Berth-Quay Crane Based on Fair Principle

作　　者：范丽先[1] 王行苑 尹静波[2] 

机构地区：[1]上海大学管理学院,上海200444 [2]上海交通大学船舶海洋与建筑工程学院,上海200240

出　　处：《工业工程与管理》2017年第2期60-68,共9页Industrial Engineering and Management

基　　金：国家自然科学基金资助项目(71302052,71673181);上海市浦江人才计划资助项目(14PJC070)

摘　　要：港口调度优化问题分为离散的泊位分配和时变的岸桥调度问题,并构建泊位-岸桥联合调度优化模型。对于到港船舶泊位分配问题,提出靠泊优先权概念,并以此作为基因编码基础。岸桥分配中提出岸桥调度的公平分配原则,使得岸桥分配存在初始分配和最终分配。为解决非线性混合整数规划模型,改进了遗传算法,模型目标是使所有船舶在港总时间最小。实验算例验证了算法设计的优越性。The operation of container terminals is divided into discrete berth allocation and time-variant scheduling of quay cranes. A joint scheduling model is then developed for the container berth-quay crane optimization. For berth allocation, the concept of berth priority was proposed to allocate berths for arriving ships,which is the basic unit in the coding system. A fair allocation principle was also designed in the scheduling of quay cranes, which makes the allocation into initial and final allocations. To solve this nonlinear mixed-integer programming model, the genetic algorithm was improved with the goal of minimizing the total time of all the ships in port. Computational experiments show the performance improvement of the proposed algorithm.

关 键 词：泊位一岸桥调度 优先权 公平原则 非线性混合整数规划模型 遗传算法 

分 类 号：U691[交通运输工程—港口、海岸及近海工程]