检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:李志强 朱望纯[1] 张伟昆[1,2] LI Zhiqiang;ZHU Wangchun;ZHANG Weikun(School of Electronic Engineering and Automation,Guilin University of Electronic Technology,Guilin,Guangxi 541004,China;Unit 91872 of PLA,China)
机构地区:[1]桂林电子科技大学电子工程与自动化学院 [2]中国人民解放军91872部队
出 处:《计算机工程与应用》2018年第8期242-246,共5页Computer Engineering and Applications
摘 要:为解决城市区域停车诱导信息系统(PGIS)中的诱导信息板选址问题,提出以诱导量为目标,以停车场对驾驶员的吸引能力、诱导信息发布板的影响范围、发布信息可信度的衰减、通往停车场的道路情况、诱导信息发布板的疏密程度和每个停车场至少被诱导一次作为约束条件建立模型。采用改进混合蛙跳算法(ISFLA)对所建数学模型进行求解,在一个网格型的路网进行仿真实验,并对求解过程进行阐述说明。结果表明,该模型可以应用在停车诱导信息系统中,合理地分配诱导信息发布板的位置,使其得到最大诱导量,方法具有可行性。In order to solve the problem of optimizing variable-message board locations in urban Parking Guidance Information System(PGIS),this paper puts forward a model with an objective of maximizing of guidance information.Some restrictions are considered in the model such as the ability of the parking lot to attract the drivers,the scope of the information boards.The credibility attenuation and the traffic condition are also considered.At the same time,the density of boards and the conditional restriction of all parks’being guided at least one time are considered,too.Improved Shuffled Frog Leaping Algorithm(ISFLA)is applied to deal with the optimization through an example in a mesh-type network of road for simulating to explain the construction and solution.Simulation results show that the model can be used in the parking guidance information system to distribute the variable-message boards reasonably.And a maximizing of guidance information can be got.The validity of the model is verified.
关 键 词:交通工程 选址优化 改进的混合蛙跳算法 停车诱导信息系统 诱导信息发布板
分 类 号:TP391[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:3.12.34.36