最优站点问题的求解  

Solution of optimal station problem

作　　者：宋灵宇[1] 张雅荣[2] 程晓晗[1] 龙熙华[2] 

机构地区：[1]长安大学理学院,陕西西安710064 [2]西安科技大学计算机学院,陕西西安710054

出　　处：《兰州理工大学学报》2012年第4期143-146,共4页Journal of Lanzhou University of Technology

基　　金：国家自然科学基金(10971166);长安大学中央高校基本科研业务费专项资金(CHD2010JC094);中央高校基本科研业务费专项资金(CHD2012TD015);长安大学科技创新团队项目的资助

摘　　要：利用函数空间迭代法和穷举法对校车最优乘车点的规划设计问题给出详细的解答.运用函数空间迭代法求出区与区之间的最短距离.采用穷举法,建立每个问题的目标函数,对于问题1,以每个区到最近乘车点的距离之和最小为目标;对于问题2,把各区人数作为权重,以所有人到最近站点所走的总路程最小为目标.建立一般地最优化模型.通过Matlab编程计算,分别求出设2个和3个最优乘车点的位置,以及每个最优乘车点所需的最少车辆数.The programming and designing problem of optimal school bus stations was solved by using the function space iterative method and exhaustive attack method and a detailed solution was given. Firstly, the shortest distance between any two districts was found by using the former method. Then the target function for the problem was set up with the latter method. Two targets were to be given： the minimum sum of the distance from every district to the nearest bus-stop was taken as the first target. As for the sec- ond target, the population of the district was taken as the weight to make sum of the walking distance of every passenger to the nearest bus-stop mimimum. The optimization model was then set up in a general way. The software Matlab was used for programming to determine the locations of two and three optimal bus-stops and the minimum necessary number of vehicles.

关 键 词：最优乘车点 函数空间迭代法 目标函数 

分 类 号：O224[理学—运筹学与控制论]