Probability based dynamic-alternate routing and the corresponding converter placement algorithm in all-optical WDM networks

This paper proposes a new dynamic-alternate routing algorithm and its corresponding converter placement algorithm in order to reduce the connection blocking probability for all-optical WDM networks. The main idea in the proposed dynamic-alternate routing algorithm is to try to route the traffics according to a predefined optimal probability distribution. The problem for finding the optimal probability distribution was shown as a convex optimization problem. The problem can be solved by flow deviation method or other standard optimization techniques. Simulation results show that the proposed routing algorithm yields lower connection blocking probabilities than the previous works. The proposed routing algorithm produces similar traffic pattern as the optimal traffic pattern. The similarity between the traffic pattern produced by the proposed dynamic-alternate routing algorithm and the optimal traffic pattern can be further employed for solving other network designing problems such as converter placement problem. Since the optimal traffic pattern can be easily predicted, the optimal traffic pattern which minimizes the blocked traffic intensity is utilized for finding the locations of wavelength converters. The key idea is to place the wavelength converters at the nodes where they are needed most. Simulations have been performed to study the performance of the proposed wavelength converter placement method. The simulation results have shown that the proposed placement method combined with the proposed probability based dynamic-alternate routing algorithm yields smaller connection blocking probability than the two converter placement methods with their corresponding alternate routing algorithms.     

Optimizing urban traffic light scheduling problem using harmony search with ensemble of local search

This study addresses urban traffic light scheduling problem (UTLSP). A centralized model is employed to describe the urban traffic light control problem in a scheduling framework. In the proposed model, the concepts of cycles, splits, and offsets are not adopted, making UTLSP fall in the class of model-based optimization problems, where each traffic light is assigned in a real-time manner by the network controller. The objective is to minimize the network-wise total delay time in a given finite horizon. A swarm intelligent algorithm, namely discrete harmony search (DHS), is proposed to solve the UTLSP. In the DHS, a novel new solution generation strategy is proposed to improve the algorithm’s performance. Three local search operators with different structures are proposed based on the feature of UTLSP to improve the performance of DHS in local space. An ensemble of local search methods is proposed to integrate different neighbourhood structures. Extensive computational experiments are carried out using the traffic data from partial traffic network in Singapore. The DHS algorithm with and without local search operators and ensemble is evaluated and tested. The comparisons and discussions verify the effectiveness of DHS algorithms with local search operators and ensemble for solving UTLSP.     

协调控制子区快速动态划分方法研究

通过建立基于交叉口关联度的协调控制子区划分模型,设计最佳控制子区划分方 案获取流程,实现了交通信号控制子区的动态划分;针对最佳控制子区划分方案求 解过程中可能面临的维数灾难问题,提出利用降维处理与遗传算法两种方法进行 子区划分方案的快速寻优,并给出了一套协调控制子区快速动态划分流程.通过算 例分析说明,在一定规模路网之下本文提出的控制子区快速动态划分方法将以一个 较大概率搜索到次优子区划分方案,且因其计算时间可以被有效控制,因此完全能够 满足控制子区划分的实时性要求,可推广应用于城市区域交通信号实时控制系统中.     

城市过饱和路网的偏好多目标相容优化控制

针对城市过饱和路网的交通信号控制问题,提出将总延误分为主线路段延误和次线路段延误的划分方法,将控制问题描述为冲突的多目标控制。针对冲突多目标控制问题中最优解不唯一,而传统优化方法中一次运行只能得到一个最优解的问题,提出了一种基于偏好的相容优化控制算法：利用偏好信息动态指引寻优的方向,在偏好区域内获得更多有价值的解;提出基于偏好的目标选择函数,保证控制解在偏好区域内的稳定性。在仿真环境中对一个11个交叉口的城市过饱和路网进行实时控制,结果表明,提出的偏好相容控制算法的效果优于定时控制方案。     

动态平衡运量配流问题及其稳态伴随解算法

动态平衡运量配流问题的建模和求解是发展智能车辆导驶系统的理论基础.本文对多起 点单讫点交通网络建立了连续时间最优控制模型,该模型的最优解对应于动态用户平衡解.文 中提出的稳态伴随解算法避免了解复杂的两点边界值问题,可以获得原问题的近似解.该算 法利用了交通网络和计算机网络的结构特性,计算速度较高,可用于城市交通流的实时控制.     

具有模型和实际差异的非线性离散动态系统最优控制

针对模型与实际存在一定差异的情况,提出了一种求解非 线性离散系统最段控制的动态系统优化和参数估计集成（Ｄｙｎａｍｉｃ Ｉｎｔｅｇｒａｔｅｄ Ｓｙｓｔｅｍ Ｏｐｔｉｍｉｚａｔｉｏｎ Ｐａｒａｍｅｔｅｒ Ｅｓｔｉｍａｔｉｏｎ,简称ＤＩＳＯＰＥ）的研究法。推导出一组求解一类有终端等式约束的非齐次的线性两点边值问题的递推公式,对于有终端等式约束的非线线性最优控制问题得到了在计算上易于实现的一种ＤＩＳＯＰＥ     

