集裝箱船舶配載智能決策研究
發(fā)布時(shí)間:2018-05-10 23:26
本文選題:配載計(jì)劃 + 集裝箱; 參考:《武漢科技大學(xué)》2015年碩士論文
【摘要】:在現(xiàn)代運(yùn)輸中,海上運(yùn)輸已經(jīng)成為不可或缺的重要組成部分,而集裝箱運(yùn)輸是海上運(yùn)輸最為重要的一種方式。尤其是隨著全球經(jīng)濟(jì)一體化的加速推進(jìn),各國(guó)間的貿(mào)易日益頻繁,對(duì)集裝箱運(yùn)輸?shù)囊揽砍潭葎?shì)必會(huì)越來越高。 集裝箱的配載是關(guān)系著作業(yè)效率、營(yíng)運(yùn)成本和運(yùn)輸安全的重要環(huán)節(jié)。一份優(yōu)質(zhì)的配載計(jì)劃,不僅能保證船舶在整個(gè)運(yùn)輸過程中,安全穩(wěn)定的航行,還能提升集裝箱的裝卸效率。研究配載的優(yōu)化問題,對(duì)集裝箱船舶運(yùn)輸和集裝箱碼頭的現(xiàn)代化管理都有廣泛的工程背景和應(yīng)用價(jià)值。 鑒于此,本文中對(duì)?慷喔劭诘募b箱班輪運(yùn)輸?shù)呐漭d問題展開討論。首先,針對(duì)船舶主貝計(jì)劃建立以混裝次數(shù)最小為目標(biāo)的數(shù)學(xué)模型,設(shè)計(jì)了粒子群算法對(duì)船舶主貝計(jì)劃進(jìn)行優(yōu)化,并從中找出混裝最為嚴(yán)重的貝位,進(jìn)行下一步研究。其次,,針對(duì)混裝貝進(jìn)行貝內(nèi)配載研究,在滿足船舶橫傾力矩約束的條件下,建立以倒箱量最小為目標(biāo)的數(shù)學(xué)模型,設(shè)計(jì)遺傳算法對(duì)其求解,并且用算例驗(yàn)證了算法的有效性和可行性。
[Abstract]:In modern transportation, maritime transport has become an indispensable part, and container transport is the most important way of maritime transport. Especially with the acceleration of global economic integration, trade between countries is becoming more and more frequent, and the degree of dependence on container transportation is bound to become higher and higher. Container stowage is an important link of operation efficiency, operation cost and transportation safety. A high quality stowage plan can not only ensure the safe and stable navigation of the ship during the whole transportation process, but also improve the efficiency of container handling. Studying the optimization of stowage has extensive engineering background and application value for container shipping and modern management of container terminal. In view of this, this paper discusses the stowage of container liner transportation with multiple ports. Firstly, aiming at the establishment of the mathematical model of the ship master shell plan with the minimum number of mixed loads as the goal, a particle swarm optimization algorithm is designed to optimize the ship master shell plan, and find out the most serious shellfish position for the next step. Secondly, under the condition of satisfying the constraints of the heeling moment of the ship, the mathematical model aiming at the minimum volume of the inverted tank is established, and the genetic algorithm is designed to solve the problem. The effectiveness and feasibility of the algorithm are verified by an example.
【學(xué)位授予單位】:武漢科技大學(xué)
【學(xué)位級(jí)別】:碩士
【學(xué)位授予年份】:2015
【分類號(hào)】:U695.22
【參考文獻(xiàn)】
相關(guān)期刊論文 前8條
1 衛(wèi)家駿;;一種集裝箱船配載問題改進(jìn)算法探討[J];重慶交通大學(xué)學(xué)報(bào)(自然科學(xué)版);2009年05期
2 孫曉雅;林焰;;集裝箱船多港bay位排箱的優(yōu)化方法[J];大連海事大學(xué)學(xué)報(bào);2011年01期
3 段成華,郭旭;基于整數(shù)規(guī)劃的單貝多港(SBMP)配載模型研究[J];計(jì)算機(jī)輔助工程;2004年03期
4 王莉莉;于紅;;集裝箱裝船順序優(yōu)化模型及遺傳算法[J];計(jì)算機(jī)工程與應(yīng)用;2008年15期
5 黎明;翟金剛;;集裝箱裝船順序的多目標(biāo)整數(shù)規(guī)劃優(yōu)化模型[J];計(jì)算機(jī)應(yīng)用研究;2012年10期
6 張維英;林焰;紀(jì)卓尚;;集裝箱船全航線Bay位排箱優(yōu)化模型[J];上海交通大學(xué)學(xué)報(bào);2007年02期
7 曾凡華;集裝箱堆場(chǎng)倒箱的原因及預(yù)防[J];水運(yùn)科技信息;1998年04期
8 朱明華;范秀敏;程奐
本文編號(hào):1871400
本文鏈接:http://sikaile.net/kejilunwen/daoluqiaoliang/1871400.html
最近更新
教材專著