为充分研究预约停车位设置方法对路内停车巡航时间的影响,根据深度优先搜索(depth first search, DFS)算法设计了停车寻位的流程、设计仿真运行程序以及仿真的一般场景,提出了包含节约巡航时间比例、服务车辆数、总停车时长、平均停车时...为充分研究预约停车位设置方法对路内停车巡航时间的影响,根据深度优先搜索(depth first search, DFS)算法设计了停车寻位的流程、设计仿真运行程序以及仿真的一般场景,提出了包含节约巡航时间比例、服务车辆数、总停车时长、平均停车时长4项指标的预约停车位设置方案的模糊综合评价方法。仿真案例基于DFS算法,根据出行者对于停车预约系统及停车位置选择偏好,设置仿真停车时所需参数以及仿真算图,共设计20组仿真方案和2组对照方案,得到各方案下各类车辆的巡航时间。结果表明:随着预约停车位比例增加,预约车辆平均巡航时间节约比例最高达21.6%,服务预约车辆数增加,但总服务车辆数并未保持上升趋势,总停车时长逐渐下降,同时平均停车时长无明显变化;预约停车位置设置不同(近目的地或远目的地),对于巡航时间有显著影响。各方案为优的隶属度最高为0.68,即80%预约停车位比例,最外侧设置4个预约停车位,解得为案例场景最优方案;相同比例预约停车位,设置一定数量最外侧预约停车位方案具有较高评价值。该研究验证了预约车位位置和比例对停车效率的影响,并得到在当前场景以及选择模型下预约停车位设置最优方案。展开更多
The algorithm is based on constructing a disjoin kg t set of the minimal paths in a network system.In this paper, cubic notation was used to describe the logic function of a network in a well-balanced state,and then t...The algorithm is based on constructing a disjoin kg t set of the minimal paths in a network system.In this paper, cubic notation was used to describe the logic function of a network in a well-balanced state,and then the sharp-product operation was used to construct the disjoint minimal path set of the network.A computer program has been developed,and when combined with decomposition technology,the reliability of a general lifeline network can be effectively and automatically calculated.展开更多
The real problem in cluster of workstations is the changes in workstation power or number of workstations or dynmaic changes in the run time behavior of the application hamper the efficient use of resources. Dynamic l...The real problem in cluster of workstations is the changes in workstation power or number of workstations or dynmaic changes in the run time behavior of the application hamper the efficient use of resources. Dynamic load balancing is a technique for the parallel implementation of problems, which generate unpredictable workloads by migration work units from heavily loaded processor to lightly loaded processors at run time. This paper proposed an efficient load balancing method in which parallel tree computations depth first search (DFS) generates unpredictable, highly imbalance workloads and moves through different phases detectable at run time, where dynamic load balancing strategy is applicable in each phase running under the MPI(message passing interface) and Unix operating system on cluster of workstations parallel platform computing.展开更多
This paper introduces the general process of the search algorithm Structure through the knight problem. According to the characteristics of the problem, we detailed discuss the DFS（Depth First Search） algorithm and ...This paper introduces the general process of the search algorithm Structure through the knight problem. According to the characteristics of the problem, we detailed discuss the DFS（Depth First Search） algorithm and BFS（Breadth First Search） algorithm, and combine the two algorithms together to solve the knights coverage problem. This article has a good reference for the mixed-use scenarios which requires a variety of search algorithms.展开更多
文摘为充分研究预约停车位设置方法对路内停车巡航时间的影响,根据深度优先搜索(depth first search, DFS)算法设计了停车寻位的流程、设计仿真运行程序以及仿真的一般场景,提出了包含节约巡航时间比例、服务车辆数、总停车时长、平均停车时长4项指标的预约停车位设置方案的模糊综合评价方法。仿真案例基于DFS算法,根据出行者对于停车预约系统及停车位置选择偏好,设置仿真停车时所需参数以及仿真算图,共设计20组仿真方案和2组对照方案,得到各方案下各类车辆的巡航时间。结果表明:随着预约停车位比例增加,预约车辆平均巡航时间节约比例最高达21.6%,服务预约车辆数增加,但总服务车辆数并未保持上升趋势,总停车时长逐渐下降,同时平均停车时长无明显变化;预约停车位置设置不同(近目的地或远目的地),对于巡航时间有显著影响。各方案为优的隶属度最高为0.68,即80%预约停车位比例,最外侧设置4个预约停车位,解得为案例场景最优方案;相同比例预约停车位,设置一定数量最外侧预约停车位方案具有较高评价值。该研究验证了预约车位位置和比例对停车效率的影响,并得到在当前场景以及选择模型下预约停车位设置最优方案。
基金Key Project of Science and Technology from the State Plan Committee.No.101-9914003
文摘The algorithm is based on constructing a disjoin kg t set of the minimal paths in a network system.In this paper, cubic notation was used to describe the logic function of a network in a well-balanced state,and then the sharp-product operation was used to construct the disjoint minimal path set of the network.A computer program has been developed,and when combined with decomposition technology,the reliability of a general lifeline network can be effectively and automatically calculated.
基金Natural Science Foundation of China (No.60 173 0 3 1)
文摘The real problem in cluster of workstations is the changes in workstation power or number of workstations or dynmaic changes in the run time behavior of the application hamper the efficient use of resources. Dynamic load balancing is a technique for the parallel implementation of problems, which generate unpredictable workloads by migration work units from heavily loaded processor to lightly loaded processors at run time. This paper proposed an efficient load balancing method in which parallel tree computations depth first search (DFS) generates unpredictable, highly imbalance workloads and moves through different phases detectable at run time, where dynamic load balancing strategy is applicable in each phase running under the MPI(message passing interface) and Unix operating system on cluster of workstations parallel platform computing.
文摘This paper introduces the general process of the search algorithm Structure through the knight problem. According to the characteristics of the problem, we detailed discuss the DFS（Depth First Search） algorithm and BFS（Breadth First Search） algorithm, and combine the two algorithms together to solve the knights coverage problem. This article has a good reference for the mixed-use scenarios which requires a variety of search algorithms.