基于蚁群算法的动态用户均衡配流

在路网中,为了使用户的出行时间降到最低,提出一个适用于多OD对的路网的动态用户均衡离散模型,并应用蚁群算法求解动态用户均衡问题.通过设计一个算例,利用仿真得出路网中的流量分配数据,并和二次规划Frank-Wolfe算法求解的流量分配数据进行比较,最后得出蚁群算法在求解动态交通用户均衡问题时具有一定的优势.     

A swarm intelligent method for traffic light scheduling: application to real urban traffic networks

Traffic lights play an important role nowadays for solving complex and serious urban traffic problems. How to optimize the schedule of hundreds of traffic lights has become a challenging and exciting problem. This paper proposes an inner and outer cellular automaton mechanism combined with particle swarm optimization (IOCA-PSO) method to achieve a dynamic and real-time optimization scheduling of urban traffic lights. The IOCA-PSO method includes the inner cellular model (ICM), the outer cellular model (OCM), and the fitness function. Our work can be divided into following parts: (1) Concise basic transition rules and affiliated transition rules are proposed in ICM, which can help the proposed phase cycle planning (PCP) algorithm achieve a globally sophisticated scheduling and offer effective solutions for different traffic problems; (2) Benefited from the combination of cellular automaton (CA) and particle swarm optimization (PSO), the proposed inner and outer cellular PSO (IOPSO) algorithm in OCM offers a strong search ability to find out the optimal timing control; (3) The proposed fitness function can evaluate and conduct the optimization of traffic lights’ scheduling dynamically for different aims by adjusting parameters. Extensive experiments show that, compared with the PSO method, the genetic algorithm method and the RANDOM method in real cases, IOCA-PSO presents distinct improvements under different traffic conditions, which shows a high adaptability of the proposed method in urban traffic network scales under different traffic flow states, intersection numbers, and vehicle numbers.     

一种参数联合优化的网络流量非线性预测模型

为了提高网络流量预测精度,利用相空间重构和神经网络参数间的相互联系,提出一种参数联合优化的网络流量非线性预测模型。将相空间重构和预测模型参数作为粒子群优化算法的粒子,网络流量预测精度作为粒子适应度函数,通过粒子之间相互协作获得全局最优参数,根据最优参数建立最优网络流量非线性预测模型,通过网络流量实例对模型性能进行测试。结果表明,相对于传统参数优化方法,参数联合优化方法大幅度提高了网络流量的预测精度,为非线性预测问题提供了一种新的研究思路。     

A hybrid ant-tabu algorithm for solving a multistate flow network reliability maximization problem

Network reliability optimization for multistate flow networks (MFN) is an important issue for many system supervisors. Network reliability maximization for an MFN by determining the optimal component assignment, where a set of multistate components are ready to be assigned to the network, is a common problem. Previous research solved this problem by developing and applying genetic algorithm. Ant colony optimization (ACO) finds a good solution quickly by utilizing the experience of the proceeding ant but sometimes falls into local optimum. Tabu search (TS) adopts a tabu list to avoid searching in the same direction, and thus it explores other possible solutions. This strategy enlarges the search space. Therefore, we propose a hybrid ant-tabu (HAT) algorithm integrating the advantages of ACO and TS to solve this problem, where network reliability is evaluated in terms of minimal paths (MPs) and Recursive Sum of Disjoint Products. Experimental (RSDP) results show that the proposed HAT has better computational efficiency than several soft computing algorithms for networks with more than six MPs or 10 arcs.     

Computation and application of the paired combinatorial logit stochastic user equilibrium problem

The paired combinatorial logit (PCL) model is one of the recent extended logit models adapted to resolve the overlapping problem in the route choice problem, while keeping the analytical tractability of the logit choice probability function. However, the development of efficient algorithms for solving the PCL model under congested and realistic networks is quite challenging, since it has large-dimensional solution variables as well as a complex objective function. In this paper, we examine the computation and application of the PCL stochastic user equilibrium (SUE) problem under congested and realistic networks. Specifically, we develop an improved path-based partial linearization algorithm for solving the PCL SUE problem by incorporating recent advances in line search strategies to enhance the computational efficiency required to determine a suitable stepsize that guarantees convergence. A real network in the city of Winnipeg is applied to examine the computational efficiency of the proposed algorithm and the robustness of various line search strategies. In addition, in order to acquire the practical implications of the PCL SUE model, we investigate the effectiveness of how the PCL model handles the effects of congestion, stochasticity, and similarity in comparison with the multinomial logit stochastic traffic equilibrium problem and the deterministic traffic equilibrium problem.     

Research on Combined Dynamic Traffic Assignment and Signal Control

