A Base Integer Programming Model and Benchmark Suite for Liner-Shipping Network Design

水准点(测量) 一套 收入 整数规划 端口(电路理论) 网络规划与设计 运筹学 地铁列车时刻表 领域(数学分析) 计算机科学 流量网络 工程类 电信 数学优化 业务 考古 操作系统 数学分析 地理 会计 电气工程 算法 历史 数学 大地测量学
作者
Berit Dangaard Brouer,J. Fernando Alvarez,Christian Edinger Munk Plum,David Pisinger,Mikkel M. Sigurd
出处
期刊:Transportation Science [Institute for Operations Research and the Management Sciences]
卷期号:48 (2): 281-312 被引量:213
标识
DOI:10.1287/trsc.2013.0471
摘要

The liner-shipping network design problem is to create a set of nonsimple cyclic sailing routes for a designated fleet of container vessels that jointly transports multiple commodities. The objective is to maximize the revenue of cargo transport while minimizing the costs of operation. The potential for making cost-effective and energy-efficient liner-shipping networks using operations research (OR) is huge and neglected. The implementation of logistic planning tools based upon OR has enhanced performance of airlines, railways, and general transportation companies, but within the field of liner shipping, applications of OR are scarce. We believe that access to domain knowledge and data is a barrier for researchers to approach the important liner-shipping network design problem. The purpose of the benchmark suite and the paper at hand is to provide easy access to the domain and the data sources of liner shipping for OR researchers in general. We describe and analyze the liner-shipping domain applied to network design and present a rich integer programming model based on services that constitute the fixed schedule of a liner shipping company. We prove the liner-shipping network design problem to be strongly NP-hard. A benchmark suite of data instances to reflect the business structure of a global liner shipping network is presented. The design of the benchmark suite is discussed in relation to industry standards, business rules, and mathematical programming. The data are based on real-life data from the largest global liner-shipping company, Maersk Line, and supplemented by data from several industry and public stakeholders. Computational results yielding the first best known solutions for six of the seven benchmark instances is provided using a heuristic combining tabu search and heuristic column generation.
最长约 10秒,即可获得该文献文件

科研通智能强力驱动
Strongly Powered by AbleSci AI
更新
PDF的下载单位、IP信息已删除 (2025-6-4)

科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
科研通AI2S应助感动黄豆采纳,获得10
3秒前
7秒前
8秒前
11秒前
Fengliguantou发布了新的文献求助10
11秒前
猪猪hero发布了新的文献求助10
13秒前
Winner发布了新的文献求助10
15秒前
隐形曼青应助科研通管家采纳,获得10
15秒前
领导范儿应助科研通管家采纳,获得10
15秒前
Lucas应助科研通管家采纳,获得30
16秒前
16秒前
圆锥香蕉应助科研通管家采纳,获得20
16秒前
科研通AI2S应助科研通管家采纳,获得10
16秒前
科研通AI2S应助科研通管家采纳,获得10
16秒前
科目三应助科研通管家采纳,获得10
16秒前
充电宝应助科研通管家采纳,获得10
16秒前
脑洞疼应助科研通管家采纳,获得10
16秒前
科研通AI5应助科研通管家采纳,获得10
16秒前
852应助科研通管家采纳,获得10
16秒前
科研通AI2S应助科研通管家采纳,获得10
16秒前
科研通AI2S应助科研通管家采纳,获得10
16秒前
情怀应助科研通管家采纳,获得10
17秒前
17秒前
感动黄豆发布了新的文献求助10
17秒前
20秒前
搞怪冷风完成签到,获得积分10
21秒前
lucky完成签到,获得积分10
21秒前
量子星尘发布了新的文献求助10
22秒前
24秒前
科目三应助战斗暴龙兽采纳,获得10
28秒前
28秒前
28秒前
29秒前
29秒前
32秒前
故意的靳发布了新的文献求助50
33秒前
111111完成签到,获得积分10
33秒前
郭小宝发布了新的文献求助20
35秒前
youwenjing11发布了新的文献求助10
36秒前
hello发布了新的文献求助10
36秒前
高分求助中
A new approach to the extrapolation of accelerated life test data 1000
ACSM’s Guidelines for Exercise Testing and Prescription, 12th edition 500
‘Unruly’ Children: Historical Fieldnotes and Learning Morality in a Taiwan Village (New Departures in Anthropology) 400
Indomethacinのヒトにおける経皮吸収 400
Phylogenetic study of the order Polydesmida (Myriapoda: Diplopoda) 370
基于可调谐半导体激光吸收光谱技术泄漏气体检测系统的研究 350
Robot-supported joining of reinforcement textiles with one-sided sewing heads 320
热门求助领域 (近24小时)
化学 材料科学 医学 生物 工程类 有机化学 生物化学 物理 内科学 纳米技术 计算机科学 化学工程 复合材料 遗传学 基因 物理化学 催化作用 冶金 细胞生物学 免疫学
热门帖子
关注 科研通微信公众号,转发送积分 3989115
求助须知:如何正确求助?哪些是违规求助? 3531367
关于积分的说明 11253688
捐赠科研通 3269986
什么是DOI,文献DOI怎么找? 1804868
邀请新用户注册赠送积分活动 882078
科研通“疑难数据库(出版商)”最低求助积分说明 809105