本文選題：進(jìn)港次序 + 泊位分配��； 參考：《運(yùn)籌與管理》2017年09期

【摘要】：為提高單向航道離散泊位港口的服務(wù)水平,研究船舶進(jìn)港次序和泊位分配的協(xié)同優(yōu)化�？紤]船舶進(jìn)出港及泊位作業(yè)的實(shí)際約束,以計(jì)劃期內(nèi)所有船舶的錨地、泊位等待成本、滯期成本和偏離成本之和最小為目標(biāo),構(gòu)建了一個(gè)混合整數(shù)規(guī)劃模型,結(jié)合問題特征設(shè)計(jì)了引入禁忌搜索算法的和聲搜索算法進(jìn)行求解。算例結(jié)果給出了計(jì)劃期內(nèi)每艘船舶的進(jìn)港次序和靠泊泊位,并通過與單獨(dú)優(yōu)化方案的對比和不同規(guī)模算例求解效果的分析,驗(yàn)證了模型和算法的有效性;分析進(jìn)出港時(shí)段變動(dòng)對船舶作業(yè)成本的影響,確定不同船舶抵港規(guī)模下的最佳進(jìn)出港時(shí)段長度,為單向航道港口時(shí)長設(shè)置提供借鑒。
[Abstract]:In order to improve the service level of the port with discrete berths, the cooperative optimization of ship arrival sequence and berth allocation is studied. Considering the actual constraints of the operation of the port and berth, a mixed integer programming model is constructed, aiming at the minimum sum of the Anchorage, berth waiting cost, delay cost and deviation cost of all ships during the planning period. A harmonic search algorithm based on Tabu search algorithm is designed to solve the problem. The results of numerical examples show the sequence of incoming ports and berthing berths of each ship during the planning period. The validity of the model and algorithm is verified by comparing with the single optimization scheme and analyzing the results of different scale examples. This paper analyzes the influence of the change of the period of entry and exit on the operating cost of the ship, and determines the optimum length of the period of entry and exit under the different scale of arrival and exit of the ship, which provides a reference for the establishment of the port length of the one-way channel.
【作者單位】： 大連海事大學(xué)交通運(yùn)輸管理學(xué)院;
【基金】：國家自然科學(xué)基金(71473024)~~
【分類號】：U691.3

【相似文獻(xiàn)】

相關(guān)期刊論文 前2條

1 宋向群;付超;郭子堅(jiān);王文淵;;沿海集裝箱港區(qū)單向航道服務(wù)水平研究[J];水運(yùn)工程;2010年07期

2 卓啟良;析影響惠州港發(fā)展的“瓶頸”及對策[J];中國港口;2005年08期

相關(guān)碩士學(xué)位論文 前1條

1 曹俊業(yè);基于潮汐流特性的變向車道協(xié)同優(yōu)化控制方法[D];青島理工大學(xué);2016年

，

本文編號：2114785