“华为杯”研究生数学建模竞赛2005年-【华为杯】A题：排队论模型解决出租车最佳数量预测（附获奖论文）

格图素书

于 2023-01-30 00:30:00 发布

阅读量492

点赞数

分类专栏：大数据竞赛赛题解析文章标签： matlab 开发语言

本文链接：https://blog.csdn.net/getusushu/article/details/128757910

版权

大数据竞赛赛题解析专栏收录该内容

484 篇文章 353 订阅 ¥49.90 ¥99.00

订阅专栏

该博客主要探讨了在‘华为杯’研究生数学建模竞赛中，如何利用排队论建立模型预测城市中出租车的最佳数量。研究涉及交通数据的收集、处理，以及在不同信息条件下（如速度、流量数据）如何改进算法以提高预测准确性和路线选择的合理性。同时，提出了考虑居民出行强度变化的预测模型和价格调整方案模型。

摘要由CSDN通过智能技术生成

赛题描述

A: Highway Traveling time Estimate and Optimal Routing

Ⅰ

Highway traveling time estimate is crucial to travelers. Hence, detectors are mounted on some of the US highways. For instance, detectors are mounted on every two-way six-lane highways of San Antonio city. However, since vehicles tend to change lanes from time to time, we may ignore vehicle lane change and consider just one lane traffic as shown below, in which the square boxes stand for detectors.

1. Detectors are able to detect and measure the speed of individual vehicles 24 hours a day. Average vehicle speed measured within 20 seconds by detectors is reported and refres

了解本专栏