检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]山东大学控制科学与工程学院,山东济南250061
出 处:《山东大学学报(工学版)》2007年第5期29-33,46,共6页Journal of Shandong University(Engineering Science)
基 金:山东省自然科学基金项目(Y2005G18)
摘 要:从速递网的构建目标、问题范围、时限及频次规定、车辆因素、运行成本、经转次数上限、时限达标率等方面对邮政速递问题进行了系统地分析,对运用最小时限邮路搜索算法构建的网络进行瓶颈分析,以获取满足规定时限标准的邮政速递网络的最优实现.实验仿真结果表明该网络构建方法具有实用性好、通用性强等特点,结论对邮政企业制定邮件发运计划及调整邮路等提供了良好的决策支持.The postal express delivery problem was systemically analyzed in terms of its construction objectives, ranges, and time limit and frequency, vehicle factors, operation costs, upper limit of transiting times, time limit satisfying ratio. Bottleneck analysis was applied to the network constructed by the minimum time limit searching algorithm, and the optimal postal express mail network that meets the specific time limit satisfying ratio was obtained. Simulation results indicate that the construction method does well in practicability and adaptability, which provides decision support to the postal enterprise in planning and making post road adjustments.
分 类 号:TP391.9[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.38