Pub Date : 2003-12-19DOI: 10.1109/ITSC.2003.1252749
L. Chu, H.X. Liu, Jun-Seok Oh, W. Recker
Simulation modeling is an increasingly popular and effective tool for analyzing transportation problems that are not amendable to study by other means. For any simulation study, model calibration is a crucial step to obtaining any results from analysis. This paper presents a systematic, multistage calibration and validation procedure for microscopic simulation models. The procedure is demonstrated in a calibration study with a corridor network in the southern California. The model validation results for the study network are also summarized.
{"title":"A calibration procedure for microscopic traffic simulation","authors":"L. Chu, H.X. Liu, Jun-Seok Oh, W. Recker","doi":"10.1109/ITSC.2003.1252749","DOIUrl":"https://doi.org/10.1109/ITSC.2003.1252749","url":null,"abstract":"Simulation modeling is an increasingly popular and effective tool for analyzing transportation problems that are not amendable to study by other means. For any simulation study, model calibration is a crucial step to obtaining any results from analysis. This paper presents a systematic, multistage calibration and validation procedure for microscopic simulation models. The procedure is demonstrated in a calibration study with a corridor network in the southern California. The model validation results for the study network are also summarized.","PeriodicalId":123155,"journal":{"name":"Proceedings of the 2003 IEEE International Conference on Intelligent Transportation Systems","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130675480","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2003-12-19DOI: 10.1109/ITSC.2003.1252651
Q. Li, Lianyu Wei, Shoufeng Ma
Intersection traffic controlling is an important aspect of the urban traffic controlling system. The controlling policy depends on the forecasting results about the vehicles arriving and distributed at signalized intersections. After Markov process is analyzed. Markov analysis method is used to construct an intersection traffic situation prediction model to estimate accurately what the forthcoming traffic conditions of the intersection may be in this paper. A numerical example applying the Markov analysis model to forecast the short period traffic flow occupancy (TFO) probability distribution at the multi-phase intersection is given. We compared the predicted TFO probability distribution to the observed results, and the errors between them are analyzed. Both simulation and real observation data are used to demonstrate the effectiveness of the method. The prediction results can help decide the real-time controlling strategies.
{"title":"The model analysis of vehicles situation and distribution in intersections based on Markov process","authors":"Q. Li, Lianyu Wei, Shoufeng Ma","doi":"10.1109/ITSC.2003.1252651","DOIUrl":"https://doi.org/10.1109/ITSC.2003.1252651","url":null,"abstract":"Intersection traffic controlling is an important aspect of the urban traffic controlling system. The controlling policy depends on the forecasting results about the vehicles arriving and distributed at signalized intersections. After Markov process is analyzed. Markov analysis method is used to construct an intersection traffic situation prediction model to estimate accurately what the forthcoming traffic conditions of the intersection may be in this paper. A numerical example applying the Markov analysis model to forecast the short period traffic flow occupancy (TFO) probability distribution at the multi-phase intersection is given. We compared the predicted TFO probability distribution to the observed results, and the errors between them are analyzed. Both simulation and real observation data are used to demonstrate the effectiveness of the method. The prediction results can help decide the real-time controlling strategies.","PeriodicalId":123155,"journal":{"name":"Proceedings of the 2003 IEEE International Conference on Intelligent Transportation Systems","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131512950","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2003-12-19DOI: 10.1109/ITSC.2003.1252075
Honghong Liu, Xinyue Wang, Zhaosheng Yang
The paper builds up traffic flow simulated models at signal intersection and describes analysis, design and implementation of software system by applying Software Engineering Theory. The paper makes use of the Object-Oriented technology which imitate man's thinking to model the rule of vehicle arriving intersection, the rule of lane choice, the rule of vehicle leaving from intersection. The simulation of traffic flow at signal intersection is an up-to-date method to research traffic control. It is expected that this paper will contribute to understand how to describe the complicated traffic phenomenon with computer language.
{"title":"The simulation of traffic flow at signal intersection by using object-oriented database models","authors":"Honghong Liu, Xinyue Wang, Zhaosheng Yang","doi":"10.1109/ITSC.2003.1252075","DOIUrl":"https://doi.org/10.1109/ITSC.2003.1252075","url":null,"abstract":"The paper builds up traffic flow simulated models at signal intersection and describes analysis, design and implementation of software system by applying Software Engineering Theory. The paper makes use of the Object-Oriented technology which imitate man's thinking to model the rule of vehicle arriving intersection, the rule of lane choice, the rule of vehicle leaving from intersection. The simulation of traffic flow at signal intersection is an up-to-date method to research traffic control. It is expected that this paper will contribute to understand how to describe the complicated traffic phenomenon with computer language.","PeriodicalId":123155,"journal":{"name":"Proceedings of the 2003 IEEE International Conference on Intelligent Transportation Systems","volume":"197 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122366864","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2003-12-19DOI: 10.1109/ITSC.2003.1252684
Tie Liu, N. Zheng, Hong Cheng, Zhengbei Xing
Road recognition based on vision navigation is an important task in intelligent vehicle research. Road image is usually influenced by shadows, noise and discontinuity of road contour, and this induces the traditional edge-based algorithm's robustness decrease greatly. To avoid negative influence from threshold selection, this paper presents a deformable template and genetic algorithm based road recognition algorithm. Firstly, preprocess road image with edge operator to get the edge information, then construct a deformable template model of road contour and its likelihood function which define the fitting degree for a given template deformable parameter, finally genetic algorithm is used to search the global maximal value of the likelihood function to get the optimal parameter of the deformable template model of road contour. Experimental results indicate that the algorithm has strong robustness for shadows, noise and discontinuity of road contour.
{"title":"A novel approach of road recognition based on deformable template and genetic algorithm","authors":"Tie Liu, N. Zheng, Hong Cheng, Zhengbei Xing","doi":"10.1109/ITSC.2003.1252684","DOIUrl":"https://doi.org/10.1109/ITSC.2003.1252684","url":null,"abstract":"Road recognition based on vision navigation is an important task in intelligent vehicle research. Road image is usually influenced by shadows, noise and discontinuity of road contour, and this induces the traditional edge-based algorithm's robustness decrease greatly. To avoid negative influence from threshold selection, this paper presents a deformable template and genetic algorithm based road recognition algorithm. Firstly, preprocess road image with edge operator to get the edge information, then construct a deformable template model of road contour and its likelihood function which define the fitting degree for a given template deformable parameter, finally genetic algorithm is used to search the global maximal value of the likelihood function to get the optimal parameter of the deformable template model of road contour. Experimental results indicate that the algorithm has strong robustness for shadows, noise and discontinuity of road contour.","PeriodicalId":123155,"journal":{"name":"Proceedings of the 2003 IEEE International Conference on Intelligent Transportation Systems","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122373052","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2003-12-19DOI: 10.1109/ITSC.2003.1252734
Xiaoning Zhang, Hai Yang, Wenyuan Huang
The classical Wardropian principle hypothesize that users minimize either individual travel cost or overall system cost. In reality, users do not always behave in such a manner; instead, they are both competing and cooperating, typically when there exists oligopoly Cournot-Nash firms. In this paper, we formulate a mixed network equilibrium model as variational inequalities (VI) that simultaneously describe the routing behaviors of user equilibrium (UE), system optimum (SO) and Cournot-Nash (CN) players. Each player is presumed to make a routing decision given the knowledge of the routing strategies of the other players. After examining the existence and uniqueness of solutions, the diagonalization approach is applied to find a mixed equilibrium solution.
{"title":"Network equilibrium with mixed behavior","authors":"Xiaoning Zhang, Hai Yang, Wenyuan Huang","doi":"10.1109/ITSC.2003.1252734","DOIUrl":"https://doi.org/10.1109/ITSC.2003.1252734","url":null,"abstract":"The classical Wardropian principle hypothesize that users minimize either individual travel cost or overall system cost. In reality, users do not always behave in such a manner; instead, they are both competing and cooperating, typically when there exists oligopoly Cournot-Nash firms. In this paper, we formulate a mixed network equilibrium model as variational inequalities (VI) that simultaneously describe the routing behaviors of user equilibrium (UE), system optimum (SO) and Cournot-Nash (CN) players. Each player is presumed to make a routing decision given the knowledge of the routing strategies of the other players. After examining the existence and uniqueness of solutions, the diagonalization approach is applied to find a mixed equilibrium solution.","PeriodicalId":123155,"journal":{"name":"Proceedings of the 2003 IEEE International Conference on Intelligent Transportation Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129234469","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2003-12-19DOI: 10.1109/ITSC.2003.1252686
Guozhen Tan, Xiaojun Han, Yilin Zhao
The problem addressed in this paper is how to efficiently compute the approximate shortest paths of large-scale network. We propose the wholly new network-tree model (NTM) constructed from arbitrary network and associated approximate algorithms for high performance computation of shortest path in large-scale network. For the tradeoffs between the computational speed and errors, three approximate network-tree shortest path (ANTSP) algorithms are presented: nearest ANTSP, heuristic ANTSP and sub-optimal ANTSP algorithms. The experiment results based on grid network show that all ANTSP algorithms achieve much higher computational efficiency than Dijkstra algorithm, and the average errors of heuristic ANTSP and sub-optimal ANTSP algorithms are significantly reduced.
{"title":"Approximate shortest path algorithms for network-tree model","authors":"Guozhen Tan, Xiaojun Han, Yilin Zhao","doi":"10.1109/ITSC.2003.1252686","DOIUrl":"https://doi.org/10.1109/ITSC.2003.1252686","url":null,"abstract":"The problem addressed in this paper is how to efficiently compute the approximate shortest paths of large-scale network. We propose the wholly new network-tree model (NTM) constructed from arbitrary network and associated approximate algorithms for high performance computation of shortest path in large-scale network. For the tradeoffs between the computational speed and errors, three approximate network-tree shortest path (ANTSP) algorithms are presented: nearest ANTSP, heuristic ANTSP and sub-optimal ANTSP algorithms. The experiment results based on grid network show that all ANTSP algorithms achieve much higher computational efficiency than Dijkstra algorithm, and the average errors of heuristic ANTSP and sub-optimal ANTSP algorithms are significantly reduced.","PeriodicalId":123155,"journal":{"name":"Proceedings of the 2003 IEEE International Conference on Intelligent Transportation Systems","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115660625","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2003-12-19DOI: 10.1109/ITSC.2003.1252674
S. Fujita, A. Nakatani
This paper proposes a scheduling scheme for solving the minimum cost single vehicle routing problem with designated deadlines, based on the dynamic programming and heuristic cost estimation. We conducted several experiments to evaluate the efficiency of the proposed scheme, and found that in more than 76% of randomly generated instances, it outputs an optimal solution within few seconds provided that the number of passengers assigned to the vehicle is at most 10. In addition, even for larger instances, it can output a better quasi-optimal solution much more quickly compared with conventional schemes.
{"title":"A vehicle scheduler for on-demand bus systems based on a heuristic cost estimation","authors":"S. Fujita, A. Nakatani","doi":"10.1109/ITSC.2003.1252674","DOIUrl":"https://doi.org/10.1109/ITSC.2003.1252674","url":null,"abstract":"This paper proposes a scheduling scheme for solving the minimum cost single vehicle routing problem with designated deadlines, based on the dynamic programming and heuristic cost estimation. We conducted several experiments to evaluate the efficiency of the proposed scheme, and found that in more than 76% of randomly generated instances, it outputs an optimal solution within few seconds provided that the number of passengers assigned to the vehicle is at most 10. In addition, even for larger instances, it can output a better quasi-optimal solution much more quickly compared with conventional schemes.","PeriodicalId":123155,"journal":{"name":"Proceedings of the 2003 IEEE International Conference on Intelligent Transportation Systems","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115786802","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2003-12-19DOI: 10.1109/ITSC.2003.1252688
Jing Dong, Zuo Zhang, D. Ma
This paper proposes a simple but efficient dynamic traffic assignment (DTA) model based on real-time local-feedback information, which uses only the information acquired through sensors beneath the lanes to decide next turn to take with neither the confinement of route enumeration and O-D detail not the hunting phenomenon caused by exploiting global information. Some simulation-based experiments and comparisons with other DTA methods are made to evaluate the system performance of the local information based technique both in ordinary congested urban traffic conditions and in unusual incident occasions. Finally, robustness and effectiveness of the model is explained as a emergent phenomenon by comparing the local information based model in traffic network with the local feedback decentralized planning in ant colony.
{"title":"Emergent phenomenon and the local information based DTA model","authors":"Jing Dong, Zuo Zhang, D. Ma","doi":"10.1109/ITSC.2003.1252688","DOIUrl":"https://doi.org/10.1109/ITSC.2003.1252688","url":null,"abstract":"This paper proposes a simple but efficient dynamic traffic assignment (DTA) model based on real-time local-feedback information, which uses only the information acquired through sensors beneath the lanes to decide next turn to take with neither the confinement of route enumeration and O-D detail not the hunting phenomenon caused by exploiting global information. Some simulation-based experiments and comparisons with other DTA methods are made to evaluate the system performance of the local information based technique both in ordinary congested urban traffic conditions and in unusual incident occasions. Finally, robustness and effectiveness of the model is explained as a emergent phenomenon by comparing the local information based model in traffic network with the local feedback decentralized planning in ant colony.","PeriodicalId":123155,"journal":{"name":"Proceedings of the 2003 IEEE International Conference on Intelligent Transportation Systems","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126662294","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2003-12-19DOI: 10.1109/ITSC.2003.1252758
Ling-li Cui, Zhi-quan Xiao
This paper addresses the issues related to the design of optimum structure for lightweight, flexible manipulators under the total weight constraint. The optimum design problem is formulated by establishing a mathematical model of flexible manipulator based on the finite difference method, the optimal solution is obtained by using an improved real-code genetic algorithms (GA). Numeric simulation has been conducted and the results have demonstrated the effectiveness of the proposed method.
{"title":"Optimum structure design of flexible manipulators based on GA","authors":"Ling-li Cui, Zhi-quan Xiao","doi":"10.1109/ITSC.2003.1252758","DOIUrl":"https://doi.org/10.1109/ITSC.2003.1252758","url":null,"abstract":"This paper addresses the issues related to the design of optimum structure for lightweight, flexible manipulators under the total weight constraint. The optimum design problem is formulated by establishing a mathematical model of flexible manipulator based on the finite difference method, the optimal solution is obtained by using an improved real-code genetic algorithms (GA). Numeric simulation has been conducted and the results have demonstrated the effectiveness of the proposed method.","PeriodicalId":123155,"journal":{"name":"Proceedings of the 2003 IEEE International Conference on Intelligent Transportation Systems","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125099606","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2003-12-19DOI: 10.1109/ITSC.2003.1252646
Jing Dong, Jianping Wu
This paper defines the concept of equilibriums function and equilibrium status, which exists not only in simple parallel links and paths, but also in traffic networks. Based on detailed mathematical analysis, it is found that link flow under traffic equilibrium condition is a function of OD matrix. Further, the traffic equilibrium status was developed. An example was designed to test the algorithm.
{"title":"Urban traffic networks equilibrium status recognition with neural network","authors":"Jing Dong, Jianping Wu","doi":"10.1109/ITSC.2003.1252646","DOIUrl":"https://doi.org/10.1109/ITSC.2003.1252646","url":null,"abstract":"This paper defines the concept of equilibriums function and equilibrium status, which exists not only in simple parallel links and paths, but also in traffic networks. Based on detailed mathematical analysis, it is found that link flow under traffic equilibrium condition is a function of OD matrix. Further, the traffic equilibrium status was developed. An example was designed to test the algorithm.","PeriodicalId":123155,"journal":{"name":"Proceedings of the 2003 IEEE International Conference on Intelligent Transportation Systems","volume":"146 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123781097","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：