This paper presents a generalized bi-level programming model of combined dynamic traffic assignment and traffic signal control,and especially analyzes a procedure for determining the equilibrium queuing delays on saturated links for dynamic network signal control satisfying the FIFO (first-in-first-out)rule.The chaotic optimal algorithm proposed in this paper can not only present the optimal signal settings,but also calculate,at each interval,the link inflow rates and outflow rates for the dynamic user optimal problem,and provide real-time information for the travelers.Finally,a numerical example is given to illustrate the application of the proposed model and solution algorithm, and comparison shows that this model has better system performance.     

Dynamic route guidance algorithm based on artificial immune system

To improve the performance of the K-shortest paths search in intelligent traffic guidance systems, this paper proposes an optimal search algorithm based on the intelligent optimization search theory and the metaphor mechanism of vertebrate immune systems. This algorithm, applied to the urban traffic network model established by the node-expanding method, can expediently realize K-shortest paths search in the urban traffic guidance systems. Because of the immune memory and global parallel search ability from artificial immune systems, K-shortest paths can be found without any repeat, which indicates evidently the superiority of the algorithm to the conventional ones. Not only does it perform a better parallelism, the algorithm also prevents premature phenomenon that often occurs in genetic algorithms. Thus, it is especially suitable for real-time requirement of the traffic guidance system and other engineering optimal applications. A case study verifies the efficiency and the practicability of the algorithm aforementioned.     

Dynamic route guidance algorithm based algorithm based on artificial immune system

To improve the performance of the K-shortest paths search in intelligent traffic guidance systems,this paper proposes an optimal search algorithm based on the intelligent optimization search theory and the memphor mechanism of vertebrate immune systems.This algorithm,applied to the urban traffic network model established by the node-expanding method,can expediently realize K-shortest paths search in the urban traffic guidance systems.Because of the immune memory and global parallel search ability from artificial immune systems,K shortest paths can be found without any repeat,which indicates evidently the superiority of the algorithm to the conventional ones.Not only does it perform a better parallelism,the algorithm also prevents premature phenomenon that often occurs in genetic algorithms.Thus,it is especially suitable for real-time requirement of the traffic guidance system and other engineering optimal applications.A case study verifies the efficiency and the practicability of the algorithm aforementioned.     

基于改进克隆选择算法的区域交通灯配时优化

为提高城市区域路网通行效率,提出一种基于改进的克隆选择算法的区域交通灯实时配时方法。该配时方法以最小化区域路网总滞留车辆数为优化目标,将交通灯状态设置问题转换成克隆选择算法搜索最优解问题,在每个单位时间根据实时车流量动态搜索出使区域路网通行能力达到最高的交通灯配时方案。为提高克隆选择算法寻优性能,提出双层动态变异算子,并对克隆抑制算子与种群刷新算子进行改进。以西安市某区域路网为仿真实验参考对象,仿真结果表明：提出的配时方法的区域路网总滞留车辆数比固定配时减少了38.93%,比基于标准遗传算法的配时方法减少了20.33%。     

动态交通分配与信号控制的组合模型及算法研究

This paper presents a generalized bi-level programming model of combined dynamic traffic assignment and traffic signal control, and especially analyzes a procedure for determining the equilibrium queuing delays on saturated links for dynamic network signal control satisfying the FIFO (first-in-first-out) rule. The chaotic optimal algorithm proposed in this paper can not only present the optimal signal settings, but also calculate, at each interval, the link inflow rates and outflow rates for the dynamic user optimal problem, and provide real-time information for the travelers. Finally, a numerical example is given to illustrate the application of the proposed model and solution algorithm, and comparison shows that this model has better system performance.     

Dynamic route guidance algorithm based on artificial immune system

To improve the performance of the K-shortest paths search in intelligent traffic guidance systems, this paper proposes an optimal search algorithm based on the intelligent optimization search theory and the metaphor mechanism of vertebrate immune systems. This algorithm, applied to the urban traffic network model established by the node-expanding method, can expediently realize K-shortest paths search in the urban traffic guidance systems. Because of the immune memory and global parallel search ability from artificial immune systems, K-shortest paths can be found without any repeat, which indicates evidently the superiority of the algorithm to the conventional ones. Not only does it perform a better parallelism, the algorithm also prevents premature phenomenon that often occurs in genetic algorithms. Thus, it is especially suitable for real-time requirement of the traffic guidance system and other engineering optimal applications. A case study verifies the efficiency and the practicability of the algorithm aforementioned.     

基于狼群算法的短时高速交通流量预测仿真

由于传统的短时高速交通流量预测算法的受到函数逼近能力影响,极易陷入局部极值的问题,提出基于狼群算法的短时高速交通流量预测算法。构造型前馈小波神经网络算法在多维空间内对短时高速交通流量预测,需通过构造型前馈小波神经网络算法分析随机相关多维样本逼近能力,利用改进狼群算法的全局寻优能力,提升算法搜索精度,并完成目标的搜索,根据搜索结果获取优质的函数逼近值最优解,提升构造型前馈小波神经网络算法函数的逼近能力,获取最佳短时高速交通流量预测值。仿真结果显示,上述算法的短时高速交通流量预测效果显著优于小波神经网络预测算法,且本文算法的预测精度较高,具有较高的稳定性。