探讨一种满足倒箱最少和作业高效的装载方案Word下载.docx
- 文档编号:17235641
- 上传时间:2022-11-29
- 格式:DOCX
- 页数:3
- 大小:19.86KB
探讨一种满足倒箱最少和作业高效的装载方案Word下载.docx
《探讨一种满足倒箱最少和作业高效的装载方案Word下载.docx》由会员分享,可在线阅读,更多相关《探讨一种满足倒箱最少和作业高效的装载方案Word下载.docx(3页珍藏版)》请在冰豆网上搜索。
调整。
依据稳性和总强度核算的成果对单个集装箱的方位进行调整,以确保满意稳性和总强度需求。
第五步:
预配。
预配也称为安置配载,首要是将装载港的集装箱按货品类型、尺度及目的港组成同类箱组,依据必定的预配准则和优化方针将其分配到船只的不一样Bay位上,断定集装箱在船上的纵向装载方位,完结集装箱在船上的整体安置。
第六步:
Bay位排箱。
Bay位排箱首要是在预配的基础上,断定单个集装箱在船上Bay位中的详细方位,首要思考箱子的尺度、分量,船只的稳性及倒箱等要素,断定集装箱沿船只纵向和横向的合理散布,它将影响船只的GM、横倾及改变强度。
Thefirststep:
todetermineloadinggoodsunloadingportorder,totheportcontainerplacedinthecabin,thefirstportcontainerafterloadingorondeck,voyagefreightpackingprocessshallnotbegreaterthanthenetloadcomponentthatvoyage,thetotalnumberofpackinggoodscannotsurmounttheshipsintheporttototalboxatthenumberofloading.Thesecondstep:
inordertocabinorganizationofgoods.Accordingtotheresultsofthesubdivision,loadinggoodsaccordingtothecabin,thedischargeportorderandboxcomponentofthecontainertodetailedcase.Thethirdstep:
thecalculationstabilityandtotalintensity.Basedonthedetailedorganizationofshipdataandcontainerships,stabilityandtotalintensitydatacalculationofshipassociation.Thefourthstep:
adjust.Adjustedaccordingtotheorientationstabilityandstrengthcalculationresultsofindividualcontainers,inordertoensuresatisfactorystabilityandstrengthdemand.Thefifthstep:
provisioning.Provisioningisalsoknownastheplacementofstowage,firstisthecontainerloadingportthegoodstype,sizeanddestinationcomponentsimilarboxgroup,onthebasisofcertainpolicycriterionandoptimizationwiththeassignedtothevesselisnotthesameasBay,concludedthatthecontainerintheship'
slongitudinalloadrange,theendofcontainerplacedonshipstheoverall.Thesixthstep:
Baylayout.Baylayoutismainlybasedonprewired,concludedthatasinglecontaineronboardBaydetailedrangeinscale,components,primaryreflectionbox,shipstabilityandinvertedboxandotherfactors,decidedthatcontainershipsalongthelongitudinalandtransversereasonabledistribution,itwillaffecttheGMships,transverseinclinationandthechangeofstrength. 详细的集装箱船每航次通常都要停靠多个半途港进行货品装卸,配载时应归纳思考货品性质、船只到港次序、货品分量、装卸作业条件,应确保半途港货品顺畅卸出及半途港货品装卸后的船只功能,详细配载算法可思考以下启发式规矩:
①成组指使技能将集装箱按货品类型、集装箱尺度、到港次序予以归类,同一特点的货品组成同类箱组;
以箱组为单位别离在船上挑选相应方位。
②当货品特点不一样时,先格外后通常将货品按类型划分为风险货品、冷藏货品及一般货品.在配载时,应首要挑选风险货品及冷藏货品的铺位,然后依据具本状况恰当组织一般货品的铺位。
DetailsofthecontainershipeachvoyageusuallydockedapluralityofMidwayportcargoloading,stowageshouldconsidertheproductproperties,shiparrivals,ordergoodscomponent,loadingandunloadingconditions,shouldensurethattheportofunloadinggoodshalfwaysmoothandmidwayportcargoloadingafterships,withloadingalgorithmcanconsiderthefollowingheuristicrules.:
①groupdirectsabilitywillcontainergoods,accordingtothetypeofcontainerportinordertoscale,categorize,thesamecharacteristicsofthegoodscomponentsimilarboxtoboxgroup;
groupunitwereselectedcorrespondingrangeontheboat.Whenthegoodshavedifferentcharacteristics,especiallyafterthefirstwillusuallybeclassifiedbytypeofgoodsforgoodsrisk,refrigeratedgoodsandgeneralgoods.Inthecargo,shouldbethefirstselectionofriskofgoodsandrefrigeratedgoodsshops,thenaccordingtotheconditionofproperorganizationgeneralcargoberth.2装备进程的数学函数和束缚条件Mathematicalfunctionandrestraintconditions2equipmentprocess 配载抵达的需求为满意必定束缚条件下最大体积装载率或分量装载率,以进步集装箱的运用率,取得最佳效益。
装箱的方针可描绘为其间:
n为货品数;
k为集装箱数;
li,wi,hi,gi别离表明货品的长、宽、高和质量;
Lj,Wj,Hj,Mj别离表明集装箱的矿车长、宽、高和最大装载质量.货品装载时有必要需求:
货品平行于集装箱的边放置;
货品不能彻底悬空,放置在上层的货品有必要与基层货品有触摸。
Stowageindemandforsatisfycertainconstraintsthemaximumvolumeloadingrateorcomponentloadingrate,rateofprogressinthecontainer,andgetthebestbenefit.Thepackingcanbedescribedas:
npolicyduringthegoodsnumber;
Kasthenumberofcontainers;
Li,WI,hi,GIshowedthatthegoodslong,wide,highandquality;
Lj,Wj,Hj,Mjshowthatthelargestcontainerlong,wide,TakaWaloadedquality.Thegoodsloadingnecessaryrequirements:
paralleltothecontainergoodsplaced;
goodscannotbecompletelysuspended,placingnecessaryandprimarygoodsinthegoodshavetouch. 装备的详细束缚如下:
束缚一:
集装箱重心方位的束缚。
为了使集装箱在运送进程中坚持平衡,对集装箱的重心方位有必定的需求,即实践重心与集装箱的几许中间的间隔不能超越必定的间隔(D)。
束缚二:
集装箱单箱分量束缚。
为了便于运送与转移,集装箱单箱分量不超越上限。
束缚三:
货品放置次序束缚。
实践装载进程中尽量做到“大不压小,重不压轻”准则,即货品放置的层有必定的束缚。
束缚四:
货品摆放方位束缚。
集装箱长、宽、高均为L、W、H标准,优化方针为集装箱的空间运用率最高,即对一批固定的货品进行转载,使选用集装箱的数量最少。
Thedetailedbindingequipmentareasfollows:
thebound:
containergravityrange.Inordertomakethecontainertokeepbalanceinthedeliveryprocess,haveacertaindemandforthecenterofgravitypositioncontainer,namelythepracticeofcenterofgravityandthecontainerofmanyintermediateintervalcannotbebeyondacertaindistance(D).Two:
containercomponents.Inordertofacilitatethetransportandtransfer,containercomponentdoesnotexceedtheupperlimit.Boundthree:
goodsplacedorder.Thepracticeof"
bigpressuresmallloadingdonottrytoprocess,heavynotpressurelight"
criterion,i.e.goodsplacedlayershaveacertainbound.Four:
goodsdisplayrangebound.Containerlong,wide,highareL,W,H,optimizationprincipleforthespaceofthecontainerusingthehighestrate,whichisreproducedonafixednumberofgoods,sothattheselectionoftheleastnumberofcontainer. 3根据忌讳查找算法的求解办法3accordingtothesolutiontaboosearchalgorithm 忌讳查找引入了人工智能的回忆机制,格外关于一些复杂问题,显示出极强的寻优才能。
忌讳指的是制止重复前面的操作。
为了避免查找堕入有些最优,用一个叫忌讳表的布局记录下现已抵达过的有些最长处,鄙人一次查找中,运用忌讳表中的信息不再或有挑选地查找这些点,以此来跳出有些最长处,一起“忘记”又使忌讳在必定时刻后失效,结尾抵达大局优化。
咱们运用DBSTree的算法来完成这一思维,详细的操作如下:
Taboosearchintothememorymechanismofartificialintelligence,especiallyforsomecomplexproblems,showsstrongoptimizationability.Tabooreferstoavoidrepeatoperation.Inordertoavoidlookingintosomeoptimallayout,witharecordcalledtabootablenowarriveatsomeofthemoststrength,thenextsearch,usingtheinformationinthetableisnolongertabooorselectedtofindthesepoints,inordertojumpoutofsomeofthestrengthsof"
forget"
togetherandmakefailureinacertaintimetabooaftertheendoftheoveralloptimization,arrived.WeusetheDBSTreealgorithmtoaccomplishthisthinking,thedetailedoperationareasfollows:
Step1:
初始化箱子容量、箱子标号、物品数量及各物品所占空间;
Step1:
initializationbox,label,boxcapacitynumberofitemsandtheitemspace;
Step2:
以箱子容量为关键值结构DBSTree,并为每个结点标号;
Step2:
inthecaseofcapacityforthekeystructureofDBSTree,andforeachnodelabel;
Step3:
顺次装载每个物品,若是物品的尺度大于容量最大的箱子,则将物品拆分,先将超尺度物品装入当时容量最大的箱子中,若是拆分后物品的剩下有些还大于箱子的容量,则持续拆分,不然转Step4。
Step3:
aresequentiallyloadedeachitem,ifgoodsscaleslargerthanthecapacityofthelargestbox,thearticlesplit,theultrascaleitemsinthecapacityofthelargestbox,iftheremainingafterthesplitgoodssomelargerthanthecapacityofthebins,continuedtosplit,orStep4. Step4:
查找:
寻觅最优匹配的箱子,假定该物品所占的空间为s1,寻觅大于等于量的关键值:
首要从根开端,若是根为空,那么查找树不包括任何关键值,查找挫折,则将丑与根的关键值相比较。
Step4:
search:
searchforoptimalmatchingbox,assumingthattheobjectspaceisS1,lookingforthekeyvalueisgreaterthanorequaltotheamountofroot:
mainlyfromthebeginning,iftherootisempty,thenthesearchtreedoesnotincludeanykeyvalue,findthesetback,theuglykeyandrootcompared. Step5:
刺进:
若是箱子未被装满,则以箱子的剩下空间更新箱子容量,假定箱子的剩下空间为e,则首要经过查找二叉树来断定要刺进的值e的方位,若是查找不成功,新元素刺进到查找的中断点,转Step7:
Step5:
Pierce:
iftheboxisnotfull,theboxleftspatialupdatingboxcapacity,ifaboxleftspacefortheE,ismainlythroughthetwosearchtreetodeterminetopiercethevaluesintheerange,ifthesearchisunsuccessful,newelementspiercetofindthebreakpoint,Step7:
Step6:
删去:
若是箱子已被装满,则从树中删去最优箱子,分三种状况:
Step6:
:
iftheboxhasbeenfilledout,fromthetreebydeletingtheoptimalcase,isdividedintothreekindsofsituation:
Case1:
要删去的节点t是树叶:
丢掉树叶结点;
ThenodeTCase1:
todeletetheleaves:
losetheleafnodes;
Case2:
要删去的节点f只要一个非空子树:
若是t没有父结点,则将t丢掉,t的仅有子树的节点成为新的查找树的根节点;
若是t有父结点node—f,则修正node的指针,使得node指向node的仅有孩子,然后删去节点node。
Case2:
todeletethenodeFaslongasanonemptytree:
iftheThasnoparentnode,thesubtreenodesonlylostt,tbecomesthenewrootnodesearchtree;
iftheTparentnodeF,pointersaremodifiednode,onlychildrenmakenodetonode,thendeletingthenodenode. Case3:
要删去一个左右子树都不为空的节点中的元素,将该元素替换为它的左子树中的最大元素或右子树中的最小元素。
Case3:
todeletealeftsubtreearenotemptynodesintheelement,theelementwiththesmallestelementmaximumelementitsleftsubtreeofortherightsubtree. Step7:
一切物品都被装载了吗?
若是是,转Step8;
不然转Step3:
Step7:
everythinghasbeenloaded?
Ifitis,Step8;
orStep3:
Step8:
输出所用箱子个数、总容量及装箱成果,完毕。
Theboxnumber,totalcapacityandpackingresultswiththeStep8:
output,.
- 配套讲稿:
如PPT文件的首页显示word图标,表示该PPT已包含配套word讲稿。双击word图标可打开word文档。
- 特殊限制:
部分文档作品中含有的国旗、国徽等图片,仅作为作品整体效果示例展示,禁止商用。设计者仅对作品中独创性部分享有著作权。
- 关 键 词:
- 探讨 一种 满足 最少 作业 高效 装载 方案