集装箱船舶装卸作业时起吊设备-车辆的规划研究(2006年)资源-CSDN文库

自然科学

论文

需积分: 10 50 浏览量 2021-05-23 17:19:55 上传评论收藏 577KB PDF 举报

资源推荐

资源详情

资源评论

第46卷第3期

2006年5月

大连理工大学学报

Jo urnal of Dalian Unive rsity o f Te chno lo g y

Vol

.46,

May

2006

文章编号: 1000-8608(2006)03-0372-08

Receiv ed by

:2004

15;

Revised by

: 2006

05.

S upported by

: N aturalScience Foundation of China (50578030).

Corresponding author

KANG Hai

gui

(1945-),

Male

Prof

Supervisor of D oc

Research on programming of crane

vehicle scheduling

fo r lo ading containership

KANG

Ha i

gui

ZH OU

Pen g

fei

(

State Ke y Lab

of Coas tal and Offshore Eng

Dalian U niv

of Technol

Dalian

116024,

Chin a

)

A b stract

: A crane-vehicle scheduling m odel is suggested in a loading

container process w ith a fleet of vehicles, several yard-cran es and a

quay-crane. T he m odel is to plan quay-crane loading operation, to schedule

yard-crane routing and to dispatch vehicles to containers, so as to m inim ize th e

totally idle tim e o f th e related eq u ip m en t an d yard -cran e travel tim e. B ecause

of its hardness, a genetic algorithm is developed w ith a reduced solution set on

its p rop erty . N u m erical ex p erim en ts sh o w th at th e m od el p rov id es sy stem ic

sim ulation for the w hole load process, and the results of G A are stable and

acceptable in allow able C P U tim e.

Key w ords

: term inallogistics; transportation; program m ing m odel; container

Introduction

W ith the increasing container shipm ent,

container term inal logistics optim ization has

becom e an im portant issue for a container

term in al. G en erally its aim is th e rap id tu rn ov er

of containers, w hich corresponds to a reduction

of a port tim e of containerships and handling

cost.

B ecause inbound containers are usually

unloaded onto a designated open space and an

u nloaded container is located in an em pty space

n ext to the previously un loaded container in

term inal, the yard handling equipm ent does not

have to travel m uch longer during the unloading

operation. T hus, the unloading tim e can be

considered to be proportional to the num ber of

containers. In the case of loading, how ever, a

container to be loaded onto a slot in a ship m ust

m eet various constraints of slots, w hich are

requested by the shipping line. A lso, locations

of outb ound containers m ay be scattered

overawideareainayard.Thus,theloading

tim e highly depends on the loading sequence of

containers

[1 , 2]

. T he follow ing issues are

considered in this paper: W hat is the schedule of

q u ay -cran e load in g o p eration s; h o w sh ou ld

vehicles be dispatched to containers; how to

assign yard-cranes to yard-bays so as to

m inim ize the idle tim e of all equipm ent and the

travel tim e of all yard -cranes.

F u ll atten tion h as b een p aid to th e relativ e

containership loading issue. A m ath em atical

m o d el an d a related op tim izin g alg orith m are

suggested in R ef. [3] for loading sequence

scheduling by virtue of optim izing a transfer

crane. T h e m ain problem of the form ulation is

an excessive com putational tim e for a large

problem , thus a heuristic algorithm is suggested

andtestedinthepaper.Cao,

et al

[4]

proposed a

tab u search alg orith m to solve th e tran sp ortation

problem w ith nonlinear side constraints, just in

t h is w a y t o m in im iz e lo a d in g c o s ts . K im ,

et al

[5 ]

proposed a m ethodology to convert a current

order of export containers in the yard into a bay

layout. T he goal is to find the few est possible

num ber of containers and/or shortest possible

travel distance in order to m inim ize the total

turnaround tim e of a vessel in a port.

Hartmann

[6]

developed a general scheduling

m odelto assign resources to jobs and arrange the

job s w ith con sid eratio n o f con strain ts. A G A

b ased on priority rules for solving the prob lem is

discussed. R outing of straddle carriers for

loading exportcontainers is discussed in R ef.[7]

to m in im ize th e to tal travel distan ce o f strad dle

carriers in th e y ard . T h e rou tin g pro b lem is

com posed of container allocation problem —

form u lated as a tran sp ortation p rob lem — an d a

carrier ro u tin g p ro b lem w ith th e g iv en seq u en ce

o f y ard -b ay s to b e visited b y a carrier. In R ef.

[8], the num ber of containers picked up by a

straddle carrier at each bay and the sequence of

