考虑服务公平性的连续泊位-岸桥集成分配

Integrated allocation of continuous berth and quay crane base on service fairness

泊位和岸桥是集装箱码头非常最要的资源,合理的分派与调度可以有效地提高作业效率.目前泊位和岸桥的集成调度模型中大多以最小化船舶在港总时间或最小惩罚成本为目标函数,忽略了码头对船舶服务的公平性.为此,通过扩展现有的连续泊位分配模型,兼顾船舶惩罚成本及船舶等待与岸桥分配的公平性,建立多目标的连续泊位分配模型.设计一个三阶式邻域搜索算法,该启发式算法包括邻域搜索安排船序列、停泊位置搜索和分配调整岸桥3个阶段.实验结果显示,不同的邻域策略取得的最优解不同,通过设置最优的邻域策略可以获取最优的目标函数值.实验表明,该模型与算法可以在接受的时间内取得最优解,相关成果可以为码头对船舶服务的公平性研究提供理论依据.

Berth and quay are the most important resources in container ports, and optimal allocation and scheduling of them under stochastic environment are able to improve work efficien- cy. At present, most of the integrated scheduling models of berth and quay crane take minimization of the total time or penalty cost of the ship in the port as the objective function, ignoring the fairness of the ship＇s service. Therefore, the existing continuous berth allocation model is extended to the multi objective continuous berth allocation model based on ship＇s penalty cost, fairness of the ship waiting and allocation of the berth and quay crane. A neighborhood search al- gorithm is designed, consisting of three stages： the sequence of the adjacent search, the search for the position of the berth and the allocation and adjustment of the quay crane. The results of the experiments show that the optimal solution is obtained by different neighborhood strategies, and the optimal value of the objective function is able to be generated by setting the optimal neighbor- hood strategies. The model and algorithm are found to possess optimal solution in an acceptable time, and the relevant results provide theory for research on ports for ships service fairness.