集装箱码头分派车辆的整数规划模型

doi:10.3969/j.issn.1000-9957.2004.02.006

大连海洋大学学报

2004, Vol. 19

Issue (2): 105-109 DOI: 10.3969/j.issn.1000-9957.2004.02.006

集装箱码头分派车辆的整数规划模型

吕显强,张宏伟

大连水产学院大连理工大学

The integer programming modol for distributing vehides in container terminal

LV Xian-qiang¹, ZHANG Hong-wei²

1.School of Information Engineering, Dalian Fisheries Univ., Dalian 116023, China; 2.Department of Applied Mathematics, Dalian University of Technology, Dalian 116024, China

摘要
相关文章
推荐阅读
Metrics

下载:

PDF (155KB)
输出: BibTeX | EndNote (RIS)

摘要建立了一个用于确定集装箱码头一组车辆工作次序的整数规划模型,其中这组车辆是用于把从货仓起重机卸下的集装箱运输到码头的存贮位置. 证明了求解这一整数规划模型等价于求解n个车辆安排线路问题的几条路径,并设计了前向搜索算法(FSA)和后向搜索算法(BSA)两种启发式算法,用于确定集装箱码头大型货轮卸货车辆的可行分派方案.

	服务
	把本文推荐给朋友
	加入引用管理器
	E-mail Alert
	RSS
	作者相关文章
	吕显强
	张宏伟

关键词: 集装箱码头车辆整数规划模型

Abstract: This paper establishes an integer programming model to determine the order of a group of vehicles for transporting a sequence of containers from cranes to their destinition at the quay. It is proved that solving the integer programming model is equivalent to finding n paths of an n-vehicle routing problem. Two heuristic algorithms are designed to determine feasible dispatching policies of vehicles for accomplishing the task.

Key words: container terminal vehicle integer programming model

发布日期: 2016-12-30 期的出版日期: 2004-04-21

中图分类号:

O221.4

引用本文:

吕显强, 张宏伟. 集装箱码头分派车辆的整数规划模型[J]. 大连海洋大学学报, 2004, 19(2): 105-109.
LV Xian-qiang, ZHANG Hong-wei. The integer programming modol for distributing vehides in container terminal. Journal of Dalian Ocean University, 2004, 19(2): 105-109.

链接本文:

https://xuebao.dlou.edu.cn/CN/10.3969/j.issn.1000-9957.2004.02.006 或 https://xuebao.dlou.edu.cn/CN/Y2004/V19/I2/105

No related articles found!

No Suggested Reading articles found!

Viewed

Full text

Abstract

Cited

Shared

Discussed