| 基于Android的物流配送最优路径的实现 |
| |
| 引用本文： | 严欢,彭翠,李虹.基于Android的物流配送最优路径的实现[J].计算机与数字工程,2014,42(9):1624-1627. |
| |
| 作者姓名： | 严欢 彭翠 李虹 |
| |
| 作者单位： | 西南科技大学信息工程学院智能终端实验室 绵阳621010 |
| |
| 基金项目： | 西南科技大学大学生创新基金 |
| |
| 摘 要： | 物流配送是一种现代化的流通方式,是供应商和客户之间的纽带,其最主要的问题是配送路径的优化问题.配送路径的选择是否合理,对加快配送速度、提高服务质量、降低配送成本以及增加经济效益都有较大影响.针对这些情况,此项目基于遗传算法设计了一套软件,模拟物流配送的最优路径,使其按照最短路程、最少时间的策略生成配送路线,并在软件界面上模拟车辆的行进.
|
| 关 键 词： | 物流配送 Android A＊算法 遗传算法 分支定界法 |
Implementation of Optimum Route of Logistics Distribution Based on Android |
| |
| YAN Huan,PENG Cui,LI Hong.Implementation of Optimum Route of Logistics Distribution Based on Android[J].Computer and Digital Engineering,2014,42(9):1624-1627. |
| |
| Authors: | YAN Huan PENG Cui LI Hong |
| |
| Affiliation: | (Intelligent Terminal Laboratory, College of Information Engineering, Southwest University of Science and Technology, Mianyang 621010) |
| |
| Abstract: | Logistics is a modern way of circulation, is the link between suppliers and customers, the main problem is the distribution route optimization problem. Whether distribution path is reasonable, has a great economic impact on speeding up delivery speed, improving service quality, reducing costs and increasing distribution. For these cases, a set of application software to simulate distribution of the optimal path is designed based on Genetic Algorithms. Vehicle simulates the optimal path following the shortest distance or the least time. |
| |
| Keywords: | logistics and distribution Android A * algorithm genetic algorithms branch and bound |
| 本文献已被 维普 万方数据 等数据库收录！ |
|
