Shun Maeda, T. Hayakawa, J. Imura, Hideaki Tanaka, Y. Mae
An EV navigation system for drivers to choose one of the route candidates depending on the drivers' preference is developed. The approach is incentive based and the route candidates are obtained through multi-objective optimization. The navigation system computes the optimal routes under the varying traffic conditions and successively checks if the selected route is relevant. In the case where the projective route is forced to change in the middle of traveling, the way of calculating the amount of partial incentive is proposed for the segments passed by.
{"title":"Incentive-Based Multi-objective Fractional Optimization for EV Navigation System with Successive Update","authors":"Shun Maeda, T. Hayakawa, J. Imura, Hideaki Tanaka, Y. Mae","doi":"10.1109/ITSC.2015.417","DOIUrl":"https://doi.org/10.1109/ITSC.2015.417","url":null,"abstract":"An EV navigation system for drivers to choose one of the route candidates depending on the drivers' preference is developed. The approach is incentive based and the route candidates are obtained through multi-objective optimization. The navigation system computes the optimal routes under the varying traffic conditions and successively checks if the selected route is relevant. In the case where the projective route is forced to change in the middle of traveling, the way of calculating the amount of partial incentive is proposed for the segments passed by.","PeriodicalId":124818,"journal":{"name":"2015 IEEE 18th International Conference on Intelligent Transportation Systems","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131230575","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}
In Chile, bicycle crashes yield more than 170 fatalities every year and these represent almost 12% of the total number of the yearly crashes. Cycling is the third cause of accident after vehicles and pedestrians. The focus of this study is on identifying high-risk bicycle crash locations and related factors at the district level that occurred during the 2008-2012 period using global and local spatial statistical analysis. The results suggest that the main contributing cause of bicycle crashes related to under the influence of alcohol or drugs tend to cluster in districts located in the central-south zone of Chile. Although the hotspots corresponding to the number of killed and severely injured cyclists has been reduced over the years of the study, the majority occur in the districts of Chillan and Rancagua. Additionally, high-risk zones of bicycle-vehicle collisions in the Metropolitan Region occur primarily due to the imprudence of the driver. The results pave the way for future investment and focus in these areas to improve bicycle safety and promote their use.
{"title":"Spatial Analysis of Bicycle Crashes in Chile","authors":"Carola A. Blazquez, Isabel Puelma, G. Khan","doi":"10.1109/ITSC.2015.441","DOIUrl":"https://doi.org/10.1109/ITSC.2015.441","url":null,"abstract":"In Chile, bicycle crashes yield more than 170 fatalities every year and these represent almost 12% of the total number of the yearly crashes. Cycling is the third cause of accident after vehicles and pedestrians. The focus of this study is on identifying high-risk bicycle crash locations and related factors at the district level that occurred during the 2008-2012 period using global and local spatial statistical analysis. The results suggest that the main contributing cause of bicycle crashes related to under the influence of alcohol or drugs tend to cluster in districts located in the central-south zone of Chile. Although the hotspots corresponding to the number of killed and severely injured cyclists has been reduced over the years of the study, the majority occur in the districts of Chillan and Rancagua. Additionally, high-risk zones of bicycle-vehicle collisions in the Metropolitan Region occur primarily due to the imprudence of the driver. The results pave the way for future investment and focus in these areas to improve bicycle safety and promote their use.","PeriodicalId":124818,"journal":{"name":"2015 IEEE 18th International Conference on Intelligent Transportation Systems","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124917243","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}
The facility location problem (FLP) has broad applications in transportation, ranging from siting electric vehicle charging stations to positioning emergency vehicles. The spatial facility location problem (SFLP) considers continuous demand of a region where facilities can be placed anywhere. One of the approaches to solving the SFLP is to aggregate the demand into discrete points first and then solve the corresponding point-based FLP as a surrogate model. The model performance, however, is measured by the percentage of the continuous space actually covered. The solution to the classic FLP is often not unique. In this paper, we explore how the behavior of the solution to the FLP would affect the quality of the coverage to the spatial demand. We examine in detail the property of the surrogate model and identify the key contributing factor that would affect the quality of the solution to the original coverage problem for covering continuous spatial demand. Our goal is to find a surrogate model that is detailed enough to capture all the key elements of the problem and achieve the desired accuracy level, yet has the size that can be handled by the existing computing power.
{"title":"Investigating Surrogate Point-Based Modeling Approach for Covering Continuous Spatial Demand","authors":"Pei-Shan Hsieh, Wei-Hua Lin, Mingyao Qi, D. Tong","doi":"10.1109/ITSC.2015.442","DOIUrl":"https://doi.org/10.1109/ITSC.2015.442","url":null,"abstract":"The facility location problem (FLP) has broad applications in transportation, ranging from siting electric vehicle charging stations to positioning emergency vehicles. The spatial facility location problem (SFLP) considers continuous demand of a region where facilities can be placed anywhere. One of the approaches to solving the SFLP is to aggregate the demand into discrete points first and then solve the corresponding point-based FLP as a surrogate model. The model performance, however, is measured by the percentage of the continuous space actually covered. The solution to the classic FLP is often not unique. In this paper, we explore how the behavior of the solution to the FLP would affect the quality of the coverage to the spatial demand. We examine in detail the property of the surrogate model and identify the key contributing factor that would affect the quality of the solution to the original coverage problem for covering continuous spatial demand. Our goal is to find a surrogate model that is detailed enough to capture all the key elements of the problem and achieve the desired accuracy level, yet has the size that can be handled by the existing computing power.","PeriodicalId":124818,"journal":{"name":"2015 IEEE 18th International Conference on Intelligent Transportation Systems","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131961418","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}
In urban railway operation, many different types of problems and malfunctions may cause disruptions during operation. This paper addresses two recovery modes during disruptions in urban railway operation. In order to compare these modes, two criteria including (1) total travel time of passengers during degraded mode, and (2) the number of non-serviced passengers, are determined. In order to compute the number of non-serviced passengers, some new formulas are proposed. At the end, the necessary remarks are suggested for urban railway operators to simply decide each of these recovery modes, as well as the scheduling patterns based on the disruption conditions. The results are tested and analyzed considering a real case study.
{"title":"Urban Railway Operation Recovery During Disruption","authors":"A. Jamili, Mohammadreza Ghoreshi Nejad","doi":"10.1109/ITSC.2015.454","DOIUrl":"https://doi.org/10.1109/ITSC.2015.454","url":null,"abstract":"In urban railway operation, many different types of problems and malfunctions may cause disruptions during operation. This paper addresses two recovery modes during disruptions in urban railway operation. In order to compare these modes, two criteria including (1) total travel time of passengers during degraded mode, and (2) the number of non-serviced passengers, are determined. In order to compute the number of non-serviced passengers, some new formulas are proposed. At the end, the necessary remarks are suggested for urban railway operators to simply decide each of these recovery modes, as well as the scheduling patterns based on the disruption conditions. The results are tested and analyzed considering a real case study.","PeriodicalId":124818,"journal":{"name":"2015 IEEE 18th International Conference on Intelligent Transportation Systems","volume":"68 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115271261","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}
Matching taxi supply with demand is one of the biggest challenges faced by taxi fleet operators today. One of the reasons why this problem is so hard to solve is because there are no readily available methods to infer unmet taxi demand from data. An algorithm that reliably does so would be of enormous value to fleet operators because it could be used to dispatch available taxis to areas where passenger demand greatly exceeds supply. In this paper, we formally define unmet taxi demand and develop a heuristic algorithm to quantify it. We explain how our method improves on traditional approaches and present the theoretical details which underpin our algorithm. Finally, we develop a smartphone application that uses our algorithm together with a live taxi data feed to provide real time recommendations to participating drivers and efficiently route taxis to where they are needed most.
{"title":"Inferring Unmet Demand from Taxi Probe Data","authors":"Anwar Afian, A. Odoni, D. Rus","doi":"10.1109/ITSC.2015.145","DOIUrl":"https://doi.org/10.1109/ITSC.2015.145","url":null,"abstract":"Matching taxi supply with demand is one of the biggest challenges faced by taxi fleet operators today. One of the reasons why this problem is so hard to solve is because there are no readily available methods to infer unmet taxi demand from data. An algorithm that reliably does so would be of enormous value to fleet operators because it could be used to dispatch available taxis to areas where passenger demand greatly exceeds supply. In this paper, we formally define unmet taxi demand and develop a heuristic algorithm to quantify it. We explain how our method improves on traditional approaches and present the theoretical details which underpin our algorithm. Finally, we develop a smartphone application that uses our algorithm together with a live taxi data feed to provide real time recommendations to participating drivers and efficiently route taxis to where they are needed most.","PeriodicalId":124818,"journal":{"name":"2015 IEEE 18th International Conference on Intelligent Transportation Systems","volume":"126 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115621301","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}
Guofa Li, S. Li, Li-Li Jia, Wenjun Wang, B. Cheng, Fang Chen
Accounting about 70% of vehicle miles on roadways, highway driving is a critical issue in traffic safety deployment. Of the various maneuvers that comprise the highly complex driving task, each one requires understanding on the connections between driving states, vehicle performance and drivers' actions. This paper attempts to flesh out a complete picture of driving maneuvers on highways. Eighteen drivers participated in this study. They drove an instrumented vehicle on highways to accumulate 2,600 km naturalistic driving data. The data were segmented and classified into 11 maneuver groups manually. Analysis on the maneuvers revealed that: 1) A maneuver transition probabilities model was proposed. According to this model, 7 typical driving patterns were drawn based on the transition probabilities. Transition events pertaining to approaching/following/lane changing accounted for 95% of all the highway transition events. 2) The durations were 7.6/6.6 s and 7.1/7.0 s for free left/right lane changes and overtake from left/right lane changes, respectively. The numbers were 22.5, 21.4 and 16.3 s for far, middle and near following maneuvers, respectively. Statistical significances were found within both groups. 3) How drivers behave in each maneuver was analyzed. Drivers drove faster in free lane changes than did in overtake lane changes. For overtake lane changes, two driving patterns were observed: accelerate to change lane and decelerate to change lane.
{"title":"Driving Maneuvers Analysis Using Naturalistic Highway Driving Data","authors":"Guofa Li, S. Li, Li-Li Jia, Wenjun Wang, B. Cheng, Fang Chen","doi":"10.1109/ITSC.2015.286","DOIUrl":"https://doi.org/10.1109/ITSC.2015.286","url":null,"abstract":"Accounting about 70% of vehicle miles on roadways, highway driving is a critical issue in traffic safety deployment. Of the various maneuvers that comprise the highly complex driving task, each one requires understanding on the connections between driving states, vehicle performance and drivers' actions. This paper attempts to flesh out a complete picture of driving maneuvers on highways. Eighteen drivers participated in this study. They drove an instrumented vehicle on highways to accumulate 2,600 km naturalistic driving data. The data were segmented and classified into 11 maneuver groups manually. Analysis on the maneuvers revealed that: 1) A maneuver transition probabilities model was proposed. According to this model, 7 typical driving patterns were drawn based on the transition probabilities. Transition events pertaining to approaching/following/lane changing accounted for 95% of all the highway transition events. 2) The durations were 7.6/6.6 s and 7.1/7.0 s for free left/right lane changes and overtake from left/right lane changes, respectively. The numbers were 22.5, 21.4 and 16.3 s for far, middle and near following maneuvers, respectively. Statistical significances were found within both groups. 3) How drivers behave in each maneuver was analyzed. Drivers drove faster in free lane changes than did in overtake lane changes. For overtake lane changes, two driving patterns were observed: accelerate to change lane and decelerate to change lane.","PeriodicalId":124818,"journal":{"name":"2015 IEEE 18th International Conference on Intelligent Transportation Systems","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121022896","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}
Today more and more Intelligent Transportation System (ITS) strategies are introduced nationwide to reduce congestion and maintain desired service levels on freeways. High Occupancy Toll (HOT) lanes (form of managed lanes) is one such ITS strategy. HOT lanes are intended to maintain certain level of service such as average speed, throughput, etc. One of the major challenges in achieving these objectives is the time delay (due to long stretches of HOT lanes) and the resulting uncertainty in the throughput calculated at the end of the HOT lanes. HOT lanes need to have pricing algorithms that control the traffic by considering this time delay between the checking point and the tollbooth. This paper introduces a PID controller based pricing algorithm that addresses this need. A simulation model of I-95 is used to demonstrate the effectiveness of this approach.
{"title":"Dynamic Pricing Algorithm with Embedded Controller for High Occupancy Toll Lanes","authors":"Guangyu Zou, Alvaro Gil, Rakesh Kulkarni","doi":"10.1109/ITSC.2015.385","DOIUrl":"https://doi.org/10.1109/ITSC.2015.385","url":null,"abstract":"Today more and more Intelligent Transportation System (ITS) strategies are introduced nationwide to reduce congestion and maintain desired service levels on freeways. High Occupancy Toll (HOT) lanes (form of managed lanes) is one such ITS strategy. HOT lanes are intended to maintain certain level of service such as average speed, throughput, etc. One of the major challenges in achieving these objectives is the time delay (due to long stretches of HOT lanes) and the resulting uncertainty in the throughput calculated at the end of the HOT lanes. HOT lanes need to have pricing algorithms that control the traffic by considering this time delay between the checking point and the tollbooth. This paper introduces a PID controller based pricing algorithm that addresses this need. A simulation model of I-95 is used to demonstrate the effectiveness of this approach.","PeriodicalId":124818,"journal":{"name":"2015 IEEE 18th International Conference on Intelligent Transportation Systems","volume":"72 12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127267633","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}
C. Menelaou, P. Kolios, S. Timotheou, C. Panayiotou
Traffic congestion has been proven a difficult problem to tackle, particularly in big cities where the number of cars are steadily increasing while the infrastructure remains stagnant. Several approaches have been proposed to alleviate the effects of traffic congestion, however, so far congestion is still a big problem in most cities. In this work we investigate a new route reservation approach to address the problem which is motivated by air traffic control. This paper formulates the route reservation problem under different assumptions and examines the complexity of the resulting formulations. Two waiting strategies are investigated, (i) vehicles are allowed to wait at the source before they start their journey, and (ii) they are allowed to wait at every road junction. Strategy (i) though more practical to implement, results to an NP-complete problem while strategy (ii) results to a problem that can be solved in polynomial time but it is not easily implemented since the infrastructure does not have adequate space for vehicles to wait until congestion downstream is cleared. Finally, a heuristic algorithm (based on time-expanded networks) is derived as a solution to both proposed waiting strategies.
{"title":"On the Complexity of Congestion Free Routing in Transportation Networks","authors":"C. Menelaou, P. Kolios, S. Timotheou, C. Panayiotou","doi":"10.1109/ITSC.2015.453","DOIUrl":"https://doi.org/10.1109/ITSC.2015.453","url":null,"abstract":"Traffic congestion has been proven a difficult problem to tackle, particularly in big cities where the number of cars are steadily increasing while the infrastructure remains stagnant. Several approaches have been proposed to alleviate the effects of traffic congestion, however, so far congestion is still a big problem in most cities. In this work we investigate a new route reservation approach to address the problem which is motivated by air traffic control. This paper formulates the route reservation problem under different assumptions and examines the complexity of the resulting formulations. Two waiting strategies are investigated, (i) vehicles are allowed to wait at the source before they start their journey, and (ii) they are allowed to wait at every road junction. Strategy (i) though more practical to implement, results to an NP-complete problem while strategy (ii) results to a problem that can be solved in polynomial time but it is not easily implemented since the infrastructure does not have adequate space for vehicles to wait until congestion downstream is cleared. Finally, a heuristic algorithm (based on time-expanded networks) is derived as a solution to both proposed waiting strategies.","PeriodicalId":124818,"journal":{"name":"2015 IEEE 18th International Conference on Intelligent Transportation Systems","volume":"106 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127324691","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}
Awareness in traffic situations and manoeuvring efficiently through complex scenarios is a critical task to be managed for active safety and autonomous vehicle applications. This task could be assigned as a separate functionality layer due to its complexity. A reference development framework for autonomous heavy vehicle applications called Traffic Situation Management functionality layer is presented in this study. This functionality layer is then verified by developing a real time autonomous rear end collision avoidance function by steering based on the reference framework. The motion of the truck is restricted within the existing lane, representing situations where there is a partial lateral interference by other vehicles, with safe distance to manoeuvre both in the longitudinal and lateral directions. Lane markings are used as a reference to guide the vehicle within the ego lane during the avoidance manoeuvre. Based on the traffic scenario and ego vehicle states an escape path is generated. A simple feed-forward and PD based feedback controller is used to track the generated path. Physical tests are conducted on a 6X2 rigid heavy truck to verify the proposed function. Results indicate satisfactory performance of the avoidance function and safe margins during the test runs.
{"title":"Introduction of Traffic Situation Management for a Rigid Truck, Tests Conducted on Object Avoidance by Steering within Ego Lane","authors":"S. Janardhanan, Mansour Keshavarz, L. Laine","doi":"10.1109/ITSC.2015.249","DOIUrl":"https://doi.org/10.1109/ITSC.2015.249","url":null,"abstract":"Awareness in traffic situations and manoeuvring efficiently through complex scenarios is a critical task to be managed for active safety and autonomous vehicle applications. This task could be assigned as a separate functionality layer due to its complexity. A reference development framework for autonomous heavy vehicle applications called Traffic Situation Management functionality layer is presented in this study. This functionality layer is then verified by developing a real time autonomous rear end collision avoidance function by steering based on the reference framework. The motion of the truck is restricted within the existing lane, representing situations where there is a partial lateral interference by other vehicles, with safe distance to manoeuvre both in the longitudinal and lateral directions. Lane markings are used as a reference to guide the vehicle within the ego lane during the avoidance manoeuvre. Based on the traffic scenario and ego vehicle states an escape path is generated. A simple feed-forward and PD based feedback controller is used to track the generated path. Physical tests are conducted on a 6X2 rigid heavy truck to verify the proposed function. Results indicate satisfactory performance of the avoidance function and safe margins during the test runs.","PeriodicalId":124818,"journal":{"name":"2015 IEEE 18th International Conference on Intelligent Transportation Systems","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125107669","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}
Simulations of transport operations have been widely used for scenario analysis and the investigation of competing strategies to optimize traffic flows and logistics operations. This paper applies a simulation approach to the optimized design of cross-border operations within the context of end-to-end trade corridor management. The high levels of inefficiency that currently characterize most African border posts is presented as use case, long cross-border delays are shown to result from conflicting objective of different stakeholders and lack of integration between the systems and processes of independent participants. The results of empirical studies were used to identify the most important contributing factors to cross-border delays. A state flow diagram that represents the critical cross-border processes was constructed to capture the logical interactions between participants, systems and processes. This was converted into a Simio-based discrete process simulator that accurately describes the reality of typical African cross-border processes. The simulator was applied to determine the beneficial impact of various potential remedies to cross-border inefficiencies, including the use of RFID to support a Green Lanes concept and the interchange of information to allow the dynamic scheduling of customs processing capacity. The results of the simulations show that cross-border delays can be reduced by more than 80% through the implementation of a combination of the proposed system and operational changes.
{"title":"A Simulation Approach to the Optimized Design of Cross-border Operations","authors":"A. Hoffman, E. Bhero","doi":"10.1109/ITSC.2015.232","DOIUrl":"https://doi.org/10.1109/ITSC.2015.232","url":null,"abstract":"Simulations of transport operations have been widely used for scenario analysis and the investigation of competing strategies to optimize traffic flows and logistics operations. This paper applies a simulation approach to the optimized design of cross-border operations within the context of end-to-end trade corridor management. The high levels of inefficiency that currently characterize most African border posts is presented as use case, long cross-border delays are shown to result from conflicting objective of different stakeholders and lack of integration between the systems and processes of independent participants. The results of empirical studies were used to identify the most important contributing factors to cross-border delays. A state flow diagram that represents the critical cross-border processes was constructed to capture the logical interactions between participants, systems and processes. This was converted into a Simio-based discrete process simulator that accurately describes the reality of typical African cross-border processes. The simulator was applied to determine the beneficial impact of various potential remedies to cross-border inefficiencies, including the use of RFID to support a Green Lanes concept and the interchange of information to allow the dynamic scheduling of customs processing capacity. The results of the simulations show that cross-border delays can be reduced by more than 80% through the implementation of a combination of the proposed system and operational changes.","PeriodicalId":124818,"journal":{"name":"2015 IEEE 18th International Conference on Intelligent Transportation Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125134599","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
扫码关注我们
求助内容：
应助结果提醒方式：