This paper presents an optimized strategy for multiple integrations of photovoltaic distributed generation (PV-DG) within radial distribution power systems. The proposed methodology focuses on identifying the optimal ...This paper presents an optimized strategy for multiple integrations of photovoltaic distributed generation (PV-DG) within radial distribution power systems. The proposed methodology focuses on identifying the optimal allocation and sizing of multiple PV-DG units to minimize power losses using a probabilistic PV model and time-series power flow analysis. Addressing the uncertainties in PV output due to weather variability and diurnal cycles is critical. A probabilistic assessment offers a more robust analysis of DG integration’s impact on the grid, potentially leading to more reliable system planning. The presented approach employs a genetic algorithm (GA) and a determined PV output profile and probabilistic PV generation profile based on experimental measurements for one year of solar radiation in Cairo, Egypt. The proposed algorithms are validated using a co-simulation framework that integrates MATLAB and OpenDSS, enabling analysis on a 33-bus test system. This framework can act as a guideline for creating other co-simulation algorithms to enhance computing platforms for contemporary modern distribution systems within smart grids concept. The paper presents comparisons with previous research studies and various interesting findings such as the considered hours for developing the probabilistic model presents different results.展开更多
The chirp sub-bottom profiler,for its high resolution,easy accessibility and cost-effectiveness,has been widely used in acoustic detection.In this paper,the acoustic impedance and grain size compositions were obtained...The chirp sub-bottom profiler,for its high resolution,easy accessibility and cost-effectiveness,has been widely used in acoustic detection.In this paper,the acoustic impedance and grain size compositions were obtained based on the chirp sub-bottom profiler data collected in the Chukchi Plateau area during the 11th Arctic Expedition of China.The time-domain adaptive search matching algorithm was used and validated on our established theoretical model.The misfit between the inversion result and the theoretical model is less than 0.067%.The grain size was calculated according to the empirical relationship between the acoustic impedance and the grain size of the sediment.The average acoustic impedance of sub-seafloor strata is 2.5026×10^(6) kg(s m^(2))^(-1)and the average grain size(θvalue)of the seafloor surface sediment is 7.1498,indicating the predominant occurrence of very fine silt sediment in the study area.Comparison of the inversion results and the laboratory measurements of nearby borehole samples shows that they are in general agreement.展开更多
In this article, numerical modeling of borehole radar for well logging in time domain is developed using pseudo-spectral time domain algorithm in axisymmetric cylindrical coordinate for proximate true formation model....In this article, numerical modeling of borehole radar for well logging in time domain is developed using pseudo-spectral time domain algorithm in axisymmetric cylindrical coordinate for proximate true formation model. The conductivity and relative permittivity logging curves are obtained from the data of borehole radar for well logging. Since the relative permittivity logging curve is not affected by salinity of formation water, borehole radar for well logging has obvious advantages as compared with conventional electrical logging. The borehole radar for well logging is a one-transmitter and two-receiver logging tool. The conductivity and relative permittivity logging curves are obtained successfully by measuring the amplitude radio and the time difference of pulse waveform from two receivers. The calculated conductivity and relative permittivity logging curves are close to the true value of surrounding formation, which tests the usability and reliability of borehole radar for well logging. The numerical modeling of borehole radar for well logging laid the important foundation for researching its logging tool.展开更多
A class of hybrid algorithms of real-time simulation based on evaluation of non-integerstep right-hand side function are presented in this paper. And some results of the convergence and stability of the algorithms are...A class of hybrid algorithms of real-time simulation based on evaluation of non-integerstep right-hand side function are presented in this paper. And some results of the convergence and stability of the algorithms are given. Using the class of algorithms, evaluation for the right-hand side function is needed once in every integration-step. Moreover, comparing with the other methods with the same amount of work, their numerical stability regions are larger and the method errors are smaller, and the numerical experiments show that the algorithms are very effective.展开更多
The trust in distributed environment is uncertain, which is variation for various factors. This paper introduces TDTM, a model for time-based dynamic trust. Every entity in the distribute environment is endowed with a...The trust in distributed environment is uncertain, which is variation for various factors. This paper introduces TDTM, a model for time-based dynamic trust. Every entity in the distribute environment is endowed with a trust-vector, which figures the trust intensity between this entity and the others. The trust intensity is dynamic due to the time and the inter-operation between two entities, a method is proposed to quantify this change based on the mind of ant colony algorithm and then an algorithm for the transfer of trust relation is also proposed. Furthermore, this paper analyses the influence to the trust intensity among all entities that is aroused by the change of trust intensity between the two entities, and presents an algorithm to resolve the problem. Finally, we show the process of the trusts＇ change that is aroused by the time＇s lapse and the inter-operation through an instance.展开更多
In this paper a class of real-time parallel modified Rosenbrock methods of numerical simulation is constructed for stiff dynamic systems on a multiprocessor system, and convergence and numerical stability of these met...In this paper a class of real-time parallel modified Rosenbrock methods of numerical simulation is constructed for stiff dynamic systems on a multiprocessor system, and convergence and numerical stability of these methods are discussed. A-stable real-time parallel formula of two-stage third-order and A(α)-stable real-time parallel formula with o ≈ 89.96° of three-stage fourth-order are particularly given. The numerical simulation experiments in parallel environment show that the class of algorithms is efficient and applicable, with greater speedup.展开更多
The feasibility of a parameter identification method based on symbolic time series analysis (STSA) and the adaptive immune clonal selection algorithm (AICSA) is studied. Data symbolization by using STSA alleviates the...The feasibility of a parameter identification method based on symbolic time series analysis (STSA) and the adaptive immune clonal selection algorithm (AICSA) is studied. Data symbolization by using STSA alleviates the effects of harmful noise in raw acceleration data. The effect of the parameters in STSA is theoretically evaluated and numerically verified. AICSA is employed to minimize the error between the state sequence histogram (SSH) that is transformed from raw acceleration data by STSA. The proposed methodology is evaluated by comparing it with AICSA using raw acceleration data. AICSA combining STSA is proved to be a powerful tool for identifying unknown parameters of structural systems even when the data is contaminated with relatively large amounts of noise.展开更多
The PPSV (Proportional Pulse in the System Variable) algorithm is a convenient method for the stabilization of the chaotic time series. It does not require any previous knowledge of the system. The PPSV method also ha...The PPSV (Proportional Pulse in the System Variable) algorithm is a convenient method for the stabilization of the chaotic time series. It does not require any previous knowledge of the system. The PPSV method also has a shortcoming, that is, the determination off. is a procedure by trial and error, since it lacks of optimization. In order to overcome the blindness, GA (Genetic Algorithm), a search algorithm based on the mechanics of natural selection and natural genetics, is used to optimize the λi The new method is named as GAPPSV algorithm. The simulation results show that GAPPSV algorithm is very efficient because the control process is short and the steady-state error is small.展开更多
This research considers the time-dependent vehicle routing problem (TDVRP). The time-dependent VRP does not assume constant speeds of the vehicles. The speeds of the vehicles vary during the various times of the day, ...This research considers the time-dependent vehicle routing problem (TDVRP). The time-dependent VRP does not assume constant speeds of the vehicles. The speeds of the vehicles vary during the various times of the day, based on the traffic conditions. During the periods of peak traffic hours, the vehicles travel at low speeds and during non-peak hours, the vehicles travel at higher speeds. A survey by TCI and IIM-C (2014) found that stoppage delay as percentage of journey time varied between five percent and 25 percent, and was very much dependent on the characteristics of routes. Costs of delay were also estimated and found not to affect margins by significant amounts. This study aims to overcome such problems arising out of traffic congestions that lead to unnecessary delays and hence, loss in customers and thereby valuable revenues to a company. This study suggests alternative routes to minimize travel times and travel distance, assuming a congestion in traffic situation. In this study, an efficient GA-based algorithm has been developed for the TDVRP, to minimize the total distance travelled, minimize the total number of vehicles utilized and also suggest alternative routes for congestion avoidance. This study will help to overcome and minimize the negative effects due to heavy traffic congestions and delays in customer service. The proposed algorithm has been shown to be superior to another existing algorithm in terms of the total distance travelled and also the number of vehicles utilized. Also the performance of the proposed algorithm is as good as the mathematical model for small size problems.展开更多
A class of nonidentical parallel machine scheduling problems are considered in which the goal is to minimize the total weighted completion time. Models and relaxations are collected. Most of these problems are NP-hard...A class of nonidentical parallel machine scheduling problems are considered in which the goal is to minimize the total weighted completion time. Models and relaxations are collected. Most of these problems are NP-hard, in the strong sense, or open problems, therefore approximation algorithms are studied. The review reveals that there exist some potential areas worthy of further research.展开更多
Based on the weighted residual method,a single-step time integration algorithm with higher-order accuracy and unconditional stability has been proposed,which is superior to the second-order accurate algorithms in trac...Based on the weighted residual method,a single-step time integration algorithm with higher-order accuracy and unconditional stability has been proposed,which is superior to the second-order accurate algorithms in tracking long-term dynamics.For improving such a higher-order accurate algorithm,this paper proposes a two sub-step higher-order algorithm with unconditional stability and controllable dissipation.In the proposed algorithm,a time step interval[t_(k),t_(k)+h]where h stands for the size of a time step is divided into two sub-steps[t_(k),t_(k)+γh]and[t_(k)+γh,t_(k)+h].A non-dissipative fourth-order algorithm is used in the rst sub-step to ensure low-frequency accuracy and a dissipative third-order algorithm is employed in the second sub-step to lter out the contribution of high-frequency modes.Besides,two approaches are used to design the algorithm parameterγ.The rst approach determinesγby maximizing low-frequency accuracy and the other determinesγfor quickly damping out highfrequency modes.The present algorithm usesρ_(∞)to exactly control the degree of numerical dissipation,and it is third-order accurate when 0≤ρ_(∞)<1 and fourth-order accurate whenρ_(∞)=1.Furthermore,the proposed algorithm is self-starting and easy to implement.Some illustrative linear and nonlinear examples are solved to check the performances of the proposed two sub-step higher-order algorithm.展开更多
Escape time algorithm is an effective theoretical algorithm of constructing fractal graphics. The key of this algorithm lies in the construction of escape time function. A new escape time function is presented based o...Escape time algorithm is an effective theoretical algorithm of constructing fractal graphics. The key of this algorithm lies in the construction of escape time function. A new escape time function is presented based on the research of escape time algorithm. An accelerated escape time algorithm is carried out in this paper. The experiments have demonstrated that the new algorithm is not only as precise as the old, but also faster when it is used to construct Julia set.展开更多
A non-incremental time-space algorithm is proposed for numerical. analysis of forming process with the inclusion of geometrical, material, contact-frictional nonlinearities. Unlike the widely used Newton-Raphso...A non-incremental time-space algorithm is proposed for numerical. analysis of forming process with the inclusion of geometrical, material, contact-frictional nonlinearities. Unlike the widely used Newton-Raphson counterpart, the present scheme features an iterative solution procedure on entire time and space domain. Validity and feasibility of foe present scheme are further justiced by the numerical investigation herewith presented.展开更多
The theoretical positioning accuracy of multilateration(MLAT) with the time difference of arrival(TDOA) algorithm is very high. However, there are some problems in practical applications. Here we analyze the location ...The theoretical positioning accuracy of multilateration(MLAT) with the time difference of arrival(TDOA) algorithm is very high. However, there are some problems in practical applications. Here we analyze the location performance of the time sum of arrival(TSOA) algorithm from the root mean square error(RMSE) and geometric dilution of precision(GDOP) in additive white Gaussian noise(AWGN) environment. The TSOA localization model is constructed. Using it, the distribution of location ambiguity region is presented with 4-base stations. And then, the location performance analysis is started from the 4-base stations with calculating the RMSE and GDOP variation. Subsequently, when the location parameters are changed in number of base stations, base station layout and so on, the performance changing patterns of the TSOA location algorithm are shown. So, the TSOA location characteristics and performance are revealed. From the RMSE and GDOP state changing trend, the anti-noise performance and robustness of the TSOA localization algorithm are proved. The TSOA anti-noise performance will be used for reducing the blind-zone and the false location rate of MLAT systems.展开更多
In this paper, we present a new algorithm of the time-dependent shortest path problem with time windows. Give a directed graph , where V is a set of nodes, E is a set of edges with a non-negative transit-time function...In this paper, we present a new algorithm of the time-dependent shortest path problem with time windows. Give a directed graph , where V is a set of nodes, E is a set of edges with a non-negative transit-time function . For each node , a time window ?within which the node may be visited and ?, is non-negative of the service and leaving time of the node. A source node s, a destination node d and a departure time?t0, the time-dependent shortest path problem with time windows asks to find an s, d-path that leaves a source node s at a departure time t0;and minimizes the total arrival time at a destination node d. This formulation generalizes the classical shortest path problem in which ce are constants. Our algorithm of the time windows gave the generalization of the ALT algorithm and A* algorithm for the classical problem according to Goldberg and Harrelson [1], Dreyfus [2] and Hart et al. [3].展开更多
Multi-constrained Quality-of-Service (QoS) routing is a big challenge for Mobile Ad hoc Networks (MANETs) where the topology may change constantly. In this paper a novel QoS Routing Algorithm based on Simulated Anneal...Multi-constrained Quality-of-Service (QoS) routing is a big challenge for Mobile Ad hoc Networks (MANETs) where the topology may change constantly. In this paper a novel QoS Routing Algorithm based on Simulated Annealing (SA_RA) is proposed. This algorithm first uses an energy function to translate multiple QoS weights into a single mixed metric and then seeks to find a feasible path by simulated annealing. The pa- per outlines simulated annealing algorithm and analyzes the problems met when we apply it to Qos Routing (QoSR) in MANETs. Theoretical analysis and experiment results demonstrate that the proposed method is an effective approximation algorithms showing better performance than the other pertinent algorithm in seeking the (approximate) optimal configuration within a period of polynomial time.展开更多
A new control mode is proposed for a networked control system whose network-induced delay is longer than a sampling period. A time-division algorithm is presented to implement the control and for the mathematical mode...A new control mode is proposed for a networked control system whose network-induced delay is longer than a sampling period. A time-division algorithm is presented to implement the control and for the mathematical modeling of such networked control system. The infinite horizon controller is designed, which renders the networked control system mean square exponentially stable.Simulation results show the validity of the proposed theory.展开更多
The growing global competition compels manufacturing organizations to engage themselves in all productivity improvement activities. In this direction, the consideration of mixed-model assembly line balancing problem a...The growing global competition compels manufacturing organizations to engage themselves in all productivity improvement activities. In this direction, the consideration of mixed-model assembly line balancing problem and implementing in industries plays a major role in improving organizational productivity. In this paper, the mixed model assembly line balancing problem with deterministic task times is considered. The authors made an attempt to develop a genetic algorithm for realistic design of the mixed-model assembly line balancing problem. The design is made using the originnal task times of the models, which is a realistic approach. Then, it is compared with the generally perceived design of the mixed-model assembly line balancing problem.展开更多
文摘This paper presents an optimized strategy for multiple integrations of photovoltaic distributed generation (PV-DG) within radial distribution power systems. The proposed methodology focuses on identifying the optimal allocation and sizing of multiple PV-DG units to minimize power losses using a probabilistic PV model and time-series power flow analysis. Addressing the uncertainties in PV output due to weather variability and diurnal cycles is critical. A probabilistic assessment offers a more robust analysis of DG integration’s impact on the grid, potentially leading to more reliable system planning. The presented approach employs a genetic algorithm (GA) and a determined PV output profile and probabilistic PV generation profile based on experimental measurements for one year of solar radiation in Cairo, Egypt. The proposed algorithms are validated using a co-simulation framework that integrates MATLAB and OpenDSS, enabling analysis on a 33-bus test system. This framework can act as a guideline for creating other co-simulation algorithms to enhance computing platforms for contemporary modern distribution systems within smart grids concept. The paper presents comparisons with previous research studies and various interesting findings such as the considered hours for developing the probabilistic model presents different results.
基金supported by the National Key R&D Program of China (No.2021YFC2801202)the National Natural Science Foundation of China (No.42076224)the Fundamental Research Funds for the Central Universities (No.202262012)。
文摘The chirp sub-bottom profiler,for its high resolution,easy accessibility and cost-effectiveness,has been widely used in acoustic detection.In this paper,the acoustic impedance and grain size compositions were obtained based on the chirp sub-bottom profiler data collected in the Chukchi Plateau area during the 11th Arctic Expedition of China.The time-domain adaptive search matching algorithm was used and validated on our established theoretical model.The misfit between the inversion result and the theoretical model is less than 0.067%.The grain size was calculated according to the empirical relationship between the acoustic impedance and the grain size of the sediment.The average acoustic impedance of sub-seafloor strata is 2.5026×10^(6) kg(s m^(2))^(-1)and the average grain size(θvalue)of the seafloor surface sediment is 7.1498,indicating the predominant occurrence of very fine silt sediment in the study area.Comparison of the inversion results and the laboratory measurements of nearby borehole samples shows that they are in general agreement.
基金supported by the Open Fund of Key Laboratory of Geo-detection (China University of Geosciences,Beijing),Ministry of Education (No. GDL0805)
文摘In this article, numerical modeling of borehole radar for well logging in time domain is developed using pseudo-spectral time domain algorithm in axisymmetric cylindrical coordinate for proximate true formation model. The conductivity and relative permittivity logging curves are obtained from the data of borehole radar for well logging. Since the relative permittivity logging curve is not affected by salinity of formation water, borehole radar for well logging has obvious advantages as compared with conventional electrical logging. The borehole radar for well logging is a one-transmitter and two-receiver logging tool. The conductivity and relative permittivity logging curves are obtained successfully by measuring the amplitude radio and the time difference of pulse waveform from two receivers. The calculated conductivity and relative permittivity logging curves are close to the true value of surrounding formation, which tests the usability and reliability of borehole radar for well logging. The numerical modeling of borehole radar for well logging laid the important foundation for researching its logging tool.
文摘A class of hybrid algorithms of real-time simulation based on evaluation of non-integerstep right-hand side function are presented in this paper. And some results of the convergence and stability of the algorithms are given. Using the class of algorithms, evaluation for the right-hand side function is needed once in every integration-step. Moreover, comparing with the other methods with the same amount of work, their numerical stability regions are larger and the method errors are smaller, and the numerical experiments show that the algorithms are very effective.
基金Supported by the National Natural Science Foun-dation of China (60403027) Natural Science Foundation of HubeiProvince (2005ABA258) Open Foundation of State Key Labora-tory of Software Engineering (SKLSE05-07)
文摘The trust in distributed environment is uncertain, which is variation for various factors. This paper introduces TDTM, a model for time-based dynamic trust. Every entity in the distribute environment is endowed with a trust-vector, which figures the trust intensity between this entity and the others. The trust intensity is dynamic due to the time and the inter-operation between two entities, a method is proposed to quantify this change based on the mind of ant colony algorithm and then an algorithm for the transfer of trust relation is also proposed. Furthermore, this paper analyses the influence to the trust intensity among all entities that is aroused by the change of trust intensity between the two entities, and presents an algorithm to resolve the problem. Finally, we show the process of the trusts＇ change that is aroused by the time＇s lapse and the inter-operation through an instance.
基金This project was supported by the National Natural Science Foundation of China (No. 19871080).
文摘In this paper a class of real-time parallel modified Rosenbrock methods of numerical simulation is constructed for stiff dynamic systems on a multiprocessor system, and convergence and numerical stability of these methods are discussed. A-stable real-time parallel formula of two-stage third-order and A(α)-stable real-time parallel formula with o ≈ 89.96° of three-stage fourth-order are particularly given. The numerical simulation experiments in parallel environment show that the class of algorithms is efficient and applicable, with greater speedup.
文摘The feasibility of a parameter identification method based on symbolic time series analysis (STSA) and the adaptive immune clonal selection algorithm (AICSA) is studied. Data symbolization by using STSA alleviates the effects of harmful noise in raw acceleration data. The effect of the parameters in STSA is theoretically evaluated and numerically verified. AICSA is employed to minimize the error between the state sequence histogram (SSH) that is transformed from raw acceleration data by STSA. The proposed methodology is evaluated by comparing it with AICSA using raw acceleration data. AICSA combining STSA is proved to be a powerful tool for identifying unknown parameters of structural systems even when the data is contaminated with relatively large amounts of noise.
文摘The PPSV (Proportional Pulse in the System Variable) algorithm is a convenient method for the stabilization of the chaotic time series. It does not require any previous knowledge of the system. The PPSV method also has a shortcoming, that is, the determination off. is a procedure by trial and error, since it lacks of optimization. In order to overcome the blindness, GA (Genetic Algorithm), a search algorithm based on the mechanics of natural selection and natural genetics, is used to optimize the λi The new method is named as GAPPSV algorithm. The simulation results show that GAPPSV algorithm is very efficient because the control process is short and the steady-state error is small.
文摘This research considers the time-dependent vehicle routing problem (TDVRP). The time-dependent VRP does not assume constant speeds of the vehicles. The speeds of the vehicles vary during the various times of the day, based on the traffic conditions. During the periods of peak traffic hours, the vehicles travel at low speeds and during non-peak hours, the vehicles travel at higher speeds. A survey by TCI and IIM-C (2014) found that stoppage delay as percentage of journey time varied between five percent and 25 percent, and was very much dependent on the characteristics of routes. Costs of delay were also estimated and found not to affect margins by significant amounts. This study aims to overcome such problems arising out of traffic congestions that lead to unnecessary delays and hence, loss in customers and thereby valuable revenues to a company. This study suggests alternative routes to minimize travel times and travel distance, assuming a congestion in traffic situation. In this study, an efficient GA-based algorithm has been developed for the TDVRP, to minimize the total distance travelled, minimize the total number of vehicles utilized and also suggest alternative routes for congestion avoidance. This study will help to overcome and minimize the negative effects due to heavy traffic congestions and delays in customer service. The proposed algorithm has been shown to be superior to another existing algorithm in terms of the total distance travelled and also the number of vehicles utilized. Also the performance of the proposed algorithm is as good as the mathematical model for small size problems.
基金the National Natural Science Foundation of China (70631003)the Hefei University of Technology Foundation (071102F).
文摘A class of nonidentical parallel machine scheduling problems are considered in which the goal is to minimize the total weighted completion time. Models and relaxations are collected. Most of these problems are NP-hard, in the strong sense, or open problems, therefore approximation algorithms are studied. The review reveals that there exist some potential areas worthy of further research.
基金supported by the National Natural Science Foundation of China(Grant Numbers 11872090,11672019,11472035).
文摘Based on the weighted residual method,a single-step time integration algorithm with higher-order accuracy and unconditional stability has been proposed,which is superior to the second-order accurate algorithms in tracking long-term dynamics.For improving such a higher-order accurate algorithm,this paper proposes a two sub-step higher-order algorithm with unconditional stability and controllable dissipation.In the proposed algorithm,a time step interval[t_(k),t_(k)+h]where h stands for the size of a time step is divided into two sub-steps[t_(k),t_(k)+γh]and[t_(k)+γh,t_(k)+h].A non-dissipative fourth-order algorithm is used in the rst sub-step to ensure low-frequency accuracy and a dissipative third-order algorithm is employed in the second sub-step to lter out the contribution of high-frequency modes.Besides,two approaches are used to design the algorithm parameterγ.The rst approach determinesγby maximizing low-frequency accuracy and the other determinesγfor quickly damping out highfrequency modes.The present algorithm usesρ_(∞)to exactly control the degree of numerical dissipation,and it is third-order accurate when 0≤ρ_(∞)<1 and fourth-order accurate whenρ_(∞)=1.Furthermore,the proposed algorithm is self-starting and easy to implement.Some illustrative linear and nonlinear examples are solved to check the performances of the proposed two sub-step higher-order algorithm.
文摘Escape time algorithm is an effective theoretical algorithm of constructing fractal graphics. The key of this algorithm lies in the construction of escape time function. A new escape time function is presented based on the research of escape time algorithm. An accelerated escape time algorithm is carried out in this paper. The experiments have demonstrated that the new algorithm is not only as precise as the old, but also faster when it is used to construct Julia set.
文摘A non-incremental time-space algorithm is proposed for numerical. analysis of forming process with the inclusion of geometrical, material, contact-frictional nonlinearities. Unlike the widely used Newton-Raphson counterpart, the present scheme features an iterative solution procedure on entire time and space domain. Validity and feasibility of foe present scheme are further justiced by the numerical investigation herewith presented.
基金supported by the Joint Civil Aviation Fund of National Natural Science Foundation of China(Nos.U1533108 and U1233112)
文摘The theoretical positioning accuracy of multilateration(MLAT) with the time difference of arrival(TDOA) algorithm is very high. However, there are some problems in practical applications. Here we analyze the location performance of the time sum of arrival(TSOA) algorithm from the root mean square error(RMSE) and geometric dilution of precision(GDOP) in additive white Gaussian noise(AWGN) environment. The TSOA localization model is constructed. Using it, the distribution of location ambiguity region is presented with 4-base stations. And then, the location performance analysis is started from the 4-base stations with calculating the RMSE and GDOP variation. Subsequently, when the location parameters are changed in number of base stations, base station layout and so on, the performance changing patterns of the TSOA location algorithm are shown. So, the TSOA location characteristics and performance are revealed. From the RMSE and GDOP state changing trend, the anti-noise performance and robustness of the TSOA localization algorithm are proved. The TSOA anti-noise performance will be used for reducing the blind-zone and the false location rate of MLAT systems.
文摘In this paper, we present a new algorithm of the time-dependent shortest path problem with time windows. Give a directed graph , where V is a set of nodes, E is a set of edges with a non-negative transit-time function . For each node , a time window ?within which the node may be visited and ?, is non-negative of the service and leaving time of the node. A source node s, a destination node d and a departure time?t0, the time-dependent shortest path problem with time windows asks to find an s, d-path that leaves a source node s at a departure time t0;and minimizes the total arrival time at a destination node d. This formulation generalizes the classical shortest path problem in which ce are constants. Our algorithm of the time windows gave the generalization of the ALT algorithm and A* algorithm for the classical problem according to Goldberg and Harrelson [1], Dreyfus [2] and Hart et al. [3].
基金Supported by the National Natural Science Foundation of China (No.60472104), the Natural Science Research Program of Jiangsu Province (No.04KJB510094).
文摘Multi-constrained Quality-of-Service (QoS) routing is a big challenge for Mobile Ad hoc Networks (MANETs) where the topology may change constantly. In this paper a novel QoS Routing Algorithm based on Simulated Annealing (SA_RA) is proposed. This algorithm first uses an energy function to translate multiple QoS weights into a single mixed metric and then seeks to find a feasible path by simulated annealing. The pa- per outlines simulated annealing algorithm and analyzes the problems met when we apply it to Qos Routing (QoSR) in MANETs. Theoretical analysis and experiment results demonstrate that the proposed method is an effective approximation algorithms showing better performance than the other pertinent algorithm in seeking the (approximate) optimal configuration within a period of polynomial time.
文摘A new control mode is proposed for a networked control system whose network-induced delay is longer than a sampling period. A time-division algorithm is presented to implement the control and for the mathematical modeling of such networked control system. The infinite horizon controller is designed, which renders the networked control system mean square exponentially stable.Simulation results show the validity of the proposed theory.
文摘The growing global competition compels manufacturing organizations to engage themselves in all productivity improvement activities. In this direction, the consideration of mixed-model assembly line balancing problem and implementing in industries plays a major role in improving organizational productivity. In this paper, the mixed model assembly line balancing problem with deterministic task times is considered. The authors made an attempt to develop a genetic algorithm for realistic design of the mixed-model assembly line balancing problem. The design is made using the originnal task times of the models, which is a realistic approach. Then, it is compared with the generally perceived design of the mixed-model assembly line balancing problem.
