In order to form an algorithm for distribution network routing,an automatic routing method of distribution network planning was proposed based on the shortest path.The problem of automatic routing was divided into two...In order to form an algorithm for distribution network routing,an automatic routing method of distribution network planning was proposed based on the shortest path.The problem of automatic routing was divided into two steps in the method:the first step was that the shortest paths along streets between substation and load points were found by the basic ant colony algorithm to form a preliminary radial distribution network,and the second step was that the result of the shortest path was used to initialize pheromone concentration and pheromone updating rules to generate globally optimal distribution network.Cases studies show that the proposed method is effective and can meet the planning requirements.It is verified that the proposed method has better solution and utility than planning method based on the ant colony algorithm.展开更多
针对网络结构单一和消防语义信息贫乏导致的室内消防救援路径难以满足消防救援多样性任务需求的问题,基于建筑信息模型(building information modeling,BIM),集成地理信息系统(geographic information system,GIS)提出了一种1(基础路径...针对网络结构单一和消防语义信息贫乏导致的室内消防救援路径难以满足消防救援多样性任务需求的问题,基于建筑信息模型(building information modeling,BIM),集成地理信息系统(geographic information system,GIS)提出了一种1(基础路径网络)+N(专题路径网络)的室内消防救援多层路径网络模型,通过对案例区BIM数据进行解析,提取2230条路径网络要素信息(包括718个节点和1512条边),构建了室内基础路径网络模型,并在此基础上生成人员疏散、灭火和人员逃生3种专题路径网络.实验结果表明:该模型能够有效支持不同消防救援任务的路径规划需求,利用Dijkstra等算法成功计算出最短路径,验证了模型的可行性和实用性.展开更多
乘务排班计划是城市轨道交通运营管理中的重要环节,为了解决目前乘务排班效率低下的问题,对乘务排班计划进行优化。在考虑便乘的情况下,以乘务排班计划总接续时间最小及总运营成本最小为目标建立地铁乘务排班计划编制的双目标优化模型...乘务排班计划是城市轨道交通运营管理中的重要环节,为了解决目前乘务排班效率低下的问题,对乘务排班计划进行优化。在考虑便乘的情况下,以乘务排班计划总接续时间最小及总运营成本最小为目标建立地铁乘务排班计划编制的双目标优化模型。在满足相关约束条件的基础上,将乘务作业段按照早、白、夜班分成3组,以乘务作业段为顶点,乘务作业段之间的接续关系为弧构建早、白、夜班的网络图,并形成乘务作业段接续时间矩阵,将乘务排班转化为最短路问题。运用相关最短路算法进行求解,该算法采用动态优化逼近的方法,一条最短路径即为一个乘务任务。以成都地铁5号线为例进行乘务排班计划编制,对模型和算法进行测试。研究结果表明:在求得的乘务排班计划中,早班乘务任务个数为53个,任务时长为280 h 34 min 57 s;白班乘务任务个数为41个,任务时长为199 h 54 min 51 s;夜班乘务任务个数为49个,任务时长为215 h 25 min 37 s。总乘务任务个数为143个,总工作时长为695 h 55 min 25 s。与手工编制结果相比,降低了乘务排班计划的总成本及接续时间,提高了求解效率。展开更多
基金Project(2009CB219703) supported by the National Basic Research Program of ChinaProject(2011AA05A117) supported by the National High Technology Research and Development Program of China
文摘In order to form an algorithm for distribution network routing,an automatic routing method of distribution network planning was proposed based on the shortest path.The problem of automatic routing was divided into two steps in the method:the first step was that the shortest paths along streets between substation and load points were found by the basic ant colony algorithm to form a preliminary radial distribution network,and the second step was that the result of the shortest path was used to initialize pheromone concentration and pheromone updating rules to generate globally optimal distribution network.Cases studies show that the proposed method is effective and can meet the planning requirements.It is verified that the proposed method has better solution and utility than planning method based on the ant colony algorithm.
文摘针对网络结构单一和消防语义信息贫乏导致的室内消防救援路径难以满足消防救援多样性任务需求的问题,基于建筑信息模型(building information modeling,BIM),集成地理信息系统(geographic information system,GIS)提出了一种1(基础路径网络)+N(专题路径网络)的室内消防救援多层路径网络模型,通过对案例区BIM数据进行解析,提取2230条路径网络要素信息(包括718个节点和1512条边),构建了室内基础路径网络模型,并在此基础上生成人员疏散、灭火和人员逃生3种专题路径网络.实验结果表明:该模型能够有效支持不同消防救援任务的路径规划需求,利用Dijkstra等算法成功计算出最短路径,验证了模型的可行性和实用性.
文摘乘务排班计划是城市轨道交通运营管理中的重要环节,为了解决目前乘务排班效率低下的问题,对乘务排班计划进行优化。在考虑便乘的情况下,以乘务排班计划总接续时间最小及总运营成本最小为目标建立地铁乘务排班计划编制的双目标优化模型。在满足相关约束条件的基础上,将乘务作业段按照早、白、夜班分成3组,以乘务作业段为顶点,乘务作业段之间的接续关系为弧构建早、白、夜班的网络图,并形成乘务作业段接续时间矩阵,将乘务排班转化为最短路问题。运用相关最短路算法进行求解,该算法采用动态优化逼近的方法,一条最短路径即为一个乘务任务。以成都地铁5号线为例进行乘务排班计划编制,对模型和算法进行测试。研究结果表明:在求得的乘务排班计划中,早班乘务任务个数为53个,任务时长为280 h 34 min 57 s;白班乘务任务个数为41个,任务时长为199 h 54 min 51 s;夜班乘务任务个数为49个,任务时长为215 h 25 min 37 s。总乘务任务个数为143个,总工作时长为695 h 55 min 25 s。与手工编制结果相比,降低了乘务排班计划的总成本及接续时间,提高了求解效率。
