The measures of path charge are important considerations in traffic assignment of road networks. Factors, such as travel time, fixed charge and traffic congestion which affect road users＇ choices of trip paths, are a...The measures of path charge are important considerations in traffic assignment of road networks. Factors, such as travel time, fixed charge and traffic congestion which affect road users＇ choices of trip paths, are analyzed. Travelers usually decide their trip paths based on their personal habits, preferences and the information at hand. By considering both deterministic and stochastic factors which affect the value of time （VOT） during the process of path choosing, a variational inequality model is proposed to describe the problem of traffic assignment. A lazy loading algorithm for traffic assignment is designed to solve the proposed model, and the calculation steps are given. Numerical experiment results show that compared with the all-or-nothing assignment, the proposed model and the algorithm can provide more optimal traffic assignments for road networks. The results of this study can be used to optimize traffic planning and management.展开更多
There were many contradictory evaluation criteria to select next-hop in the delay-disruption tolerance networks(DTN).To solve this problem,an attribute hierarchical model was proposed,in which the predefined criteria ...There were many contradictory evaluation criteria to select next-hop in the delay-disruption tolerance networks(DTN).To solve this problem,an attribute hierarchical model was proposed,in which the predefined criteria were summarized as static identity attributes,forwarding desire attributes and delivery capability attributes(IDC).Based on this model,a novel multi-attributes congestion aware routing(MACAR) scheme with uncertain information for next-hop selection was presented,by adopting an decision theory to aggregate attributes with belief structure and computing partial ordering relations.The simulation results show that MACAR presents higher successful delivery rate,lower average delay and effectively alleviate congestion.展开更多
Adaptive clustering hierarchy routing(ACHR) establishes a clusters-based hierarchical hybrid routing algorithm with two-hop local visibility for delay tolerant network(DTN).The major contribution of ACHR is the combin...Adaptive clustering hierarchy routing(ACHR) establishes a clusters-based hierarchical hybrid routing algorithm with two-hop local visibility for delay tolerant network(DTN).The major contribution of ACHR is the combination of single copy scheme and multi-copy scheme and the combination of hop-by-hop and multi-hop mechanism ACHR,which has the advantages in simplicity,availability and well-expansibility.The result shows that it can take advantage of the random communication opportunities and local network connectivity,and achieves 1.6 times delivery ratio and 60% overhead compared with its counterpart.展开更多
A finite horizon predictive control algorithm, which applies a saturated feedback control law as its local control law, is presented for nonlinear systems with time-delay subject to input constraints. In the algorithm...A finite horizon predictive control algorithm, which applies a saturated feedback control law as its local control law, is presented for nonlinear systems with time-delay subject to input constraints. In the algorithm, N free control moves, a saturated local control law and the terminal weighting matrices are solved by a minimization problem based on linear matrix inequality （LMI） constraints online. Compared with the algorithm with a nonsaturated local law, the presented algorithm improves the performances of the closed-loop systems such as feasibility and optimality. This model predictive control （MPC） algorithm is applied to an industrial continuous stirred tank reactor （CSTR） with explicit input constraint. The simulation results demonstrate that the presented algorithm is effective.展开更多
This paper introduces an ant colony routing and wavelength assignment algorithm based on cross-layer design(CL-ACRWA),which can overcome the adverse effects of Doppler wavelength shift on data transmission in optical ...This paper introduces an ant colony routing and wavelength assignment algorithm based on cross-layer design(CL-ACRWA),which can overcome the adverse effects of Doppler wavelength shift on data transmission in optical satellite networks. Firstly, a cross-layer optimization model is built, which considers the Doppler wavelength shift, the transmission delay as well as wavelength-continuity constraint. Then an ant colony algorithm is utilized to solve the cross-layer optimization model, resulting in finding an optimal light path satisfying the above constraints for every connection request. The performance of CL-ACRWA is measured by the communication success probability, the convergence property and the transmission delay. Simulation results show that CL-ACRWA performs well in communication success probability and has good global search ability as well as fast convergence speed. Meanwhile, the transmission delay can meet the basic requirement of real-time transmission of business.展开更多
ISA100.11 a industrial wireless network standard is based on a deterministic scheduling mechanism.For the timeslot delay caused by deterministic scheduling,a routing algorithm is presented for industrial environments....ISA100.11 a industrial wireless network standard is based on a deterministic scheduling mechanism.For the timeslot delay caused by deterministic scheduling,a routing algorithm is presented for industrial environments.According to timeslot,superframe,links,channel and data retransmission of deterministic scheduling mechanisms that affect the design of the routing algorithm,the algorithm selects the link quality,timeslot delay and retransmission delay as the routing criteria and finds the optimum communication path by k shortest paths algorithm.Theoretical analysis and experimental verification show that the optimal paths selected by the algorithm not only have high link quality and low retransmission delay,but also meet the requirements of the deterministic scheduling.The algorithm can effectively solve the problem of packet loss and transmission delay during data transmission,and provide a valuable solution for efficient data transmission based on determinacy.展开更多
Periodic solutions occur commonly in linear or nonlinear dynamical systems. In some cases, the stability of a periodic solution holds if the rightmost characteristic root has negative real part. Based on the Lambert W...Periodic solutions occur commonly in linear or nonlinear dynamical systems. In some cases, the stability of a periodic solution holds if the rightmost characteristic root has negative real part. Based on the Lambert W function, this paper presents a simple algorithm for locating the rightmost characteristic root of periodic solutions of some nonlinear oscillators with large time delay. As application, the proposed algorithm is used to study the primary resonance and 1/3 subharmonic resonance of the Duffing oscillator under harmonic excitation and delayed feedback, as well as the control problem of the van der Pol oscillator under harmonic excitation by using delayed feedback, with a number of case studies. The main advantage of this algorithm is that though very simple in implementation, it works effectively with high accuracy even if the delay is large.展开更多
To solve the dynamical consensus problem of second-order multi-agent systems with communication delay,delay-dependent compensations are added into the normal asynchronously-coupled consensus algorithm so as to make th...To solve the dynamical consensus problem of second-order multi-agent systems with communication delay,delay-dependent compensations are added into the normal asynchronously-coupled consensus algorithm so as to make the agents achieve a dynamical consensus. Based on frequency-domain analysis, sufficient conditions are gained for second-order multi-agent systems with communication delay under leaderless and leader-following consensus algorithms respectively. Simulation illustrates the correctness of the results.展开更多
In the precise point positioning(PPP),some impossible accurately simulated systematic errors still remained in the GPS observations and will inevitably degrade the precision of zenith tropospheric delay(ZTD) estimatio...In the precise point positioning(PPP),some impossible accurately simulated systematic errors still remained in the GPS observations and will inevitably degrade the precision of zenith tropospheric delay(ZTD) estimation.The stochastic models used in the GPS PPP mode are compared.In this paper,the research results show that the precision of PPP-derived ZTD can be obviously improved through selecting a suitable stochastic model for GPS measurements.Low-elevation observations can cover more troposphere information that can improve the estimation of ZTD.A new stochastic model based on satellite low elevation cosine square is presented.The results show that the stochastic model using satellite elevation-based cosine square function is better than previous stochastic models.展开更多
In this paper, a time-delayed predator-prey system is considered. The existence of Hopf bifurcations at the positive equilibrium is established by analyzing the distribution of the characteristic values. An explicit a...In this paper, a time-delayed predator-prey system is considered. The existence of Hopf bifurcations at the positive equilibrium is established by analyzing the distribution of the characteristic values. An explicit algorithm for determining the direction of the Hopf bifurcation and the stability of the bifurcating periodic solutions are derived by using the normal form and the center manifold theory. Numerical simulations to support the analytical conclusions are carried out.展开更多
It is considered here for an improved ant algorithm to minimize the delivery time of VRP （Vehicle Routing Problem） in distribution center. Firstly VRP which objective is to minimize the delivery time is given, then ...It is considered here for an improved ant algorithm to minimize the delivery time of VRP （Vehicle Routing Problem） in distribution center. Firstly VRP which objective is to minimize the delivery time is given, then the optimal vehicle distributionroute-division approach of distribution center for given customer array is defined, and the ant colony algorithm for VRP with objective to minimize the delivery time is presented. The research of this paper is based on the information and application case of tobacco network in Hangzhou city. By investigating, we created two different system models. One is division of distribution route of distribution center, and the other is optimization of single vehicle route. The computational example tests and verifys the solution.展开更多
基金The National High Technology Research and Development Program of China(863 Program)(No.2007AA11Z202)the National Key Technology R&D Program of China during the 11th Five-Year Plan Period(No.2006BAJ18B03)
文摘The measures of path charge are important considerations in traffic assignment of road networks. Factors, such as travel time, fixed charge and traffic congestion which affect road users＇ choices of trip paths, are analyzed. Travelers usually decide their trip paths based on their personal habits, preferences and the information at hand. By considering both deterministic and stochastic factors which affect the value of time （VOT） during the process of path choosing, a variational inequality model is proposed to describe the problem of traffic assignment. A lazy loading algorithm for traffic assignment is designed to solve the proposed model, and the calculation steps are given. Numerical experiment results show that compared with the all-or-nothing assignment, the proposed model and the algorithm can provide more optimal traffic assignments for road networks. The results of this study can be used to optimize traffic planning and management.
基金Project(60973127) supported by the National Natural Science Foundation of ChinaProject(09JJ3123) supported by the Natural Science Foundation of Hunan Province,China
文摘There were many contradictory evaluation criteria to select next-hop in the delay-disruption tolerance networks(DTN).To solve this problem,an attribute hierarchical model was proposed,in which the predefined criteria were summarized as static identity attributes,forwarding desire attributes and delivery capability attributes(IDC).Based on this model,a novel multi-attributes congestion aware routing(MACAR) scheme with uncertain information for next-hop selection was presented,by adopting an decision theory to aggregate attributes with belief structure and computing partial ordering relations.The simulation results show that MACAR presents higher successful delivery rate,lower average delay and effectively alleviate congestion.
基金Project(531107040202) supported by the Fundamental Research Funds for the Central Universities of China
文摘Adaptive clustering hierarchy routing(ACHR) establishes a clusters-based hierarchical hybrid routing algorithm with two-hop local visibility for delay tolerant network(DTN).The major contribution of ACHR is the combination of single copy scheme and multi-copy scheme and the combination of hop-by-hop and multi-hop mechanism ACHR,which has the advantages in simplicity,availability and well-expansibility.The result shows that it can take advantage of the random communication opportunities and local network connectivity,and achieves 1.6 times delivery ratio and 60% overhead compared with its counterpart.
基金Supported by the National High Technology Research and Development Program of China(2004AA412050)
文摘A finite horizon predictive control algorithm, which applies a saturated feedback control law as its local control law, is presented for nonlinear systems with time-delay subject to input constraints. In the algorithm, N free control moves, a saturated local control law and the terminal weighting matrices are solved by a minimization problem based on linear matrix inequality （LMI） constraints online. Compared with the algorithm with a nonsaturated local law, the presented algorithm improves the performances of the closed-loop systems such as feasibility and optimality. This model predictive control （MPC） algorithm is applied to an industrial continuous stirred tank reactor （CSTR） with explicit input constraint. The simulation results demonstrate that the presented algorithm is effective.
基金supported by the National Natural Science Foundation of China(No.61675033,61575026,61675233)National High Technical Research and Development Program of China(No.2015AA015504)
文摘This paper introduces an ant colony routing and wavelength assignment algorithm based on cross-layer design(CL-ACRWA),which can overcome the adverse effects of Doppler wavelength shift on data transmission in optical satellite networks. Firstly, a cross-layer optimization model is built, which considers the Doppler wavelength shift, the transmission delay as well as wavelength-continuity constraint. Then an ant colony algorithm is utilized to solve the cross-layer optimization model, resulting in finding an optimal light path satisfying the above constraints for every connection request. The performance of CL-ACRWA is measured by the communication success probability, the convergence property and the transmission delay. Simulation results show that CL-ACRWA performs well in communication success probability and has good global search ability as well as fast convergence speed. Meanwhile, the transmission delay can meet the basic requirement of real-time transmission of business.
基金Supported by the National Natural Science Foundation of China(No.61301125)the National High Technology Research and Development Programme of China(No.0AA0401028003)+2 种基金National Science and Technology Major Project(No.2013ZX03005005)the Fundamental and Advanced Research Program of Chongqing(No.cstc2013jcyjA40008)the Youth Top-notch Talent Support Program of Chongqing(No.2013-139)
文摘ISA100.11 a industrial wireless network standard is based on a deterministic scheduling mechanism.For the timeslot delay caused by deterministic scheduling,a routing algorithm is presented for industrial environments.According to timeslot,superframe,links,channel and data retransmission of deterministic scheduling mechanisms that affect the design of the routing algorithm,the algorithm selects the link quality,timeslot delay and retransmission delay as the routing criteria and finds the optimum communication path by k shortest paths algorithm.Theoretical analysis and experimental verification show that the optimal paths selected by the algorithm not only have high link quality and low retransmission delay,but also meet the requirements of the deterministic scheduling.The algorithm can effectively solve the problem of packet loss and transmission delay during data transmission,and provide a valuable solution for efficient data transmission based on determinacy.
基金supported by the National Natural Science Foundation of China (Grant Nos. 10825207, 11032009)by Program for Changjiang Scholars and Innovative Research Team in University (Grant No. IRT0968)
文摘Periodic solutions occur commonly in linear or nonlinear dynamical systems. In some cases, the stability of a periodic solution holds if the rightmost characteristic root has negative real part. Based on the Lambert W function, this paper presents a simple algorithm for locating the rightmost characteristic root of periodic solutions of some nonlinear oscillators with large time delay. As application, the proposed algorithm is used to study the primary resonance and 1/3 subharmonic resonance of the Duffing oscillator under harmonic excitation and delayed feedback, as well as the control problem of the van der Pol oscillator under harmonic excitation by using delayed feedback, with a number of case studies. The main advantage of this algorithm is that though very simple in implementation, it works effectively with high accuracy even if the delay is large.
基金Supported by the National Natural Science Foundation of China under Grant Nos.61104092,61134007,and61203147the Priority Academic Program Development of Jiangsu Higher Education Institutions
文摘To solve the dynamical consensus problem of second-order multi-agent systems with communication delay,delay-dependent compensations are added into the normal asynchronously-coupled consensus algorithm so as to make the agents achieve a dynamical consensus. Based on frequency-domain analysis, sufficient conditions are gained for second-order multi-agent systems with communication delay under leaderless and leader-following consensus algorithms respectively. Simulation illustrates the correctness of the results.
文摘In the precise point positioning(PPP),some impossible accurately simulated systematic errors still remained in the GPS observations and will inevitably degrade the precision of zenith tropospheric delay(ZTD) estimation.The stochastic models used in the GPS PPP mode are compared.In this paper,the research results show that the precision of PPP-derived ZTD can be obviously improved through selecting a suitable stochastic model for GPS measurements.Low-elevation observations can cover more troposphere information that can improve the estimation of ZTD.A new stochastic model based on satellite low elevation cosine square is presented.The results show that the stochastic model using satellite elevation-based cosine square function is better than previous stochastic models.
文摘In this paper, a time-delayed predator-prey system is considered. The existence of Hopf bifurcations at the positive equilibrium is established by analyzing the distribution of the characteristic values. An explicit algorithm for determining the direction of the Hopf bifurcation and the stability of the bifurcating periodic solutions are derived by using the normal form and the center manifold theory. Numerical simulations to support the analytical conclusions are carried out.
文摘It is considered here for an improved ant algorithm to minimize the delivery time of VRP （Vehicle Routing Problem） in distribution center. Firstly VRP which objective is to minimize the delivery time is given, then the optimal vehicle distributionroute-division approach of distribution center for given customer array is defined, and the ant colony algorithm for VRP with objective to minimize the delivery time is presented. The research of this paper is based on the information and application case of tobacco network in Hangzhou city. By investigating, we created two different system models. One is division of distribution route of distribution center, and the other is optimization of single vehicle route. The computational example tests and verifys the solution.