b ay visits is d eterm in ed to m in im ize to tal travel

distance/tim e of the carrier. T he proposed

in teger-program m ing m odel is solved by a

tw o-phase procedure. B ose,

et al

[9]

in v e s t ig a te d

different dispatching strategies for straddle

carriers to g an try cran es in ord er to redu ce

vessel′s turnaround tim e at port by m axim izing

productivity of gantry cranes achieved by an

efficient schedule of the given straddle carriers.

Bish,

et al

[10 ]

fo cu sed on th e N P -h ard

vehicle-schedu ling-location problem of assigning

a yard location to each im port container and

dispatching vehicles to containers in order to

m inim ize the totaltim e for unloading a vessel. A

heuristic algorithm based on an assignm ent

problem form ulation is presented. K im ,

et al

[11 ]

discussed the load-sequencing problem for

ex p o rt con tain ers in term in als w ith tran sfer

cranes and yard trucks. A flexible beam search

algorithm for m inim izing total handling tim e of

cranes and trucks is suggested. T he existing

m ethods and algorithm s are m ostly obtained by

optim izing the single process. B ut in order to

obtain an efficient loading planning in term inal,

it is n ecessary to p u t forw ard th e relativ e

problem s as a w hole. T herefore in the paper, a

system ic m odel is proposed for container loading

scheduling and a genetic algorithm is developed

to solve it.

Problem formulation

Problem description

T he contain er vessel loading process m ainly

involves in stow age planning, yard-crane and

quay-crane scheduling, yard vehicle planning. A

shipping line′s em ployee classifies loading

containers based on their attributes including

discharge ports and w eigh t-class of containers,

etc.. C ontainers w ith these attributes are

assigned to specific positions w ithin ships. B ased

on this instruction, a term inal planner then

assigns the dedicated containers identified by

num bers to respective slots. Q uay-crane split

(scheduling) is to assign quay-cranes to ships

and ship sections. M ode of loading vessels and

quay-crane split together result in a loading

sequence (show n in T ab .1), w hich sh ow s the

n um ber of contain ers and the sequence of

vessel-bay in w hich a quay-crane perform s the

loading operation on categories of containers.

T ab.1 A n exam ple of quay-crane loading sequence

S equ en ce of q u ay -crane C o n tainer category Q uantity

1A3

2B5

3C6

4B4

5A5

6D3

7E7

It is supposed in the paper that quay-crane

loading schedules are planned in advance and

outbound containers have been stored in specific

storage bays. T ake single quay-crane case for an

exam ple, in w hich loading schedule in T ab.1

373

第3期

剩余7页未读，继续阅读

评论收藏

内容反馈

weixin_38553275

粉丝: 5
资源: 917

集装箱船舶装卸作业时起吊设备-车辆的规划研究 (2006年)

最新资源

集装箱船舶装卸作业时起吊设备-车辆的规划研究 (2006年)

集装箱码头船舶装卸作业监控过程的改进研究1

集装箱码头装卸作业调度优化研究1

自动化集装箱码头装卸工艺系统应用现状与展望_何继红1

论文研究-集装箱码头同贝同步装卸作业的序列优化模型.pdf

基隆、神户、釜山、新加坡等港集装箱装卸费用计算方法-报告资料.pdf

自动化集装箱码头装卸系统的协同调度优化__栾晨1

行业文档-设计装置-集装箱散货装卸平台.zip

集装箱码头“岸桥-集卡-堆场”作业计划的优化1

港口集装箱装卸作业的重调度研究1

集装箱堆场装卸设备智能化调度优化研究_张雪松1

集装箱自装卸运输车起重装置设计-太原科技大学机械设计及其自动化本科毕业设计.doc

自动化集装箱码头岸桥-堆场作业均衡调度研究_丁一1

自动化集装箱码头装卸工艺设计中若干问题的思索与探讨.pdf

论文研究-基于堆场混合堆存的集装箱码头装船顺序优化模型.pdf

铁路集装箱站场装卸自动化远程智能控制系统设计研究.pdf

集装箱码头装卸作业成本分摊与折扣定价_丁一1

集装箱码头铁路装卸线_场布置对铁水联运作业效率的影响_张涌昊1

集装箱码头装卸系统及调度优化——以大连港集装箱码头为例1

论文研究-约束规划求解集装箱装卸系统集成调度问题.pdf

集装箱装卸设备与自动化.pdf

自动化集装箱码头装卸工艺方案设计.pdf

南京港龙潭港区集装箱码头装卸设备配置优化与仿真_王旋1

最新资源