遇见数据集

Ship Routing Problem Dataset

收藏
Mendeley Data2024-05-10 更新2024-06-27 收录
官方服务:

资源简介:

This is a dataset about minimizing maritime passenger transfer in ship routing. consists of data on the distance between ports, the number of passengers from the port of origin to the port of destination, ship speed, and the duration of berthing at ports.This is a multi-depot, heterogeneous, and asymmetric Vehicle Routing Problem. in the sense that this problem contains multiple depots, with vehicles of varying types, and the distance between ports is not always the same in the opposite direction. There are 82 ports which will be served by 25 ships. 70 ports are customer ports, and 12 ports are fuel ports (depots). Costumer ports are c1 to c70, and fuel ports are f1 to f12.

本数据集聚焦船舶航线规划场景下海上旅客接驳量最小化问题,涵盖港口间通行距离、始发港至目的港的旅客客流量、船舶航速及港口停靠时长等核心数据。本问题属于多车场异构非对称车辆路径问题(Vehicle Routing Problem, VRP),具体特征为:包含多个车场,使用不同类型的作业船舶,且港口间双向通行距离并非完全对等。本次数据集共包含82个待服务港口,由25艘船舶负责调度;其中70个为客运客户港口,12个为燃油补给车场。客运港口编号为c1至c70,燃油补给港口编号为f1至f12。

创建时间:
2024-05-01
搜集汇总
数据集介绍
Ship Routing Problem Dataset 数据集图片
背景与挑战
背景概述
该数据集专注于船舶路由问题,旨在最小化海上乘客转移,包含港口距离、乘客流量、船速和停泊时间等关键数据。它是一个多车场、异构且非对称的车辆路径问题,涉及82个港口(70个客户港口和12个燃料港口)和25艘船,适用于人工智能和计算智能领域的研究。
以上内容由遇见数据集搜集并总结生成
二维码
社区交流群
二维码
科研交流群
商业服务