WorldWideScience

Sample records for traffic flow scheduling

  1. Integration of Tactical Departure Scheduling and Traffic Flow Management, Phase I

    Data.gov (United States)

    National Aeronautics and Space Administration — In the ATM Select topic area of Integrated Arrival, Departure and Surface (IADS) planning, this proposal addresses Tactical Departure Scheduling (TDS), which is a...

  2. Pittsburgh International Airport - Scheduled Passenger Traffic

    Data.gov (United States)

    Allegheny County / City of Pittsburgh / Western PA Regional Data Center — Here you can find Pittsburgh International Airport’s Monthly Scheduled Traffic Reports. Each of these reports contain a year-over-year (YOY) analysis of scheduled...

  3. Traffic Flow Management Wrap-Up

    Science.gov (United States)

    Grabbe, Shon

    2011-01-01

    Traffic Flow Management involves the scheduling and routing of air traffic subject to airport and airspace capacity constraints, and the efficient use of available airspace. Significant challenges in this area include: (1) weather integration and forecasting, (2) accounting for user preferences in the Traffic Flow Management decision making process, and (3) understanding and mitigating the environmental impacts of air traffic on the environment. To address these challenges, researchers in the Traffic Flow Management area are developing modeling, simulation and optimization techniques to route and schedule air traffic flights and flows while accommodating user preferences, accounting for system uncertainties and considering the environmental impacts of aviation. This presentation will highlight some of the major challenges facing researchers in this domain, while also showcasing recent innovations designed to address these challenges.

  4. Proportional green time scheduling for traffic lights

    NARCIS (Netherlands)

    P. Kovacs; Le, T. (Tung); R. Núñez Queija (Rudesindo); Vu, H. (Hai); N. Walton

    2016-01-01

    textabstractWe consider the decentralized scheduling of a large number of urban traffic lights. We investigate factors determining system performance, in particular, the length of the traffic light cycle and the proportion of green time allocated to each junction. We study the effect of the length

  5. SignalGuru: Leveraging mobile phones for collaborative traffic signal schedule advisory

    OpenAIRE

    Koukoumidis, Emmanouil; Peh, Li-Shiuan; Martonosi, Margaret

    2011-01-01

    While traffic signals are necessary to safely control competing flows of traffic, they inevitably enforce a stop-and-go movement pattern that increases fuel consumption, reduces traffic flow and causes traffic jams. These side effects can be alleviated by providing drivers and their onboard computational devices (e.g., vehicle computer, smartphone) with information about the schedule of the traffic signals ahead. Based on when the signal ahead will turn green, drivers can then adjust speed so...

  6. Scheduling Network Traffic for Grid Purposes

    DEFF Research Database (Denmark)

    Gamst, Mette

    This thesis concerns scheduling of network traffic in grid context. Grid computing consists of a number of geographically distributed computers, which work together for solving large problems. The computers are connected through a network. When scheduling job execution in grid computing, data...... transmission has so far not been taken into account. This causes stability problems, because data transmission takes time and thus causes delays to the execution plan. This thesis proposes the integration of job scheduling and network routing. The scientific contribution is based on methods from operations...... research and consists of six papers. The first four considers data transmission in grid context. The last two solves the data transmission problem, where the number of paths per data connection is bounded from above. The thesis shows that it is possible to solve the integrated job scheduling and network...

  7. LTE uplink scheduling - flow level analysis

    NARCIS (Netherlands)

    Dimitrova, D.C.; van den Berg, J.L.; Heijenk, G.; Litjens, R.; Sacchi, Claudio; Bellalta, Boris; Vinel, Alexey; Schlegel, Christian; Granelli, Fabrizio; Zhang, Yan

    Long Term Evolution (LTE) is a cellular technology foreseen to extend the capacity and improve the performance of current 3G cellular networks. A key mechanism in the LTE traffic handling is the packet scheduler, which is in charge of allocating resources to active flows in both the frequency and

  8. LTE uplink scheduling - Flow level analysis

    NARCIS (Netherlands)

    Dimitrova, D.C.; Berg, J.L. van den; Heijenk, G.; Litjens, R.

    2011-01-01

    Long Term Evolution (LTE) is a cellular technology foreseen to extend the capacity and improve the performance of current 3G cellular networks. A key mechanism in the LTE traffic handling is the packet scheduler, which is in charge of allocating resources to active flows in both the frequency and

  9. A novel downlink scheduling strategy for traffic communication system based on TD-LTE technology.

    Science.gov (United States)

    Chen, Ting; Zhao, Xiangmo; Gao, Tao; Zhang, Licheng

    2016-01-01

    There are many existing classical scheduling algorithms which can obtain better system throughput and user equality, however, they are not designed for traffic transportation environment, which cannot consider whether the transmission performance of various information flows could meet comprehensive requirements of traffic safety and delay tolerance. This paper proposes a novel downlink scheduling strategy for traffic communication system based on TD-LTE technology, which can perform two classification mappings for various information flows in the eNodeB: firstly, associate every information flow packet with traffic safety importance weight according to its relevance to the traffic safety; secondly, associate every traffic information flow with service type importance weight according to its quality of service (QoS) requirements. Once the connection is established, at every scheduling moment, scheduler would decide the scheduling order of all buffers' head of line packets periodically according to the instant value of scheduling importance weight function, which calculated by the proposed algorithm. From different scenario simulations, it can be verified that the proposed algorithm can provide superior differentiated transmission service and reliable QoS guarantee to information flows with different traffic safety levels and service types, which is more suitable for traffic transportation environment compared with the existing popularity PF algorithm. With the limited wireless resource, information flow closed related to traffic safety will always obtain priority scheduling right timely, which can help the passengers' journey more safe. Moreover, the proposed algorithm cannot only obtain good flow throughput and user fairness which are almost equal to those of the PF algorithm without significant differences, but also provide better realtime transmission guarantee to realtime information flow.

  10. Pittsburgh International Airport - March 2018 Scheduled Passenger Traffic

    Data.gov (United States)

    Allegheny County / City of Pittsburgh / Western PA Regional Data Center — Attached is Pittsburgh International Airport’s Monthly Scheduled Traffic Report. This report contains a year-over-year (YOY) analysis of scheduled flights and...

  11. Pittsburgh International Airport - April 2018 Scheduled Passenger Traffic

    Data.gov (United States)

    Allegheny County / City of Pittsburgh / Western PA Regional Data Center — Attached is Pittsburgh International Airport’s Monthly Scheduled Traffic Report. This report contains a year-over-year (YOY) analysis of scheduled flights and...

  12. Pittsburgh International Airport - January 2018 Scheduled Passenger Traffic

    Data.gov (United States)

    Allegheny County / City of Pittsburgh / Western PA Regional Data Center — Attached is Pittsburgh International Airport’s Monthly Scheduled Traffic Report. This report contains a year-over-year (YOY) analysis of scheduled flights and...

  13. Pittsburgh International Airport - February 2018 Scheduled Passenger Traffic

    Data.gov (United States)

    Allegheny County / City of Pittsburgh / Western PA Regional Data Center — Attached is Pittsburgh International Airport’s Monthly Scheduled Traffic Report. This report contains a year-over-year (YOY) analysis of scheduled flights and...

  14. Probabilistic description of traffic flow

    International Nuclear Information System (INIS)

    Mahnke, R.; Kaupuzs, J.; Lubashevsky, I.

    2005-01-01

    A stochastic description of traffic flow, called probabilistic traffic flow theory, is developed. The general master equation is applied to relatively simple models to describe the formation and dissolution of traffic congestions. Our approach is mainly based on spatially homogeneous systems like periodically closed circular rings without on- and off-ramps. We consider a stochastic one-step process of growth or shrinkage of a car cluster (jam). As generalization we discuss the coexistence of several car clusters of different sizes. The basic problem is to find a physically motivated ansatz for the transition rates of the attachment and detachment of individual cars to a car cluster consistent with the empirical observations in real traffic. The emphasis is put on the analogy with first-order phase transitions and nucleation phenomena in physical systems like supersaturated vapour. The results are summarized in the flux-density relation, the so-called fundamental diagram of traffic flow, and compared with empirical data. Different regimes of traffic flow are discussed: free flow, congested mode as stop-and-go regime, and heavy viscous traffic. The traffic breakdown is studied based on the master equation as well as the Fokker-Planck approximation to calculate mean first passage times or escape rates. Generalizations are developed to allow for on-ramp effects. The calculated flux-density relation and characteristic breakdown times coincide with empirical data measured on highways. Finally, a brief summary of the stochastic cellular automata approach is given

  15. Scheduling strategies for LTE uplink with flow behaviour analysis

    OpenAIRE

    Dimitrova, D.C.; Berg, J.L. van den; Litjens, R.; Heijenk, G.

    2010-01-01

    Long Term Evolution (LTE) is a cellular technology developed to support diversity of data traffic at potentially high rates. It is foreseen to extend the capacity and improve the performance of current 3G cellular networks. A key mechanism in the LTE traffic handling is the packet scheduler, which is in charge of allocating resources to active flows in both the frequency and time dimension. In this paper we present a performance comparison of two distinct scheduling schemes for LTE uplink (fa...

  16. Integrated Traffic Flow Management Decision Making

    Science.gov (United States)

    Grabbe, Shon R.; Sridhar, Banavar; Mukherjee, Avijit

    2009-01-01

    A generalized approach is proposed to support integrated traffic flow management decision making studies at both the U.S. national and regional levels. It can consider tradeoffs between alternative optimization and heuristic based models, strategic versus tactical flight controls, and system versus fleet preferences. Preliminary testing was accomplished by implementing thirteen unique traffic flow management models, which included all of the key components of the system and conducting 85, six-hour fast-time simulation experiments. These experiments considered variations in the strategic planning look-ahead times, the replanning intervals, and the types of traffic flow management control strategies. Initial testing indicates that longer strategic planning look-ahead times and re-planning intervals result in steadily decreasing levels of sector congestion for a fixed delay level. This applies when accurate estimates of the air traffic demand, airport capacities and airspace capacities are available. In general, the distribution of the delays amongst the users was found to be most equitable when scheduling flights using a heuristic scheduling algorithm, such as ration-by-distance. On the other hand, equity was the worst when using scheduling algorithms that took into account the number of seats aboard each flight. Though the scheduling algorithms were effective at alleviating sector congestion, the tactical rerouting algorithm was the primary control for avoiding en route weather hazards. Finally, the modeled levels of sector congestion, the number of weather incursions, and the total system delays, were found to be in fair agreement with the values that were operationally observed on both good and bad weather days.

  17. Synchronized flow in oversaturated city traffic.

    Science.gov (United States)

    Kerner, Boris S; Klenov, Sergey L; Hermanns, Gerhard; Hemmerle, Peter; Rehborn, Hubert; Schreckenberg, Michael

    2013-11-01

    Based on numerical simulations with a stochastic three-phase traffic flow model, we reveal that moving queues (moving jams) in oversaturated city traffic dissolve at some distance upstream of the traffic signal while transforming into synchronized flow. It is found that, as in highway traffic [Kerner, Phys. Rev. E 85, 036110 (2012)], such a jam-absorption effect in city traffic is explained by a strong driver's speed adaptation: Time headways (space gaps) between vehicles increase upstream of a moving queue (moving jam), resulting in moving queue dissolution. It turns out that at given traffic signal parameters, the stronger the speed adaptation effect, the shorter the mean distance between the signal location and the road location at which moving queues dissolve fully and oversaturated traffic consists of synchronized flow only. A comparison of the synchronized flow in city traffic found in this Brief Report with synchronized flow in highway traffic is made.

  18. Structuring of Road Traffic Flows

    Directory of Open Access Journals (Sweden)

    Planko Rožić

    2005-09-01

    Full Text Available Systemic traffic count on the Croatian road network hasbeen carried out for more than three decades in different ways.During this period a large number of automatic traffic countershave been installed, and they operate on different principles.The traffic count has been analyzed from the aspect of vehicleclassification. The count results can be only partly comparedsince they yield different structures of traffic flows. Special analysisrefers to the classification of vehicles by automatic trafficcounters.During the research, a database has been formed with physicalelements of vehicles of over five thousand vehicle types. Theresearch results prove that the vehicle length only is not sufficientfor the classification of vehicles, the way it is used in thepresent automatic traffic counts, but rather the number of axles,the wheelbase as well as the front and rear overhangs needto be considered as well. Therefore, the detector system shouldapply also the detector of axles.The results have been presented that were obtained as partof the program TEST- Technological, research, developmentproject supported by the Minist1y of Science, Education andSport.

  19. Traffic Flow Visualization and Control

    National Research Council Canada - National Science Library

    Larson, Robert

    1999-01-01

    .... Air Force Research Laboratory. It is a video-camera-based, wide-area, traffic surveillance and detection system that provides real-time traffic information to traffic management center operators...

  20. Design Principles and Algorithms for Air Traffic Arrival Scheduling

    Science.gov (United States)

    Erzberger, Heinz; Itoh, Eri

    2014-01-01

    This report presents design principles and algorithms for building a real-time scheduler of arrival aircraft based on a first-come-first-served (FCFS) scheduling protocol. The algorithms provide the conceptual and computational foundation for the Traffic Management Advisor (TMA) of the Center/terminal radar approach control facilities (TRACON) automation system, which comprises a set of decision support tools for managing arrival traffic at major airports in the United States. The primary objective of the scheduler is to assign arrival aircraft to a favorable landing runway and schedule them to land at times that minimize delays. A further objective of the scheduler is to allocate delays between high-altitude airspace far away from the airport and low-altitude airspace near the airport. A method of delay allocation is described that minimizes the average operating cost in the presence of errors in controlling aircraft to a specified landing time. This report is a revision of an earlier paper first presented as part of an Advisory Group for Aerospace Research and Development (AGARD) lecture series in September 1995. The authors, during vigorous discussions over the details of this paper, felt it was important to the air-trafficmanagement (ATM) community to revise and extend the original 1995 paper, providing more detail and clarity and thereby allowing future researchers to understand this foundational work as the basis for the TMA's scheduling algorithms.

  1. Predicting Information Flows in Network Traffic.

    Science.gov (United States)

    Hinich, Melvin J.; Molyneux, Robert E.

    2003-01-01

    Discusses information flow in networks and predicting network traffic and describes a study that uses time series analysis on a day's worth of Internet log data. Examines nonlinearity and traffic invariants, and suggests that prediction of network traffic may not be possible with current techniques. (Author/LRW)

  2. Traffic Flow Theory - A State-of-the-Art Report: Revised Monograph on Traffic Flow Theory

    Science.gov (United States)

    2002-04-13

    This publication is an update and expansion of the Transportation Research Board (TRB) Special Report 165, "Traffic Flow Theory," published in 1975. This updating was undertaken on recommendation of the TRB's Committee on Traffic Flow Theory and Char...

  3. Automated mixed traffic vehicle control and scheduling study

    Science.gov (United States)

    Peng, T. K. C.; Chon, K.

    1976-01-01

    The operation and the expected performance of a proposed automatic guideway transit system which uses low speed automated mixed traffic vehicles (AMTVs) were analyzed. Vehicle scheduling and headway control policies were evaluated with a transit system simulation model. The effect of mixed traffic interference on the average vehicle speed was examined with a vehicle pedestrian interface model. Control parameters regulating vehicle speed were evaluated for safe stopping and passenger comfort. Some preliminary data on the cost and operation of an experimental AMTV system are included. These data were the result of a separate task conducted at JPL, and were included as background information.

  4. Online traffic flow model applying dynamic flow-density relation

    International Nuclear Information System (INIS)

    Kim, Y.

    2002-01-01

    This dissertation describes a new approach of the online traffic flow modelling based on the hydrodynamic traffic flow model and an online process to adapt the flow-density relation dynamically. The new modelling approach was tested based on the real traffic situations in various homogeneous motorway sections and a motorway section with ramps and gave encouraging simulation results. This work is composed of two parts: first the analysis of traffic flow characteristics and second the development of a new online traffic flow model applying these characteristics. For homogeneous motorway sections traffic flow is classified into six different traffic states with different characteristics. Delimitation criteria were developed to separate these states. The hysteresis phenomena were analysed during the transitions between these traffic states. The traffic states and the transitions are represented on a states diagram with the flow axis and the density axis. For motorway sections with ramps the complicated traffic flow is simplified and classified into three traffic states depending on the propagation of congestion. The traffic states are represented on a phase diagram with the upstream demand axis and the interaction strength axis which was defined in this research. The states diagram and the phase diagram provide a basis for the development of the dynamic flow-density relation. The first-order hydrodynamic traffic flow model was programmed according to the cell-transmission scheme extended by the modification of flow dependent sending/receiving functions, the classification of cells and the determination strategy for the flow-density relation in the cells. The unreasonable results of macroscopic traffic flow models, which may occur in the first and last cells in certain conditions are alleviated by applying buffer cells between the traffic data and the model. The sending/receiving functions of the cells are determined dynamically based on the classification of the

  5. Autosolitons in applied physics and traffic flow

    International Nuclear Information System (INIS)

    Kerner, B.S.

    1996-01-01

    A review of investigations of autosolitons in nonlinear systems which are of interest for the applied physics and for the transportation research is presented. Autosolitons are solitary intrinsic states which can be formed in a broad class of physical, chemical, biological dissipative distributed media and in traffic flow. Properties of autosolitons which are general for physical systems and for traffic flow will be discussed. Based on results of recent investigations of traffic jams in traffic flow, a comparison of nonlinear characteristics of traffic jams and with nonlinear properties of autosolitons which can be formed in active systems with diffusion will be given. Forms, properties, processes of evolution of autosolitons in traffic flow, in semiconductors and in gas discharge plasma are considered. copyright 1996 American Institute of Physics

  6. Reconstruction of dynamical equations for traffic flow

    OpenAIRE

    Kriso, S.; Friedrich, R.; Peinke, J.; Wagner, P.

    2001-01-01

    Traffic flow data collected by an induction loop detector on the highway close to Koeln-Nord are investigated with respect to their dynamics including the stochastic content. In particular we present a new method, with which the flow dynamics can be extracted directly from the measured data. As a result a Langevin equation for the traffic flow is obtained. From the deterministic part of the flow dynamics, stable fixed points are extracted and set into relation with common features of the fund...

  7. 11th Traffic and Granular Flow Conference

    CERN Document Server

    Daamen, Winnie

    2016-01-01

    The Conference on Traffic and Granular Flow brings together international researchers from different fields ranging from physics to computer science and engineering to discuss the latest developments in traffic-related systems. Originally conceived to facilitate new ideas by considering the similarities of traffic and granular flow, TGF'15, organised by Delft University of Technology, now covers a broad range of topics related to driven particle and transport systems. Besides the classical topics of granular flow and highway traffic, its scope includes data transport (Internet traffic), pedestrian and evacuation dynamics, intercellular transport, swarm behaviour and the collective dynamics of other biological systems. Recent advances in modelling, computer simulation and phenomenology are presented, and prospects for applications, for example to traffic control, are discussed. The conference explores the interrelations between the above-mentioned fields and offers the opportunity to stimulate interdisciplinar...

  8. Traffic and Granular Flow ’07

    CERN Document Server

    Chevoir, François; Gondret, Philippe; Lassarre, Sylvain; Lebacque, Jean-Patrick; Schreckenberg, Michael

    2009-01-01

    This book covers several research fields, all of which deal with transport. Three main topics are treated: road traffic, granular matter, and biological transport. Different points of view, i.e. modelling, simulations, experiments, and phenomenological observations, are considered. Sub-topics include: highway or urban vehicular traffic (dynamics of traffic, macro/micro modelling, measurements, data analysis, security issues, psychological issues), pedestrian traffic, animal traffic (e.g. social insects), collective motion in biological systems (molecular motors...), granular flow (dense flows, intermittent flows, solid/liquid transition, jamming, force networks, fluid and solid friction), networks (biological networks, urban traffic, the internet, vulnerability of networks, optimal transport networks) and cellular automata applied to the various aforementioned fields.

  9. Flow shop scheduling with heterogeneous workers

    OpenAIRE

    Benavides, Alexander J.; Ritt, Marcus; Miralles Insa, Cristóbal Javier

    2014-01-01

    We propose an extension to the flow shop scheduling problem named Heterogeneous Flow Shop Scheduling Problem (Het-FSSP), where two simultaneous issues have to be resolved: finding the best worker assignment to the workstations, and solving the corresponding scheduling problem. This problem is motivated by Sheltered Work centers for Disabled, whose main objective is the labor integration of persons with disabilities, an important aim not only for these centers but for any company d...

  10. Will Automated Vehicles Negatively Impact Traffic Flow?

    Directory of Open Access Journals (Sweden)

    S. C. Calvert

    2017-01-01

    Full Text Available With low-level vehicle automation already available, there is a necessity to estimate its effects on traffic flow, especially if these could be negative. A long gradual transition will occur from manual driving to automated driving, in which many yet unknown traffic flow dynamics will be present. These effects have the potential to increasingly aid or cripple current road networks. In this contribution, we investigate these effects using an empirically calibrated and validated simulation experiment, backed up with findings from literature. We found that low-level automated vehicles in mixed traffic will initially have a small negative effect on traffic flow and road capacities. The experiment further showed that any improvement in traffic flow will only be seen at penetration rates above 70%. Also, the capacity drop appeared to be slightly higher with the presence of low-level automated vehicles. The experiment further investigated the effect of bottleneck severity and truck shares on traffic flow. Improvements to current traffic models are recommended and should include a greater detail and understanding of driver-vehicle interaction, both in conventional and in mixed traffic flow. Further research into behavioural shifts in driving is also recommended due to limited data and knowledge of these dynamics.

  11. Traffic Flow Prediction Using MI Algorithm and Considering Noisy and Data Loss Conditions: An Application to Minnesota Traffic Flow Prediction

    Directory of Open Access Journals (Sweden)

    Seyed Hadi Hosseini

    2014-10-01

    Full Text Available Traffic flow forecasting is useful for controlling traffic flow, traffic lights, and travel times. This study uses a multi-layer perceptron neural network and the mutual information (MI technique to forecast traffic flow and compares the prediction results with conventional traffic flow forecasting methods. The MI method is used to calculate the interdependency of historical traffic data and future traffic flow. In numerical case studies, the proposed traffic flow forecasting method was tested against data loss, changes in weather conditions, traffic congestion, and accidents. The outcomes were highly acceptable for all cases and showed the robustness of the proposed flow forecasting method.

  12. Traffic Scheduling in WDM Passive Optical Network with Delay Guarantee

    Institute of Scientific and Technical Information of China (English)

    2005-01-01

    WDM passive optical network becomes more favorable as the required bandwidth increases, but currently few media access control algorithms adapted to WDM access network. This paper presented a new scheduling algorithm for bandwidth sharing in WDM passive optical networks, which provides per-flow delay guarantee and supports variable-length packets scheduling. Through theoretical analysis and simulation, the end-to-end delay bound and throughput fairness of the algorithm was demonstrated.

  13. Traffic and Granular Flow ’03

    CERN Document Server

    Luding, Stefan; Bovy, Piet; Schreckenberg, Michael; Wolf, Dietrich

    2005-01-01

    These proceedings are the fifth in the series Traffic and Granular Flow, and we hope they will be as useful a reference as their predecessors. Both the realistic modelling of granular media and traffic flow present important challenges at the borderline between physics and engineering, and enormous progress has been made since 1995, when this series started. Still the research on these topics is thriving, so that this book again contains many new results. Some highlights addressed at this conference were the influence of long range electric and magnetic forces and ambient fluids on granular media, new precise traffic measurements, and experiments on the complex decision making of drivers. No doubt the “hot topics” addressed in granular matter research have diverged from those in traffic since the days when the obvious analogies between traffic jams on highways and dissipative clustering in granular flow intrigued both c- munities alike. However, now just this diversity became a stimulating feature of the ...

  14. Traffic flow dynamics data, models and simulation

    CERN Document Server

    Treiber, Martin

    2013-01-01

    This textbook provides a comprehensive and instructive coverage of vehicular traffic flow dynamics and modeling. It makes this fascinating interdisciplinary topic, which to date was only documented in parts by specialized monographs, accessible to a broad readership. Numerous figures and problems with solutions help the reader to quickly understand and practice the presented concepts. This book is targeted at students of physics and traffic engineering and, more generally, also at students and professionals in computer science, mathematics, and interdisciplinary topics. It also offers material for project work in programming and simulation at college and university level. The main part, after presenting different categories of traffic data, is devoted to a mathematical description of the dynamics of traffic flow, covering macroscopic models which describe traffic in terms of density, as well as microscopic many-particle models in which each particle corresponds to a vehicle and its driver. Focus chapters on ...

  15. International Workshop on Traffic and Granular Flow

    CERN Document Server

    Herrmann, Hans; Schreckenberg, Michael; Wolf, Dietrich; Social, Traffic and Granular Dynamics

    2000-01-01

    "Are there common phenomena and laws in the dynamic behavior of granular materials, traffic, and socio-economic systems?" The answers given at the international workshop "Traffic and Granular Flow '99" are presented in this volume. From a physical standpoint, all these systems can be treated as (self)-driven many-particle systems with strong fluctuations, showing multistability, phase transitions, non-linear waves, etc. The great interest in these systems is due to several unexpected new discoveries and their practical relevance for solving some fundamental problems of today's societies. This includes intelligent measures for traffic flow optimization and methods from "econophysics" for stabilizing (stock) markets.

  16. ON THE ARRIVAL TRAFFIC FLOW ORGANIZATION

    Directory of Open Access Journals (Sweden)

    Nikita A. Assorov

    2017-01-01

    Full Text Available This article is about air traffic flow organization, ICAO regulations describe the organizing of traffic flow as one of the purposes of air traffic control, but they don’t state exactly at what point the flow has to be organized and metered. The flight phase, where air traffic controller interferes with his instructions in order to begin organizing of all aircraft landing at a certain airport depends on the actual traffic volume per hour, airspace capacity and design.The example of air traffic situation in Moscow Domodedovo airport is described in the article, with runway 32 right in use, no significant weather, real usage of STARs, considering all the ICAO and Russian Federation regulations regarding speed control with the restrictions mentioned in AIP of Moscow Domodedovo. The purpose of the experiment is to prove the need of metering the air traffic flow on the entry points in Moscow TMA, because in case of unorganized air traffic flow approach controllers will have additional unnecessary workload.The conducted calculations show, that only 3 aircraft entering TMA on the same distance from initial approach point can be handled using only speed control and existing standard arrival procedures, in all other cases vectoring or holding areas should be used.In order to avoid such situations and increase the number of the aircraft that can be handled by the approach controller with less instructions, all the traffic arriving on the TMA entry point has to be metered by area control centre, because the air traffic control unit has much more space and time for long term speed control modifications, e.g. ±0,02 Mach. In conclusion a simple rule comes to mind – the bigger inbound traffic is, the earlier one has to organize it, in order to do it speed control, radar vectors, miles-in-trail can be used. Also new equipment and technology can help air traffic controller with this task, e.g. AMAN (arrival manager, in addition to this, the experience of

  17. Traffic and Granular Flow '11

    CERN Document Server

    Buslaev, Alexander; Bugaev, Alexander; Yashina, Marina; Schadschneider, Andreas; Schreckenberg, Michael; TGF11

    2013-01-01

    This book continues the biannual series of conference proceedings, which has become a classical reference resource in traffic and granular research alike. It addresses new developments at the interface between physics, engineering and computational science. Complex systems, where many simple agents, be they vehicles or particles, give rise to surprising and fascinating phenomena.   The contributions collected in these proceedings cover several research fields, all of which deal with transport. Topics include highway, pedestrian and internet traffic, granular matter, biological transport, transport networks, data acquisition, data analysis and technological applications. Different perspectives, i.e. modeling, simulations, experiments and phenomenological observations, are considered.

  18. Traffic flow dynamics. Data, models and simulation

    Energy Technology Data Exchange (ETDEWEB)

    Treiber, Martin [Technische Univ. Dresden (Germany). Inst. fuer Wirtschaft und Verkehr; Kesting, Arne [TomTom Development Germany GmbH, Berlin (Germany)

    2013-07-01

    First comprehensive textbook of this fascinating interdisciplinary topic which explains advances in a way that it is easily accessible to engineering, physics and math students. Presents practical applications of traffic theory such as driving behavior, stability analysis, stop-and-go waves, and travel time estimation. Presents the topic in a novel and systematic way by addressing both microscopic and macroscopic models with a focus on traffic instabilities. Revised and extended edition of the German textbook ''Verkehrsdynamik und -simulation''. This textbook provides a comprehensive and instructive coverage of vehicular traffic flow dynamics and modeling. It makes this fascinating interdisciplinary topic, which to date was only documented in parts by specialized monographs, accessible to a broad readership. Numerous figures and problems with solutions help the reader to quickly understand and practice the presented concepts. This book is targeted at students of physics and traffic engineering and, more generally, also at students and professionals in computer science, mathematics, and interdisciplinary topics. It also offers material for project work in programming and simulation at college and university level. The main part, after presenting different categories of traffic data, is devoted to a mathematical description of the dynamics of traffic flow, covering macroscopic models which describe traffic in terms of density, as well as microscopic many-particle models in which each particle corresponds to a vehicle and its driver. Focus chapters on traffic instabilities and model calibration/validation present these topics in a novel and systematic way. Finally, the theoretical framework is shown at work in selected applications such as traffic-state and travel-time estimation, intelligent transportation systems, traffic operations management, and a detailed physics-based model for fuel consumption and emissions.

  19. Dynamic methods of air traffic flow management

    Directory of Open Access Journals (Sweden)

    Jacek SKORUPSKI

    2011-01-01

    Full Text Available Air traffic management is a complex hierarchical system. Hierarchy levels can be defined according to decision making time horizon or to analyze area volume. For medium time horizon and wide analysis area, the air traffic flow management services were established. Their main task is to properly co-ordinate air traffic in European airspace, so as to minimize delays arising in congested sectors. Those services have to assure high safety level at the same time. Thus it is a very complex task, with many goals, many decision variables and many constraints.In the paper review of the methods developed for aiding air traffic flow management services is presented. More detailed description of a dynamic method is given. This method is based on stochastic capacity and scenario analysis. Some problems in utilization of presented methods are also pointed out, so are the next research possibilities.

  20. Digital Advertising Traffic Operation: Flow Management Analysis

    OpenAIRE

    Mas, Massimiliano Dal

    2017-01-01

    In a Web Advertising Traffic Operation the Trafficking Routing Problem (TRP) consists in scheduling the management of Web Advertising (Adv) campaign between Trafficking campaigns in the most efficient way to oversee and manage relationship with partners and internal teams, managing expectations through integration and post-launch in order to ensure success for every stakeholders involved. For our own interest we did that independent research projects also through specific innovative tasks val...

  1. Traffic flow characteristic and capacity in intelligent work zones.

    Science.gov (United States)

    2009-10-15

    Intellgent transportation system (ITS) technologies are utilized to manage traffic flow and safety in : highway work zones. Traffic management plans for work zones require queuing analyses to determine : the anticipated traffic backups, but the predi...

  2. Traffic Flow Wide-Area Surveillance system

    Energy Technology Data Exchange (ETDEWEB)

    Allgood, G.O.; Ferrell, R.K.; Kercel, S.W.; Abston, R.A.

    1994-09-01

    Traffic management can be thought of as a stochastic queuing process where the serving time at one of its control points is dynamically linked to the global traffic pattern, which is, in turn, dynamically linked to the control point. For this closed-loop system to be effective, the traffic management system must sense and interpret a large spatial projection of data originating from multiple sensor suites. This concept is the basis for the development of a Traffic Flow Wide-Area Surveillance (TFWAS) system. This paper presents the results of a study by Oak Ridge National Laboratory to define the operational specifications and characteristics, to determine the constraints, and to examine the state of technology of a TFWAS system in terms of traffic management and control. In doing so, the functions and attributes of a TFWAS system are mapped into an operational structure consistent with the Intelligent Vehicle Highway System (IVHS) concept and the existing highway infrastructure. This mapping includes identifying candidate sensor suites and establishing criteria, requirements, and performance measures by which these systems can be graded in their ability and practicality to meet the operational requirements of a TFWAS system. In light of this, issues such as system integration, applicable technologies, impact on traffic management and control, and public acceptance are addressed.

  3. Traffic flow wide-area surveillance system

    Science.gov (United States)

    Allgood, Glenn O.; Ferrell, Regina K.; Kercel, Stephen W.; Abston, Ruth A.

    1995-01-01

    Traffic management can be thought of as a stochastic queuing process where the serving time at one of its control points is dynamically linked to the global traffic pattern, which is, in turn, dynamically linked to the control point. For this closed-loop system to be effective, the traffic management system must sense and interpret a large spatial projection of data originating from multiple sensor suites. This concept is the basis for the development of a traffic flow wide-area surveillance (TFWAS) system. This paper presents the results of a study by Oak Ridge National Laboratory to define the operational specifications and characteristics, to determine the constraints, and to examine the state of technology of a TFWAS system in terms of traffic management and control. In doing so, the functions and attributes of a TFWAS system are mapped into an operational structure consistent with the Intelligent Vehicle Highway System (IVHS) concept and the existing highway infrastructure. This mapping includes identifying candidate sensor suites and establishing criteria, requirements, and performance measures by which these systems can be graded in their ability and practicality to meet the operational requirements of a TFWAS system. In light of this, issues such as system integration, applicable technologies, impact on traffic management and control, and public acceptance are addressed.

  4. From Traffic Flow to Economic System

    Science.gov (United States)

    Bando, M.

    The optimal velocity model which is applied to traffic flow phenomena explains a spontaneous formation of traffic congestion. We discuss why the model works well in describing both free-flow and congested flow states in a unified way. The essential ingredient is that our model takes account of a sort of time delay in reacting to a given stimulus. This causes instability of many-body system, and yields a kind of phase transition above a certain critical density. Especially there appears a limit cycle on the phase space along which individual vehicle moves, and they show cyclic behavior. Once that we recognize the mechanism the same idea can be applied to a variety of phenomena which show cyclic behavior observed in many-body systems. As an example of such applications, we investigate business cycles commonly observed in economic system. We further discuss a possible origin of a kind of cyclic behavior observed in climate change.

  5. Traffic Flow Optimization Using a Quantum Annealer

    Directory of Open Access Journals (Sweden)

    Florian Neukart

    2017-12-01

    Full Text Available Quantum annealing algorithms belong to the class of metaheuristic tools, applicable for solving binary optimization problems. Hardware implementations of quantum annealing, such as the quantum processing units (QPUs produced by D-Wave Systems, have been subject to multiple analyses in research, with the aim of characterizing the technology’s usefulness for optimization and sampling tasks. In this paper, we present a real-world application that uses quantum technologies. Specifically, we show how to map certain parts of a real-world traffic flow optimization problem to be suitable for quantum annealing. We show that time-critical optimization tasks, such as continuous redistribution of position data for cars in dense road networks, are suitable candidates for quantum computing. Due to the limited size and connectivity of current-generation D-Wave QPUs, we use a hybrid quantum and classical approach to solve the traffic flow problem.

  6. Forecasting Multivariate Road Traffic Flows Using Bayesian Dynamic Graphical Models, Splines and Other Traffic Variables

    NARCIS (Netherlands)

    Anacleto, Osvaldo; Queen, Catriona; Albers, Casper J.

    Traffic flow data are routinely collected for many networks worldwide. These invariably large data sets can be used as part of a traffic management system, for which good traffic flow forecasting models are crucial. The linear multiregression dynamic model (LMDM) has been shown to be promising for

  7. Scheduling strategies for LTE uplink with flow behaviour analysis

    NARCIS (Netherlands)

    Dimitrova, D.C.; Berg, J.L. van den; Litjens, R.; Heijenk, G.

    2010-01-01

    Long Term Evolution (LTE) is a cellular technology developed to support diversity of data traffic at potentially high rates. It is foreseen to extend the capacity and improve the performance of current 3G cellular networks. A key mechanism in the LTE traffic handling is the packet scheduler, which

  8. Scheduling strategies for LTE uplink with flow behaviour analysis

    NARCIS (Netherlands)

    Dimitrova, D.C.; van den Berg, Hans Leo; Litjens, R.; Brogle, Marc; Osipov, Evgeny; Heijenk, Gerhard J.

    Long Term Evolution (LTE) is a cellular technology developed to support diversity of data traffic at potentially high rates. It is foreseen to extend the capacity and improve the performance of current 3G cellular networks. A key mechanism in the LTE traffic handling is the packet scheduler, which

  9. Analysis of vehicular traffic flow in the major areas of Kuala Lumpur utilizing open-traffic

    Science.gov (United States)

    Manogaran, Saargunawathy; Ali, Muhammad; Yusof, Kamaludin Mohamad; Suhaili, Ramdhan

    2017-09-01

    Vehicular traffic congestion occurs when a large number of drivers are overcrowded on the road and the traffic flow does not run smoothly. Traffic congestion causes chaos on the road and interruption to daily activities of users. Time consumed on road give lots of negative effects on productivity, social behavior, environmental and cost to economy. Congestion is worsens and leads to havoc during the emergency such as flood, accidents, road maintenance and etc., where behavior of traffic flow is always unpredictable and uncontrollable. Real-time and historical traffic data are critical inputs for most traffic flow analysis applications. Researcher attempt to predict traffic using simulations as there is no exact model of traffic flow exists due to its high complexity. Open Traffic is an open source platform available for traffic data analysis linked to Open Street Map (OSM). This research is aimed to study and understand the Open Traffic platform. The real-time traffic flow pattern in Kuala Lumpur area was successfully been extracted and analyzed using Open Traffic. It was observed that the congestion occurs on every major road in Kuala Lumpur and most of it owes to the offices and the economic and commercial centers during rush hours. At some roads the congestion occurs at night due to the tourism activities.

  10. Evaluation of High Density Air Traffic Operations with Automation for Separation Assurance, Weather Avoidance and Schedule Conformance

    Science.gov (United States)

    Prevot, Thomas; Mercer, Joey S.; Martin, Lynne Hazel; Homola, Jeffrey R.; Cabrall, Christopher D.; Brasil, Connie L.

    2011-01-01

    In this paper we discuss the development and evaluation of our prototype technologies and procedures for far-term air traffic control operations with automation for separation assurance, weather avoidance and schedule conformance. Controller-in-the-loop simulations in the Airspace Operations Laboratory at the NASA Ames Research Center in 2010 have shown very promising results. We found the operations to provide high airspace throughput, excellent efficiency and schedule conformance. The simulation also highlighted areas for improvements: Short-term conflict situations sometimes resulted in separation violations, particularly for transitioning aircraft in complex traffic flows. The combination of heavy metering and growing weather resulted in an increased number of aircraft penetrating convective weather cells. To address these shortcomings technologies and procedures have been improved and the operations are being re-evaluated with the same scenarios. In this paper we will first describe the concept and technologies for automating separation assurance, weather avoidance, and schedule conformance. Second, the results from the 2010 simulation will be reviewed. We report human-systems integration aspects, safety and efficiency results as well as airspace throughput, workload, and operational acceptability. Next, improvements will be discussed that were made to address identified shortcomings. We conclude that, with further refinements, air traffic control operations with ground-based automated separation assurance can routinely provide currently unachievable levels of traffic throughput in the en route airspace.

  11. Flow level performance approximations for elastic traffic integrated with prioritized stream traffic

    NARCIS (Netherlands)

    Malhotra, R.; Berg, J.L. van den

    2007-01-01

    Almost all traffic in todays networks can be classified as being either stream or elastic. The support of these two traffic types is possible either with a Differentiated (DiffServ) or an Integrated Services (IntServ) architecture. However, both DiffServ and IntServ rely on efficient scheduling

  12. Reducing Downlink Signaling Traffic in Wireless Systems Using Mobile-Assisted Scheduling

    OpenAIRE

    Moosavi, Reza; Larsson, Erik G.

    2010-01-01

    We present an idea to reduce the part of the downlink signaling traffic in wireless multiple access systems that contains scheduling information. The theoretical basis of the scheme is that the scheduling decisions made by the base station are correlated with the CSI reports from the mobiles. This correlation can be exploited by the source coding scheme that is used to compress the scheduling maps before they are sent to the mobiles. In the proposed scheme, this idea is implemented by letting...

  13. Acceleration of aircraft-level Traffic Flow Management

    Science.gov (United States)

    Rios, Joseph Lucio

    This dissertation describes novel approaches to solving large-scale, high fidelity, aircraft-level Traffic Flow Management scheduling problems. Depending on the methods employed, solving these problems to optimality can take longer than the length of the planning horizon in question. Research in this domain typically focuses on the quality of the modeling used to describe the problem and the benefits achieved from the optimized solution, often treating computational aspects as secondary or tertiary. The work presented here takes the complementary view and considers the computational aspect as the primary concern. To this end, a previously published model for solving this Traffic Flow Management scheduling problem is used as starting point for this study. The model proposed by Bertsimas and Stock-Patterson is a binary integer program taking into account all major resource capacities and the trajectories of each flight to decide which flights should be held in which resource for what amount of time in order to satisfy all capacity requirements. For large instances, the solve time using state-of-the-art solvers is prohibitive for use within a potential decision support tool. With this dissertation, however, it will be shown that solving can be achieved in reasonable time for instances of real-world size. Five other techniques developed and tested for this dissertation will be described in detail. These are heuristic methods that provide good results. Performance is measured in terms of runtime and "optimality gap." We then describe the most successful method presented in this dissertation: Dantzig-Wolfe Decomposition. Results indicate that a parallel implementation of Dantzig-Wolfe Decomposition optimally solves the original problem in much reduced time and with better integrality and smaller optimality gap than any of the heuristic methods or state-of-the-art, commercial solvers. The solution quality improves in every measureable way as the number of subproblems

  14. Real-Time Corrected Traffic Correlation Model for Traffic Flow Forecasting

    Directory of Open Access Journals (Sweden)

    Hua-pu Lu

    2015-01-01

    Full Text Available This paper focuses on the problems of short-term traffic flow forecasting. The main goal is to put forward traffic correlation model and real-time correction algorithm for traffic flow forecasting. Traffic correlation model is established based on the temporal-spatial-historical correlation characteristic of traffic big data. In order to simplify the traffic correlation model, this paper presents correction coefficients optimization algorithm. Considering multistate characteristic of traffic big data, a dynamic part is added to traffic correlation model. Real-time correction algorithm based on Fuzzy Neural Network is presented to overcome the nonlinear mapping problems. A case study based on a real-world road network in Beijing, China, is implemented to test the efficiency and applicability of the proposed modeling methods.

  15. Stationary velocity distributions in traffic flows

    International Nuclear Information System (INIS)

    1997-01-01

    We introduce a traffic flow model that incorporates clustering and passing. We obtain analytically the steady state characteristics of the flow from a Boltzmann-like equation. A single dimensionless parameter, R=c 0 v 0 t 0 with c 0 the concentration, v 0 the velocity range, and t 0 -1 the passing rate, determines the nature of the steady state. When R 1, large clusters with average mass left-angle m right-angle ∼R α form, and the flux is J∼R -γ . The initial distribution of slow cars governs the statistics. When P 0 (v)∼v μ as v→0, the scaling exponents are γ=1/(μ+2), α=1/2 when μ>0, and α=(μ+1)/(μ+2) when μ<0. copyright 1997 The American Physical Society

  16. Robust Traffic Flow Management: Coevolutionary Approach, Phase I

    Data.gov (United States)

    National Aeronautics and Space Administration — We will develop a Coevolutionary Decision Support Tool (CDST) that explicitly incorporates weather uncertainty (non-probabilistically) into strategic Traffic Flow...

  17. Abnormal traffic flow data detection based on wavelet analysis

    Directory of Open Access Journals (Sweden)

    Xiao Qian

    2016-01-01

    Full Text Available In view of the traffic flow data of non-stationary, the abnormal data detection is difficult.proposed basing on the wavelet analysis and least squares method of abnormal traffic flow data detection in this paper.First using wavelet analysis to make the traffic flow data of high frequency and low frequency component and separation, and then, combined with least square method to find abnormal points in the reconstructed signal data.Wavelet analysis and least square method, the simulation results show that using wavelet analysis of abnormal traffic flow data detection, effectively reduce the detection results of misjudgment rate and false negative rate.

  18. Construction and simulation of a novel continuous traffic flow model

    International Nuclear Information System (INIS)

    Hwang, Yao-Hsin; Yu, Jui-Ling

    2017-01-01

    In this paper, we aim to propose a novel mathematical model for traffic flow and apply a newly developed characteristic particle method to solve the associate governing equations. As compared with the existing non-equilibrium higher-order traffic flow models, the present one is put forward to satisfy the following three conditions: 1.Preserve the equilibrium state in the smooth region. 2.Yield an anisotropic propagation of traffic flow information. 3.Expressed with a conservation law form for traffic momentum. These conditions will ensure a more practical simulation in traffic flow physics: The current traffic will not be influenced by the condition in the behind and result in unambiguous condition across a traffic shock. Through analyses of characteristics, stability condition and steady-state solution adherent to the equation system, it is shown that the proposed model actually conform to these conditions. Furthermore, this model can be cast into its characteristic form which, incorporated with the Rankine-Hugoniot relation, is appropriate to be simulated by the characteristic particle method to obtain accurate computational results. - Highlights: • The traffic model expressed with the momentum conservation law. • Traffic flow information propagate anisotropically and preserve the equilibrium state in the smooth region. • Computational particles of two families are invented to mimic forward-running and backward-running characteristics. • Formation of shocks will be naturally detected by the intersection of computational particles of same family. • A newly developed characteristic particle method is used to simulate traffic flow model equations.

  19. Cross-Layer Scheduling and Resource Allocation for Heterogeneous Traffic in 3G LTE

    Directory of Open Access Journals (Sweden)

    Richard Musabe

    2014-01-01

    Full Text Available 3G long term evolution (LTE introduces stringent needs in order to provide different kinds of traffic with Quality of Service (QoS characteristics. The major problem with this nature of LTE is that it does not have any paradigm scheduling algorithm that will ideally control the assignment of resources which in turn will improve the user satisfaction. This has become an open subject and different scheduling algorithms have been proposed which are quite challenging and complex. To address this issue, in this paper, we investigate how our proposed algorithm improves the user satisfaction for heterogeneous traffic, that is, best-effort traffic such as file transfer protocol (FTP and real-time traffic such as voice over internet protocol (VoIP. Our proposed algorithm is formulated using the cross-layer technique. The goal of our proposed algorithm is to maximize the expected total user satisfaction (total-utility under different constraints. We compared our proposed algorithm with proportional fair (PF, exponential proportional fair (EXP-PF, and U-delay. Using simulations, our proposed algorithm improved the performance of real-time traffic based on throughput, VoIP delay, and VoIP packet loss ratio metrics while PF improved the performance of best-effort traffic based on FTP traffic received, FTP packet loss ratio, and FTP throughput metrics.

  20. ReFlow: Reports on Internet Traffic

    NARCIS (Netherlands)

    Hoogesteger, Martijn; de Oliveira Schmidt, R.; Sperotto, Anna; Pras, Aiko

    Internet traffic statistics can provide valuable information to network analysts and researchers about the traffic, technologies and main characteristics of today’s networks. For many years Internet2 maintained a public website with statistics about the traffic in the Abilene network. This site was

  1. Proportional fair scheduling algorithm based on traffic in satellite communication system

    Science.gov (United States)

    Pan, Cheng-Sheng; Sui, Shi-Long; Liu, Chun-ling; Shi, Yu-Xin

    2018-02-01

    In the satellite communication network system, in order to solve the problem of low system capacity and user fairness in multi-user access to satellite communication network in the downlink, combined with the characteristics of user data service, an algorithm study on throughput capacity and user fairness scheduling is proposed - Proportional Fairness Algorithm Based on Traffic(B-PF). The algorithm is improved on the basis of the proportional fairness algorithm in the wireless communication system, taking into account the user channel condition and caching traffic information. The user outgoing traffic is considered as the adjustment factor of the scheduling priority and presents the concept of traffic satisfaction. Firstly,the algorithm calculates the priority of the user according to the scheduling algorithm and dispatches the users with the highest priority. Secondly, when a scheduled user is the business satisfied user, the system dispatches the next priority user. The simulation results show that compared with the PF algorithm, B-PF can improve the system throughput, the business satisfaction and fairness.

  2. Traffic flow wide-area surveillance system definition

    Energy Technology Data Exchange (ETDEWEB)

    Allgood, G.O.; Ferrell, R.K.; Kercel, S.W.; Abston, R.A.; Carnal, C.L. [Oak Ridge National Lab., TN (United States); Moynihan, P.I. [Jet Propulsion Lab., Pasadena, CA (United States)

    1994-11-01

    Traffic Flow Wide-Area Surveillance (TFWAS) is a system for assessing the state of traffic flow over a wide area for enhanced traffic control and improved traffic management and planning. The primary purpose of a TFWAS system is to provide a detailed traffic flow description and context description to sophisticated traffic management and control systems being developed or envisioned for the future. A successful TFWAS system must possess the attributes of safety, reconfigurability, reliability, and expandability. The primary safety premise of TFWAS is to ensure that no action or failure of the TFWAS system or its components can result in risk of injury to humans. A wide variety of communication techniques is available for use with TFWAS systems. These communication techniques can be broken down into two categories, landlines and wireless. Currently used and possible future traffic sensing technologies have been examined. Important criteria for selecting TFWAS sensors include sensor capabilities, costs, operational constraints, sensor compatibility with the infrastructure, and extent. TFWAS is a concept that can take advantage of the strengths of different traffic sensing technologies, can readily adapt to newly developed technologies, and can grow with the development of new traffic control strategies. By developing innovative algorithms that will take information from a variety of sensor types and develop descriptions of traffic flows over a wide area, a more comprehensive understanding of the traffic state can be provided to the control system to perform the most reasonable control actions over the entire wide area. The capability of characterizing the state of traffic over an entire region should revolutionize developments in traffic control strategies.

  3. Effects of Car Accidents on Three-Lane Traffic Flow

    Directory of Open Access Journals (Sweden)

    Jianzhong Chen

    2014-01-01

    Full Text Available A three-lane traffic flow model is proposed to investigate the effect of car accidents on the traffic flow. The model is an extension of the full velocity difference (FVD model by taking into account the lane changing. The extended lane-changing rules are presented to model the lane-changing behaviour. The cases that the car accidents occupy the exterior or interior lane, the medium lane, and two lanes are studied by numerical simulations. The time-space diagrams and the current diagrams are presented, and the traffic jams are investigated. The results show that the car accident has a different effect on the traffic flow when it occupies different lanes. The car accidents have a more serious effect on the whole road when they occupy two lanes. The larger the density is, the greater the influence on the traffic flow becomes.

  4. Flow-shop scheduling problem under uncertainties: Review and trends

    OpenAIRE

    Eliana María González-Neira; Jairo R. Montoya-Torres; David Barrera

    2017-01-01

    Among the different tasks in production logistics, job scheduling is one of the most important at the operational decision-making level to enable organizations to achieve competiveness. Scheduling consists in the allocation of limited resources to activities over time in order to achieve one or more optimization objectives. Flow-shop (FS) scheduling problems encompass the sequencing processes in environments in which the activities or operations are performed in a serial flow. This type of co...

  5. Towards Signalling Maintenance Scheduling for European Railway Traffic Management System

    DEFF Research Database (Denmark)

    M. Pour, Shahrzad

    signalling system. Therefore, the entire maintenance system needs to change from the previous system to the newest system, and hence, new optimisation techniques need to be established so as to facilitate managers in creating ideal maintenance strategies. The aim of this thesis is to develop new maintenance......The European Railway Traffic Management System (ERTMS) is the newest signalling standard that has been introduced in the railway industry. The aim of ERTMS is to ensure better signalling communication amongst various train systems, and hence, to help in attaining improved connectivity and commuting...... between European countries. In various countries across the world, there is a gradual shift from the current signalling systems to ERTMS. Amongst the European countries, Denmark was the first country to commence a full upgrading of its signalling system to ERTMS. A variety of maintenance requirements...

  6. Road traffic flow and impact on environment in Hyderabad city

    International Nuclear Information System (INIS)

    Memon, Zaheer-ud-Din; Ansari, A.K.; Memon, S.A.

    2000-01-01

    In Hyderabad city due to dramatic increase in traffic intensity on the roads, traffic flow have been much beyond the comfortable limits. High values of traffic flow density have been recorded on Court Road (34.05%), Tilak Road (19.87%), Risala Road (22.91%) and Cafe George (23.14%) of Hyderabad city. Above 80% people are found to be annoyed due to traffic congestion, noise and smoke resulting in health ailments. Slow Moving Vehicles (SMVs) comprising of animal and hand drawn vehicles (rehras) cause serious disruption in the traffic stream on city roads, which are ultimately causing traffic-jam condition resulting a serious impact on environment. No definite parking places exist for public vehicles because of encroachment on roads. Proper foot paths are not available for pedestrian, which results in increase in accidents. (author)

  7. A measure theoretic approach to traffic flow optimization on networks

    OpenAIRE

    Cacace, Simone; Camilli, Fabio; De Maio, Raul; Tosin, Andrea

    2018-01-01

    We consider a class of optimal control problems for measure-valued nonlinear transport equations describing traffic flow problems on networks. The objective isto minimise/maximise macroscopic quantities, such as traffic volume or average speed,controlling few agents, for example smart traffic lights and automated cars. The measuretheoretic approach allows to study in a same setting local and nonlocal drivers interactionsand to consider the control variables as additional measures interacting ...

  8. Navier-Stokes-like equations for traffic flow.

    Science.gov (United States)

    Velasco, R M; Marques, W

    2005-10-01

    The macroscopic traffic flow equations derived from the reduced Paveri-Fontana equation are closed starting with the maximization of the informational entropy. The homogeneous steady state taken as a reference is obtained for a specific model of the desired velocity and a kind of Chapman-Enskog method is developed to calculate the traffic pressure at the Navier-Stokes level. Numerical solution of the macroscopic traffic equations is obtained and its characteristics are analyzed.

  9. An Efficient Computational Technique for Fractal Vehicular Traffic Flow

    Directory of Open Access Journals (Sweden)

    Devendra Kumar

    2018-04-01

    Full Text Available In this work, we examine a fractal vehicular traffic flow problem. The partial differential equations describing a fractal vehicular traffic flow are solved with the aid of the local fractional homotopy perturbation Sumudu transform scheme and the local fractional reduced differential transform method. Some illustrative examples are taken to describe the success of the suggested techniques. The results derived with the aid of the suggested schemes reveal that the present schemes are very efficient for obtaining the non-differentiable solution to fractal vehicular traffic flow problem.

  10. Microscopic modeling of multi-lane highway traffic flow

    Science.gov (United States)

    Hodas, Nathan O.; Jagota, Anand

    2003-12-01

    We discuss a microscopic model for the study of multi-lane highway traffic flow dynamics. Each car experiences a force resulting from a combination of the desire of the driver to attain a certain velocity, aerodynamic drag, and change of the force due to car-car interactions. The model also includes multi-lane simulation capability and the ability to add and remove obstructions. We implement the model via a Java applet, which is used to simulate traffic jam formation, the effect of bottlenecks on traffic flow, and the existence of light, medium, and heavy traffic flow. The simulations also provide insight into how the properties of individual cars result in macroscopic behavior. Because the investigation of emergent characteristics is so common in physics, the study of traffic in this manner sheds new light on how the micro-to-macro transition works in general.

  11. Congestion Control and Traffic Scheduling for Collaborative Crowdsourcing in SDN Enabled Mobile Wireless Networks

    Directory of Open Access Journals (Sweden)

    Dawei Shen

    2018-01-01

    Full Text Available Currently, a number of crowdsourcing-based mobile applications have been implemented in mobile networks and Internet of Things (IoT, targeted at real-time services and recommendation. The frequent information exchanges and data transmissions in collaborative crowdsourcing are heavily injected into the current communication networks, which poses great challenges for Mobile Wireless Networks (MWN. This paper focuses on the traffic scheduling and load balancing problem in software-defined MWN and designs a hybrid routing forwarding scheme as well as a congestion control algorithm to achieve the feasible solution. The traffic scheduling algorithm first sorts the tasks in an ascending order depending on the amount of tasks and then solves it using a greedy scheme. In the proposed congestion control scheme, the traffic assignment is first transformed into a multiknapsack problem, and then the Artificial Fish Swarm Algorithm (AFSA is utilized to solve this problem. Numerical results on practical network topology reveal that, compared with the traditional schemes, the proposed congestion control and traffic scheduling schemes can achieve load balancing, reduce the probability of network congestion, and improve the network throughput.

  12. Research on the Method of Traffic Organization and Optimization Based on Dynamic Traffic Flow Model

    Directory of Open Access Journals (Sweden)

    Shu-bin Li

    2017-01-01

    Full Text Available The modern transportation system is becoming sluggish by traffic jams, so much so that it can harm the economic and society in our country. One of the reasons is the surging vehicles day by day. Another reason is the shortage of the traffic supply seriously. But the most important reason is that the traffic organization and optimization hardly met the conditions of modern transport development. In this paper, the practical method of the traffic organization and optimization used in regional area is explored by the dynamic traffic network analysis method. Firstly, the operational states of the regional traffic network are obtained by simulation method based on the self-developed traffic simulation software DynaCHINA, in which the improved traffic flow simulation model was proposed in order to be more suitable for actual domestic urban transport situation. Then the appropriated optimization model and algorithm were proposed according to different optimized content and organization goals, and the traffic simulation processes more suitable to regional optimization were designed exactly. Finally, a regional network in Tai’an city was selected as an example. The simulation results show that the proposed method is effective and feasible. It can provide strong scientific and technological support for the traffic management department.

  13. assessment of traffic flow on enugu highways using speed density

    African Journals Online (AJOL)

    HOD

    Corresponding author, tel: +234 – 806 – 435 – 0200 ... construction, maintenance and optimization of the highways using the ...... Research Part A: Policy and Practice 29(4), 273-281. 1995. ... relationships: Quality and Theory of Traffic Flow.

  14. Calibration of CORSIM models under saturated traffic flow conditions.

    Science.gov (United States)

    2013-09-01

    This study proposes a methodology to calibrate microscopic traffic flow simulation models. : The proposed methodology has the capability to calibrate simultaneously all the calibration : parameters as well as demand patterns for any network topology....

  15. Agent-Based Collaborative Traffic Flow Management, Phase I

    Data.gov (United States)

    National Aeronautics and Space Administration — We propose agent-based game-theoretic approaches for simulation of strategies involved in multi-objective collaborative traffic flow management (CTFM). Intelligent...

  16. Accurate Multisteps Traffic Flow Prediction Based on SVM

    Directory of Open Access Journals (Sweden)

    Zhang Mingheng

    2013-01-01

    Full Text Available Accurate traffic flow prediction is prerequisite and important for realizing intelligent traffic control and guidance, and it is also the objective requirement for intelligent traffic management. Due to the strong nonlinear, stochastic, time-varying characteristics of urban transport system, artificial intelligence methods such as support vector machine (SVM are now receiving more and more attentions in this research field. Compared with the traditional single-step prediction method, the multisteps prediction has the ability that can predict the traffic state trends over a certain period in the future. From the perspective of dynamic decision, it is far important than the current traffic condition obtained. Thus, in this paper, an accurate multi-steps traffic flow prediction model based on SVM was proposed. In which, the input vectors were comprised of actual traffic volume and four different types of input vectors were compared to verify their prediction performance with each other. Finally, the model was verified with actual data in the empirical analysis phase and the test results showed that the proposed SVM model had a good ability for traffic flow prediction and the SVM-HPT model outperformed the other three models for prediction.

  17. Scheduler-dependent inter-cell interference and its impact on LTE uplink performance at flow level

    NARCIS (Netherlands)

    Dimitrova, D.C.; Heijenk, Geert; van den Berg, Hans Leo; Yankov, S.; Masip Bruin, Xavier; Verchere, Dominique; Tsaoussidis, Vassilis; Yannuzzi, Marcelo

    The Long Term Evolution (LTE) cellular technology is ex- pected to extend the capacity and improve the performance of current 3G cellular networks. Among the key mechanisms in LTE responsible for traffic management is the packet scheduler, which handles the al- location of resources to active flows

  18. Scheduler-dependent inter-cell interference and its impact on LTE uplink performance at flow level

    NARCIS (Netherlands)

    Dimitrova, D.C.; Heijenk, G.; Berg, J.L. van den; Yankov, S.

    2011-01-01

    The Long Term Evolution (LTE) cellular technology is expected to extend the capacity and improve the performance of current 3G cellular networks. Among the key mechanisms in LTE responsible for traffic management is the packet scheduler, which handles the allocation of resources to active flows in

  19. Hierarchical and coupling model of factors influencing vessel traffic flow.

    Directory of Open Access Journals (Sweden)

    Zhao Liu

    Full Text Available Understanding the characteristics of vessel traffic flow is crucial in maintaining navigation safety, efficiency, and overall waterway transportation management. Factors influencing vessel traffic flow possess diverse features such as hierarchy, uncertainty, nonlinearity, complexity, and interdependency. To reveal the impact mechanism of the factors influencing vessel traffic flow, a hierarchical model and a coupling model are proposed in this study based on the interpretative structural modeling method. The hierarchical model explains the hierarchies and relationships of the factors using a graph. The coupling model provides a quantitative method that explores interaction effects of factors using a coupling coefficient. The coupling coefficient is obtained by determining the quantitative indicators of the factors and their weights. Thereafter, the data obtained from Port of Tianjin is used to verify the proposed coupling model. The results show that the hierarchical model of the factors influencing vessel traffic flow can explain the level, structure, and interaction effect of the factors; the coupling model is efficient in analyzing factors influencing traffic volumes. The proposed method can be used for analyzing increases in vessel traffic flow in waterway transportation system.

  20. Hierarchical and coupling model of factors influencing vessel traffic flow.

    Science.gov (United States)

    Liu, Zhao; Liu, Jingxian; Li, Huanhuan; Li, Zongzhi; Tan, Zhirong; Liu, Ryan Wen; Liu, Yi

    2017-01-01

    Understanding the characteristics of vessel traffic flow is crucial in maintaining navigation safety, efficiency, and overall waterway transportation management. Factors influencing vessel traffic flow possess diverse features such as hierarchy, uncertainty, nonlinearity, complexity, and interdependency. To reveal the impact mechanism of the factors influencing vessel traffic flow, a hierarchical model and a coupling model are proposed in this study based on the interpretative structural modeling method. The hierarchical model explains the hierarchies and relationships of the factors using a graph. The coupling model provides a quantitative method that explores interaction effects of factors using a coupling coefficient. The coupling coefficient is obtained by determining the quantitative indicators of the factors and their weights. Thereafter, the data obtained from Port of Tianjin is used to verify the proposed coupling model. The results show that the hierarchical model of the factors influencing vessel traffic flow can explain the level, structure, and interaction effect of the factors; the coupling model is efficient in analyzing factors influencing traffic volumes. The proposed method can be used for analyzing increases in vessel traffic flow in waterway transportation system.

  1. Particle hopping vs. fluid-dynamical models for traffic flow

    Energy Technology Data Exchange (ETDEWEB)

    Nagel, K.

    1995-12-31

    Although particle hopping models have been introduced into traffic science in the 19509, their systematic use has only started recently. Two reasons for this are, that they are advantageous on modem computers, and that recent theoretical developments allow analytical understanding of their properties and therefore more confidence for their use. In principle, particle hopping models fit between microscopic models for driving and fluiddynamical models for traffic flow. In this sense, they also help closing the conceptual gap between these two. This paper shows connections between particle hopping models and traffic flow theory. It shows that the hydrodynamical limits of certain particle hopping models correspond to the Lighthill-Whitham theory for traffic flow, and that only slightly more complex particle hopping models produce already the correct traffic jam dynamics, consistent with recent fluid-dynamical models for traffic flow. By doing so, this paper establishes that, on the macroscopic level, particle hopping models are at least as good as fluid-dynamical models. Yet, particle hopping models have at least two advantages over fluid-dynamical models: they straightforwardly allow microscopic simulations, and they include stochasticity.

  2. EVALUATION OF HUMAN SETTLEMENT INFLUENCE ON SUBURBAN TRAFFIC FLOW DENSITY

    Directory of Open Access Journals (Sweden)

    P. Horbachov

    2017-06-01

    Full Text Available Study results of the human settlement influence on the traffic flow density in suburban service of international, national and regional roads of Ukraine are presented. The possibility of an adequate description of suburban traffic flows in the vicinity of large cities is established, depending on the city population and link remoteness from the city center. The possibility is determined on the basis of obtained models to define the prognosis value of the intensity and specific maintenance of freight and passenger transport flows.

  3. Advancing Traffic Flow Theory Using Empirical Microscopic Data

    Science.gov (United States)

    2015-01-01

    As reviewed in Section 1.1, much of traffic flow theory depends a fundamental relationship (FR) between flow, density, and space mean speed; either explicitly, e.g., hydrodynamic models such as LWR (Lighthill and Whitham, 1955, and Richards, 1956) or...

  4. The Development of the Multi-Center Traffic Management Advisor (MCTMA): Traffic Flow Management Research in a Multi-Facility Environment

    Science.gov (United States)

    Lee, Katharine K.; Davis, Thomas J.; Levin, Kerry M.; Rowe, Dennis W.

    2001-01-01

    The Traffic Management Advisor (TMA) is a decision-support tool for traffic managers and air traffic controllers that provides traffic flow visualization and other flow management tools. TMA creates an efficiently sequenced and safely spaced schedule for arrival traffic that meets but does not exceed specified airspace system constraints. TMA is being deployed at selected facilities throughout the National Airspace System in the US as part of the FAA's Free Flight Phase 1 program. TMA development and testing, and its current deployment, focuses on managing the arrival capacity for single major airports within single terminal areas and single en route centers. The next phase of development for this technology is the expansion of the TMA capability to complex facilities in which a terminal area or airport is fed by multiple en route centers, thus creating a multicenter TMA functionality. The focus of the multi-center TMA (McTMA) development is on the busy facilities in the Northeast comdor of the US. This paper describes the planning and development of McTMA and the challenges associated with adapting a successful traffic flow management tool for a very complex airspace.

  5. Flow-shop scheduling problem under uncertainties: Review and trends

    Directory of Open Access Journals (Sweden)

    Eliana María González-Neira

    2017-03-01

    Full Text Available Among the different tasks in production logistics, job scheduling is one of the most important at the operational decision-making level to enable organizations to achieve competiveness. Scheduling consists in the allocation of limited resources to activities over time in order to achieve one or more optimization objectives. Flow-shop (FS scheduling problems encompass the sequencing processes in environments in which the activities or operations are performed in a serial flow. This type of configuration includes assembly lines and the chemical, electronic, food, and metallurgical industries, among others. Scheduling has been mostly investigated for the deterministic cases, in which all parameters are known in advance and do not vary over time. Nevertheless, in real-world situations, events are frequently subject to uncertainties that can affect the decision-making process. Thus, it is important to study scheduling and sequencing activities under uncertainties since they can cause infeasibilities and disturbances. The purpose of this paper is to provide a general overview of the FS scheduling problem under uncertainties and its role in production logistics and to draw up opportunities for further research. To this end, 100 papers about FS and flexible flow-shop scheduling problems published from 2001 to October 2016 were analyzed and classified. Trends in the reviewed literature are presented and finally some research opportunities in the field are proposed.

  6. Impacts of Snowy Weather Conditions on Expressway Traffic Flow Characteristics

    Directory of Open Access Journals (Sweden)

    Jiancheng Weng

    2013-01-01

    Full Text Available Snowy weather will significantly degrade expressway operations, reduce service levels, and increase driving difficulty. Furthermore, the impact of snow varies in different types of roads, diverse cities, and snow densities due to different driving behavior. Traffic flow parameters are essential to decide what should be appropriate for weather-related traffic management and control strategies. This paper takes Beijing as a case study and analyzes traffic flow data collected by detectors in expressways. By comparing the performance of traffic flow under normal and snowy weather conditions, this paper quantitatively describes the impact of adverse weather on expressway volume and average speeds. Results indicate that average speeds on the Beijing expressway under heavy snow conditions decrease by 10–20 km/h when compared to those under normal weather conditions, the vehicle headway generally increases by 2–4 seconds, and the road capacity drops by about 33%. This paper also develops a specific expressway traffic parameter reduction model which proposes reduction coefficients of expressway volumes and speeds under various snow density conditions in Beijing. The conclusions paper provide effective foundational parameters for urban expressway controls and traffic management under snow conditions.

  7. Lagrangian generic second order traffic flow models for node

    Directory of Open Access Journals (Sweden)

    Asma Khelifi

    2018-02-01

    Full Text Available This study sheds light on higher order macroscopic traffic flow modeling on road networks, thanks to the generic second order models (GSOM family which embeds a myriad of traffic models. It has been demonstrated that such higher order models are easily solved in Lagrangian coordinates which are compatible with both microscopic and macroscopic descriptions. The generalized GSOM model is reformulated in the Lagrangian coordinate system to develop a more efficient numerical method. The difficulty in applying this approach on networks basically resides in dealing with node dynamics. Traffic flow characteristics at node are different from that on homogeneous links. Different geometry features can lead to different critical research issues. For instance, discontinuity in traffic stream can be an important issue for traffic signal operations, while capacity drop may be crucial for lane-merges. The current paper aims to establish and analyze a new adapted node model for macroscopic traffic flow models by applying upstream and downstream boundary conditions on the Lagrangian coordinates in order to perform simulations on networks of roads, and accompanying numerical method. The internal node dynamics between upstream and downstream links are taken into account of the node model. Therefore, a numerical example is provided to underscore the efficiency of this approach. Simulations show that the discretized node model yields accurate results. Additional kinematic waves and contact discontinuities are induced by the variation of the driver attribute.

  8. Simulation-Based Dynamic Passenger Flow Assignment Modelling for a Schedule-Based Transit Network

    Directory of Open Access Journals (Sweden)

    Xiangming Yao

    2017-01-01

    Full Text Available The online operation management and the offline policy evaluation in complex transit networks require an effective dynamic traffic assignment (DTA method that can capture the temporal-spatial nature of traffic flows. The objective of this work is to propose a simulation-based dynamic passenger assignment framework and models for such applications in the context of schedule-based rail transit systems. In the simulation framework, travellers are regarded as individual agents who are able to obtain complete information on the current traffic conditions. A combined route selection model integrated with pretrip route selection and entrip route switch is established for achieving the dynamic network flow equilibrium status. The train agent is operated strictly with the timetable and its capacity limitation is considered. A continuous time-driven simulator based on the proposed framework and models is developed, whose performance is illustrated through a large-scale network of Beijing subway. The results indicate that more than 0.8 million individual passengers and thousands of trains can be simulated simultaneously at a speed ten times faster than real time. This study provides an efficient approach to analyze the dynamic demand-supply relationship for large schedule-based transit networks.

  9. FLOW-SHOP SCHEDULING WITH MULTIPLE OPERATIONS AND TIME LAGS

    NARCIS (Netherlands)

    RIEZEBOS, J; GAALMAN, GJC; GUPTA, JND

    A scheduling system is proposed and developed for a special type of flow shop. Ln this flow shop there is one machine at each stage. A job may require multiple operations at each stage. The first operation of a job on stage j cannot start until the last operation of the job on stage j - 1 has

  10. Null Space Based Preemptive Scheduling For Joint URLLC and eMBB Traffic in 5G Networks

    DEFF Research Database (Denmark)

    Abdul-Mawgood Ali Ali Esswie, Ali; Pedersen, Klaus

    2018-01-01

    In this paper, we propose a null-space-based preemptive scheduling framework for cross-objective optimization to always guarantee robust URLLC performance, while extracting the maximum possible eMBB capacity. The proposed scheduler perpetually grants incoming URLLC traffic a higher priority for i...

  11. Social dilemma structures hidden behind traffic flow with lane changes

    International Nuclear Information System (INIS)

    Tanimoto, Jun; Kukida, Shinji; Hagishima, Aya

    2014-01-01

    Aiming to merge traffic flow analysis with evolutionary game theory, we investigated the question of whether such structures can be formed from frequent lane changes in usual traffic flow without any explicit bottlenecks. In our model system, two classes of driver-agents coexist: C-agents (cooperative strategy) always remain in the lane they are initially assigned, whereas D-agents (defective strategy) try to change lanes to move ahead. In relatively high-density flows, such as the metastable and high-density phases, we found structures that correspond to either n-person prisoner dilemma (n-PD) games or quasi-PD games. In these situations, lane changes by D-agents create heavy traffic jams that reduce social efficiency. (paper)

  12. Impact of distracted driving on safety and traffic flow.

    Science.gov (United States)

    Stavrinos, Despina; Jones, Jennifer L; Garner, Annie A; Griffin, Russell; Franklin, Crystal A; Ball, David; Welburn, Sharon C; Ball, Karlene K; Sisiopiku, Virginia P; Fine, Philip R

    2013-12-01

    Studies have documented a link between distracted driving and diminished safety; however, an association between distracted driving and traffic congestion has not been investigated in depth. The present study examined the behavior of teens and young adults operating a driving simulator while engaged in various distractions (i.e., cell phone, texting, and undistracted) and driving conditions (i.e., free flow, stable flow, and oversaturation). Seventy five participants 16-25 years of age (split into 2 groups: novice drivers and young adults) drove a STISIM simulator three times, each time with one of three randomly presented distractions. Each drive was designed to represent daytime scenery on a 4 lane divided roadway and included three equal roadway portions representing Levels of Service (LOS) A, C, and E as defined in the 2000 Highway Capacity Manual. Participants also completed questionnaires documenting demographics and driving history. Both safety and traffic flow related driving outcomes were considered. A Repeated Measures Multivariate Analysis of Variance was employed to analyze continuous outcome variables and a Generalized Estimate Equation (GEE) Poisson model was used to analyze count variables. Results revealed that, in general more lane deviations and crashes occurred during texting. Distraction (in most cases, text messaging) had a significantly negative impact on traffic flow, such that participants exhibited greater fluctuation in speed, changed lanes significantly fewer times, and took longer to complete the scenario. In turn, more simulated vehicles passed the participant drivers while they were texting or talking on a cell phone than while undistracted. The results indicate that distracted driving, particularly texting, may lead to reduced safety and traffic flow, thus having a negative impact on traffic operations. No significant differences were detected between age groups, suggesting that all drivers, regardless of age, may drive in a manner

  13. Computing Programs for Determining Traffic Flows from Roundabouts

    Science.gov (United States)

    Boroiu, A. A.; Tabacu, I.; Ene, A.; Neagu, E.; Boroiu, A.

    2017-10-01

    For modelling road traffic at the level of a road network it is necessary to specify the flows of all traffic currents at each intersection. These data can be obtained by direct measurements at the traffic light intersections, but in the case of a roundabout this is not possible directly and the literature as well as the traffic modelling software doesn’t offer ways to solve this issue. Two sets of formulas are proposed by which all traffic flows from the roundabouts with 3 or 4 arms are calculated based on the streams that can be measured. The objective of this paper is to develop computational programs to operate with these formulas. For each of the two sets of analytical relations, a computational program was developed in the Java operating language. The obtained results fully confirm the applicability of the calculation programs. The final stage for capitalizing these programs will be to make them web pages in HTML format, so that they can be accessed and used on the Internet. The achievements presented in this paper are an important step to provide a necessary tool for traffic modelling because these computational programs can be easily integrated into specialized software.

  14. Analyses of Lattice Traffic Flow Model on a Gradient Highway

    International Nuclear Information System (INIS)

    Gupta Arvind Kumar; Redhu Poonam; Sharma Sapna

    2014-01-01

    The optimal current difference lattice hydrodynamic model is extended to investigate the traffic flow dynamics on a unidirectional single lane gradient highway. The effect of slope on uphill/downhill highway is examined through linear stability analysis and shown that the slope significantly affects the stability region on the phase diagram. Using nonlinear stability analysis, the Burgers, Korteweg-deVries (KdV) and modified Korteweg-deVries (mKdV) equations are derived in stable, metastable and unstable region, respectively. The effect of reaction coefficient is examined and concluded that it plays an important role in suppressing the traffic jams on a gradient highway. The theoretical findings have been verified through numerical simulation which confirm that the slope on a gradient highway significantly influence the traffic dynamics and traffic jam can be suppressed efficiently by considering the optimal current difference effect in the new lattice model. (nuclear physics)

  15. An improved sheep flock heredity algorithm for job shop scheduling and flow shop scheduling problems

    Directory of Open Access Journals (Sweden)

    Chandramouli Anandaraman

    2011-10-01

    Full Text Available Job Shop Scheduling Problem (JSSP and Flow Shop Scheduling Problem (FSSP are strong NP-complete combinatorial optimization problems among class of typical production scheduling problems. An improved Sheep Flock Heredity Algorithm (ISFHA is proposed in this paper to find a schedule of operations that can minimize makespan. In ISFHA, the pairwise mutation operation is replaced by a single point mutation process with a probabilistic property which guarantees the feasibility of the solutions in the local search domain. A Robust-Replace (R-R heuristic is introduced in place of chromosomal crossover to enhance the global search and to improve the convergence. The R-R heuristic is found to enhance the exploring potential of the algorithm and enrich the diversity of neighborhoods. Experimental results reveal the effectiveness of the proposed algorithm, whose optimization performance is markedly superior to that of genetic algorithms and is comparable to the best results reported in the literature.

  16. Aircraft emission inventories for scheduled air traffic for the 1976-92 time period. Historical trends

    Energy Technology Data Exchange (ETDEWEB)

    Baughcum, S L; Henderson, S C; Tritz, T G [Boeing Co., Seattle, WA (United States)

    1998-12-31

    Emission inventories of fuel burned, NO{sub x}, CO, and hydrocarbons have been calculated for scheduled air traffic in 1976, 1984, 1990 and 1992 on a 1 deg latitude x 1 deg longitude x 1 km pressure altitude grid. Using this database, the seasonal variation and historical trends in aircraft emissions have been calculated for selected geographical regions (e.g., North Atlantic, Europe, North America, North Pacific). The trend in emissions is a combination of the effects of passenger demand growth, improved aircraft efficiency, changes in combustor characteristics, and aircraft size. (author) 8 refs.

  17. Aircraft emission inventories for scheduled air traffic for the 1976-92 time period. Historical trends

    Energy Technology Data Exchange (ETDEWEB)

    Baughcum, S.L.; Henderson, S.C.; Tritz, T.G. [Boeing Co., Seattle, WA (United States)

    1997-12-31

    Emission inventories of fuel burned, NO{sub x}, CO, and hydrocarbons have been calculated for scheduled air traffic in 1976, 1984, 1990 and 1992 on a 1 deg latitude x 1 deg longitude x 1 km pressure altitude grid. Using this database, the seasonal variation and historical trends in aircraft emissions have been calculated for selected geographical regions (e.g., North Atlantic, Europe, North America, North Pacific). The trend in emissions is a combination of the effects of passenger demand growth, improved aircraft efficiency, changes in combustor characteristics, and aircraft size. (author) 8 refs.

  18. Modeling connected and autonomous vehicles in heterogeneous traffic flow

    Science.gov (United States)

    Ye, Lanhang; Yamamoto, Toshiyuki

    2018-01-01

    The objective of this study was to develop a heterogeneous traffic-flow model to study the possible impact of connected and autonomous vehicles (CAVs) on the traffic flow. Based on a recently proposed two-state safe-speed model (TSM), a two-lane cellular automaton (CA) model was developed, wherein both the CAVs and conventional vehicles were incorporated in the heterogeneous traffic flow. In particular, operation rules for CAVs are established considering the new characteristics of this emerging technology, including autonomous driving through the adaptive cruise control and inter-vehicle connection via short-range communication. Simulations were conducted under various CAV-penetration rates in the heterogeneous flow. The impact of CAVs on the road capacity was numerically investigated. The simulation results indicate that the road capacity increases with an increase in the CAV-penetration rate within the heterogeneous flow. Up to a CAV-penetration rate of 30%, the road capacity increases gradually; the effect of the difference in the CAV capability on the growth rate is insignificant. When the CAV-penetration rate exceeds 30%, the growth rate is largely decided by the capability of the CAV. The greater the capability, the higher the road-capacity growth rate. The relationship between the CAV-penetration rate and the road capacity is numerically analyzed, providing some insights into the possible impact of the CAVs on traffic systems.

  19. An Analysis of Vehicular Traffic Flow Using Langevin Equation

    Directory of Open Access Journals (Sweden)

    Çağlar Koşun

    2015-08-01

    Full Text Available Traffic flow data are stochastic in nature, and an abundance of literature exists thereof. One way to express stochastic data is the Langevin equation. Langevin equation consists of two parts. The first part is known as the deterministic drift term, the other as the stochastic diffusion term. Langevin equation does not only help derive the deterministic and random terms of the selected portion of the city of Istanbul traffic empirically, but also sheds light on the underlying dynamics of the flow. Drift diagrams have shown that slow lane tends to get congested faster when vehicle speeds attain a value of 25 km/h, and it is 20 km/h for the fast lane. Three or four distinct regimes may be discriminated again from the drift diagrams; congested, intermediate, and free-flow regimes. At places, even the intermediate regime may be divided in two, often with readiness to congestion. This has revealed the fact that for the selected portion of the highway, there are two main states of flow, namely, congestion and free-flow, with an intermediate state where the noise-driven traffic flow forces the flow into either of the distinct regimes.

  20. Modelling traffic flows with intelligent cars and intelligent roads

    NARCIS (Netherlands)

    van Arem, Bart; Tampere, Chris M.J.; Malone, Kerry

    2003-01-01

    This paper addresses the modeling of traffic flows with intelligent cars and intelligent roads. It will describe the modeling approach MIXIC and review the results for different ADA systems: Adaptive Cruise Control, a special lane for Intelligent Vehicles, cooperative following and external speed

  1. Cellular automata model for traffic flow with safe driving conditions

    International Nuclear Information System (INIS)

    Lárraga María Elena; Alvarez-Icaza Luis

    2014-01-01

    In this paper, a recently introduced cellular automata (CA) model is used for a statistical analysis of the inner microscopic structure of synchronized traffic flow. The analysis focuses on the formation and dissolution of clusters or platoons of vehicles, as the mechanism that causes the presence of this synchronized traffic state with a high flow. This platoon formation is one of the most interesting phenomena observed in traffic flows and plays an important role both in manual and automated highway systems (AHS). Simulation results, obtained from a single-lane system under periodic boundary conditions indicate that in the density region where the synchronized state is observed, most vehicles travel together in platoons with approximately the same speed and small spatial distances. The examination of velocity variations and individual vehicle gaps shows that the flow corresponding to the synchronized state is stable, safe and highly correlated. Moreover, results indicate that the observed platoon formation in real traffic is reproduced in simulations by the relation between vehicle headway and velocity that is embedded in the dynamics definition of the CA model. (general)

  2. Traffic flow behavior at a single-lane urban roundabout

    Science.gov (United States)

    Lakouari, N.; Oubram, O.; Ez-Zahraouy, H.; Cisneros-Villalobos, L.; Velásquez-Aguilar, J. G.

    In this paper, we propose a stochastic cellular automata model to study the traffic behavior at a single-lane roundabout. Vehicles can enter the interior lane or exit from it via N intersecting lane, the boundary conditions are stochastic. The traffic is controlled by a self-organized scheme. It has turned out that depending on the rules of insertion to the roundabout, five distinct traffic phases can appear, namely, free flow, congestion, maximum current, jammed and gridlock. The transition between the free flow and the gridlock is forbidden. The density profiles are used to study the traffic pattern at the interior lane of the roundabout. In order to quantify the interactions between vehicles in the interior lane of the roundabout, the velocity correlation coefficient (VCC) is also studied. Besides, the spatiotemporal diagrams corresponding to the entry/exit lanes are derived numerically. Furthermore, we have investigated the effect of displaying signal (PIn), as the PIn decreases, the maximum current increases at the expense of the free flow and the jamming phase. Finally, we have investigated the effect of the braking probability P on the interior lane of the roundabout. We have found that the increase of P raises the spontaneous jam formation on the ring. Thus, enlarges the maximum current and the jamming phase while the free flow phase decreases.

  3. Research on traffic flow characteristics at signal intersection

    Science.gov (United States)

    Zeng, Jun-Wei; Yu, Sen-Bin; Qian, Yong-Sheng; Wei, Xu-Ting; Feng, Xiao; Wang, Hui

    2017-09-01

    Based on the cautious driving behavior and the principle of the vehicles at left-side having priority to pass in the intersection, a two-dimensional cellular automata model for planar signalized intersection (NS-STCA) is established. The different turning vehicles are regarded as the research objects and the effect of the left-turn probability, signal cycle, vehicle flow density on traffic flow at the intersection is investigated.

  4. Equivalent noise level response to number of vehicles: a comparison between a high traffic flow and low traffic flow highway in Klang Valley, Malaysia

    OpenAIRE

    Halim, Herni; Abdullah, Ramdzani

    2014-01-01

    HIGHLIGHTS Highway traffic noise is a serious problem in Malaysia Heavy traffic flow highway recorded higher noise level compared to low traffic flow Noise level stabilized at certain number of vehicles on the road i.e above 500 vehicles. Although much research on road traffic noise has found that noise level increase are influenced by driver behavior and source-receiver distance, little attention has been paid to the relationship between noise level and total number of vehicles...

  5. Sonification of network traffic flow for monitoring and situational awareness

    Science.gov (United States)

    2018-01-01

    Maintaining situational awareness of what is happening within a computer network is challenging, not only because the behaviour happens within machines, but also because data traffic speeds and volumes are beyond human ability to process. Visualisation techniques are widely used to present information about network traffic dynamics. Although they provide operators with an overall view and specific information about particular traffic or attacks on the network, they often still fail to represent the events in an understandable way. Also, because they require visual attention they are not well suited to continuous monitoring scenarios in which network administrators must carry out other tasks. Here we present SoNSTAR (Sonification of Networks for SiTuational AwaReness), a real-time sonification system for monitoring computer networks to support network administrators’ situational awareness. SoNSTAR provides an auditory representation of all the TCP/IP traffic within a network based on the different traffic flows between between network hosts. A user study showed that SoNSTAR raises situational awareness levels by enabling operators to understand network behaviour and with the benefit of lower workload demands (as measured by the NASA TLX method) than visual techniques. SoNSTAR identifies network traffic features by inspecting the status flags of TCP/IP packet headers. Combinations of these features define particular traffic events which are mapped to recorded sounds to generate a soundscape that represents the real-time status of the network traffic environment. The sequence, timing, and loudness of the different sounds allow the network to be monitored and anomalous behaviour to be detected without the need to continuously watch a monitor screen. PMID:29672543

  6. Sonification of network traffic flow for monitoring and situational awareness.

    Science.gov (United States)

    Debashi, Mohamed; Vickers, Paul

    2018-01-01

    Maintaining situational awareness of what is happening within a computer network is challenging, not only because the behaviour happens within machines, but also because data traffic speeds and volumes are beyond human ability to process. Visualisation techniques are widely used to present information about network traffic dynamics. Although they provide operators with an overall view and specific information about particular traffic or attacks on the network, they often still fail to represent the events in an understandable way. Also, because they require visual attention they are not well suited to continuous monitoring scenarios in which network administrators must carry out other tasks. Here we present SoNSTAR (Sonification of Networks for SiTuational AwaReness), a real-time sonification system for monitoring computer networks to support network administrators' situational awareness. SoNSTAR provides an auditory representation of all the TCP/IP traffic within a network based on the different traffic flows between between network hosts. A user study showed that SoNSTAR raises situational awareness levels by enabling operators to understand network behaviour and with the benefit of lower workload demands (as measured by the NASA TLX method) than visual techniques. SoNSTAR identifies network traffic features by inspecting the status flags of TCP/IP packet headers. Combinations of these features define particular traffic events which are mapped to recorded sounds to generate a soundscape that represents the real-time status of the network traffic environment. The sequence, timing, and loudness of the different sounds allow the network to be monitored and anomalous behaviour to be detected without the need to continuously watch a monitor screen.

  7. Traffic Management as a Service: The Traffic Flow Pattern Classification Problem

    Directory of Open Access Journals (Sweden)

    Carlos T. Calafate

    2015-01-01

    Full Text Available Intelligent Transportation System (ITS technologies can be implemented to reduce both fuel consumption and the associated emission of greenhouse gases. However, such systems require intelligent and effective route planning solutions to reduce travel time and promote stable traveling speeds. To achieve such goal these systems should account for both estimated and real-time traffic congestion states, but obtaining reliable traffic congestion estimations for all the streets/avenues in a city for the different times of the day, for every day in a year, is a complex task. Modeling such a tremendous amount of data can be time-consuming and, additionally, centralized computation of optimal routes based on such time-dependencies has very high data processing requirements. In this paper we approach this problem through a heuristic to considerably reduce the modeling effort while maintaining the benefits of time-dependent traffic congestion modeling. In particular, we propose grouping streets by taking into account real traces describing the daily traffic pattern. The effectiveness of this heuristic is assessed for the city of Valencia, Spain, and the results obtained show that it is possible to reduce the required number of daily traffic flow patterns by a factor of 4210 while maintaining the essence of time-dependent modeling requirements.

  8. Analysis on the Correlation of Traffic Flow in Hainan Province Based on Baidu Search

    Science.gov (United States)

    Chen, Caixia; Shi, Chun

    2018-03-01

    Internet search data records user’s search attention and consumer demand, providing necessary database for the Hainan traffic flow model. Based on Baidu Index, with Hainan traffic flow as example, this paper conduct both qualitative and quantitative analysis on the relationship between search keyword from Baidu Index and actual Hainan tourist traffic flow, and build multiple regression model by SPSS.

  9. Optimal scheduling for distribution network with redox flow battery storage

    International Nuclear Information System (INIS)

    Hosseina, Majid; Bathaee, Seyed Mohammad Taghi

    2016-01-01

    Highlights: • A novel method for optimal scheduling of storages in radial network is presented. • Peak shaving and load leveling are the main objectives. • Vanadium redox flow battery is considered as the energy storage unit. • Real data is used for simulation. - Abstract: There are many advantages to utilize storages in electric power system. Peak shaving, load leveling, load frequency control, integration of renewable, energy trading and spinning reserve are the most important of them. Batteries, especially redox flow batteries, are one of the appropriate storages for utilization in distribution network. This paper presents a novel, heuristic and practical method for optimal scheduling in distribution network with flow battery storage. This heuristic method is more suitable for scheduling and operation of distribution networks which require installation of storages. Peak shaving and load leveling is considered as the main objective in this paper. Several indices are presented in this paper for determine the place of storages and also scheduling for optimal use of energy in them. Simulations of this paper are based on real information of distribution network substation that located in Semnan, Iran.

  10. An evolutionary outlook of air traffic flow management techniques

    Science.gov (United States)

    Kistan, Trevor; Gardi, Alessandro; Sabatini, Roberto; Ramasamy, Subramanian; Batuwangala, Eranga

    2017-01-01

    In recent years Air Traffic Flow Management (ATFM) has become pertinent even in regions without sustained overload conditions caused by dense traffic operations. Increasing traffic volumes in the face of constrained resources has created peak congestion at specific locations and times in many areas of the world. Increased environmental awareness and economic drivers have combined to create a resurgent interest in ATFM as evidenced by a spate of recent ATFM conferences and workshops mediated by official bodies such as ICAO, IATA, CANSO the FAA and Eurocontrol. Significant ATFM acquisitions in the last 5 years include South Africa, Australia and India. Singapore, Thailand and Korea are all expected to procure ATFM systems within a year while China is expected to develop a bespoke system. Asia-Pacific nations are particularly pro-active given the traffic growth projections for the region (by 2050 half of all air traffic will be to, from or within the Asia-Pacific region). National authorities now have access to recently published international standards to guide the development of national and regional operational concepts for ATFM, geared to Communications, Navigation, Surveillance/Air Traffic Management and Avionics (CNS+A) evolutions. This paper critically reviews the field to determine which ATFM research and development efforts hold the best promise for practical technological implementations, offering clear benefits both in terms of enhanced safety and efficiency in times of growing air traffic. An evolutionary approach is adopted starting from an ontology of current ATFM techniques and proceeding to identify the technological and regulatory evolutions required in the future CNS+A context, as the aviation industry moves forward with a clearer understanding of emerging operational needs, the geo-political realities of regional collaboration and the impending needs of global harmonisation.

  11. Multiple Vehicle Detection and Segmentation in Malaysia Traffic Flow

    Science.gov (United States)

    Fariz Hasan, Ahmad; Fikri Che Husin, Mohd; Affendi Rosli, Khairul; Norhafiz Hashim, Mohd; Faiz Zainal Abidin, Amar

    2018-03-01

    Vision based system are widely used in the field of Intelligent Transportation System (ITS) to extract a large amount of information to analyze traffic scenes. By rapid number of vehicles on the road as well as significant increase on cameras dictated the need for traffic surveillance systems. This system can take over the burden some task was performed by human operator in traffic monitoring centre. The main technique proposed by this paper is concentrated on developing a multiple vehicle detection and segmentation focusing on monitoring through Closed Circuit Television (CCTV) video. The system is able to automatically segment vehicle extracted from heavy traffic scene by optical flow estimation alongside with blob analysis technique in order to detect the moving vehicle. Prior to segmentation, blob analysis technique will compute the area of interest region corresponding to moving vehicle which will be used to create bounding box on that particular vehicle. Experimental validation on the proposed system was performed and the algorithm is demonstrated on various set of traffic scene.

  12. Concept definition of traffic flow wide-area surveillance

    Energy Technology Data Exchange (ETDEWEB)

    Allgood, G.O.; Ferrell, R.K.; Kercel, S.W.

    1994-07-01

    Traffic management can be thought of as a stochastic queuing process where the serving time at one of its control points is dynamically linked to the global traffic pattern, which is, in turn, dynamically linked to the control point. For this closed-loop system to be effective, the traffic management system must sense and interpret large spatial projections of data originating from multiple sensor suites. The intent of the Wide-Area Surveillance (WAS) Project is to build upon this concept and define the operational specifications and characteristics of a Traffic Flow Wide-Area Surveillance (TFWAS) system in terms of traffic management and control. In doing so, the functional capabilities of a TFWAS will be mapped onto an operational profile that is consistent with the Federal Highway Administration`s Intelligent Vehicle Highway System. This document provides the underlying foundation of this work by offering a concept definition for the TFWAS system. It concentrates on answering the question: ``What is the system?`` In doing so, the report develops a hierarchy of specialized definitions.

  13. Modeling self-consistent multi-class dynamic traffic flow

    Science.gov (United States)

    Cho, Hsun-Jung; Lo, Shih-Ching

    2002-09-01

    In this study, we present a systematic self-consistent multiclass multilane traffic model derived from the vehicular Boltzmann equation and the traffic dispersion model. The multilane domain is considered as a two-dimensional space and the interaction among vehicles in the domain is described by a dispersion model. The reason we consider a multilane domain as a two-dimensional space is that the driving behavior of road users may not be restricted by lanes, especially motorcyclists. The dispersion model, which is a nonlinear Poisson equation, is derived from the car-following theory and the equilibrium assumption. Under the concept that all kinds of users share the finite section, the density is distributed on a road by the dispersion model. In addition, the dynamic evolution of the traffic flow is determined by the systematic gas-kinetic model derived from the Boltzmann equation. Multiplying Boltzmann equation by the zeroth, first- and second-order moment functions, integrating both side of the equation and using chain rules, we can derive continuity, motion and variance equation, respectively. However, the second-order moment function, which is the square of the individual velocity, is employed by previous researches does not have physical meaning in traffic flow. Although the second-order expansion results in the velocity variance equation, additional terms may be generated. The velocity variance equation we propose is derived from multiplying Boltzmann equation by the individual velocity variance. It modifies the previous model and presents a new gas-kinetic traffic flow model. By coupling the gas-kinetic model and the dispersion model, a self-consistent system is presented.

  14. A Novel Algorithm of Quantum Random Walk in Server Traffic Control and Task Scheduling

    Directory of Open Access Journals (Sweden)

    Dong Yumin

    2014-01-01

    Full Text Available A quantum random walk optimization model and algorithm in network cluster server traffic control and task scheduling is proposed. In order to solve the problem of server load balancing, we research and discuss the distribution theory of energy field in quantum mechanics and apply it to data clustering. We introduce the method of random walk and illuminate what the quantum random walk is. Here, we mainly research the standard model of one-dimensional quantum random walk. For the data clustering problem of high dimensional space, we can decompose one m-dimensional quantum random walk into m one-dimensional quantum random walk. In the end of the paper, we compare the quantum random walk optimization method with GA (genetic algorithm, ACO (ant colony optimization, and SAA (simulated annealing algorithm. In the same time, we prove its validity and rationality by the experiment of analog and simulation.

  15. Flow shop scheduling algorithm to optimize warehouse activities

    Directory of Open Access Journals (Sweden)

    P. Centobelli

    2016-01-01

    Full Text Available Successful flow-shop scheduling outlines a more rapid and efficient process of order fulfilment in warehouse activities. Indeed the way and the speed of order processing and, in particular, the operations concerning materials handling between the upper stocking area and a lower forward picking one must be optimized. The two activities, drops and pickings, have considerable impact on important performance parameters for Supply Chain wholesaler companies. In this paper, a new flow shop scheduling algorithm is formulated in order to process a greater number of orders by replacing the FIFO logic for the drops activities of a wholesaler company on a daily basis. The System Dynamics modelling and simulation have been used to simulate the actual scenario and the output solutions. Finally, a t-Student test validates the modelled algorithm, granting that it can be used for all wholesalers based on drop and picking activities.

  16. Optimal Results and Numerical Simulations for Flow Shop Scheduling Problems

    Directory of Open Access Journals (Sweden)

    Tao Ren

    2012-01-01

    Full Text Available This paper considers the m-machine flow shop problem with two objectives: makespan with release dates and total quadratic completion time, respectively. For Fm|rj|Cmax, we prove the asymptotic optimality for any dense scheduling when the problem scale is large enough. For Fm‖ΣCj2, improvement strategy with local search is presented to promote the performance of the classical SPT heuristic. At the end of the paper, simulations show the effectiveness of the improvement strategy.

  17. Heuristics for no-wait flow shop scheduling problem

    Directory of Open Access Journals (Sweden)

    Kewal Krishan Nailwal

    2016-09-01

    Full Text Available No-wait flow shop scheduling refers to continuous flow of jobs through different machines. The job once started should have the continuous processing through the machines without wait. This situation occurs when there is a lack of an intermediate storage between the processing of jobs on two consecutive machines. The problem of no-wait with the objective of minimizing makespan in flow shop scheduling is NP-hard; therefore the heuristic algorithms are the key to solve the problem with optimal solution or to approach nearer to optimal solution in simple manner. The paper describes two heuristics, one constructive and an improvement heuristic algorithm obtained by modifying the constructive one for sequencing n-jobs through m-machines in a flow shop under no-wait constraint with the objective of minimizing makespan. The efficiency of the proposed heuristic algorithms is tested on 120 Taillard’s benchmark problems found in the literature against the NEH under no-wait and the MNEH heuristic for no-wait flow shop problem. The improvement heuristic outperforms all heuristics on the Taillard’s instances by improving the results of NEH by 27.85%, MNEH by 22.56% and that of the proposed constructive heuristic algorithm by 24.68%. To explain the computational process of the proposed algorithm, numerical illustrations are also given in the paper. Statistical tests of significance are done in order to draw the conclusions.

  18. A Queuing Model-Based System for Triggering Traffic Flow Management Algorithms, Phase I

    Data.gov (United States)

    National Aeronautics and Space Administration — Next generation air traffic management systems are expected use multiple software tools and quantitative methods for managing traffic flow in the National Airspace....

  19. Human Factors of Automated Driving : Predicting the Effects of Authority Transitions on Traffic Flow Efficiency

    NARCIS (Netherlands)

    Varotto, S.F.; Hoogendoorn, R.G.; Van Arem, B.; Hoogendoorn, S.P.

    2014-01-01

    Automated driving potentially has a significant impact on traffic flow efficiency. Automated vehicles, which possess cooperative capabilities, are expected to reduce congestion levels for instance by increasing road capacity, by anticipating traffic conditions further downstream and also by

  20. Traffic

    International Nuclear Information System (INIS)

    Lichtblau, G.

    2001-01-01

    This chapter deals with passenger and freight traffic, public and private transportation, traffic related environmental impacts, future developments, traffic indicators, regional traffic planning, health costs due to road traffic related air pollution, noise pollution, measures and regulations for traffic control and fuels for traffic. In particular energy consumption, energy efficiency, pollutant emissions ( CO 2 , SO 2 , NO x , HC, CO, N 2 O, NH 3 and particulates) and environmental effects of the different types of traffic and different types of fuels are compared and studied. Legal regulations and measures for an effective traffic control are discussed. (a.n.)

  1. Use of a Phase Transition Concept for Traffic Flow Condition Estimation

    Directory of Open Access Journals (Sweden)

    Larin Oleg N.

    2014-12-01

    Full Text Available The article covers the main models of traffic flow conditions, analyzes the condition estimation criteria, and provides the classification of models. The article provides the grounds for the use of the phase transition concept for traffic flow condition estimation. The models of the aggregate condition of free and congested traffic have been developed, the phase boundaries between free and congested traffic have been defined. Applicability conditions for the models of the aggregate condition of have been analyzed.

  2. Scheduling and control strategies for the departure problem in air traffic control

    Science.gov (United States)

    Bolender, Michael Alan

    Two problems relating to the departure problem in air traffic control automation are examined. The first problem that is addressed is the scheduling of aircraft for departure. The departure operations at a major US hub airport are analyzed, and a discrete event simulation of the departure operations is constructed. Specifically, the case where there is a single departure runway is considered. The runway is fed by two queues of aircraft. Each queue, in turn, is fed by a single taxiway. Two salient areas regarding scheduling are addressed. The first is the construction of optimal departure sequences for the aircraft that are queued. Several greedy search algorithms are designed to minimize the total time to depart a set of queued aircraft. Each algorithm has a different set of heuristic rules to resolve situations within the search space whenever two branches of the search tree with equal edge costs are encountered. These algorithms are then compared and contrasted with a genetic search algorithm in order to assess the performance of the heuristics. This is done in the context of a static departure problem where the length of the departure queue is fixed. A greedy algorithm which deepens the search whenever two branches of the search tree with non-unique costs are encountered is shown to outperform the other heuristic algorithms. This search strategy is then implemented in the discrete event simulation. A baseline performance level is established, and a sensitivity analysis is performed by implementing changes in traffic mix, routing, and miles-in-trail restrictions for comparison. It is concluded that to minimize the average time spent in the queue for different traffic conditions, a queue assignment algorithm is needed to maintain an even balance of aircraft in the queues. A necessary consideration is to base queue assignment upon traffic management restrictions such as miles-in-trail constraints. The second problem addresses the technical challenges associated

  3. Macroscopic Model and Simulation Analysis of Air Traffic Flow in Airport Terminal Area

    Directory of Open Access Journals (Sweden)

    Honghai Zhang

    2014-01-01

    Full Text Available We focus on the spatiotemporal characteristics and their evolvement law of the air traffic flow in airport terminal area to provide scientific basis for optimizing flight control processes and alleviating severe air traffic conditions. Methods in this work combine mathematical derivation and simulation analysis. Based on cell transmission model the macroscopic models of arrival and departure air traffic flow in terminal area are established. Meanwhile, the interrelationship and influential factors of the three characteristic parameters as traffic flux, density, and velocity are presented. Then according to such models, the macro emergence of traffic flow evolution is emulated with the NetLogo simulation platform, and the correlativity of basic traffic flow parameters is deduced and verified by means of sensitivity analysis. The results suggest that there are remarkable relations among the three characteristic parameters of the air traffic flow in terminal area. Moreover, such relationships evolve distinctly with the flight procedures, control separations, and ATC strategies.

  4. An Interference-Aware Traffic-Priority-Based Link Scheduling Algorithm for Interference Mitigation in Multiple Wireless Body Area Networks

    Directory of Open Access Journals (Sweden)

    Thien T. T. Le

    2016-12-01

    Full Text Available Currently, wireless body area networks (WBANs are effectively used for health monitoring services. However, in cases where WBANs are densely deployed, interference among WBANs can cause serious degradation of network performance and reliability. Inter-WBAN interference can be reduced by scheduling the communication links of interfering WBANs. In this paper, we propose an interference-aware traffic-priority-based link scheduling (ITLS algorithm to overcome inter-WBAN interference in densely deployed WBANs. First, we model a network with multiple WBANs as an interference graph where node-level interference and traffic priority are taken into account. Second, we formulate link scheduling for multiple WBANs as an optimization model where the objective is to maximize the throughput of the entire network while ensuring the traffic priority of sensor nodes. Finally, we propose the ITLS algorithm for multiple WBANs on the basis of the optimization model. High spatial reuse is also achieved in the proposed ITLS algorithm. The proposed ITLS achieves high spatial reuse while considering traffic priority, packet length, and the number of interfered sensor nodes. Our simulation results show that the proposed ITLS significantly increases spatial reuse and network throughput with lower delay by mitigating inter-WBAN interference.

  5. Modeling, Identification, Estimation, and Simulation of Urban Traffic Flow in Jakarta and Bandung

    Directory of Open Access Journals (Sweden)

    Herman Y. Sutarto

    2015-06-01

    Full Text Available This paper presents an overview of urban traffic flow from the perspective of system theory and stochastic control. The topics of modeling, identification, estimation and simulation techniques are evaluated and validated using actual traffic flow data from the city of Jakarta and Bandung, Indonesia, and synthetic data generated from traffic micro-simulator VISSIM. The results on particle filter (PF based state estimation and Expectation-Maximization (EM based parameter estimation (identification confirm the proposed model gives satisfactory results that capture the variation of urban traffic flow. The combination of the technique and the simulator platform assembles possibility to develop a real-time traffic light controller.  

  6. Monitoring individual traffic flows within the ATLAS TDAQ network

    CERN Document Server

    Sjoen, R; Ciobotaru, M; Batraneanu, S M; Leahu, L; Martin, B; Al-Shabibi, A

    2010-01-01

    The ATLAS data acquisition system consists of four different networks interconnecting up to 2000 processors using up to 200 edge switches and five multi-blade chassis devices. The architecture of the system has been described in [1] and its operational model in [2]. Classical, SNMP-based, network monitoring provides statistics on aggregate traffic, but for performance monitoring and troubleshooting purposes there was an imperative need to identify and quantify single traffic flows. sFlow [3] is an industry standard based on statistical sampling which attempts to provide a solution to this. Due to the size of the ATLAS network, the collection and analysis of the sFlow data from all devices generates a data handling problem of its own. This paper describes how this problem is addressed by making it possible to collect and store data either centrally or distributed according to need. The methods used to present the results in a relevant fashion for system analysts are discussed and we explore the possibilities a...

  7. Monitoring individual traffic flows within the ATLAS TDAQ network

    International Nuclear Information System (INIS)

    Sjoen, R; Batraneanu, S M; Leahu, L; Martin, B; Al-Shabibi, A; Stancu, S; Ciobotaru, M

    2010-01-01

    The ATLAS data acquisition system consists of four different networks interconnecting up to 2000 processors using up to 200 edge switches and five multi-blade chassis devices. The architecture of the system has been described in [1] and its operational model in [2]. Classical, SNMP-based, network monitoring provides statistics on aggregate traffic, but for performance monitoring and troubleshooting purposes there was an imperative need to identify and quantify single traffic flows. sFlow [3] is an industry standard based on statistical sampling which attempts to provide a solution to this. Due to the size of the ATLAS network, the collection and analysis of the sFlow data from all devices generates a data handling problem of its own. This paper describes how this problem is addressed by making it possible to collect and store data either centrally or distributed according to need. The methods used to present the results in a relevant fashion for system analysts are discussed and we explore the possibilities and limitations of this diagnostic tool, giving an example of its use in solving system problems that arise during the ATLAS data taking.

  8. Control of Networked Traffic Flow Distribution - A Stochastic Distribution System Perspective

    Energy Technology Data Exchange (ETDEWEB)

    Wang, Hong [Pacific Northwest National Laboratory (PNNL); Aziz, H M Abdul [ORNL; Young, Stan [National Renewable Energy Laboratory (NREL); Patil, Sagar [Pacific Northwest National Laboratory (PNNL)

    2017-10-01

    Networked traffic flow is a common scenario for urban transportation, where the distribution of vehicle queues either at controlled intersections or highway segments reflect the smoothness of the traffic flow in the network. At signalized intersections, the traffic queues are controlled by traffic signal control settings and effective traffic lights control would realize both smooth traffic flow and minimize fuel consumption. Funded by the Energy Efficient Mobility Systems (EEMS) program of the Vehicle Technologies Office of the US Department of Energy, we performed a preliminary investigation on the modelling and control framework in context of urban network of signalized intersections. In specific, we developed a recursive input-output traffic queueing models. The queue formation can be modeled as a stochastic process where the number of vehicles entering each intersection is a random number. Further, we proposed a preliminary B-Spline stochastic model for a one-way single-lane corridor traffic system based on theory of stochastic distribution control.. It has been shown that the developed stochastic model would provide the optimal probability density function (PDF) of the traffic queueing length as a dynamic function of the traffic signal setting parameters. Based upon such a stochastic distribution model, we have proposed a preliminary closed loop framework on stochastic distribution control for the traffic queueing system to make the traffic queueing length PDF follow a target PDF that potentially realizes the smooth traffic flow distribution in a concerned corridor.

  9. A Modified Cellular Automaton Approach for Mixed Bicycle Traffic Flow Modeling

    Directory of Open Access Journals (Sweden)

    Xiaonian Shan

    2015-01-01

    Full Text Available Several previous studies have used the Cellular Automaton (CA for the modeling of bicycle traffic flow. However, previous CA models have several limitations, resulting in differences between the simulated and the observed traffic flow features. The primary objective of this study is to propose a modified CA model for simulating the characteristics of mixed bicycle traffic flow. Field data were collected on physically separated bicycle path in Shanghai, China, and were used to calibrate the CA model using the genetic algorithm. Traffic flow features between simulations of several CA models and field observations were compared. The results showed that our modified CA model produced more accurate simulation for the fundamental diagram and the passing events in mixed bicycle traffic flow. Based on our model, the bicycle traffic flow features, including the fundamental diagram, the number of passing events, and the number of lane changes, were analyzed. We also analyzed the traffic flow features with different traffic densities, traffic components on different travel lanes. Results of the study can provide important information for understanding and simulating the operations of mixed bicycle traffic flow.

  10. Incorporation of Duffing Oscillator and Wigner-Ville Distribution in Traffic Flow Prediction

    Directory of Open Access Journals (Sweden)

    Anamarija L. Mrgole

    2017-02-01

    Full Text Available The main purpose of this study was to investigate the use of various chaotic pattern recognition methods for traffic flow prediction. Traffic flow is a variable, dynamic and complex system, which is non-linear and unpredictable. The emergence of traffic flow congestion in road traffic is estimated when the traffic load on a specific section of the road in a specific time period is close to exceeding the capacity of the road infrastructure. Under certain conditions, it can be seen in concentrating chaotic traffic flow patterns. The literature review of traffic flow theory and its connection with chaotic features implies that this kind of method has great theoretical and practical value. Researched methods of identifying chaos in traffic flow have shown certain restrictions in their techniques but have suggested guidelines for improving the identification of chaotic parameters in traffic flow. The proposed new method of forecasting congestion in traffic flow uses Wigner-Ville frequency distribution. This method enables the display of a chaotic attractor without the use of reconstruction phase space.

  11. Energy-Saving Traffic Scheduling in Hybrid Software Defined Wireless Rechargeable Sensor Networks.

    Science.gov (United States)

    Wei, Yunkai; Ma, Xiaohui; Yang, Ning; Chen, Yijin

    2017-09-15

    Software Defined Wireless Rechargeable Sensor Networks (SDWRSNs) are an inexorable trend for Wireless Sensor Networks (WSNs), including Wireless Rechargeable Sensor Network (WRSNs). However, the traditional network devices cannot be completely substituted in the short term. Hybrid SDWRSNs, where software defined devices and traditional devices coexist, will last for a long time. Hybrid SDWRSNs bring new challenges as well as opportunities for energy saving issues, which is still a key problem considering that the wireless chargers are also exhaustible, especially in some rigid environment out of the main supply. Numerous energy saving schemes for WSNs, or even some works for WRSNs, are no longer suitable for the new features of hybrid SDWRSNs. To solve this problem, this paper puts forward an Energy-saving Traffic Scheduling (ETS) algorithm. The ETS algorithm adequately considers the new characters in hybrid SDWRSNs, and takes advantage of the Software Defined Networking (SDN) controller's direct control ability on SDN nodes and indirect control ability on normal nodes. The simulation results show that, comparing with traditional Minimum Transmission Energy (MTE) protocol, ETS can substantially improve the energy efficiency in hybrid SDWRSNs for up to 20-40% while ensuring feasible data delay.

  12. Energy-Saving Traffic Scheduling in Hybrid Software Defined Wireless Rechargeable Sensor Networks

    Directory of Open Access Journals (Sweden)

    Yunkai Wei

    2017-09-01

    Full Text Available Software Defined Wireless Rechargeable Sensor Networks (SDWRSNs are an inexorable trend for Wireless Sensor Networks (WSNs, including Wireless Rechargeable Sensor Network (WRSNs. However, the traditional network devices cannot be completely substituted in the short term. Hybrid SDWRSNs, where software defined devices and traditional devices coexist, will last for a long time. Hybrid SDWRSNs bring new challenges as well as opportunities for energy saving issues, which is still a key problem considering that the wireless chargers are also exhaustible, especially in some rigid environment out of the main supply. Numerous energy saving schemes for WSNs, or even some works for WRSNs, are no longer suitable for the new features of hybrid SDWRSNs. To solve this problem, this paper puts forward an Energy-saving Traffic Scheduling (ETS algorithm. The ETS algorithm adequately considers the new characters in hybrid SDWRSNs, and takes advantage of the Software Defined Networking (SDN controller’s direct control ability on SDN nodes and indirect control ability on normal nodes. The simulation results show that, comparing with traditional Minimum Transmission Energy (MTE protocol, ETS can substantially improve the energy efficiency in hybrid SDWRSNs for up to 20–40% while ensuring feasible data delay.

  13. Traffic Flow Prediction with Rainfall Impact Using a Deep Learning Method

    Directory of Open Access Journals (Sweden)

    Yuhan Jia

    2017-01-01

    Full Text Available Accurate traffic flow prediction is increasingly essential for successful traffic modeling, operation, and management. Traditional data driven traffic flow prediction approaches have largely assumed restrictive (shallow model architectures and do not leverage the large amount of environmental data available. Inspired by deep learning methods with more complex model architectures and effective data mining capabilities, this paper introduces the deep belief network (DBN and long short-term memory (LSTM to predict urban traffic flow considering the impact of rainfall. The rainfall-integrated DBN and LSTM can learn the features of traffic flow under various rainfall scenarios. Experimental results indicate that, with the consideration of additional rainfall factor, the deep learning predictors have better accuracy than existing predictors and also yield improvements over the original deep learning models without rainfall input. Furthermore, the LSTM can outperform the DBN to capture the time series characteristics of traffic flow data.

  14. Dynamic route guidance strategy in a two-route pedestrian-vehicle mixed traffic flow system

    Science.gov (United States)

    Liu, Mianfang; Xiong, Shengwu; Li, Bixiang

    2016-05-01

    With the rapid development of transportation, traffic questions have become the major issue for social, economic and environmental aspects. Especially, during serious emergencies, it is very important to alleviate road traffic congestion and improve the efficiency of evacuation to reduce casualties, and addressing these problems has been a major task for the agencies responsible in recent decades. Advanced road guidance strategies have been developed for homogeneous traffic flows, or to reduce traffic congestion and enhance the road capacity in a symmetric two-route scenario. However, feedback strategies have rarely been considered for pedestrian-vehicle mixed traffic flows with variable velocities and sizes in an asymmetric multi-route traffic system, which is a common phenomenon in many developing countries. In this study, we propose a weighted road occupancy feedback strategy (WROFS) for pedestrian-vehicle mixed traffic flows, which considers the system equilibrium to ease traffic congestion. In order to more realistic simulating the behavior of mixed traffic objects, the paper adopted a refined and dynamic cellular automaton model (RDPV_CA model) as the update mechanism for pedestrian-vehicle mixed traffic flow. Moreover, a bounded rational threshold control was introduced into the feedback strategy to avoid some negative effect of delayed information and reduce. Based on comparisons with the two previously proposed strategies, the simulation results obtained in a pedestrian-vehicle traffic flow scenario demonstrated that the proposed strategy with a bounded rational threshold was more effective and system equilibrium, system stability were reached.

  15. Understanding characteristics in multivariate traffic flow time series from complex network structure

    Science.gov (United States)

    Yan, Ying; Zhang, Shen; Tang, Jinjun; Wang, Xiaofei

    2017-07-01

    Discovering dynamic characteristics in traffic flow is the significant step to design effective traffic managing and controlling strategy for relieving traffic congestion in urban cities. A new method based on complex network theory is proposed to study multivariate traffic flow time series. The data were collected from loop detectors on freeway during a year. In order to construct complex network from original traffic flow, a weighted Froenius norm is adopt to estimate similarity between multivariate time series, and Principal Component Analysis is implemented to determine the weights. We discuss how to select optimal critical threshold for networks at different hour in term of cumulative probability distribution of degree. Furthermore, two statistical properties of networks: normalized network structure entropy and cumulative probability of degree, are utilized to explore hourly variation in traffic flow. The results demonstrate these two statistical quantities express similar pattern to traffic flow parameters with morning and evening peak hours. Accordingly, we detect three traffic states: trough, peak and transitional hours, according to the correlation between two aforementioned properties. The classifying results of states can actually represent hourly fluctuation in traffic flow by analyzing annual average hourly values of traffic volume, occupancy and speed in corresponding hours.

  16. Cellular automata model for traffic flow at intersections in internet of vehicles

    Science.gov (United States)

    Zhao, Han-Tao; Liu, Xin-Ru; Chen, Xiao-Xu; Lu, Jian-Cheng

    2018-03-01

    Considering the effect of the front vehicle's speed, the influence of the brake light and the conflict of the traffic flow, we established a cellular automata model called CE-NS for traffic flow at the intersection in the non-vehicle networking environment. According to the information interaction of Internet of Vehicles (IoV), introducing parameters describing the congestion and the accurate speed of the front vehicle into the CE-NS model, we improved the rules of acceleration, deceleration and conflict, and finally established a cellular automata model for traffic flow at intersections of IoV. The relationship between traffic parameters such as vehicle speed, flow and average travel time is obtained by numerical simulation of two models. Based on this, we compared the traffic situation of the non-vehicle networking environment with conditions of IoV environment, and analyzed the influence of the different degree of IoV on the traffic flow. The results show that the traffic speed is increased, the travel time is reduced, the flux of intersections is increased and the traffic flow is more smoothly under IoV environment. After the vehicle which achieves IoV reaches a certain proportion, the operation effect of the traffic flow begins to improve obviously.

  17. The Entropy Solutions for the Lighthill-Whitham-Richards Traffic Flow Model with a Discontinuous Flow-Density Relationship

    National Research Council Canada - National Science Library

    Lu, Yadong; Wong, S. C; Zhang, Mengping; Shu, Chi-Wang

    2007-01-01

    ...) traffic flow model with a flow-density relationship which is piecewise quadratic, concave, but not continuous at the junction points where two quadratic polynomials meet, and with piecewise linear...

  18. Non-clairvoyant weighted flow time scheduling with rejection penalty

    DEFF Research Database (Denmark)

    Chan, Ho-Leung; Chan, Sze-Hang; Lam, Tak-Wah

    2012-01-01

    is defined as the weighted flow time of the job plus the penalty if it is rejected before completion. Previous work on minimizing the total user cost focused on the clairvoyant single-processor setting [BBC+03,CLL11] and has produced O(1)-competitive online algorithm for jobs with arbitrary weights...... algorithm has to decide job rejection and determine the order and speed of job execution. It is interesting to study the tradeoff between the above-mentioned user cost and energy. This paper gives two O(1)-competitive non-clairvoyant algorithms for minimizing the user cost plus energy on a single processor......This paper initiates the study of online scheduling with rejection penalty in the non-clairvoyant setting, i.e., the size (processing time) of a job is not assumed to be known at its release time. In the rejection penalty model, jobs can be rejected with a penalty, and the user cost of a job...

  19. Hydro-thermal power flow scheduling accounting for head variations

    International Nuclear Information System (INIS)

    El-Hawary, M.E.; Ravindranath, K.M.

    1992-01-01

    In this paper the authors treat the problem of optimal economic operation of hydrothermal electric power systems with variable head hydro plants employing the power flow equations to represent the network. Newton's method is used to solve the problem for a number of test systems. A comparison with solutions with fixed head is presented. In general the optimal schedule requires higher slack bus and thermal power generation and cost in the case of variable head hydro plant than that required by the fixed head hydro plant in all demand periods. Correspondingly, the hydro generation is less in the case of variable head hydro plant compared to fixed head hydro plant. A negligible difference in voltage magnitudes in all the time intervals, but it is observed that slightly higher voltages occur in the case of the fixed head hydro plant. Higher power and energy losses occur in the case of variable head hydro plants compared to the fixed head hydro plants

  20. A Machine Learning Approach to Air Traffic Route Choice Modelling

    OpenAIRE

    Marcos, Rodrigo; García-Cantú, Oliva; Herranz, Ricardo

    2018-01-01

    Air Traffic Flow and Capacity Management (ATFCM) is one of the constituent parts of Air Traffic Management (ATM). The goal of ATFCM is to make airport and airspace capacity meet traffic demand and, when capacity opportunities are exhausted, optimise traffic flows to meet the available capacity. One of the key enablers of ATFCM is the accurate estimation of future traffic demand. The available information (schedules, flight plans, etc.) and its associated level of uncertainty differ across the...

  1. The impact of traffic-flow patterns on air quality in urban street canyons

    International Nuclear Information System (INIS)

    Thaker, Prashant; Gokhale, Sharad

    2016-01-01

    We investigated the effect of different urban traffic-flow patterns on pollutant dispersion in different winds in a real asymmetric street canyon. Free-flow traffic causes more turbulence in the canyon facilitating more dispersion and a reduction in pedestrian level concentration. The comparison of with and without a vehicle-induced-turbulence revealed that when winds were perpendicular, the free-flow traffic reduced the concentration by 73% on the windward side with a minor increase of 17% on the leeward side, whereas for parallel winds, it reduced the concentration by 51% and 29%. The congested-flow traffic increased the concentrations on the leeward side by 47% when winds were perpendicular posing a higher risk to health, whereas reduced it by 17–42% for parallel winds. The urban air quality and public health can, therefore, be improved by improving the traffic-flow patterns in street canyons as vehicle-induced turbulence has been shown to contribute significantly to dispersion. - Highlights: • CFD is used to study impact of traffic-flow patterns on urban air quality. • Facilitating free-flow patterns induce more turbulence in street canyons. • Traffic-generated turbulence alters pollutant levels in urban street canyons. - This study investigates the effect of vehicle-induced-turbulence generated during free-flow traffic pattern in reduction of air pollutant concentrations in urban street canyons.

  2. Big Data-Driven Based Real-Time Traffic Flow State Identification and Prediction

    Directory of Open Access Journals (Sweden)

    Hua-pu Lu

    2015-01-01

    Full Text Available With the rapid development of urban informatization, the era of big data is coming. To satisfy the demand of traffic congestion early warning, this paper studies the method of real-time traffic flow state identification and prediction based on big data-driven theory. Traffic big data holds several characteristics, such as temporal correlation, spatial correlation, historical correlation, and multistate. Traffic flow state quantification, the basis of traffic flow state identification, is achieved by a SAGA-FCM (simulated annealing genetic algorithm based fuzzy c-means based traffic clustering model. Considering simple calculation and predictive accuracy, a bilevel optimization model for regional traffic flow correlation analysis is established to predict traffic flow parameters based on temporal-spatial-historical correlation. A two-stage model for correction coefficients optimization is put forward to simplify the bilevel optimization model. The first stage model is built to calculate the number of temporal-spatial-historical correlation variables. The second stage model is present to calculate basic model formulation of regional traffic flow correlation. A case study based on a real-world road network in Beijing, China, is implemented to test the efficiency and applicability of the proposed modeling and computing methods.

  3. Distributed and Centralized Conflict Management Under Traffic Flow Management Constraints

    Science.gov (United States)

    Feron, Eric; Bilimoria, Karl (Technical Monitor)

    2001-01-01

    The past year's activity has concentrated on the following two activities: (1) Refining and completing our study on the stability of interacting flows of aircraft when they have to resolve conflicts in a decentralized and sequential manner. More specifically, it was felt that some of the modeling assumptions made during previous research (such offset maneuvering models) could be improved to include more realistic models such as heading changes when analyzing interacting flow stability problems. We extended our analysis to achieve this goal. The results of this study have been submitted for presentation at the 2002 American Control Conference; (2) Examining the issues associated with delay propagation across multiple enroute sectors. This study was initiated at NASA in cooperation with Dr. Karl Bilimoria. Considering a set of adjacent sectors, this ongoing study concentrates on the effect of various traffic flow management strategies on the propagation of delays and congestion across sectors. The problem description and findings so far are reported in the attached working paper "Enroute sector buffering capacity."

  4. An intelligent vehicular traffic signal control system with state flow chart design and fpga prototyping

    International Nuclear Information System (INIS)

    Solangi, U.S.; Memon, T.D.; Noonari, A.S.; Ansari, O.A.

    2017-01-01

    The problem of vehicular traffic congestion is a persistent constraint in the socio-economic development of Pakistan. This paper presents design and implementation of an intelligent traffic controller based on FPGA (Field Programmable Gate Array) to provide an efficient traffic management by optimizing functioning of traffic lights which will result in minimizing traffic congestion at intersections. The existent Traffic Signal system in Pakistan is fixed-time based and offers only Open Loop method for Traffic Control. The Intelligent Traffic Controller presented here uses feedback sensors to read the Traffic density present at a four way intersection to provide an efficient alternative for better supervisory Control of Traffic flow. The traffic density based control logic has been developed in a State Flow Chart for improved visualization of State Machine based operation, and implemented as a Subsystem in Simulink and transferred into VHDL (Hardware Description Language) code using HDL Coder for reducing development time and time to market, which are essential to capitalize Embedded Systems Market. The VHDL code is synthesized with Altera QUARTUS, simulated timing waveform is obtained to verify correctness of the algorithm for different Traffic Scenarios. For implementation purpose estimations were obtained for Cyclone-III and Stratix-III. (author)

  5. An Intelligent Vehicular Traffic Signal Control System with State Flow Chart Design and FPGA Prototyping

    Directory of Open Access Journals (Sweden)

    UMAIR SAEEDSOLANGI

    2017-04-01

    Full Text Available The problem of vehicular traffic congestion is a persistent constraint in the socio-economic development of Pakistan. This paper presents design and implementation of an intelligent traffic controller based on FPGA (Field Programmable Gate Array to provide an efficient traffic management by optimizing functioning of traffic lights which will result in minimizing traffic congestion at intersections. The existent Traffic Signal system in Pakistan is fixed-time based and offers only Open Loop method for Traffic Control. The Intelligent Traffic Controller presented here uses feedback sensors to read the Traffic density present at a four way intersection to provide an efficient alternative for better supervisory Control of Traffic flow. The traffic density based control logic has been developed in a State Flow Chart for improved visualization of State Machine based operation, and implemented as a Subsystem in Simulink and transferred into VHDL (Hardware Description Language code using HDL Coder for reducing development time and time to market, which are essential to capitalize Embedded Systems Market. The VHDL code is synthesized with Altera QUARTUS, simulated timing waveform is obtained to verify correctness of the algorithm for different Traffic Scenarios. For implementation purpose estimations were obtained for Cyclone-III and Stratix-III.

  6. Modelling of road traffic for traffic flow optimization of modern regional center as an example of Odessa

    Directory of Open Access Journals (Sweden)

    S.V. Myronenko

    2016-12-01

    Full Text Available At present sharply there is a problem of traffic management especially in big cities. The increase in the number of vehicles, both personal and public, led to congestion of city roads, many hours of traffic jams, difficulty of movement of pedestrians, increase the number of accidents, etc. Aim: The aim of the study is to evaluate the possibility of using simulation models to solve problems of analysis and optimization of traffic flows. To achieve this goal in a simulation environment the data base of the transport network will be developed. Materials and Methods: The problem of analysis and optimization of traffic flow is considered by the example of the city of Odessa (Ukraine, the results and recommendations can be easily adapted for other cities of Ukraine, and for the cities of most countries of the former socialist bloc. Features of transport systems make it impossible to build an adequate analytical model to explore options for the management of the system and its characteristic in different conditions. At the same time simulation modelling as a method to study such objects is a promising for the solution to this problem. As a simulation environment an OmniTRANS package as a universal tool for modeling of discrete, continuous and hybrid systems. Results: With OmniTRANS programs the model of traffic in Odessa was derived and the intensity of the traffic flow. B first approximation the transport network of the central district of the city was considered and built; without calibration and simulation it was developed a database of elements of the transport network and shown how it can be used to solve problems of analysis and optimization of traffic flows. Models constructed from elements of created database, allows you to change the level of detail of the simulated objects and phenomena, thereby obtaining models as macro and micro level.

  7. Wave dynamics in an extended macroscopic traffic flow model with periodic boundaries

    Science.gov (United States)

    Wang, Yu-Qing; Chu, Xing-Jian; Zhou, Chao-Fan; Yan, Bo-Wen; Jia, Bin; Fang, Chen-Hao

    2018-06-01

    Motivated by the previous traffic flow model considering the real-time traffic state, a modified macroscopic traffic flow model is established. The periodic boundary condition is applied to the car-following model. Besides, the traffic state factor R is defined in order to correct the real traffic conditions in a more reasonable way. It is a key step that we introduce the relaxation time as a density-dependent function and provide corresponding evolvement of traffic flow. Three different typical initial densities, namely the high density, the medium one and the low one, are intensively investigated. It can be found that the hysteresis loop exists in the proposed periodic-boundary system. Furthermore, the linear and nonlinear stability analyses are performed in order to test the robustness of the system.

  8. A Wavelet Neural Network Optimal Control Model for Traffic-Flow Prediction in Intelligent Transport Systems

    Science.gov (United States)

    Huang, Darong; Bai, Xing-Rong

    Based on wavelet transform and neural network theory, a traffic-flow prediction model, which was used in optimal control of Intelligent Traffic system, is constructed. First of all, we have extracted the scale coefficient and wavelet coefficient from the online measured raw data of traffic flow via wavelet transform; Secondly, an Artificial Neural Network model of Traffic-flow Prediction was constructed and trained using the coefficient sequences as inputs and raw data as outputs; Simultaneous, we have designed the running principium of the optimal control system of traffic-flow Forecasting model, the network topological structure and the data transmitted model; Finally, a simulated example has shown that the technique is effectively and exactly. The theoretical results indicated that the wavelet neural network prediction model and algorithms have a broad prospect for practical application.

  9. Detecting Anomaly in Traffic Flow from Road Similarity Analysis

    KAUST Repository

    Liu, Xinran

    2016-06-02

    Taxies equipped with GPS devices are considered as 24-hour moving sensors widely distributed in urban road networks. Plenty of accurate and realtime trajectories of taxi are recorded by GPS devices and are commonly studied for understanding traffic dynamics. This paper focuses on anomaly detection in traffic volume, especially the non-recurrent traffic anomaly caused by unexpected or transient incidents, such as traffic accidents, celebrations and disasters. It is important to detect such sharp changes of traffic status for sensing abnormal events and planning their impact on the smooth volume of traffic. Unlike existing anomaly detection approaches that mainly monitor the derivation of current traffic status from history in the past, the proposed method in this paper evaluates the abnormal score of traffic on one road by comparing its current traffic volume with not only its historical data but also its neighbors. We define the neighbors as the roads that are close in sense of both geo-location and traffic patterns, which are extracted by matrix factorization. The evaluation results on trajectories data of 12,286 taxies over four weeks in Beijing show that our approach outperforms other baseline methods with higher precision and recall.

  10. Delay-feedback control strategy for reducing CO2 emission of traffic flow system

    Science.gov (United States)

    Zhang, Li-Dong; Zhu, Wen-Xing

    2015-06-01

    To study the signal control strategy for reducing traffic emission theoretically, we first presented a kind of discrete traffic flow model with relative speed term based on traditional coupled map car-following model. In the model, the relative speed difference between two successive running cars is incorporated into following vehicle's acceleration running equation. Then we analyzed its stability condition with discrete control system stability theory. Third, we designed a delay-feedback controller to suppress traffic jam and decrease traffic emission based on modern controller theory. Last, numerical simulations are made to support our theoretical results, including the comparison of models' stability analysis, the influence of model type and signal control on CO2 emissions. The results show that the temporal behavior of our model is superior to other models, and the traffic signal controller has good effect on traffic jam suppression and traffic CO2 emission, which fully supports the theoretical conclusions.

  11. Continuous traffic flow modeling of driver support systems in multiclass traffic with intervehicle communication and drivers in the loop

    NARCIS (Netherlands)

    Tampere, C.; Hoogendoorn, S.P.; van Arem, Bart

    2009-01-01

    This paper presents a continuous traffic-flow model for the explorative analysis of advanced driver-assistance systems (ADASs). Such systems use technology (sensors and intervehicle communication) to support the task of the driver, who retains full control over the vehicle. Based on a review of

  12. No-Wait Flexible Flow Shop Scheduling with Due Windows

    Directory of Open Access Journals (Sweden)

    Rong-Hwa Huang

    2015-01-01

    Full Text Available To improve capacity and reduce processing time, the flow shop with multiprocessors (FSMP system is commonly used in glass, steel, and semiconductor production. No-wait FSMP is a modern production system that responds to periods when zero work is required in process production. The production process must be continuous and uninterrupted. Setup time must also be considered. Just-in-time (JIT production is very popular in industry, and timely delivery is important to customer satisfaction. Therefore, it is essential to consider the time window constraint, which is also very complex. This study focuses on a no-wait FSMP problem with time window constraint. An improved ant colony optimization (ACO, known as ant colony optimization with flexible update (ACOFU, is developed to solve the problem. The results demonstrate that ACOFU is more effective and robust than ACO when applied to small-scale problems. ACOFU has superior solution capacity and robustness when applied to large-scale problems. Therefore, this study concludes that the proposed algorithm ACOFU performs excellently when applied to the scheduling problem discussed in this study.

  13. Variable speed limit strategies analysis with mesoscopic traffic flow model based on complex networks

    Science.gov (United States)

    Li, Shu-Bin; Cao, Dan-Ni; Dang, Wen-Xiu; Zhang, Lin

    As a new cross-discipline, the complexity science has penetrated into every field of economy and society. With the arrival of big data, the research of the complexity science has reached its summit again. In recent years, it offers a new perspective for traffic control by using complex networks theory. The interaction course of various kinds of information in traffic system forms a huge complex system. A new mesoscopic traffic flow model is improved with variable speed limit (VSL), and the simulation process is designed, which is based on the complex networks theory combined with the proposed model. This paper studies effect of VSL on the dynamic traffic flow, and then analyzes the optimal control strategy of VSL in different network topologies. The conclusion of this research is meaningful to put forward some reasonable transportation plan and develop effective traffic management and control measures to help the department of traffic management.

  14. A cellular automata model of traffic flow with variable probability of randomization

    International Nuclear Information System (INIS)

    Zheng Wei-Fan; Zhang Ji-Ye

    2015-01-01

    Research on the stochastic behavior of traffic flow is important to understand the intrinsic evolution rules of a traffic system. By introducing an interactional potential of vehicles into the randomization step, an improved cellular automata traffic flow model with variable probability of randomization is proposed in this paper. In the proposed model, the driver is affected by the interactional potential of vehicles before him, and his decision-making process is related to the interactional potential. Compared with the traditional cellular automata model, the modeling is more suitable for the driver’s random decision-making process based on the vehicle and traffic situations in front of him in actual traffic. From the improved model, the fundamental diagram (flow–density relationship) is obtained, and the detailed high-density traffic phenomenon is reproduced through numerical simulation. (paper)

  15. Carpooling and Driver Responses to Fuel Price Changes: Evidence from Traffic Flows in Los Angeles

    OpenAIRE

    Antonio M. Bento; Jonathan E. Hughes; Daniel T. Kaffine

    2012-01-01

    Understanding how drivers respond to fuel price changes has important implications for highway congestion, accidents, carbon policy, local air pollution and taxation. We examine the underexplored relationship between fuel prices and carpooling. Using a simple theoretical model we show that traffic flows in mainline lanes decrease when fuel prices increase. However in carpool (HOV) lanes, flow can either increase or decrease. Traffic flows in mainline lanes are shown to be more responsive to p...

  16. Multi-flow scheduling for coordinated direct and relayed users in cellular systems

    DEFF Research Database (Denmark)

    Thai, Chan; Popovski, Petar; Kaneko, Megumi

    2013-01-01

    . Such are the Coordinated Direct/Relay (CDR) schemes, where each basic transmission involves two flows to a direct and a relayed user. Usage of MFT schemes as building blocks of more complex transmission schemes essentially changes the problem of scheduling, since some of the flows to be scheduled are coupled in a signal...

  17. A Fault Detection Mechanism in a Data-flow Scheduled Multithreaded Processor

    NARCIS (Netherlands)

    Fu, J.; Yang, Q.; Poss, R.; Jesshope, C.R.; Zhang, C.

    2014-01-01

    This paper designs and implements the Redundant Multi-Threading (RMT) in a Data-flow scheduled MultiThreaded (DMT) multicore processor, called Data-flow scheduled Redundant Multi-Threading (DRMT). Meanwhile, It presents Asynchronous Output Comparison (AOC) for RMT techniques to avoid fault detection

  18. On non-permutation solutions to some two machine flow shop scheduling problems

    NARCIS (Netherlands)

    V. Strusevich (Vitaly); P.J. Zwaneveld (Peter)

    1994-01-01

    textabstractIn this paper, we study two versions of the two machine flow shop scheduling problem, where schedule length is to be minimized. First, we consider the two machine flow shop with setup, processing, and removal times separated. It is shown that an optimal solution need not be a permutation

  19. Cellular automata model for urban road traffic flow considering pedestrian crossing street

    Science.gov (United States)

    Zhao, Han-Tao; Yang, Shuo; Chen, Xiao-Xu

    2016-11-01

    In order to analyze the effect of pedestrians' crossing street on vehicle flows, we investigated traffic characteristics of vehicles and pedestrians. Based on that, rules of lane changing, acceleration, deceleration, randomization and update are modified. Then we established two urban two-lane cellular automata models of traffic flow, one of which is about sections with non-signalized crosswalk and the other is on uncontrolled sections with pedestrians crossing street at random. MATLAB is used for numerical simulation of the different traffic conditions; meanwhile space-time diagram and relational graphs of traffic flow parameters are generated and then comparatively analyzed. Simulation results indicate that when vehicle density is lower than around 25 vehs/(km lane), pedestrians have modest impact on traffic flow, whereas when vehicle density is higher than about 60 vehs/(km lane), traffic speed and volume will decrease significantly especially on sections with non-signal-controlled crosswalk. The results illustrate that the proposed models reconstruct the traffic flow's characteristic with the situation where there are pedestrians crossing and can provide some practical reference for urban traffic management.

  20. Intelligent transportation systems in improving traffic flow in tourism destinations

    OpenAIRE

    Mrnjavac, Edna; Marsanic, Robert

    2007-01-01

    The rapid growth and development of motorisation combined with relatively small investments made to improving transportation infrastructure in cities, as well as in tourism destinations, has led to serious problems in the unobstructed movement of vehicles in public traffic areas. Traffic congestion on roadways, in ferryboat ports and at state borders during the summer months and year-round lines of cars going to or returning from work are a regular presence in traffic in most urban and touris...

  1. Batch Scheduling for Hybrid Assembly Differentiation Flow Shop to Minimize Total Actual Flow Time

    Science.gov (United States)

    Maulidya, R.; Suprayogi; Wangsaputra, R.; Halim, A. H.

    2018-03-01

    A hybrid assembly differentiation flow shop is a three-stage flow shop consisting of Machining, Assembly and Differentiation Stages and producing different types of products. In the machining stage, parts are processed in batches on different (unrelated) machines. In the assembly stage, each part of the different parts is assembled into an assembly product. Finally, the assembled products will further be processed into different types of final products in the differentiation stage. In this paper, we develop a batch scheduling model for a hybrid assembly differentiation flow shop to minimize the total actual flow time defined as the total times part spent in the shop floor from the arrival times until its due date. We also proposed a heuristic algorithm for solving the problems. The proposed algorithm is tested using a set of hypothetic data. The solution shows that the algorithm can solve the problems effectively.

  2. Modeling a content-aware LTE MAC downlink scheduler with heterogeneous traffic

    DEFF Research Database (Denmark)

    Artuso, Matteo; Christiansen, Henrik Lehrmann

    2013-01-01

    The scheduling policy adopted in the LTE (Long Term Evolution) MAC layer is the most valuable degree of freedom left from the 3GPP (3rd Generation Partnership Project) consortium to the industry and the research community . This paper presents an OPNET model of the downlink scheduling in a one...

  3. A new cellular automata model of traffic flow with negative exponential weighted look-ahead potential

    Science.gov (United States)

    Ma, Xiao; Zheng, Wei-Fan; Jiang, Bao-Shan; Zhang, Ji-Ye

    2016-10-01

    With the development of traffic systems, some issues such as traffic jams become more and more serious. Efficient traffic flow theory is needed to guide the overall controlling, organizing and management of traffic systems. On the basis of the cellular automata model and the traffic flow model with look-ahead potential, a new cellular automata traffic flow model with negative exponential weighted look-ahead potential is presented in this paper. By introducing the negative exponential weighting coefficient into the look-ahead potential and endowing the potential of vehicles closer to the driver with a greater coefficient, the modeling process is more suitable for the driver’s random decision-making process which is based on the traffic environment that the driver is facing. The fundamental diagrams for different weighting parameters are obtained by using numerical simulations which show that the negative exponential weighting coefficient has an obvious effect on high density traffic flux. The complex high density non-linear traffic behavior is also reproduced by numerical simulations. Project supported by the National Natural Science Foundation of China (Grant Nos. 11572264, 11172247, 11402214, and 61373009).

  4. Heterogeneous traffic flow modelling using second-order macroscopic continuum model

    Science.gov (United States)

    Mohan, Ranju; Ramadurai, Gitakrishnan

    2017-01-01

    Modelling heterogeneous traffic flow lacking in lane discipline is one of the emerging research areas in the past few years. The two main challenges in modelling are: capturing the effect of varying size of vehicles, and the lack in lane discipline, both of which together lead to the 'gap filling' behaviour of vehicles. The same section length of the road can be occupied by different types of vehicles at the same time, and the conventional measure of traffic concentration, density (vehicles per lane per unit length), is not a good measure for heterogeneous traffic modelling. First aim of this paper is to have a parsimonious model of heterogeneous traffic that can capture the unique phenomena of gap filling. Second aim is to emphasize the suitability of higher-order models for modelling heterogeneous traffic. Third, the paper aims to suggest area occupancy as concentration measure of heterogeneous traffic lacking in lane discipline. The above mentioned two main challenges of heterogeneous traffic flow are addressed by extending an existing second-order continuum model of traffic flow, using area occupancy for traffic concentration instead of density. The extended model is calibrated and validated with field data from an arterial road in Chennai city, and the results are compared with those from few existing generalized multi-class models.

  5. Effect of Water Flows on Ship Traffic in Narrow Water Channels Based on Cellular Automata

    Directory of Open Access Journals (Sweden)

    Hu Hongtao

    2017-11-01

    Full Text Available In narrow water channels, ship traffic may be affected by water flows and ship interactions. Studying their effects can help maritime authorities to establish appropriate management strategies. In this study, a two-lane cellular automation model is proposed. Further, the behavior of ship traffic is analyzed by setting different water flow velocities and considering ship interactions. Numerical experiment results show that the ship traffic density-flux relation is significantly different from the results obtained by classical models. Furthermore, due to ship interactions, the ship lane-change rate is influenced by the water flow to a certain degree.

  6. Finite size scaling analysis on Nagel-Schreckenberg model for traffic flow

    Science.gov (United States)

    Balouchi, Ashkan; Browne, Dana

    2015-03-01

    The traffic flow problem as a many-particle non-equilibrium system has caught the interest of physicists for decades. Understanding the traffic flow properties and though obtaining the ability to control the transition from the free-flow phase to the jammed phase plays a critical role in the future world of urging self-driven cars technology. We have studied phase transitions in one-lane traffic flow through the mean velocity, distributions of car spacing, dynamic susceptibility and jam persistence -as candidates for an order parameter- using the Nagel-Schreckenberg model to simulate traffic flow. The length dependent transition has been observed for a range of maximum velocities greater than a certain value. Finite size scaling analysis indicates power-law scaling of these quantities at the onset of the jammed phase.

  7. Improved Optical Flow Algorithm for a Intelligent Traffic Tracking System

    Directory of Open Access Journals (Sweden)

    Xia Yupeng

    2013-05-01

    Full Text Available It is known that to get the contours and segmentations of moving cars is the essential step of image processing in intelligent traffic tracking systems. As an effective way, the optical flow algorithm is widely used for this kind of applications. But in traditional gradient-based approaches, in order to make the data responding to the edges of moving objects expand to the area, which gray level is flat, it needs to keep the iteration times large enough. It takes a large amount of calculation time, and the accuracy of the result is not as good as expected. In order to improve the numerical reliability of image gradient data, Hessian matrix distinguishing, Gaussian filtering standard deviation amending, mean model amending and multi-image comparing, the four algorithms were investigated by applying them to track moving objects. From the experimental results, it is shown that both the calculation convergence speed and accuracy of our methods have greatly improved comparing with traditional algorithms, the feasibility and validity of those methods were confirmed.

  8. Predicting Free Flow Speed and Crash Risk of Bicycle Traffic Flow Using Artificial Neural Network Models

    Directory of Open Access Journals (Sweden)

    Cheng Xu

    2015-01-01

    Full Text Available Free flow speed is a fundamental measure of traffic performance and has been found to affect the severity of crash risk. However, the previous studies lack analysis and modelling of impact factors on bicycles’ free flow speed. The main focus of this study is to develop multilayer back propagation artificial neural network (BPANN models for the prediction of free flow speed and crash risk on the separated bicycle path. Four different models with considering different combinations of input variables (e.g., path width, traffic condition, bicycle type, and cyclists’ characteristics were developed. 459 field data samples were collected from eleven bicycle paths in Hangzhou, China, and 70% of total samples were used for training, 15% for validation, and 15% for testing. The results show that considering the input variables of bicycle types and characteristics of cyclists will effectively improve the accuracy of the prediction models. Meanwhile, the parameters of bicycle types have more significant effect on predicting free flow speed of bicycle compared to those of cyclists’ characteristics. The findings could contribute for evaluation, planning, and management of bicycle safety.

  9. Traffic flow impacts of adaptive cruise control deactivation and (Re)activation with cooperative driver behavior

    NARCIS (Netherlands)

    Klunder, G.; Li, M.; Minderhoud, M.

    2009-01-01

    In 2006 in the Netherlands, a field operational test was carried out to study the effect of adaptive cruise control (ACC) and lane departure warning on driver behavior and traffic flow in real traffic. To estimate the effect for larger penetration rates, simulations were needed. For a reliable

  10. Optimizing traffic flow efficiency by controlling lane changes: collective, group and user optima

    NARCIS (Netherlands)

    Yao, S.; Knoop, V.L.; van Arem, B.

    2017-01-01

    Lane changes can lead to disturbances in traffic flow, whilst the uneven distribution of traffic over different lanes as a result of lane changes can also lead to instabilities and congestion on one specific lane. Therefore, giving advice on lane change can be beneficial for both individual drivers

  11. Traffic Flow at Sags : Theory, Modeling and Control

    NARCIS (Netherlands)

    Goni-Ros, B.

    2016-01-01

    Sag vertical curves (sags) are roadway sections along which the gradient increases gradually in the direction of traffic. Empirical observations show that, on freeways, traffic congestion often occurs at sags; actually, in some countries (e.g., Japan), sags are one of the most common types of

  12. Topology-based hierarchical scheduling using deficit round robin

    DEFF Research Database (Denmark)

    Yu, Hao; Yan, Ying; Berger, Michael Stubert

    2009-01-01

    according to the topology. The mapping process could be completed through the network management plane or by manual configuration. Based on the knowledge of the network, the scheduler can manage the traffic on behalf of other less advanced nodes, avoid potential traffic congestion, and provide flow...... protection and isolation. Comparisons between hierarchical scheduling, flow-based scheduling, and class-based scheduling schemes have been carried out under a symmetric tree topology. Results have shown that the hierarchical scheduling scheme provides better flow protection and isolation from attack...

  13. A New Macro Model for Traffic Flow on a Highway with Ramps and Numerical Tests

    International Nuclear Information System (INIS)

    Tang Tieqiao; Huang Haijun; Zhang Ying; Wong, S.C.; Gao Ziyou

    2009-01-01

    In this paper, we present a new macro model for traffic flow on a highway with ramps based on the existing models. We use the new model to study the effects of on-off-ramp on the main road traffic during the morning rush period and the evening rush period. Numerical tests show that, during the two rush periods, these effects are often different and related to the status of the main road traffic. If the main road traffic flow is uniform, then ramps always produce stop-and-go traffic when the main road density is between two critical values, and ramps have little effect on the main road traffic when the main road density is less than the smaller critical value or greater than the larger critical value. If a small perturbation appears on the main road, ramp may lead to stop-and-go traffic, or relieve or even eliminate the stop-and-go traffic, under different circumstances. These results are consistent with real traffic, which shows that the new model is reasonable.

  14. Investigation of the Link Between Macroscopic Traffic Flow Characteristics and Individual Vehicle Fuel Consumption

    Science.gov (United States)

    2017-10-01

    This project investigated the factors impacting individual vehicle energy consumption, including vehicle characteristics, ambient temperature, season, speed, driving behavior, and traffic flow. A fleet of 18 vehicles with a variety of ownership, size...

  15. Evaluation of dynamic message signs and their potential impact on traffic flow : [research summary].

    Science.gov (United States)

    2013-04-01

    The objective of this research was to understand the potential impact of DMS messages on traffic : flow and evaluate their accuracy, timeliness, relevance and usefulness. Additionally, Bluetooth : sensors were used to track and analyze the diversion ...

  16. Characterization of General TCP Traffic under a Large Number of Flows Regime

    National Research Council Canada - National Science Library

    Tinnakornsrisuphap, Peerapol; La, Richard J; Makowski, Armand M

    2002-01-01

    .... Accurate traffic modeling of a large number of short-lived TCP flows is extremely difficult due to the interaction between session, transport, and network layers, and the explosion of the size...

  17. An Improved Macro Model of Traffic Flow with the Consideration of Ramps and Numerical Tests

    Directory of Open Access Journals (Sweden)

    Zhongke Shi

    2015-01-01

    Full Text Available We present an improved macro model for traffic flow based on the existing models. The equilibrium point equation of the model is obtained. The stop-and-go traffic phenomenon is described in phase plane and the relationship between traffic jams and system instability is clearly shown in the phase plane diagrams. Using the improved model, some traffic phenomena on a highway with ramps are found in this paper. The numerical simulation is carried out to investigate various nonlinear traffic phenomena with a single ramp generated by different initial densities and vehicle generation rates. According to the actual road sections of Xi’an-Baoji highways, the situations of morning peak with several ramps are also analyzed. All these results are consistent with real traffic, which shows that the improved model is reasonable.

  18. MOE-Analysis for Oversaturated Flow with Interrupted Facility and Heterogeneous Traffic for Urban Roads

    Directory of Open Access Journals (Sweden)

    Hemant Kumar Sharma

    2012-09-01

    Full Text Available Speed-flow functions have been developed by several transportation experts to predict accurately the speed of urban road networks. HCM Speed-Flow Curve, BPR Curve, MTC Speed-Flow Curve, Akçelik Speed-Flow Curve are some extraordinary efforts to define the shape of speed-flow curves. However, the complexity of driver's behaviour, interactions among different type of vehicles, lateral clearance, co-relation of driver's psychology with vehicular characteristics and interdependence of various variables of traffic has led to continuous development and refinement of speed-flow curves. The problem gets more difficult in the case of urban roads with heterogeneous traffic, oversaturated flow and signalized network (which includes some unsignalized intersections as well. This paper presents analysis for various measures of effectiveness (MOE for urban roads with interrupted flow comprising heterogeneous traffic. Model has been developed for heterogeneous traffic under constraints of roadway geometry, vehicle characteristics, driving behaviour and traffic controls. The model developed in this paper predicts speed, delay, average queue and maximum queue estimates for urban roads and quantifies congestion for oversaturated conditions. The investigation details the oversaturated portion of flow in particular.

  19. Nonlinear analysis of an extended traffic flow model in ITS environment

    Energy Technology Data Exchange (ETDEWEB)

    Yu Lei [College of Automation, Northwestern Polytechnical University, Xi' an, Shaanxi 710072 (China)], E-mail: yuleijk@126.com; Shi Zhongke [College of Automation, Northwestern Polytechnical University, Xi' an, Shaanxi 710072 (China)

    2008-05-15

    An extended traffic flow model is proposed by introducing the relative velocity of arbitrary number of cars that precede and that follow into the Newell-Whitham-type car-following model. The stability condition of this model is obtained by using the linear stability theory. The results show that the stability of traffic flow is improved by taking into account the relative velocity of cars ahead and backward. By applying the nonlinear analysis the modified Korteweg-de Vries (mKdV) equation is derived to describe the traffic behavior near the critical point. The kink-antikink soliton, the solution of the mKdV equation, is obtained to describe the traffic jams. From the numerical simulation, it is shown that the traffic jams are suppressed efficiently by taking into account the relative velocity of cars ahead and backward. The analytical results are consistent with the simulation one.

  20. Nonlinear analysis of an extended traffic flow model in ITS environment

    International Nuclear Information System (INIS)

    Yu Lei; Shi Zhongke

    2008-01-01

    An extended traffic flow model is proposed by introducing the relative velocity of arbitrary number of cars that precede and that follow into the Newell-Whitham-type car-following model. The stability condition of this model is obtained by using the linear stability theory. The results show that the stability of traffic flow is improved by taking into account the relative velocity of cars ahead and backward. By applying the nonlinear analysis the modified Korteweg-de Vries (mKdV) equation is derived to describe the traffic behavior near the critical point. The kink-antikink soliton, the solution of the mKdV equation, is obtained to describe the traffic jams. From the numerical simulation, it is shown that the traffic jams are suppressed efficiently by taking into account the relative velocity of cars ahead and backward. The analytical results are consistent with the simulation one

  1. An Architecture to Manage Incoming Traffic of Inter-Domain Routing Using OpenFlow Networks

    Directory of Open Access Journals (Sweden)

    Walber José Adriano Silva

    2018-04-01

    Full Text Available The Border Gateway Protocol (BGP is the current state-of-the-art inter-domain routing between Autonomous Systems (ASes. Although BGP has different mechanisms to manage outbound traffic in an AS domain, it lacks an efficient tool for inbound traffic control from transit ASes such as Internet Service Providers (ISPs. For inter-domain routing, the BGP’s destination-based forwarding paradigm limits the granularity of distributing the network traffic among the multiple paths of the current Internet topology. Thus, this work offered a new architecture to manage incoming traffic in the inter-domain using OpenFlow networks. The architecture explored direct inter-domain communication to exchange control information and the functionalities of the OpenFlow protocol. Based on the achieved results of the size of exchanging messages, the proposed architecture is not only scalable, but also capable of performing load balancing for inbound traffic using different strategies.

  2. A network centrality measure framework for analyzing urban traffic flow: A case study of Wuhan, China

    Science.gov (United States)

    Zhao, Shuangming; Zhao, Pengxiang; Cui, Yunfan

    2017-07-01

    In this paper, we propose an improved network centrality measure framework that takes into account both the topological characteristics and the geometric properties of a road network in order to analyze urban traffic flow in relation to different modes: intersection, road, and community, which correspond to point mode, line mode, and area mode respectively. Degree, betweenness, and PageRank centralities are selected as the analysis measures, and GPS-enabled taxi trajectory data is used to evaluate urban traffic flow. The results show that the mean value of the correlation coefficients between the modified degree, the betweenness, and the PageRank centralities and the traffic flow in all periods are higher than the mean value of the correlation coefficients between the conventional degree, the betweenness, the PageRank centralities and the traffic flow at different modes; this indicates that the modified measurements, for analyzing traffic flow, are superior to conventional centrality measurements. This study helps to shed light into the understanding of urban traffic flow in relation to different modes from the perspective of complex networks.

  3. Detecting Anomaly in Traffic Flow from Road Similarity Analysis

    KAUST Repository

    Liu, Xinran; Liu, Xingwu; Wang, Yuanhong; Pu, Juhua; Zhang, Xiangliang

    2016-01-01

    Taxies equipped with GPS devices are considered as 24-hour moving sensors widely distributed in urban road networks. Plenty of accurate and realtime trajectories of taxi are recorded by GPS devices and are commonly studied for understanding traffic

  4. Jam Formation of Traffic Flow in Harbor Tunnel

    International Nuclear Information System (INIS)

    He Hongdi; Lu Weizhen; Dong Liyun

    2011-01-01

    This paper reports a study concerning occurrence and growth of traffic jam in a harbor tunnel. The single-lane with three sections (downgrade, flat, and upgrade) is taken into account and they are characterized with different velocity limit. At the low density, the traffic current increases linearly with density and saturates at some values of immediately density. As the density increases, the traffic jam appears firstly before the upgrade section and then extends to the downgrade section. Additionally, the relationships of the velocity and headway against position in different densities are obtained from simulation. These results clearly clarify where and when the traffic jam appears. Finally, the critical densities are derived via the theoretical analysis before and after the discontinuous fronts and the theoretical results are consistent with the critical values of simulation results. (interdisciplinary physics and related areas of science and technology)

  5. FLOW PATTERNS OF VEHICULAR TRAFFIC ALONG HIGHWAY TOLL PLAZA IN OGUN STATE

    Directory of Open Access Journals (Sweden)

    Bashiru A. Raji

    2009-06-01

    Full Text Available Congestion on our highways, freeways and arterials are increasing at an alarming rate. This occurs because there is an increase in vehicular growth without a corresponding increase in road size, and this has made free flow of traffic a preponderant problem in our highways. Toll plaza causes delay on our highways and results are formation of queue. This paper examined how simple queuing model can be used to determine traffic intensity and the flow pattern of car traffic at a toll plaza. The study was carried out with twelve field assistants at Ogere toll plaza in Ogun State. Findings show a significant variation in the degree of hourly traffic intensities at the four pay points for cars at the toll plaza. However, variation in the daily traffic intensities at the four pay points for cars showed no significant variation. The study also revealed that bumps constructed to check vehicles speed, hawker’s trading activities are among other factors that constitute hindrance to free flow of traffic other than service time and inter-arrival time of cars at the toll plaza. It is therefore recommended that appropriate authority should look into these factors and take necessary steps towards ensuring free flow of traffic at the plaza.

  6. A novel particle swarm optimization algorithm for permutation flow-shop scheduling to minimize makespan

    International Nuclear Information System (INIS)

    Lian Zhigang; Gu Xingsheng; Jiao Bin

    2008-01-01

    It is well known that the flow-shop scheduling problem (FSSP) is a branch of production scheduling and is NP-hard. Now, many different approaches have been applied for permutation flow-shop scheduling to minimize makespan, but current algorithms even for moderate size problems cannot be solved to guarantee optimality. Some literatures searching PSO for continuous optimization problems are reported, but papers searching PSO for discrete scheduling problems are few. In this paper, according to the discrete characteristic of FSSP, a novel particle swarm optimization (NPSO) algorithm is presented and successfully applied to permutation flow-shop scheduling to minimize makespan. Computation experiments of seven representative instances (Taillard) based on practical data were made, and comparing the NPSO with standard GA, we obtain that the NPSO is clearly more efficacious than standard GA for FSSP to minimize makespan

  7. Ergodicity of Traffic Flow with Constant Penetration Rate for Traffic Monitoring via Floating Vehicle Technique

    Science.gov (United States)

    Gunawan, Fergyanto E.; Abbas, Bahtiar S.; Atmadja, Wiedjaja; Yoseph Chandra, Fajar; Agung, Alexander AS; Kusnandar, Erwin

    2014-03-01

    Traffic congestion in Asian megacities has become extremely worse, and any means to lessen the congestion level is urgently needed. Building an efficient mass transportation system is clearly necessary. However, implementing Intelligent Transportation Systems (ITS) have also been demonstrated effective in various advanced countries. Recently, the floating vehicle technique (FVT), an ITS implementation, has become cost effective to provide real-time traffic information with proliferation of the smartphones. Although many publications have discussed various issues related to the technique, none of them elaborates the discrepancy of a single floating car data (FCD) and the associated fleet data. This work addresses the issue based on an analysis of Sugiyama et al's experimental data. The results indicate that there is an optimum averaging time interval such that the estimated velocity by the FVT reasonably representing the traffic velocity.

  8. Traffic Flow Condition Classification for Short Sections Using Single Microwave Sensor

    Directory of Open Access Journals (Sweden)

    Memiş Kemal

    2010-01-01

    Full Text Available Daily observed traffic flow can show different characteristics varying with the times of the day. They are caused by traffic incidents such as accidents, disabled cars, construction activities and other unusual events. Three different major traffic conditions can be occurred: "Flow," "Dense" and "Congested". Objective of this research is to identify the current traffic condition by examining the traffic measurement parameters. The earlier researches have dealt only with speed and volume by ignoring occupancy. In our study, the occupancy is another important parameter of classification. The previous works have used multiple sensors to classify traffic condition whereas our work uses only single microwave sensor. We have extended Multiple Linear Regression classification with our new approach of Estimating with Error Prediction. We present novel algorithms of Multiclassification with One-Against-All Method and Multiclassification with Binary Comparison for multiple SVM architecture. Finaly, a non-linear model of backpropagation neural network is introduced for classification. This combination has not been reported on previous studies. Training data are obtained from the Corsim based microscopic traffic simulator TSIS 5.1. All performances are compared using this data set. Our methods are currently installed and running at traffic management center of 2.Ring Road in Istanbul.

  9. Simple cellular automaton model for traffic breakdown, highway capacity, and synchronized flow

    Science.gov (United States)

    Kerner, Boris S.; Klenov, Sergey L.; Schreckenberg, Michael

    2011-10-01

    We present a simple cellular automaton (CA) model for two-lane roads explaining the physics of traffic breakdown, highway capacity, and synchronized flow. The model consists of the rules “acceleration,” “deceleration,” “randomization,” and “motion” of the Nagel-Schreckenberg CA model as well as “overacceleration through lane changing to the faster lane,” “comparison of vehicle gap with the synchronization gap,” and “speed adaptation within the synchronization gap” of Kerner's three-phase traffic theory. We show that these few rules of the CA model can appropriately simulate fundamental empirical features of traffic breakdown and highway capacity found in traffic data measured over years in different countries, like characteristics of synchronized flow, the existence of the spontaneous and induced breakdowns at the same bottleneck, and associated probabilistic features of traffic breakdown and highway capacity. Single-vehicle data derived in model simulations show that synchronized flow first occurs and then self-maintains due to a spatiotemporal competition between speed adaptation to a slower speed of the preceding vehicle and passing of this slower vehicle. We find that the application of simple dependences of randomization probability and synchronization gap on driving situation allows us to explain the physics of moving synchronized flow patterns and the pinch effect in synchronized flow as observed in real traffic data.

  10. Improved Channel Allocation and RLC block scheduling for Downlink traffic in GPRS

    DEFF Research Database (Denmark)

    Wang, Haibo; Devendra, Devendra; Zhou, Xin

    This paper investigates the Radio Resource Management (RRM) approaches for GSM/GPRS networks. The effort was put on Access Control(AC), Time-Slot (TS) allocation, and Radio Link Control (RLC) packet scheduling for down-link performance enhancement. A new credit-based algorithm was proposed...

  11. Vehicular traffic flow at an intersection with the possibility of turning

    International Nuclear Information System (INIS)

    Foulaadvand, M Ebrahim; Belbasi, Somayyeh

    2011-01-01

    We have developed a Nagel-Schreckenberg cellular automata model for describing a vehicular traffic flow at a single intersection. A set of traffic lights operating in a fixed-time scheme controls the traffic flow. An open boundary condition is applied to the streets each of which conducts a unidirectional flow. Streets are single lane and cars can turn upon reaching to the intersection with prescribed probabilities. Extensive Monte Carlo simulations are carried out to find the model flow characteristics. In particular, we investigate the flow dependence on signalization parameters, turning probabilities and input rates. It is shown that for each set of parameters, there exists a plateau region inside which the total outflow from the intersection remains almost constant. We also compute total waiting time of vehicles per cycle behind red lights for various control parameters.

  12. A bi-criteria M-machine SDST flow shop scheduling using modified ...

    African Journals Online (AJOL)

    user

    In the present work, a modified heuristic based genetic algorithm ..... Due to the large search space in flow shop scheduling, it is expected that random generation ..... ergonomics, anthropometry, inventory management and quality control etc.

  13. Modeling of speed distribution for mixed bicycle traffic flow

    Directory of Open Access Journals (Sweden)

    Cheng Xu

    2015-11-01

    Full Text Available Speed is a fundamental measure of traffic performance for highway systems. There were lots of results for the speed characteristics of motorized vehicles. In this article, we studied the speed distribution for mixed bicycle traffic which was ignored in the past. Field speed data were collected from Hangzhou, China, under different survey sites, traffic conditions, and percentages of electric bicycle. The statistics results of field data show that the total mean speed of electric bicycles is 17.09 km/h, 3.63 km/h faster and 27.0% higher than that of regular bicycles. Normal, log-normal, gamma, and Weibull distribution models were used for testing speed data. The results of goodness-of-fit hypothesis tests imply that the log-normal and Weibull model can fit the field data very well. Then, the relationships between mean speed and electric bicycle proportions were proposed using linear regression models, and the mean speed for purely electric bicycles or regular bicycles can be obtained. The findings of this article will provide effective help for the safety and traffic management of mixed bicycle traffic.

  14. Heterogeneous Cellular Networks with Spatio-Temporal Traffic: Delay Analysis and Scheduling

    OpenAIRE

    Zhong, Yi; Quek, Tony Q. S.; Ge, Xiaohu

    2016-01-01

    Emergence of new types of services has led to various traffic and diverse delay requirements in fifth generation (5G) wireless networks. Meeting diverse delay requirements is one of the most critical goals for the design of 5G wireless networks. Though the delay of point-to-point communications has been well investigated, the delay of multi-point to multi-point communications has not been thoroughly studied since it is a complicated function of all links in the network. In this work, we propo...

  15. The Preventive Signaling Maintenance Crew Scheduling Problem for European Railway Traffic Management system (ERTMS)

    DEFF Research Database (Denmark)

    M. Pour, Shahrzad; Stidsen, Thomas Jacob Riis; Rasmussen, Kourosh Marjani

    , the western part of Denmark. This case is particularly interesting, since the entire railway signalling system is currently being upgraded to the new European Railway Traffic Management System (ERTMS) standard. The new signals need continuous maintenance and in this article we plan the distribution of crew......A railway system is a large and complex infrastructure, which requires continuous maintenance in order to function correctly. Proper maintenance is critical but can also be costly. In this paper we consider the practical case of planning the preventive maintenance of railway signals in Jutland...

  16. Research on three-phase traffic flow modeling based on interaction range

    Science.gov (United States)

    Zeng, Jun-Wei; Yang, Xu-Gang; Qian, Yong-Sheng; Wei, Xu-Ting

    2017-12-01

    On the basis of the multiple velocity difference effect (MVDE) model and under short-range interaction, a new three-phase traffic flow model (S-MVDE) is proposed through careful consideration of the influence of the relationship between the speeds of the two adjacent cars on the running state of the rear car. The random slowing rule in the MVDE model is modified in order to emphasize the influence of vehicle interaction between two vehicles on the probability of vehicles’ deceleration. A single-lane model which without bottleneck structure under periodic boundary conditions is simulated, and it is proved that the traffic flow simulated by S-MVDE model will generate the synchronous flow of three-phase traffic theory. Under the open boundary, the model is expanded by adding an on-ramp, the congestion pattern caused by the bottleneck is simulated at different main road flow rates and on-ramp flow rates, which is compared with the traffic congestion pattern observed by Kerner et al. and it is found that the results are consistent with the congestion characteristics in the three-phase traffic flow theory.

  17. A review of scheduling problem and resolution methods in flexible flow shop

    Directory of Open Access Journals (Sweden)

    Tian-Soon Lee

    2019-01-01

    Full Text Available The Flexible flow shop (FFS is defined as a multi-stage flow shops with multiple parallel machines. FFS scheduling problem is a complex combinatorial problem which has been intensively studied in many real world industries. This review paper gives a comprehensive exploration review on the FFS scheduling problem and guides the reader by considering and understanding different environmental assumptions, system constraints and objective functions for future research works. The published papers are classified into two categories. First is the FFS system characteristics and constraints including the problem differences and limitation defined by different studies. Second, the scheduling performances evaluation are elaborated and categorized into time, job and multi related objectives. In addition, the resolution approaches that have been used to solve FFS scheduling problems are discussed. This paper gives a comprehensive guide for the reader with respect to future research work on the FFS scheduling problem.

  18. Discrete bat algorithm for optimal problem of permutation flow shop scheduling.

    Science.gov (United States)

    Luo, Qifang; Zhou, Yongquan; Xie, Jian; Ma, Mingzhi; Li, Liangliang

    2014-01-01

    A discrete bat algorithm (DBA) is proposed for optimal permutation flow shop scheduling problem (PFSP). Firstly, the discrete bat algorithm is constructed based on the idea of basic bat algorithm, which divide whole scheduling problem into many subscheduling problems and then NEH heuristic be introduced to solve subscheduling problem. Secondly, some subsequences are operated with certain probability in the pulse emission and loudness phases. An intensive virtual population neighborhood search is integrated into the discrete bat algorithm to further improve the performance. Finally, the experimental results show the suitability and efficiency of the present discrete bat algorithm for optimal permutation flow shop scheduling problem.

  19. Discrete Bat Algorithm for Optimal Problem of Permutation Flow Shop Scheduling

    Science.gov (United States)

    Luo, Qifang; Zhou, Yongquan; Xie, Jian; Ma, Mingzhi; Li, Liangliang

    2014-01-01

    A discrete bat algorithm (DBA) is proposed for optimal permutation flow shop scheduling problem (PFSP). Firstly, the discrete bat algorithm is constructed based on the idea of basic bat algorithm, which divide whole scheduling problem into many subscheduling problems and then NEH heuristic be introduced to solve subscheduling problem. Secondly, some subsequences are operated with certain probability in the pulse emission and loudness phases. An intensive virtual population neighborhood search is integrated into the discrete bat algorithm to further improve the performance. Finally, the experimental results show the suitability and efficiency of the present discrete bat algorithm for optimal permutation flow shop scheduling problem. PMID:25243220

  20. Macroscopic discontinuity modeling for multiclass multilane traffic flow operations

    NARCIS (Netherlands)

    Ngoduy, D.

    2006-01-01

    Congestion in traffic networks causes severe problems in and around large cities. It is the source of important economic inefficiencies, both on the level of individual persons and of the society as a whole. However, societal and environmental constraints prohibit large-scale extensions of the

  1. A Study on the Model of Traffic Flow and Vehicle Exhaust Emission

    Directory of Open Access Journals (Sweden)

    Han Xue

    2013-01-01

    Full Text Available The increase of traffic flow in cities causes traffic congestion and accidents as well as air pollution. Traffic problems have attracted the interest of many researchers from the perspective of theory and engineering. In order to provide a simple and practical method for measuring the exhaust emission and assessing the effect of pollution control, a model is based on the relationship between traffic flow and vehicle exhaust emission under a certain level of road capacity constraints. In the proposed model, the hydrocarbons (HC, carbon monoxide (CO, and nitrogen oxides (NOx are considered as the indexes of total exhaust emission, and the speed is used as an intermediate variable. To verify the rationality and practicality of the model, a case study for Beijing, China, is provided in which the effects of taxi fare regulation and the specific vehicle emission reduction policy are analyzed.

  2. Analysis of energy consumption and emission of the heterogeneous traffic flow consisting of traditional vehicles and electric vehicles

    Science.gov (United States)

    Xiao, Hong; Huang, Hai-Jun; Tang, Tie-Qiao

    2017-12-01

    Electric vehicle (EV) has become a potential traffic tool, which has attracted researchers to explore various traffic phenomena caused by EV (e.g. congestion, electricity consumption, etc.). In this paper, we study the energy consumption (including the fuel consumption and the electricity consumption) and emissions of heterogeneous traffic flow (that consists of the traditional vehicle (TV) and EV) under three traffic situations (i.e. uniform flow, shock and rarefaction waves, and a small perturbation) from the perspective of macro traffic flow. The numerical results show that the proportion of electric vehicular flow has great effects on the TV’s fuel consumption and emissions and the EV’s electricity consumption, i.e. the fuel consumption and emissions decrease while the electricity consumption increases with the increase of the proportion of electric vehicular flow. The results can help us better understand the energy consumption and emissions of the heterogeneous traffic flow consisting of TV and EV.

  3. Exact solutions to traffic density estimation problems involving the Lighthill-Whitham-Richards traffic flow model using mixed integer programming

    KAUST Repository

    Canepa, Edward S.; Claudel, Christian G.

    2012-01-01

    This article presents a new mixed integer programming formulation of the traffic density estimation problem in highways modeled by the Lighthill Whitham Richards equation. We first present an equivalent formulation of the problem using an Hamilton-Jacobi equation. Then, using a semi-analytic formula, we show that the model constraints resulting from the Hamilton-Jacobi equation result in linear constraints, albeit with unknown integers. We then pose the problem of estimating the density at the initial time given incomplete and inaccurate traffic data as a Mixed Integer Program. We then present a numerical implementation of the method using experimental flow and probe data obtained during Mobile Century experiment. © 2012 IEEE.

  4. Exact solutions to traffic density estimation problems involving the Lighthill-Whitham-Richards traffic flow model using mixed integer programming

    KAUST Repository

    Canepa, Edward S.

    2012-09-01

    This article presents a new mixed integer programming formulation of the traffic density estimation problem in highways modeled by the Lighthill Whitham Richards equation. We first present an equivalent formulation of the problem using an Hamilton-Jacobi equation. Then, using a semi-analytic formula, we show that the model constraints resulting from the Hamilton-Jacobi equation result in linear constraints, albeit with unknown integers. We then pose the problem of estimating the density at the initial time given incomplete and inaccurate traffic data as a Mixed Integer Program. We then present a numerical implementation of the method using experimental flow and probe data obtained during Mobile Century experiment. © 2012 IEEE.

  5. Density waves in a lattice hydrodynamic traffic flow model with the anticipation effect

    International Nuclear Information System (INIS)

    Zhao Min; Sun Di-Hua; Tian Chuan

    2012-01-01

    By introducing the traffic anticipation effect in the real world into the original lattice hydrodynamic model, we present a new anticipation effect lattice hydrodynamic (AELH) model, and obtain the linear stability condition of the model by applying the linear stability theory. Through nonlinear analysis, we derive the Burgers equation and Korteweg-de Vries (KdV) equation, to describe the propagating behaviour of traffic density waves in the stable and the metastable regions, respectively. The good agreement between simulation results and analytical results shows that the stability of traffic flow can be enhanced when the anticipation effect is considered. (interdisciplinary physics and related areas of science and technology)

  6. A new lattice hydrodynamic traffic flow model with a consideration of multi-anticipation effect

    International Nuclear Information System (INIS)

    Tian Chuan; Sun Di-Hua; Yang Shu-Hong

    2011-01-01

    We present a new multi-anticipation lattice hydrodynamic model based on the traffic anticipation effect in the real world. Applying the linear stability theory, we obtain the linear stability condition of the model. Through nonlinear analysis, we derive the modified Korteweg-de Vries equation to describe the propagating behaviour of a traffic density wave near the critical point. The good agreement between the simulation results and the analytical results shows that the stability of traffic flow can be enhanced when the multi-anticipation effect is considered. (interdisciplinary physics and related areas of science and technology)

  7. The impact of traffic-flow patterns on air quality in urban street canyons.

    Science.gov (United States)

    Thaker, Prashant; Gokhale, Sharad

    2016-01-01

    We investigated the effect of different urban traffic-flow patterns on pollutant dispersion in different winds in a real asymmetric street canyon. Free-flow traffic causes more turbulence in the canyon facilitating more dispersion and a reduction in pedestrian level concentration. The comparison of with and without a vehicle-induced-turbulence revealed that when winds were perpendicular, the free-flow traffic reduced the concentration by 73% on the windward side with a minor increase of 17% on the leeward side, whereas for parallel winds, it reduced the concentration by 51% and 29%. The congested-flow traffic increased the concentrations on the leeward side by 47% when winds were perpendicular posing a higher risk to health, whereas reduced it by 17-42% for parallel winds. The urban air quality and public health can, therefore, be improved by improving the traffic-flow patterns in street canyons as vehicle-induced turbulence has been shown to contribute significantly to dispersion. Copyright © 2015 Elsevier Ltd. All rights reserved.

  8. Optimized Structure of the Traffic Flow Forecasting Model With a Deep Learning Approach.

    Science.gov (United States)

    Yang, Hao-Fan; Dillon, Tharam S; Chen, Yi-Ping Phoebe

    2017-10-01

    Forecasting accuracy is an important issue for successful intelligent traffic management, especially in the domain of traffic efficiency and congestion reduction. The dawning of the big data era brings opportunities to greatly improve prediction accuracy. In this paper, we propose a novel model, stacked autoencoder Levenberg-Marquardt model, which is a type of deep architecture of neural network approach aiming to improve forecasting accuracy. The proposed model is designed using the Taguchi method to develop an optimized structure and to learn traffic flow features through layer-by-layer feature granulation with a greedy layerwise unsupervised learning algorithm. It is applied to real-world data collected from the M6 freeway in the U.K. and is compared with three existing traffic predictors. To the best of our knowledge, this is the first time that an optimized structure of the traffic flow forecasting model with a deep learning approach is presented. The evaluation results demonstrate that the proposed model with an optimized structure has superior performance in traffic flow forecasting.

  9. Concept for a Satellite-Based Advanced Air Traffic Management System : Volume 8. Operational Logic Flow Diagrams for a Generic Advanced Air Traffic Management system

    Science.gov (United States)

    1974-02-01

    The volume presents a description of the services a generic Advanced Air Traffic Management System (AATMS) should provide to the useres of the system to facilitate the safe, efficient flow of traffic. It provides a definition of the functions which t...

  10. Analyzing the Influence of Mobile Phone Use of Drivers on Traffic Flow Based on an Improved Cellular Automaton Model

    Directory of Open Access Journals (Sweden)

    Yao Xiao

    2015-01-01

    Full Text Available This paper aimed to analyze the influence of drivers’ behavior of phone use while driving on traffic flow, including both traffic efficiency and traffic safety. An improved cellular automaton model was proposed to simulate traffic flow with distracted drivers based on the Nagel-Schreckenberg model. The driving characters of drivers using a phone were first discussed and a value representing the probability to use a phone while driving was put into the CA model. Simulation results showed that traffic flow rate was significantly reduced if some drivers used a phone compared to no phone use. The flow rate and velocity decreased as the proportion of drivers using a phone increased. While, under low density, the risk of traffic decreased first and then increased as the distracted drivers increased, the distracted behavior of drivers, like using a phone, could reduce the flow rate by 5 percent according to the simulation.

  11. Analysis of mixed traffic flow with human-driving and autonomous cars based on car-following model

    Science.gov (United States)

    Zhu, Wen-Xing; Zhang, H. M.

    2018-04-01

    We investigated the mixed traffic flow with human-driving and autonomous cars. A new mathematical model with adjustable sensitivity and smooth factor was proposed to describe the autonomous car's moving behavior in which smooth factor is used to balance the front and back headway in a flow. A lemma and a theorem were proved to support the stability criteria in traffic flow. A series of simulations were carried out to analyze the mixed traffic flow. The fundamental diagrams were obtained from the numerical simulation results. The varying sensitivity and smooth factor of autonomous cars affect traffic flux, which exhibits opposite varying tendency with increasing parameters before and after the critical density. Moreover, the sensitivity of sensors and smooth factors play an important role in stabilizing the mixed traffic flow and suppressing the traffic jam.

  12. Traffic Flow Prediction Model for Large-Scale Road Network Based on Cloud Computing

    Directory of Open Access Journals (Sweden)

    Zhaosheng Yang

    2014-01-01

    Full Text Available To increase the efficiency and precision of large-scale road network traffic flow prediction, a genetic algorithm-support vector machine (GA-SVM model based on cloud computing is proposed in this paper, which is based on the analysis of the characteristics and defects of genetic algorithm and support vector machine. In cloud computing environment, firstly, SVM parameters are optimized by the parallel genetic algorithm, and then this optimized parallel SVM model is used to predict traffic flow. On the basis of the traffic flow data of Haizhu District in Guangzhou City, the proposed model was verified and compared with the serial GA-SVM model and parallel GA-SVM model based on MPI (message passing interface. The results demonstrate that the parallel GA-SVM model based on cloud computing has higher prediction accuracy, shorter running time, and higher speedup.

  13. Characteristic Analysis of Mixed Traffic Flow of Regular and Autonomous Vehicles Using Cellular Automata

    Directory of Open Access Journals (Sweden)

    Yangzexi Liu

    2017-01-01

    Full Text Available The technology of autonomous vehicles is expected to revolutionize the operation of road transport systems. The penetration rate of autonomous vehicles will be low at the early stage of their deployment. It is a challenge to explore the effects of autonomous vehicles and their penetration on heterogeneous traffic flow dynamics. This paper aims to investigate this issue. An improved cellular automaton was employed as the modeling platform for our study. In particular, two sets of rules for lane changing were designed to address mild and aggressive lane changing behavior. With extensive simulation studies, we obtained some promising results. First, the introduction of autonomous vehicles to road traffic could considerably improve traffic flow, particularly the road capacity and free-flow speed. And the level of improvement increases with the penetration rate. Second, the lane-changing frequency between neighboring lanes evolves with traffic density along a fundamental-diagram-like curve. Third, the impacts of autonomous vehicles on the collective traffic flow characteristics are mainly related to their smart maneuvers in lane changing and car following, and it seems that the car-following impact is more pronounced.

  14. Northern and Southern European Traffic Flow Land Segment Analysis as Part of the Redirection Justification

    Directory of Open Access Journals (Sweden)

    SiniŁa Vilke

    2017-12-01

    Full Text Available Natural geotraffic flows act as one of the most important factors directly affecting redirections of the world transportation routes. In terms of door-to-door multimodal transport chain, several routes from Far East toward European destinations exist, with Northern European route acting as prevailing one. The proposed paper elaborates possibilities of redirection of the traffic flow by directing cargoes to an alternative route through the Adriatic Sea. The aim is to justify realisation of mentioned possibility in terms of land transportation segment analysis, i.e. by analysing cargo transportation from ports to final destinations in Central Europe, placed in natural gravitational hinterland of ports of Northern Adriatic Port Association (NAPA. Geo-traffic and logistics’ analyses of NAPA ports are presented in the paper. Container traffic and its trend as compared with Northern European ports are analysed. The development plans of inland connections are presented in function of justification of the traffic flow redirection. A model for the selection and evaluation of the optimal container transport route by using the multiple criteria analysis (MCA has been introduced and developed. The model was applied for the selection of the representative service connecting Far East (origin and the central Europe (destination by detailed analysis of the land transportation segment. The PROMETHEE method was used for the model testing and evaluation. Summarised results are presented and discussed tending to confirmation of the traffic flow redirection justification.

  15. 3D Markov Process for Traffic Flow Prediction in Real-Time

    Directory of Open Access Journals (Sweden)

    Eunjeong Ko

    2016-01-01

    Full Text Available Recently, the correct estimation of traffic flow has begun to be considered an essential component in intelligent transportation systems. In this paper, a new statistical method to predict traffic flows using time series analyses and geometric correlations is proposed. The novelty of the proposed method is two-fold: (1 a 3D heat map is designed to describe the traffic conditions between roads, which can effectively represent the correlations between spatially- and temporally-adjacent traffic states; and (2 the relationship between the adjacent roads on the spatiotemporal domain is represented by cliques in MRF and the clique parameters are obtained by example-based learning. In order to assess the validity of the proposed method, it is tested using data from expressway traffic that are provided by the Korean Expressway Corporation, and the performance of the proposed method is compared with existing approaches. The results demonstrate that the proposed method can predict traffic conditions with an accuracy of 85%, and this accuracy can be improved further.

  16. SMART VIDEO SURVEILLANCE SYSTEM FOR VEHICLE DETECTION AND TRAFFIC FLOW CONTROL

    Directory of Open Access Journals (Sweden)

    A. A. SHAFIE

    2011-08-01

    Full Text Available Traffic signal light can be optimized using vehicle flow statistics obtained by Smart Video Surveillance Software (SVSS. This research focuses on efficient traffic control system by detecting and counting the vehicle numbers at various times and locations. At present, one of the biggest problems in the main city in any country is the traffic jam during office hour and office break hour. Sometimes it can be seen that the traffic signal green light is still ON even though there is no vehicle coming. Similarly, it is also observed that long queues of vehicles are waiting even though the road is empty due to traffic signal light selection without proper investigation on vehicle flow. This can be handled by adjusting the vehicle passing time implementing by our developed SVSS. A number of experiment results of vehicle flows are discussed in this research graphically in order to test the feasibility of the developed system. Finally, adoptive background model is proposed in SVSS in order to successfully detect target objects such as motor bike, car, bus, etc.

  17. SYSTEM ANALYSIS OF MAJOR TRENDS IN DEVELOPMENT OF ADAPTIVE TRAFFIC FLOW MANAGEMENT METHODS

    Directory of Open Access Journals (Sweden)

    A. N. Klimovich

    2017-01-01

    Full Text Available Adaptive algorithms, which current traffic systems are based on, exist for many decades. Information technologies have developed significantly over this period and it makes more relevant their application in the field of transport. This paper analyses modern trends in the development of adaptive traffic flow control methods. Reviewed the most perspective directions in the field of intelligent transport systems, such as high-speed wireless communication between vehicles and road infrastructure based on such technologies as DSRC and WAVE, traffic jams prediction having such features as traffic flow information, congestion, velocity of vehicles using machine learning, fuzzy logic rules and genetic algorithms, application of driver assistance systems to increase vehicle’s autonomy. Advantages of such technologies in safety, efficiency and usability of transport are shown. Described multi-agent approach, which uses V2I-communication between vehicles and intersection controller to improve efficiency of control due to more complete traffic flow information and possibility to give orders to separate vehicles. Presented number of algorithms which use such approach to create new generation of adaptive transport systems.

  18. Dynamic analysis of pedestrian crossing behaviors on traffic flow at unsignalized mid-block crosswalks

    Science.gov (United States)

    Liu, Gang; He, Jing; Luo, Zhiyong; Yang, Wunian; Zhang, Xiping

    2015-05-01

    It is important to study the effects of pedestrian crossing behaviors on traffic flow for solving the urban traffic jam problem. Based on the Nagel-Schreckenberg (NaSch) traffic cellular automata (TCA) model, a new one-dimensional TCA model is proposed considering the uncertainty conflict behaviors between pedestrians and vehicles at unsignalized mid-block crosswalks and defining the parallel updating rules of motion states of pedestrians and vehicles. The traffic flow is simulated for different vehicle densities and behavior trigger probabilities. The fundamental diagrams show that no matter what the values of vehicle braking probability, pedestrian acceleration crossing probability, pedestrian backing probability and pedestrian generation probability, the system flow shows the "increasing-saturating-decreasing" trend with the increase of vehicle density; when the vehicle braking probability is lower, it is easy to cause an emergency brake of vehicle and result in great fluctuation of saturated flow; the saturated flow decreases slightly with the increase of the pedestrian acceleration crossing probability; when the pedestrian backing probability lies between 0.4 and 0.6, the saturated flow is unstable, which shows the hesitant behavior of pedestrians when making the decision of backing; the maximum flow is sensitive to the pedestrian generation probability and rapidly decreases with increasing the pedestrian generation probability, the maximum flow is approximately equal to zero when the probability is more than 0.5. The simulations prove that the influence of frequent crossing behavior upon vehicle flow is immense; the vehicle flow decreases and gets into serious congestion state rapidly with the increase of the pedestrian generation probability.

  19. End-to-End Traffic Flow Modeling of the Integrated SCaN Network

    Science.gov (United States)

    Cheung, K.-M.; Abraham, D. S.

    2012-05-01

    In this article, we describe the analysis and simulation effort of the end-to-end traffic flow for the Integrated Space Communications and Navigation (SCaN) Network. Using the network traffic derived for the 30-day period of July 2018 from the Space Communications Mission Model (SCMM), we generate the wide-area network (WAN) bandwidths of the ground links for different architecture options of the Integrated SCaN Network. We also develop a new analytical scheme to model the traffic flow and buffering mechanism of a store-and-forward network. It is found that the WAN bandwidth of the Integrated SCaN Network is an important differentiator of different architecture options, as the recurring circuit costs of certain architecture options can be prohibitively high.

  20. Capacity of Freeway Merge Areas with Different On-Ramp Traffic Flow

    Directory of Open Access Journals (Sweden)

    Jinxing Shen

    2015-06-01

    Full Text Available This paper is aimed at investigating the influence of different types of traffic flows on the capacity of freeway merge areas. Based on the classical gap-acceptance model, two calculating models were established specifically considering randomly arriving vehicles and individual difference in driving behaviours. Monte-Carlo simulation was implemented to reproduce the maximum traffic volume on the designed freeway merge area under different situations. The results demonstrated that the proposed calculating models have better performance than the conventional gap-acceptance theory on accurately predicting the capacity of freeway merge areas. The findings of research could be helpful to improve the microscopic traffic flow simulation model from a more practical perspective and support the designing of freeway merge areas as well.

  1. Distributed and Centralized Conflict Management Under Traffic Flow Management Constraints

    Science.gov (United States)

    Feron, Eric; Bilimoria, Karl (Technical Monitor)

    2003-01-01

    Current air transportation in the United States relies on a system born half a century ago. While demand for air travel has kept increasing over the years, technologies at the heart of the National Airspace System (NAS) have not been able to follow an adequate evolution. For instance, computers used to centralize flight data in airspace sectors run a software developed in 1972. Safety, as well as certification and portability issues arise as major obstacles for the improvement of the system. The NAS is a structure that has never been designed, but has rather evolved over time. This has many drawbacks, mainly due to a lack of integration and engineering leading to many inefficiencies and losses of performance. To improve the operations, understanding of this complex needs to be built up to a certain level. This work presents research done on Air Traffic Management (ATM) at the level of the en-route sector.

  2. A better understanding of long-range temporal dependence of traffic flow time series

    Science.gov (United States)

    Feng, Shuo; Wang, Xingmin; Sun, Haowei; Zhang, Yi; Li, Li

    2018-02-01

    Long-range temporal dependence is an important research perspective for modelling of traffic flow time series. Various methods have been proposed to depict the long-range temporal dependence, including autocorrelation function analysis, spectral analysis and fractal analysis. However, few researches have studied the daily temporal dependence (i.e. the similarity between different daily traffic flow time series), which can help us better understand the long-range temporal dependence, such as the origin of crossover phenomenon. Moreover, considering both types of dependence contributes to establishing more accurate model and depicting the properties of traffic flow time series. In this paper, we study the properties of daily temporal dependence by simple average method and Principal Component Analysis (PCA) based method. Meanwhile, we also study the long-range temporal dependence by Detrended Fluctuation Analysis (DFA) and Multifractal Detrended Fluctuation Analysis (MFDFA). The results show that both the daily and long-range temporal dependence exert considerable influence on the traffic flow series. The DFA results reveal that the daily temporal dependence creates crossover phenomenon when estimating the Hurst exponent which depicts the long-range temporal dependence. Furthermore, through the comparison of the DFA test, PCA-based method turns out to be a better method to extract the daily temporal dependence especially when the difference between days is significant.

  3. Engineering Consequences of changing Traffic Flows on Minor Rural Roads in a developing Multifunctional European Countryside

    NARCIS (Netherlands)

    Jaarsma, C.F.; Hermans, C.M.L.; Rienks, W.A.; Vries, de J.R.

    2012-01-01

    Multifunctional agriculture (MFA) is a leading catchword in European agricultural policy. This paper aims to investigate expanding traffic flows arising from new activities connected with agricultural business, such as on-farm sales of products, care-farming, and agritourism. These activities put an

  4. Self-organized natural roads for predicting traffic flow: a sensitivity study

    International Nuclear Information System (INIS)

    Jiang, Bin; Zhao, Sijian; Yin, Junjun

    2008-01-01

    In this paper, we extended road-based topological analysis to both nationwide and urban road networks, and concentrated on a sensitivity study with respect to the formation of self-organized natural roads based on the Gestalt principle of good continuity. Both annual average daily traffic (AADT) and global positioning system (GPS) data were used to correlate with a series of ranking metrics including five centrality-based metrics and two PageRank metrics. It was found that there exists a tipping point from segment-based to road-based network topology in terms of correlation between ranking metrics and their traffic. To our great surprise, (1) this correlation is significantly improved if a selfish rather than utopian strategy is adopted in forming the self-organized natural roads, and (2) point-based metrics assigned by summation into individual roads tend to have a much better correlation with traffic flow than line-based metrics. These counter-intuitive surprising findings constitute emergent properties of self-organized natural roads, which are intelligent enough for predicting traffic flow, thus shedding substantial light on the understanding of road networks and their traffic from the perspective of complex networks

  5. Multi-Agent Based Microscopic Simulation Modeling for Urban Traffic Flow

    Directory of Open Access Journals (Sweden)

    Xianyan Kuang

    2014-10-01

    Full Text Available Traffic simulation plays an important role in the evaluation of traffic decisions. The movement of vehicles essentially is the operating process of drivers, in order to reproduce the urban traffic flow from the micro-aspect on computer, this paper establishes an urban traffic flow microscopic simulation system (UTFSim based on multi-agent. The system is seen as an intelligent virtual environment system (IVES, and the four-layer structure of it is built. The road agent, vehicle agent and signal agent are modeled. The concept of driving trajectory which is divided into LDT (Lane Driving Trajectory and VDDT (Vehicle Dynamic Driving Trajectory is introduced. The “Link-Node” road network model is improved. The driving behaviors including free driving, following driving, lane changing, slowing down, vehicle stop, etc. are analyzed. The results of the signal control experiments utilizing the UTFSim developed in the platform of Visual Studio. NET indicates that it plays a good performance and can be used in the evaluation of traffic management and control.

  6. Traffic flow behavior at un-signalized intersection with crossings pedestrians

    Science.gov (United States)

    Khallouk, A.; Echab, H.; Ez-Zahraouy, H.; Lakouari, N.

    2018-02-01

    Mixed traffic flux composed of crossing pedestrians and vehicles extensively exists in cities. To study the characteristics of the interference traffic flux, we develop a pedestrian-vehicle cellular automata model to present the interaction behaviors on a simple cross road. By realizing the fundamental parameters (i.e. injecting rates α1, α2, the extracting rate β and the pedestrian arrival rate αP), simulations are carried out. The vehicular traffic flux is calculated in terms of rates. The effect of the crosswalk can be regarded as a dynamic impurity. The system phase diagrams in the (α1 ,αP) plane are built. It is found that the phase diagrams consist essentially of four phases namely Free Flow, Congested, Maximal Current and Gridlock. The value of the Maximal current phase depends on the extracting rate β, while the Gridlock phase is achieved only when the pedestrians generating rate is higher than a critical value. Furthermore, the effect of vehicles changing lane (Pch1 ,Pch2) and the location of the crosswalk XP on the dynamic characteristics of vehicles flow are investigated. It is found that traffic situation in the system is slightly enhanced if the location of the crosswalks XP is far from the intersection. However, when Pch1, Pch2 increase, the traffic becomes congested and the Gridlock phase enlarges.

  7. Traffic flow model at fixed control signals with discrete service time distribution

    Directory of Open Access Journals (Sweden)

    Lucky I. Igbinosun

    2016-04-01

    Full Text Available Most of the models of road traffic flow at fixed-cycle controlled intersection assume stationary distributions and provide steady state results. The assumption that a constant number of vehicles can leave the system during the green phase is unrealistic in real life situations. A discrete time queuing model was developed to describe the operation of traffic flow at a road intersection with fixed-cycle signalized control and to account for the randomness in the number of vehicles that can leave the system. The results show the expected queue size in the system when the traffic is light and for a busy period, respectively. For the light period, when the traffic intensity is less than one, it takes a shorter green cycle time for vehicles to clear up than during high traffic intensity (the road junction is saturated. Increasing the number of cars that can leave the junction at the turn of the green phase reduces the number of cycle times before the queue is cleared.

  8. A Method of Flow-Shop Re-Scheduling Dealing with Variation of Productive Capacity

    Directory of Open Access Journals (Sweden)

    Kenzo KURIHARA

    2005-02-01

    Full Text Available We can make optimum scheduling results using various methods that are proposed by many researchers. However, it is very difficult to process the works on time without delaying the schedule. There are two major causes that disturb the planned optimum schedules; they are (1the variation of productive capacity, and (2the variation of products' quantities themselves. In this paper, we deal with the former variation, or productive capacities, at flow-shop works. When production machines in a shop go out of order at flow-shops, we cannot continue to operate the productions and we have to stop the production line. To the contrary, we can continue to operate the shops even if some workers absent themselves. Of course, in this case, the production capacities become lower, because workers need to move from a machine to another to overcome the shortage of workers and some shops cannot be operated because of the worker shortage. We developed a new re-scheduling method based on Branch-and Bound method. We proposed an equation for calculating the lower bound for our Branch-and Bound method in a practical time. Some evaluation experiments are done using practical data of real flow-shop works. We compared our results with those of another simple scheduling method, and we confirmed the total production time of our result is shorter than that of another method by 4%.

  9. A Hybrid Metaheuristic Approach for Minimizing the Total Flow Time in A Flow Shop Sequence Dependent Group Scheduling Problem

    Directory of Open Access Journals (Sweden)

    Antonio Costa

    2014-07-01

    Full Text Available Production processes in Cellular Manufacturing Systems (CMS often involve groups of parts sharing the same technological requirements in terms of tooling and setup. The issue of scheduling such parts through a flow-shop production layout is known as the Flow-Shop Group Scheduling (FSGS problem or, whether setup times are sequence-dependent, the Flow-Shop Sequence-Dependent Group Scheduling (FSDGS problem. This paper addresses the FSDGS issue, proposing a hybrid metaheuristic procedure integrating features from Genetic Algorithms (GAs and Biased Random Sampling (BRS search techniques with the aim of minimizing the total flow time, i.e., the sum of completion times of all jobs. A well-known benchmark of test cases, entailing problems with two, three, and six machines, is employed for both tuning the relevant parameters of the developed procedure and assessing its performances against two metaheuristic algorithms recently presented by literature. The obtained results and a properly arranged ANOVA analysis highlight the superiority of the proposed approach in tackling the scheduling problem under investigation.

  10. Relative performance of priority rules for hybrid flow shop scheduling with setup times

    Directory of Open Access Journals (Sweden)

    Helio Yochihiro Fuchigami

    2015-12-01

    Full Text Available This paper focuses the hybrid flow shop scheduling problem with explicit and sequence-independent setup times. This production environment is a multistage system with unidirectional flow of jobs, wherein each stage may contain multiple machines available for processing. The optimized measure was the total time to complete the schedule (makespan. The aim was to propose new priority rules to support the schedule and to evaluate their relative performance at the production system considered by the percentage of success, relative deviation, standard deviation of relative deviation, and average CPU time. Computational experiments have indicated that the rules using ascending order of the sum of processing and setup times of the first stage (SPT1 and SPT1_ERD performed better, reaching together more than 56% of success.

  11. Job Flow Distribution and Ranked Jobs Scheduling in Grid Virtual Organizations

    CERN Document Server

    Toporkov, Victor; Tselishchev, Alexey; Yemelyanov, Dmitry; Potekhin, Petr

    2015-01-01

    In this work, we consider the problems of job flow distribution and ranked job framework forming within a model of cycle scheduling in Grid virtual organizations. The problem of job flow distribution is solved in terms of jobs and computing resource domains compatibility. A coefficient estimating such compatibility is introduced and studied experimentally. Two distribution strategies are suggested. Job framework forming is justified with such quality of service indicators as an average job execution time, a number of required scheduling cycles, and a number of job execution declines. Two methods for job selection and scheduling are proposed and compared: the first one is based on the knapsack problem solution, while the second one utilizes the mentioned compatibility coefficient. Along with these methods we present experimental results demonstrating the efficiency of proposed approaches and compare them with random job selection.

  12. Effect of the Length of Traffic Flow Records on the Estimate of a Bridge Service Life

    Directory of Open Access Journals (Sweden)

    Krejsa Jan

    2016-12-01

    Full Text Available The service life of bridges is significantly affected by fatigue of used material induced by heavy vehicles. Therefore, precise determination of the vehicle weight is of crucial importance for the calculation of fatigue damage and the prediction of the bridge serviceability. This paper investigates accuracy of the determination of fatigue depending on the length of traffic flow recording. The presented data were obtained from the measurements carried out on a bridge of the Prague Highway Ring. The analysis reveals that the optimal length of traffic recording is about 30 days.

  13. A new stochastic cellular automaton model on traffic flow and its jamming phase transition

    International Nuclear Information System (INIS)

    Sakai, Satoshi; Nishinari, Katsuhiro; Iida, Shinji

    2006-01-01

    A general stochastic traffic cellular automaton (CA) model, which includes the slow-to-start effect and driver's perspective, is proposed in this paper. It is shown that this model includes well-known traffic CA models such as the Nagel-Schreckenberg model, the quick-start model and the slow-to-start model as specific cases. Fundamental diagrams of this new model clearly show metastable states around the critical density even when the stochastic effect is present. We also obtain analytic expressions of the phase transition curve in phase diagrams by using approximate flow-density relations at boundaries. These phase transition curves are in excellent agreement with numerical results

  14. Information Flow Scheduling in Concurrent Multi-Product Development Based on DSM

    Science.gov (United States)

    Sun, Qing-Chao; Huang, Wei-Qiang; Jiang, Ying-Jie; Sun, Wei

    2017-09-01

    Multi-product collaborative development is adopted widely in manufacturing enterprise, while the present multi-project planning models don't take technical/data interactions of multiple products into account. To decrease the influence of technical/data interactions on project progresses, the information flow scheduling models based on the extended DSM is presented. Firstly, information dependencies are divided into four types: series, parallel, coupling and similar. Secondly, different types of dependencies are expressed as DSM units, and the extended DSM model is brought forward, described as a block matrix. Furthermore, the information flow scheduling methods is proposed, which involves four types of operations, where partitioning and clustering algorithm are modified from DSM for ensuring progress of high-priority project, merging and converting is the specific computation of the extended DSM. Finally, the information flow scheduling of two machine tools development is analyzed with example, and different project priorities correspond to different task sequences and total coordination cost. The proposed methodology provides a detailed instruction for information flow scheduling in multi-product development, with specially concerning technical/data interactions.

  15. Preemptive scheduling in a two-stage multiprocessor flow shop is NP-hard

    NARCIS (Netherlands)

    Hoogeveen, J.A.; Lenstra, J.K.; Veltman, B.

    1996-01-01

    In 1954, Johnson gave an efficient algorithm for minimizing makespan in a two-machine flow shop; there is no advantage to preemption in this case. McNaughton's wrap-around rule of 1959 finds a shortest preemptive schedule on identical parallel machines in linear time. A similarly efficient algorithm

  16. Development and application of traffic flow information collecting and analysis system based on multi-type video

    Science.gov (United States)

    Lu, Mujie; Shang, Wenjie; Ji, Xinkai; Hua, Mingzhuang; Cheng, Kuo

    2015-12-01

    Nowadays, intelligent transportation system (ITS) has already become the new direction of transportation development. Traffic data, as a fundamental part of intelligent transportation system, is having a more and more crucial status. In recent years, video observation technology has been widely used in the field of traffic information collecting. Traffic flow information contained in video data has many advantages which is comprehensive and can be stored for a long time, but there are still many problems, such as low precision and high cost in the process of collecting information. This paper aiming at these problems, proposes a kind of traffic target detection method with broad applicability. Based on three different ways of getting video data, such as aerial photography, fixed camera and handheld camera, we develop a kind of intelligent analysis software which can be used to extract the macroscopic, microscopic traffic flow information in the video, and the information can be used for traffic analysis and transportation planning. For road intersections, the system uses frame difference method to extract traffic information, for freeway sections, the system uses optical flow method to track the vehicles. The system was applied in Nanjing, Jiangsu province, and the application shows that the system for extracting different types of traffic flow information has a high accuracy, it can meet the needs of traffic engineering observations and has a good application prospect.

  17. Analytical and grid-free solutions to the Lighthill-Whitham-Richards traffic flow model

    KAUST Repository

    Mazaré , Pierre Emmanuel; Dehwah, Ahmad H.; Claudel, Christian G.; Bayen, Alexandre M.

    2011-01-01

    In this article, we propose a computational method for solving the Lighthill-Whitham-Richards (LWR) partial differential equation (PDE) semi-analytically for arbitrary piecewise-constant initial and boundary conditions, and for arbitrary concave fundamental diagrams. With these assumptions, we show that the solution to the LWR PDE at any location and time can be computed exactly and semi-analytically for a very low computational cost using the cumulative number of vehicles formulation of the problem. We implement the proposed computational method on a representative traffic flow scenario to illustrate the exactness of the analytical solution. We also show that the proposed scheme can handle more complex scenarios including traffic lights or moving bottlenecks. The computational cost of the method is very favorable, and is compared with existing algorithms. A toolbox implementation available for public download is briefly described, and posted at http://traffic.berkeley.edu/project/downloads/lwrsolver. © 2011 Elsevier Ltd.

  18. Analytical and grid-free solutions to the Lighthill-Whitham-Richards traffic flow model

    KAUST Repository

    Mazaré, Pierre Emmanuel

    2011-12-01

    In this article, we propose a computational method for solving the Lighthill-Whitham-Richards (LWR) partial differential equation (PDE) semi-analytically for arbitrary piecewise-constant initial and boundary conditions, and for arbitrary concave fundamental diagrams. With these assumptions, we show that the solution to the LWR PDE at any location and time can be computed exactly and semi-analytically for a very low computational cost using the cumulative number of vehicles formulation of the problem. We implement the proposed computational method on a representative traffic flow scenario to illustrate the exactness of the analytical solution. We also show that the proposed scheme can handle more complex scenarios including traffic lights or moving bottlenecks. The computational cost of the method is very favorable, and is compared with existing algorithms. A toolbox implementation available for public download is briefly described, and posted at http://traffic.berkeley.edu/project/downloads/lwrsolver. © 2011 Elsevier Ltd.

  19. Permutation flow-shop scheduling problem to optimize a quadratic objective function

    Science.gov (United States)

    Ren, Tao; Zhao, Peng; Zhang, Da; Liu, Bingqian; Yuan, Huawei; Bai, Danyu

    2017-09-01

    A flow-shop scheduling model enables appropriate sequencing for each job and for processing on a set of machines in compliance with identical processing orders. The objective is to achieve a feasible schedule for optimizing a given criterion. Permutation is a special setting of the model in which the processing order of the jobs on the machines is identical for each subsequent step of processing. This article addresses the permutation flow-shop scheduling problem to minimize the criterion of total weighted quadratic completion time. With a probability hypothesis, the asymptotic optimality of the weighted shortest processing time schedule under a consistency condition (WSPT-CC) is proven for sufficiently large-scale problems. However, the worst case performance ratio of the WSPT-CC schedule is the square of the number of machines in certain situations. A discrete differential evolution algorithm, where a new crossover method with multiple-point insertion is used to improve the final outcome, is presented to obtain high-quality solutions for moderate-scale problems. A sequence-independent lower bound is designed for pruning in a branch-and-bound algorithm for small-scale problems. A set of random experiments demonstrates the performance of the lower bound and the effectiveness of the proposed algorithms.

  20. Information-Aided Smart Schemes for Vehicle Flow Detection Enhancements of Traffic Microwave Radar Detectors

    Directory of Open Access Journals (Sweden)

    Tan-Jan Ho

    2016-07-01

    Full Text Available For satisfactory traffic management of an intelligent transport system, it is vital that traffic microwave radar detectors (TMRDs can provide real-time traffic information with high accuracy. In this study, we develop several information-aided smart schemes for traffic detection improvements of TMRDs in multiple-lane environments. Specifically, we select appropriate thresholds not only for removing noise from fast Fourier transforms (FFTs of regional lane contexts but also for reducing FFT side lobes within each lane. The resulting FFTs of reflected vehicle signals and those of clutter are distinguishable. We exploit FFT and lane-/or time stamp-related information for developing smart schemes, which mitigate adverse effects of lane-crossing FFT side lobes of a vehicle signal. As such, the proposed schemes can enhance the detection accuracy of both lane vehicle flow and directional traffic volume. On-site experimental results demonstrate the advantages and feasibility of the proposed methods, and suggest the best smart scheme.

  1. Properties of Phase Transition of Traffic Flow on Urban Expressway Systems with Ramps and Accessory Roads

    International Nuclear Information System (INIS)

    Mei Chaoqun; Liu Yejin

    2011-01-01

    In this paper, we develop a cellular automaton model to describe the phase transition of traffic flow on urban expressway systems with on-off-ramps and accessory roads. The lane changing rules are given in detailed, the numerical results show that the main road and the accessory road both produce phase transitions. These phase transitions will often be influenced by the number of lanes, lane changing, the ramp flow, the input flow rate, and the geometry structure. (interdisciplinary physics and related areas of science and technology)

  2. The impact of a congestion assistant on traffic flow efficiency and safety in congested traffic caused by a lane drop

    NARCIS (Netherlands)

    van Driel, Cornelie; van Arem, Bart

    2010-01-01

    This article presents the results of a microscopic traffic simulation study conducted to investigate the impact of a Congestion Assistant on traffic efficiency and traffic safety. The Congestion Assistant is an in-vehicle system in which an active pedal supports the driver when approaching

  3. Dynamic Traffic Congestion Simulation and Dissipation Control Based on Traffic Flow Theory Model and Neural Network Data Calibration Algorithm

    Directory of Open Access Journals (Sweden)

    Li Wang

    2017-01-01

    Full Text Available Traffic congestion is a common problem in many countries, especially in big cities. At present, China’s urban road traffic accidents occur frequently, the occurrence frequency is high, the accident causes traffic congestion, and accidents cause traffic congestion and vice versa. The occurrence of traffic accidents usually leads to the reduction of road traffic capacity and the formation of traffic bottlenecks, causing the traffic congestion. In this paper, the formation and propagation of traffic congestion are simulated by using the improved medium traffic model, and the control strategy of congestion dissipation is studied. From the point of view of quantitative traffic congestion, the paper provides the fact that the simulation platform of urban traffic integration is constructed, and a feasible data analysis, learning, and parameter calibration method based on RBF neural network is proposed, which is used to determine the corresponding decision support system. The simulation results prove that the control strategy proposed in this paper is effective and feasible. According to the temporal and spatial evolution of the paper, we can see that the network has been improved on the whole.

  4. Comparative Simulation Study of Production Scheduling in the Hybrid and the Parallel Flow

    Directory of Open Access Journals (Sweden)

    Varela Maria L.R.

    2017-06-01

    Full Text Available Scheduling is one of the most important decisions in production control. An approach is proposed for supporting users to solve scheduling problems, by choosing the combination of physical manufacturing system configuration and the material handling system settings. The approach considers two alternative manufacturing scheduling configurations in a two stage product oriented manufacturing system, exploring the hybrid flow shop (HFS and the parallel flow shop (PFS environments. For illustrating the application of the proposed approach an industrial case from the automotive components industry is studied. The main aim of this research to compare results of study of production scheduling in the hybrid and the parallel flow, taking into account the makespan minimization criterion. Thus the HFS and the PFS performance is compared and analyzed, mainly in terms of the makespan, as the transportation times vary. The study shows that the performance HFS is clearly better when the work stations’ processing times are unbalanced, either in nature or as a consequence of the addition of transport times just to one of the work station processing time but loses advantage, becoming worse than the performance of the PFS configuration when the work stations’ processing times are balanced, either in nature or as a consequence of the addition of transport times added on the work stations’ processing times. This means that physical layout configurations along with the way transport time are including the work stations’ processing times should be carefully taken into consideration due to its influence on the performance reached by both HFS and PFS configurations.

  5. Memory effects in microscopic traffic models and wide scattering in flow-density data

    Science.gov (United States)

    Treiber, Martin; Helbing, Dirk

    2003-10-01

    By means of microscopic simulations we show that noninstantaneous adaptation of the driving behavior to the traffic situation together with the conventional method to measure flow-density data provides a possible explanation for the observed inverse-λ shape and the wide scattering of flow-density data in “synchronized” congested traffic. We model a memory effect in the response of drivers to the traffic situation for a wide class of car-following models by introducing an additional dynamical variable (the “subjective level of service”) describing the adaptation of drivers to the surrounding traffic situation during the past few minutes and couple this internal state to parameters of the underlying model that are related to the driving style. For illustration, we use the intelligent-driver model (IDM) as the underlying model, characterize the level of service solely by the velocity, and couple the internal variable to the IDM parameter “time gap” to model an increase of the time gap in congested traffic (“frustration effect”), which is supported by single-vehicle data. We simulate open systems with a bottleneck and obtain flow-density data by implementing “virtual detectors.” The shape, relative size, and apparent “stochasticity” of the region of the scattered data points agree nearly quantitatively with empirical data. Wide scattering is even observed for identical vehicles, although the proposed model is a time-continuous, deterministic, single-lane car-following model with a unique fundamental diagram.

  6. A multiclass vehicular dynamic traffic flow model for main roads and dedicated lanes/roads of multimodal transport network

    Energy Technology Data Exchange (ETDEWEB)

    Sossoe, K.S., E-mail: kwami.sossoe@irt-systemx.fr [TECHNOLOGICAL RESEARCH INSTITUTE SYSTEMX (France); Lebacque, J-P., E-mail: jean-patrick.lebacque@ifsttar.fr [UPE/IFSTTAR-COSYS-GRETTIA (France)

    2015-03-10

    We present in this paper a model of vehicular traffic flow for a multimodal transportation road network. We introduce the notion of class of vehicles to refer to vehicles of different transport modes. Our model describes the traffic on highways (which may contain several lanes) and network transit for pubic transportation. The model is drafted with Eulerian and Lagrangian coordinates and uses a Logit model to describe the traffic assignment of our multiclass vehicular flow description on shared roads. The paper also discusses traffic streams on dedicated lanes for specific class of vehicles with event-based traffic laws. An Euler-Lagrangian-remap scheme is introduced to numerically approximate the model’s flow equations.

  7. Run-Time HW/SW Scheduling of Data Flow Applications on Reconfigurable Architectures

    Directory of Open Access Journals (Sweden)

    Ghaffari Fakhreddine

    2009-01-01

    Full Text Available This paper presents an efficient dynamic and run-time Hardware/Software scheduling approach. This scheduling heuristic consists in mapping online the different tasks of a highly dynamic application in such a way that the total execution time is minimized. We consider soft real-time data flow graph oriented applications for which the execution time is function of the input data nature. The target architecture is composed of two processors connected to a dynamically reconfigurable hardware accelerator. Our approach takes advantage of the reconfiguration property of the considered architecture to adapt the treatment to the system dynamics. We compare our heuristic with another similar approach. We present the results of our scheduling method on several image processing applications. Our experiments include simulation and synthesis results on a Virtex V-based platform. These results show a better performance against existing methods.

  8. Roads at risk: traffic detours from debris flows in southern Norway

    Science.gov (United States)

    Meyer, N. K.; Schwanghart, W.; Korup, O.; Nadim, F.

    2015-05-01

    Globalisation and interregional exchange of people, goods, and services has boosted the importance of and reliance on all kinds of transport networks. The linear structure of road networks is especially sensitive to natural hazards. In southern Norway, steep topography and extreme weather events promote frequent traffic disruption caused by debris flows. Topographic susceptibility and trigger frequency maps serve as input into a hazard appraisal at the scale of first-order catchments to quantify the impact of debris flows on the road network in terms of a failure likelihood of each link connecting two network vertices, e.g. road junctions. We compute total additional traffic loads as a function of traffic volume and excess distance, i.e. the extra length of an alternative path connecting two previously disrupted network vertices using a shortest-path algorithm. Our risk metric of link failure is the total additional annual traffic load, expressed as vehicle kilometres, because of debris-flow-related road closures. We present two scenarios demonstrating the impact of debris flows on the road network and quantify the associated path-failure likelihood between major cities in southern Norway. The scenarios indicate that major routes crossing the central and north-western part of the study area are associated with high link-failure risk. Yet options for detours on major routes are manifold and incur only little additional costs provided that drivers are sufficiently well informed about road closures. Our risk estimates may be of importance to road network managers and transport companies relying on speedy delivery of services and goods.

  9. Property relationships of the physical infrastructure and the traffic flow networks

    Science.gov (United States)

    Zhou, Ta; Zou, Sheng-Rong; He, Da-Ren

    2010-03-01

    We studied both empirically and analytically the correlation between the degrees or the clustering coefficients, respectively, of the networks in the physical infrastructure and the traffic flow layers in three Chinese transportation systems. The systems are bus transportation systems in Beijing and Hangzhou, and the railway system in the mainland. It is found that the correlation between the degrees obey a linear function; while the correlation between the clustering coefficients obey a power law. A possible dynamic explanation on the rules is presented.

  10. A new lattice model of traffic flow with the consideration of the driver's forecast effects

    Energy Technology Data Exchange (ETDEWEB)

    Peng, G.H., E-mail: pengguanghan@yahoo.com.cn [College of Physics and Electronic Science, Hunan University of Arts and Science, Changde 415000 (China); Cai, X.H.; Liu, C.Q.; Cao, B.F. [College of Physics and Electronic Science, Hunan University of Arts and Science, Changde 415000 (China)

    2011-05-30

    In this Letter, a new lattice model is presented with the consideration of the driver's forecast effects (DFE). The linear stability condition of the extended model is obtained by using the linear stability theory. The analytical results show that the new model can improve the stability of traffic flow by considering DFE. The modified KdV equation near the critical point is derived to describe the traffic jam by nonlinear analysis. Numerical simulation also shows that the new model can improve the stability of traffic flow by adjusting the driver's forecast intensity parameter, which is consistent with the theoretical analysis. -- Highlights: → A new driver's forecast lattice model of traffic flow has been presented. → The driver's forecast effects on the stability of traffic flow have been explored. → The modified KdV equation near the critical point is derived to describe the traffic jam by nonlinear analysis. → The analytical and numerical results show that the driver's forecast effect can improve the stability of traffic flow.

  11. Investigation of the Link Between Macroscopic Traffic Flow Characteristics and Individual Vehicle Fuel Consumption : Tech Transfer Summary

    Science.gov (United States)

    2017-10-01

    The objective of this project was to investigate the impacts of several factors, including vehicle characteristics, ambient temperature, season, speed, driving behavior, and traffic flow, on individual vehicle energy consumption.

  12. Big data analytics : predicting traffic flow regimes from simulated connected vehicle messages using data analytics and machine learning.

    Science.gov (United States)

    2016-12-25

    The key objectives of this study were to: 1. Develop advanced analytical techniques that make use of a dynamically configurable connected vehicle message protocol to predict traffic flow regimes in near-real time in a virtual environment and examine ...

  13. Development of a Computational Framework for Big Data-Driven Prediction of Long-Term Bridge Performance and Traffic Flow

    Science.gov (United States)

    2018-04-01

    Consistent efforts with dense sensor deployment and data gathering processes for bridge big data have accumulated profound information regarding bridge performance, associated environments, and traffic flows. However, direct applications of bridge bi...

  14. Heuristics methods for the flow shop scheduling problem with separated setup times

    Directory of Open Access Journals (Sweden)

    Marcelo Seido Nagano

    2012-06-01

    Full Text Available This paper deals with the permutation flow shop scheduling problem with separated machine setup times. As a result of an investigation on the problem characteristics, four heuristics methods are proposed with procedures of the construction sequencing solution by an analogy with the asymmetric traveling salesman problem with the objective of minimizing makespan. Experimental results show that one of the new heuristics methods proposed provide high quality solutions in comparisons with the evaluated methods considered in the literature.

  15. Betweenness centrality and its applications from modeling traffic flows to network community detection

    Science.gov (United States)

    Ren, Yihui

    As real-world complex networks are heterogeneous structures, not all their components such as nodes, edges and subgraphs carry the same role or importance in the functions performed by the networks: some elements are more critical than others. Understanding the roles of the components of a network is crucial for understanding the behavior of the network as a whole. One the most basic function of networks is transport; transport of vehicles/people, information, materials, forces, etc., and these quantities are transported along edges between source and destination nodes. For this reason, network path-based importance measures, also called centralities, play a crucial role in the understanding of the transport functions of the network and the network's structural and dynamical behavior in general. In this thesis we study the notion of betweenness centrality, which measures the fraction of lowest-cost (or shortest) paths running through a network component, in particular through a node or an edge. High betweenness centrality nodes/edges are those that will be frequently used by the entities transported through the network and thus they play a key role in the overall transport properties of the network. In the first part of the thesis we present a first-principles based method for traffic prediction using a cost-based generalization of the radiation model (emission/absorbtion model) for human mobility, coupled with a cost-minimizing algorithm for efficient distribution of the mobility fluxes through the network. Using US census and highway traffic data, we show that traffic can efficiently and accurately be computed from a range-limited, network betweenness type calculation. The model based on travel time costs captures the log-normal distribution of the traffic and attains a high Pearson correlation coefficient (0.75) when compared with real traffic. We then focus on studying the extent of changes in traffic flows in the wake of a localized damage or alteration to the

  16. Predicting Traffic Flow in Local Area Networks by the Largest Lyapunov Exponent

    Directory of Open Access Journals (Sweden)

    Yan Liu

    2016-01-01

    Full Text Available The dynamics of network traffic are complex and nonlinear, and chaotic behaviors and their prediction, which play an important role in local area networks (LANs, are studied in detail, using the largest Lyapunov exponent. With the introduction of phase space reconstruction based on the time sequence, the high-dimensional traffic is projected onto the low dimension reconstructed phase space, and a reduced dynamic system is obtained from the dynamic system viewpoint. Then, a numerical method for computing the largest Lyapunov exponent of the low-dimensional dynamic system is presented. Further, the longest predictable time, which is related to chaotic behaviors in the system, is studied using the largest Lyapunov exponent, and the Wolf method is used to predict the evolution of the traffic in a local area network by both Dot and Interval predictions, and a reliable result is obtained by the presented method. As the conclusion, the results show that the largest Lyapunov exponent can be used to describe the sensitivity of the trajectory in the reconstructed phase space to the initial values. Moreover, Dot Prediction can effectively predict the flow burst. The numerical simulation also shows that the presented method is feasible and efficient for predicting the complex dynamic behaviors in LAN traffic, especially for congestion and attack in networks, which are the main two complex phenomena behaving as chaos in networks.

  17. Improved teaching-learning-based and JAYA optimization algorithms for solving flexible flow shop scheduling problems

    Science.gov (United States)

    Buddala, Raviteja; Mahapatra, Siba Sankar

    2017-11-01

    Flexible flow shop (or a hybrid flow shop) scheduling problem is an extension of classical flow shop scheduling problem. In a simple flow shop configuration, a job having `g' operations is performed on `g' operation centres (stages) with each stage having only one machine. If any stage contains more than one machine for providing alternate processing facility, then the problem becomes a flexible flow shop problem (FFSP). FFSP which contains all the complexities involved in a simple flow shop and parallel machine scheduling problems is a well-known NP-hard (Non-deterministic polynomial time) problem. Owing to high computational complexity involved in solving these problems, it is not always possible to obtain an optimal solution in a reasonable computation time. To obtain near-optimal solutions in a reasonable computation time, a large variety of meta-heuristics have been proposed in the past. However, tuning algorithm-specific parameters for solving FFSP is rather tricky and time consuming. To address this limitation, teaching-learning-based optimization (TLBO) and JAYA algorithm are chosen for the study because these are not only recent meta-heuristics but they do not require tuning of algorithm-specific parameters. Although these algorithms seem to be elegant, they lose solution diversity after few iterations and get trapped at the local optima. To alleviate such drawback, a new local search procedure is proposed in this paper to improve the solution quality. Further, mutation strategy (inspired from genetic algorithm) is incorporated in the basic algorithm to maintain solution diversity in the population. Computational experiments have been conducted on standard benchmark problems to calculate makespan and computational time. It is found that the rate of convergence of TLBO is superior to JAYA. From the results, it is found that TLBO and JAYA outperform many algorithms reported in the literature and can be treated as efficient methods for solving the FFSP.

  18. MULTICRITERIA HYBRID FLOW SHOP SCHEDULING PROBLEM: LITERATURE REVIEW, ANALYSIS, AND FUTURE RESEARCH

    Directory of Open Access Journals (Sweden)

    Marcia de Fatima Morais

    2014-12-01

    Full Text Available This research focuses on the Hybrid Flow Shop production scheduling problem, which is one of the most difficult problems to solve. The literature points to several studies that focus the Hybrid Flow Shop scheduling problem with monocriteria functions. Despite of the fact that, many real world problems involve several objective functions, they can often compete and conflict, leading researchers to concentrate direct their efforts on the development of methods that take consider this variant into consideration. The goal of the study is to review and analyze the methods in order to solve the Hybrid Flow Shop production scheduling problem with multicriteria functions in the literature. The analyses were performed using several papers that have been published over the years, also the parallel machines types, the approach used to develop solution methods, the type of method develop, the objective function, the performance criterion adopted, and the additional constraints considered. The results of the reviewing and analysis of 46 papers showed opportunities for future research on this topic, including the following: (i use uniform and dedicated parallel machines, (ii use exact and metaheuristics approaches, (iv develop lower and uppers bounds, relations of dominance and different search strategies to improve the computational time of the exact methods,  (v develop  other types of metaheuristic, (vi work with anticipatory setups, and (vii add constraints faced by the production systems itself.

  19. CERCLA document flow: Compressing the schedule, saving costs, and expediting review at the Savannah River Site

    International Nuclear Information System (INIS)

    Hoffman, W.D.

    1991-01-01

    The purpose of this paper is to convey the logic of the CERCLA document flow including Work Plans, Characterization Studies, Risk Assessments, Remedial Investigations, Feasibility Studies, proposed plans, and Records of Decision. The intent is to show how schedules at the Savannah River Site are being formulated to accomplish work using an observational approach where carefully planned tasks can be initiated early and carried out in parallel. This paper will share specific proactive experience in working with the EPA to expedite projects, begin removal actions, take interim actions, speed document flow, and eliminate unnecessary documents from the review cycle

  20. 77 FR 3544 - Meeting and Webinar on the Active Traffic and Demand Management and Intelligent Network Flow...

    Science.gov (United States)

    2012-01-24

    ... Intelligent Network Flow Optimization Operational Concepts; Notice of Public Meeting AGENCY: Research and... Demand Management (ADTM) and Intelligent Network Flow Optimization (INFLO) operational concepts. The ADTM... infrastructure. The vision for ATDM research is to allow transportation agencies to increase traffic flow...

  1. Continuous traffic flow modeling of driver support systems in multiclass traffic with inter-vehicle communication and drivers in the loop

    NARCIS (Netherlands)

    Tampere, C.M.J.; Hoogendoorn, S.P.; Arem, B. van

    2009-01-01

    This paper presents a continuous traffic-flow model for the explorative analysis of advanced driver-assistance systems (ADASs). Such systems use technology (sensors and intervehicle communication) to support the task of the driver, who retains full control over the vehicle. Based on a review of

  2. Literature Review on the Hybrid Flow Shop Scheduling Problem with Unrelated Parallel Machines

    Directory of Open Access Journals (Sweden)

    Eliana Marcela Peña Tibaduiza

    2017-01-01

    Full Text Available Context: The flow shop hybrid problem with unrelated parallel machines has been less studied in the academia compared to the flow shop hybrid with identical processors. For this reason, there are few reports about the kind of application of this problem in industries. Method: A literature review of the state of the art on flow-shop scheduling problem was conducted by collecting and analyzing academic papers on several scientific databases. For this aim, a search query was constructed using keywords defining the problem and checking the inclusion of unrelated parallel machines in such definition; as a result, 50 papers were finally selected for this study. Results: A classification of the problem according to the characteristics of the production system was performed, also solution methods, constraints and objective functions commonly used are presented. Conclusions: An increasing trend is observed in studies of flow shop with multiple stages, but few are based on industry case-studies.

  3. INVESTIGATION OF ROADWAY GEOMETRIC AND TRAFFIC FLOW FACTORS FOR VEHICLE CRASHES USING SPATIOTEMPORAL INTERACTION

    Directory of Open Access Journals (Sweden)

    G. Gill

    2017-09-01

    Full Text Available Traffic safety is a major concern in the transportation industry due to immense monetary and emotional burden caused by crashes of various severity levels, especially the injury and fatality ones. To reduce such crashes on all public roads, the safety management processes are commonly implemented which include network screening, problem diagnosis, countermeasure identification, and project prioritization. The selection of countermeasures for potential mitigation of crashes is governed by the influential factors which impact roadway crashes. Crash prediction model is the tool widely adopted by safety practitioners or researchers to link various influential factors to crash occurrences. Many different approaches have been used in the past studies to develop better fitting models which also exhibit prediction accuracy. In this study, a crash prediction model is developed to investigate the vehicular crashes occurring at roadway segments. The spatial and temporal nature of crash data is exploited to form a spatiotemporal model which accounts for the different types of heterogeneities among crash data and geometric or traffic flow variables. This study utilizes the Poisson lognormal model with random effects, which can accommodate the yearly variations in explanatory variables and the spatial correlations among segments. The dependency of different factors linked with roadway geometric, traffic flow, and road surface type on vehicular crashes occurring at segments was established as the width of lanes, posted speed limit, nature of pavement, and AADT were found to be correlated with vehicle crashes.

  4. Investigation of Roadway Geometric and Traffic Flow Factors for Vehicle Crashes Using Spatiotemporal Interaction

    Science.gov (United States)

    Gill, G.; Sakrani, T.; Cheng, W.; Zhou, J.

    2017-09-01

    Traffic safety is a major concern in the transportation industry due to immense monetary and emotional burden caused by crashes of various severity levels, especially the injury and fatality ones. To reduce such crashes on all public roads, the safety management processes are commonly implemented which include network screening, problem diagnosis, countermeasure identification, and project prioritization. The selection of countermeasures for potential mitigation of crashes is governed by the influential factors which impact roadway crashes. Crash prediction model is the tool widely adopted by safety practitioners or researchers to link various influential factors to crash occurrences. Many different approaches have been used in the past studies to develop better fitting models which also exhibit prediction accuracy. In this study, a crash prediction model is developed to investigate the vehicular crashes occurring at roadway segments. The spatial and temporal nature of crash data is exploited to form a spatiotemporal model which accounts for the different types of heterogeneities among crash data and geometric or traffic flow variables. This study utilizes the Poisson lognormal model with random effects, which can accommodate the yearly variations in explanatory variables and the spatial correlations among segments. The dependency of different factors linked with roadway geometric, traffic flow, and road surface type on vehicular crashes occurring at segments was established as the width of lanes, posted speed limit, nature of pavement, and AADT were found to be correlated with vehicle crashes.

  5. Self-Organization in 2D Traffic Flow Model with Jam-Avoiding Drive

    Science.gov (United States)

    Nagatani, Takashi

    1995-04-01

    A stochastic cellular automaton (CA) model is presented to investigate the traffic jam by self-organization in the two-dimensional (2D) traffic flow. The CA model is the extended version of the 2D asymmetric exclusion model to take into account jam-avoiding drive. Each site contains either a car moving to the up, a car moving to the right, or is empty. A up car can shift right with probability p ja if it is blocked ahead by other cars. It is shown that the three phases (the low-density phase, the intermediate-density phase and the high-density phase) appear in the traffic flow. The intermediate-density phase is characterized by the right moving of up cars. The jamming transition to the high-density jamming phase occurs with higher density of cars than that without jam-avoiding drive. The jamming transition point p 2c increases with the shifting probability p ja. In the deterministic limit of p ja=1, it is found that a new jamming transition occurs from the low-density synchronized-shifting phase to the high-density moving phase with increasing density of cars. In the synchronized-shifting phase, all up cars do not move to the up but shift to the right by synchronizing with the move of right cars. We show that the jam-avoiding drive has an important effect on the dynamical jamming transition.

  6. Phase-plane analysis to an “anisotropic” higher-order traffic flow model

    Science.gov (United States)

    Wu, Chun-Xiu

    2018-04-01

    The qualitative theory of differential equations is applied to investigate the traveling wave solution to an “anisotropic” higher-order viscous traffic flow model under the Lagrange coordinate system. The types and stabilities of the equilibrium points are discussed in the phase plane. Through the numerical simulation, the overall distribution structures of trajectories are drawn to analyze the relation between the phase diagram and the selected conservative solution variables, and the influences of the parameters on the system are studied. The limit-circle, limit circle-spiral point, saddle-spiral point and saddle-nodal point solutions are obtained. These steady-state solutions provide good explanation for the phenomena of the oscillatory and homogeneous congestions in real-world traffic.

  7. Urban traffic simulated from the dual representation: Flow, crisis and congestion

    International Nuclear Information System (INIS)

    Hu Maobin; Jiang Rui; Wang Ruili; Wu Qingsong

    2009-01-01

    We propose a traffic simulation model for urban system based on the dual graph representation of a urban road network and with a random entering vehicle rate. To avoid the shortcoming of 'Space Syntax' of ignoring the road's metric distance, we consider both the motion of the vehicles along roads and the navigation of the vehicles in the network. Simulations have shown some basic properties of urban traffic system, such as flux fluctuation, crisis and dissipation, phase transition from a free flow to jams, overall capacity, the distribution of traveling time, and the fundamental diagram. The system's behavior greatly depends on the topology of the transportation network. A well-planned lattice grid can keep more vehicles travelling. The critical entering vehicle rate is much greater in lattice grid than in a self-organized network. The vehicles have to travel longer time in a self-organized urban system due to the navigation cost.

  8. A hybrid quantum-inspired genetic algorithm for multiobjective flow shop scheduling.

    Science.gov (United States)

    Li, Bin-Bin; Wang, Ling

    2007-06-01

    This paper proposes a hybrid quantum-inspired genetic algorithm (HQGA) for the multiobjective flow shop scheduling problem (FSSP), which is a typical NP-hard combinatorial optimization problem with strong engineering backgrounds. On the one hand, a quantum-inspired GA (QGA) based on Q-bit representation is applied for exploration in the discrete 0-1 hyperspace by using the updating operator of quantum gate and genetic operators of Q-bit. Moreover, random-key representation is used to convert the Q-bit representation to job permutation for evaluating the objective values of the schedule solution. On the other hand, permutation-based GA (PGA) is applied for both performing exploration in permutation-based scheduling space and stressing exploitation for good schedule solutions. To evaluate solutions in multiobjective sense, a randomly weighted linear-sum function is used in QGA, and a nondominated sorting technique including classification of Pareto fronts and fitness assignment is applied in PGA with regard to both proximity and diversity of solutions. To maintain the diversity of the population, two trimming techniques for population are proposed. The proposed HQGA is tested based on some multiobjective FSSPs. Simulation results and comparisons based on several performance metrics demonstrate the effectiveness of the proposed HQGA.

  9. Multi-Objective Flexible Flow Shop Scheduling Problem Considering Variable Processing Time due to Renewable Energy

    Directory of Open Access Journals (Sweden)

    Xiuli Wu

    2018-03-01

    Full Text Available Renewable energy is an alternative to non-renewable energy to reduce the carbon footprint of manufacturing systems. Finding out how to make an alternative energy-efficient scheduling solution when renewable and non-renewable energy drives production is of great importance. In this paper, a multi-objective flexible flow shop scheduling problem that considers variable processing time due to renewable energy (MFFSP-VPTRE is studied. First, the optimization model of the MFFSP-VPTRE is formulated considering the periodicity of renewable energy and the limitations of energy storage capacity. Then, a hybrid non-dominated sorting genetic algorithm with variable local search (HNSGA-II is proposed to solve the MFFSP-VPTRE. An operation and machine-based encoding method is employed. A low-carbon scheduling algorithm is presented. Besides the crossover and mutation, a variable local search is used to improve the offspring’s Pareto set. The offspring and the parents are combined and those that dominate more are selected to continue evolving. Finally, two groups of experiments are carried out. The results show that the low-carbon scheduling algorithm can effectively reduce the carbon footprint under the premise of makespan optimization and the HNSGA-II outperforms the traditional NSGA-II and can solve the MFFSP-VPTRE effectively and efficiently.

  10. A Performance Assessment of an Airborne Separation Assistance System Using Realistic Complex Traffic Flows

    Science.gov (United States)

    Smith, Jeremy C.; Bussink, Frank J. L.

    2008-01-01

    This paper presents the results from a study that investigates the performance of a tactical Airborne Separation Assistance System (ASAS) in en route airspace, under varying demand levels, with realistic traffic flows. The ASAS concept studied here allows flight crews of equipped aircraft to perform separation from other air traffic autonomously. This study addresses the tactical aspects of an ASAS using aircraft state data (i.e. position and velocity) to detect and resolve projected conflicts. In addition, use of a conflict prevention system helps ASAS-equipped aircraft avoid maneuvers that may cause new conflicts. ASAS-capable aircraft are equipped with satellite-based navigation and Automatic Dependent Surveillance Broadcast (ADS-B) for transmission and receipt of aircraft state data. In addition to tactical conflict detection and resolution (CD&R), a complete, integrated ASAS is likely to incorporate a strategic CD&R component with a longer look-ahead time, using trajectory intent information. A system-wide traffic flow management (TFM) component, located at the FAA command center helps aircraft to avoid regions of excessive traffic density and complexity. A Traffic Alert and Collision Avoidance System (TCAS), as used today is the system of last resort. This integrated approach avoids sole reliance on the use of the tactical CD&R studied here, but the tactical component remains a critical element of the complete ASAS. The focus of this paper is to determine to what extent the proposed tactical component of ASAS alone can maintain aircraft separation at demand levels up to three times that of current traffic. The study also investigates the effect of mixing ASAS-equipped aircraft with unequipped aircraft (i.e. current day) that do not have the capability to self-separate. Position and velocity data for unequipped aircraft needs to be available to ASASequipped. Most likely, for this future concept, state data would be available from instrument flight rules (IFR

  11. Complex traffic flow that allows as well as hampers lane-changing intrinsically contains social-dilemma structures

    Science.gov (United States)

    Iwamura, Yoshiro; Tanimoto, Jun

    2018-02-01

    To investigate an interesting question as to whether or not social dilemma structures can be found in a realistic traffic flow reproduced by a model, we built a new microscopic model in which an intentional driver may try lane-changing to go in front of other vehicles and may hamper others’ lane-changes. Our model consists of twofold parts; cellular automaton emulating a real traffic flow and evolutionary game theory to implement a driver’s decision making-process. Numerical results reveal that a social dilemma like the multi-player chicken game or prisoner’s dilemma game emerges depending on the traffic phase. This finding implies that a social dilemma, which has been investigated by applied mathematics so far, hides behind a traffic flow, which has been explored by fluid dynamics. Highlight - Complex system of traffic flow with consideration of driver’s decision making process is concerned. - A new model dovetailing cellular automaton with game theory is established. - Statistical result from numerical simulations reveals a social dilemma structure underlying traffic flow. - The social dilemma is triggered by a driver’s egocentric actions of lane-changing and hampering other’s lane-change.

  12. Simulation evaluation of TIMER, a time-based, terminal air traffic, flow-management concept

    Science.gov (United States)

    Credeur, Leonard; Capron, William R.

    1989-01-01

    A description of a time-based, extended terminal area ATC concept called Traffic Intelligence for the Management of Efficient Runway scheduling (TIMER) and the results of a fast-time evaluation are presented. The TIMER concept is intended to bridge the gap between today's ATC system and a future automated time-based ATC system. The TIMER concept integrates en route metering, fuel-efficient cruise and profile descents, terminal time-based sequencing and spacing together with computer-generated controller aids, to improve delivery precision for fuller use of runway capacity. Simulation results identify and show the effects and interactions of such key variables as horizon of control location, delivery time error at both the metering fix and runway threshold, aircraft separation requirements, delay discounting, wind, aircraft heading and speed errors, and knowledge of final approach speed.

  13. Group Elevator Peak Scheduling Based on Robust Optimization Model

    Directory of Open Access Journals (Sweden)

    ZHANG, J.

    2013-08-01

    Full Text Available Scheduling of Elevator Group Control System (EGCS is a typical combinatorial optimization problem. Uncertain group scheduling under peak traffic flows has become a research focus and difficulty recently. RO (Robust Optimization method is a novel and effective way to deal with uncertain scheduling problem. In this paper, a peak scheduling method based on RO model for multi-elevator system is proposed. The method is immune to the uncertainty of peak traffic flows, optimal scheduling is realized without getting exact numbers of each calling floor's waiting passengers. Specifically, energy-saving oriented multi-objective scheduling price is proposed, RO uncertain peak scheduling model is built to minimize the price. Because RO uncertain model could not be solved directly, RO uncertain model is transformed to RO certain model by elevator scheduling robust counterparts. Because solution space of elevator scheduling is enormous, to solve RO certain model in short time, ant colony solving algorithm for elevator scheduling is proposed. Based on the algorithm, optimal scheduling solutions are found quickly, and group elevators are scheduled according to the solutions. Simulation results show the method could improve scheduling performances effectively in peak pattern. Group elevators' efficient operation is realized by the RO scheduling method.

  14. Outsourcing and scheduling for a two-machine flow shop with release times

    Science.gov (United States)

    Ahmadizar, Fardin; Amiri, Zeinab

    2018-03-01

    This article addresses a two-machine flow shop scheduling problem where jobs are released intermittently and outsourcing is allowed. The first operations of outsourced jobs are processed by the first subcontractor, they are transported in batches to the second subcontractor for processing their second operations, and finally they are transported back to the manufacturer. The objective is to select a subset of jobs to be outsourced, to schedule both the in-house and the outsourced jobs, and to determine a transportation plan for the outsourced jobs so as to minimize the sum of the makespan and the outsourcing and transportation costs. Two mathematical models of the problem and several necessary optimality conditions are presented. A solution approach is then proposed by incorporating the dominance properties with an ant colony algorithm. Finally, computational experiments are conducted to evaluate the performance of the models and solution approach.

  15. Efficient bounding schemes for the two-center hybrid flow shop scheduling problem with removal times.

    Science.gov (United States)

    Hidri, Lotfi; Gharbi, Anis; Louly, Mohamed Aly

    2014-01-01

    We focus on the two-center hybrid flow shop scheduling problem with identical parallel machines and removal times. The job removal time is the required duration to remove it from a machine after its processing. The objective is to minimize the maximum completion time (makespan). A heuristic and a lower bound are proposed for this NP-Hard problem. These procedures are based on the optimal solution of the parallel machine scheduling problem with release dates and delivery times. The heuristic is composed of two phases. The first one is a constructive phase in which an initial feasible solution is provided, while the second phase is an improvement one. Intensive computational experiments have been conducted to confirm the good performance of the proposed procedures.

  16. A Mutualism Quantum Genetic Algorithm to Optimize the Flow Shop Scheduling with Pickup and Delivery Considerations

    Directory of Open Access Journals (Sweden)

    Jinwei Gu

    2015-01-01

    Full Text Available A mutualism quantum genetic algorithm (MQGA is proposed for an integrated supply chain scheduling with the materials pickup, flow shop scheduling, and the finished products delivery. The objective is to minimize the makespan, that is, the arrival time of the last finished product to the customer. In MQGA, a new symbiosis strategy named mutualism is proposed to adjust the size of each population dynamically by regarding the mutual influence relation of the two subpopulations. A hybrid Q-bit coding method and a local speeding-up method are designed to increase the diversity of genes, and a checking routine is carried out to ensure the feasibility of each solution; that is, the total physical space of each delivery batch could not exceed the capacity of the vehicle. Compared with the modified genetic algorithm (MGA and the quantum-inspired genetic algorithm (QGA, the effectiveness and efficiency of the MQGA are validated by numerical experiments.

  17. Some exact solutions to the Lighthill–Whitham–Richards–Payne traffic flow equations

    International Nuclear Information System (INIS)

    Rowlands, G; Infeld, E; Skorupski, A A

    2013-01-01

    We find a class of exact solutions to the Lighthill–Whitham–Richards–Payne (LWRP) traffic flow equations. Using two consecutive Lagrangian transformations, a linearization is achieved. Next, depending on the initial density, we either apply (again two) Lambert functions and obtain exact formulae for the dependence of the car density and velocity on x, t, or else, failing that, the same result in a parametric representation. The calculation always involves two possible factorizations of a consistency condition. Both must be considered. In physical terms, the lineup usually separates into two offshoots at different velocities. Each velocity soon becomes uniform. This outcome in many ways resembles the two soliton solution to the Korteweg–de Vries equation. We check general conservation requirements. Although traffic flow research has developed tremendously since LWRP, this calculation, being exact, may open the door to solving similar problems, such as gas dynamics or water flow in rivers. With this possibility in mind, we outline the procedure in some detail at the end. (paper)

  18. Modeling mechanical restriction differences between car and heavy truck in two-lane cellular automata traffic flow model

    Science.gov (United States)

    Li, Xin; Li, Xingang; Xiao, Yao; Jia, Bin

    2016-06-01

    Real traffic is heterogeneous with car and truck. Due to mechanical restrictions, the car and the truck have different limited deceleration capabilities, which are important factors in safety driving. This paper extends the single lane safety driving (SD) model with limited deceleration capability to two-lane SD model, in which car-truck heterogeneous traffic is considered. A car has a larger limited deceleration capability while a heavy truck has a smaller limited deceleration capability as a result of loaded goods. Then the safety driving conditions are different as the types of the following and the leading vehicles vary. In order to eliminate the well-known plug in heterogeneous two-lane traffic, it is assumed that heavy truck has active deceleration behavior when the heavy truck perceives the forming plug. The lane-changing decisions are also determined by the safety driving conditions. The fundamental diagram, spatiotemporal diagram, and lane-changing frequency were investigated to show the effect of mechanical restriction on heterogeneous traffic flow. It was shown that there would be still three traffic phases in heterogeneous traffic condition; the active deceleration of the heavy truck could well eliminate the plug; the lane-changing frequency was low in synchronized flow; the flow and velocity would decrease as the proportion of heavy truck grows or the limited deceleration capability of heavy truck drops; and the flow could be improved with lane control measures.

  19. Modeling Mixed Bicycle Traffic Flow: A Comparative Study on the Cellular Automata Approach

    Directory of Open Access Journals (Sweden)

    Dan Zhou

    2015-01-01

    Full Text Available Simulation, as a powerful tool for evaluating transportation systems, has been widely used in transportation planning, management, and operations. Most of the simulation models are focused on motorized vehicles, and the modeling of nonmotorized vehicles is ignored. The cellular automata (CA model is a very important simulation approach and is widely used for motorized vehicle traffic. The Nagel-Schreckenberg (NS CA model and the multivalue CA (M-CA model are two categories of CA model that have been used in previous studies on bicycle traffic flow. This paper improves on these two CA models and also compares their characteristics. It introduces a two-lane NS CA model and M-CA model for both regular bicycles (RBs and electric bicycles (EBs. In the research for this paper, many cases, featuring different values for the slowing down probability, lane-changing probability, and proportion of EBs, were simulated, while the fundamental diagrams and capacities of the proposed models were analyzed and compared between the two models. Field data were collected for the evaluation of the two models. The results show that the M-CA model exhibits more stable performance than the two-lane NS model and provides results that are closer to real bicycle traffic.

  20. An improved multi-value cellular automata model for heterogeneous bicycle traffic flow

    Energy Technology Data Exchange (ETDEWEB)

    Jin, Sheng [College of Civil Engineering and Architecture, Zhejiang University, Hangzhou, 310058 China (China); Qu, Xiaobo [Griffith School of Engineering, Griffith University, Gold Coast, 4222 Australia (Australia); Xu, Cheng [Department of Transportation Management Engineering, Zhejiang Police College, Hangzhou, 310053 China (China); College of Transportation, Jilin University, Changchun, 130022 China (China); Ma, Dongfang, E-mail: mdf2004@zju.edu.cn [Ocean College, Zhejiang University, Hangzhou, 310058 China (China); Wang, Dianhai [College of Civil Engineering and Architecture, Zhejiang University, Hangzhou, 310058 China (China)

    2015-10-16

    This letter develops an improved multi-value cellular automata model for heterogeneous bicycle traffic flow taking the higher maximum speed of electric bicycles into consideration. The update rules of both regular and electric bicycles are improved, with maximum speeds of two and three cells per second respectively. Numerical simulation results for deterministic and stochastic cases are obtained. The fundamental diagrams and multiple states effects under different model parameters are analyzed and discussed. Field observations were made to calibrate the slowdown probabilities. The results imply that the improved extended Burgers cellular automata (IEBCA) model is more consistent with the field observations than previous models and greatly enhances the realism of the bicycle traffic model. - Highlights: • We proposed an improved multi-value CA model with higher maximum speed. • Update rules are introduced for heterogeneous bicycle traffic with maximum speed 2 and 3 cells/s. • Simulation results of the proposed model are consistent with field bicycle data. • Slowdown probabilities of both regular and electric bicycles are calibrated.

  1. An improved multi-value cellular automata model for heterogeneous bicycle traffic flow

    International Nuclear Information System (INIS)

    Jin, Sheng; Qu, Xiaobo; Xu, Cheng; Ma, Dongfang; Wang, Dianhai

    2015-01-01

    This letter develops an improved multi-value cellular automata model for heterogeneous bicycle traffic flow taking the higher maximum speed of electric bicycles into consideration. The update rules of both regular and electric bicycles are improved, with maximum speeds of two and three cells per second respectively. Numerical simulation results for deterministic and stochastic cases are obtained. The fundamental diagrams and multiple states effects under different model parameters are analyzed and discussed. Field observations were made to calibrate the slowdown probabilities. The results imply that the improved extended Burgers cellular automata (IEBCA) model is more consistent with the field observations than previous models and greatly enhances the realism of the bicycle traffic model. - Highlights: • We proposed an improved multi-value CA model with higher maximum speed. • Update rules are introduced for heterogeneous bicycle traffic with maximum speed 2 and 3 cells/s. • Simulation results of the proposed model are consistent with field bicycle data. • Slowdown probabilities of both regular and electric bicycles are calibrated

  2. Mechanisms of jamming in the Nagel-Schreckenberg model for traffic flow

    Science.gov (United States)

    Bette, Henrik M.; Habel, Lars; Emig, Thorsten; Schreckenberg, Michael

    2017-01-01

    We study the Nagel-Schreckenberg cellular automata model for traffic flow by both simulations and analytical techniques. To better understand the nature of the jamming transition, we analyze the fraction of stopped cars P (v =0 ) as a function of the mean car density. We present a simple argument that yields an estimate for the free density where jamming occurs, and show satisfying agreement with simulation results. We demonstrate that the fraction of jammed cars P (v ∈{0 ,1 }) can be decomposed into the three factors (jamming rate, jam lifetime, and jam size) for which we derive, from random walk arguments, exponents that control their scaling close to the critical density.

  3. New scheduling rules for a dynamic flexible flow line problem with sequence-dependent setup times

    Science.gov (United States)

    Kia, Hamidreza; Ghodsypour, Seyed Hassan; Davoudpour, Hamid

    2017-09-01

    In the literature, the application of multi-objective dynamic scheduling problem and simple priority rules are widely studied. Although these rules are not efficient enough due to simplicity and lack of general insight, composite dispatching rules have a very suitable performance because they result from experiments. In this paper, a dynamic flexible flow line problem with sequence-dependent setup times is studied. The objective of the problem is minimization of mean flow time and mean tardiness. A 0-1 mixed integer model of the problem is formulated. Since the problem is NP-hard, four new composite dispatching rules are proposed to solve it by applying genetic programming framework and choosing proper operators. Furthermore, a discrete-event simulation model is made to examine the performances of scheduling rules considering four new heuristic rules and the six adapted heuristic rules from the literature. It is clear from the experimental results that composite dispatching rules that are formed from genetic programming have a better performance in minimization of mean flow time and mean tardiness than others.

  4. Flow shop scheduling decisions through Techniques for Order Preference by Similarity to an Ideal Solution (TOPSIS

    Directory of Open Access Journals (Sweden)

    Arun Gupta

    2016-07-01

    Full Text Available The flow-shop scheduling problem (FSP has been widely studied in the literature and having a very active research area. Over the last few decades, a number of heuristic/meta-heuristic solution techniques have been developed. Some of these techniques offer excellent effectiveness and efficiency at the expense of substantial implementation efforts and being extremely complicated. This paper brings out the application of a Multi-Criteria Decision Making (MCDM method known as techniques for order preference by similarity to an ideal solution (TOPSIS using different weighting schemes in flow-shop environment. The objective function is identification of a job sequence which in turn would have minimum makespan (total job completion time. The application of the proposed method to flow shop scheduling is presented and explained with a numerical example. The results of the proposed TOPSIS based technique of FSP are also compared on the basis of some benchmark problems and found compatible with the results obtained from other standard procedures.

  5. A Bee Colony Optimization Approach for Mixed Blocking Constraints Flow Shop Scheduling Problems

    Directory of Open Access Journals (Sweden)

    Mostafa Khorramizadeh

    2015-01-01

    Full Text Available The flow shop scheduling problems with mixed blocking constraints with minimization of makespan are investigated. The Taguchi orthogonal arrays and path relinking along with some efficient local search methods are used to develop a metaheuristic algorithm based on bee colony optimization. In order to compare the performance of the proposed algorithm, two well-known test problems are considered. Computational results show that the presented algorithm has comparative performance with well-known algorithms of the literature, especially for the large sized problems.

  6. A Local Search Algorithm for the Flow Shop Scheduling Problem with Release Dates

    Directory of Open Access Journals (Sweden)

    Tao Ren

    2015-01-01

    Full Text Available This paper discusses the flow shop scheduling problem to minimize the makespan with release dates. By resequencing the jobs, a modified heuristic algorithm is obtained for handling large-sized problems. Moreover, based on some properties, a local search scheme is provided to improve the heuristic to gain high-quality solution for moderate-sized problems. A sequence-independent lower bound is presented to evaluate the performance of the algorithms. A series of simulation results demonstrate the effectiveness of the proposed algorithms.

  7. Optimal Research and Numerical Simulation for Scheduling No-Wait Flow Shop in Steel Production

    Directory of Open Access Journals (Sweden)

    Huawei Yuan

    2013-01-01

    Full Text Available This paper considers the m-machine flow shop scheduling problem with the no-wait constraint to minimize total completion time which is the typical model in steel production. First, the asymptotic optimality of the Shortest Processing Time (SPT first rule is proven for this problem. To further evaluate the performance of the algorithm, a new lower bound with performance guarantee is designed. At the end of the paper, numerical simulations show the effectiveness of the proposed algorithm and lower bound.

  8. A Hybrid Short-Term Traffic Flow Prediction Model Based on Singular Spectrum Analysis and Kernel Extreme Learning Machine.

    Directory of Open Access Journals (Sweden)

    Qiang Shang

    Full Text Available Short-term traffic flow prediction is one of the most important issues in the field of intelligent transport system (ITS. Because of the uncertainty and nonlinearity, short-term traffic flow prediction is a challenging task. In order to improve the accuracy of short-time traffic flow prediction, a hybrid model (SSA-KELM is proposed based on singular spectrum analysis (SSA and kernel extreme learning machine (KELM. SSA is used to filter out the noise of traffic flow time series. Then, the filtered traffic flow data is used to train KELM model, the optimal input form of the proposed model is determined by phase space reconstruction, and parameters of the model are optimized by gravitational search algorithm (GSA. Finally, case validation is carried out using the measured data of an expressway in Xiamen, China. And the SSA-KELM model is compared with several well-known prediction models, including support vector machine, extreme learning machine, and single KLEM model. The experimental results demonstrate that performance of the proposed model is superior to that of the comparison models. Apart from accuracy improvement, the proposed model is more robust.

  9. A Sarsa(λ)-based control model for real-time traffic light coordination.

    Science.gov (United States)

    Zhou, Xiaoke; Zhu, Fei; Liu, Quan; Fu, Yuchen; Huang, Wei

    2014-01-01

    Traffic problems often occur due to the traffic demands by the outnumbered vehicles on road. Maximizing traffic flow and minimizing the average waiting time are the goals of intelligent traffic control. Each junction wants to get larger traffic flow. During the course, junctions form a policy of coordination as well as constraints for adjacent junctions to maximize their own interests. A good traffic signal timing policy is helpful to solve the problem. However, as there are so many factors that can affect the traffic control model, it is difficult to find the optimal solution. The disability of traffic light controllers to learn from past experiences caused them to be unable to adaptively fit dynamic changes of traffic flow. Considering dynamic characteristics of the actual traffic environment, reinforcement learning algorithm based traffic control approach can be applied to get optimal scheduling policy. The proposed Sarsa(λ)-based real-time traffic control optimization model can maintain the traffic signal timing policy more effectively. The Sarsa(λ)-based model gains traffic cost of the vehicle, which considers delay time, the number of waiting vehicles, and the integrated saturation from its experiences to learn and determine the optimal actions. The experiment results show an inspiring improvement in traffic control, indicating the proposed model is capable of facilitating real-time dynamic traffic control.

  10. A Sarsa(λ-Based Control Model for Real-Time Traffic Light Coordination

    Directory of Open Access Journals (Sweden)

    Xiaoke Zhou

    2014-01-01

    Full Text Available Traffic problems often occur due to the traffic demands by the outnumbered vehicles on road. Maximizing traffic flow and minimizing the average waiting time are the goals of intelligent traffic control. Each junction wants to get larger traffic flow. During the course, junctions form a policy of coordination as well as constraints for adjacent junctions to maximize their own interests. A good traffic signal timing policy is helpful to solve the problem. However, as there are so many factors that can affect the traffic control model, it is difficult to find the optimal solution. The disability of traffic light controllers to learn from past experiences caused them to be unable to adaptively fit dynamic changes of traffic flow. Considering dynamic characteristics of the actual traffic environment, reinforcement learning algorithm based traffic control approach can be applied to get optimal scheduling policy. The proposed Sarsa(λ-based real-time traffic control optimization model can maintain the traffic signal timing policy more effectively. The Sarsa(λ-based model gains traffic cost of the vehicle, which considers delay time, the number of waiting vehicles, and the integrated saturation from its experiences to learn and determine the optimal actions. The experiment results show an inspiring improvement in traffic control, indicating the proposed model is capable of facilitating real-time dynamic traffic control.

  11. Scheduling stochastic two-machine flow shop problems to minimize expected makespan

    Directory of Open Access Journals (Sweden)

    Mehdi Heydari

    2013-07-01

    Full Text Available During the past few years, despite tremendous contribution on deterministic flow shop problem, there are only limited number of works dedicated on stochastic cases. This paper examines stochastic scheduling problems in two-machine flow shop environment for expected makespan minimization where processing times of jobs are normally distributed. Since jobs have stochastic processing times, to minimize the expected makespan, the expected sum of the second machine’s free times is minimized. In other words, by minimization waiting times for the second machine, it is possible to reach the minimum of the objective function. A mathematical method is proposed which utilizes the properties of the normal distributions. Furthermore, this method can be used as a heuristic method for other distributions, as long as the means and variances are available. The performance of the proposed method is explored using some numerical examples.

  12. Counting the corners of a random walk and its application to traffic flow

    International Nuclear Information System (INIS)

    Knorr, Florian; Schreckenberg, Michael

    2012-01-01

    We study a system with two types of interacting particles on a one-dimensional lattice. Particles of the first type, which we call ‘active’, are able to detect particles of the second type (called ‘passive’). By relating the problem to a discrete random walk in one dimension with a fixed number of steps we determine the fraction of active and detected particles for both open and periodic boundary conditions as well as for the case where passive particles interact with both or only one neighbors. In the random walk picture, where the two particles types stand for steps in opposite directions, passive particles are detected whenever the resulting path has a corner. For open boundary conditions, it turns out that a simple mean field approximation reproduces the exact result if the particles interact with one neighbor only. A practical application of this problem is heterogeneous traffic flow with communicating and non-communicating vehicles. In this context communicating vehicles can be thought of as active particles which can by front (and rear) sensors detect the vehicle ahead (and behind) although these vehicles do not actively share information. Therefore, we also present simulation results which show the validity of our analysis for real traffic flow. (paper)

  13. A mixed-mode traffic assignment model with new time-flow impedance function

    Science.gov (United States)

    Lin, Gui-Hua; Hu, Yu; Zou, Yuan-Yang

    2018-01-01

    Recently, with the wide adoption of electric vehicles, transportation network has shown different characteristics and been further developed. In this paper, we present a new time-flow impedance function, which may be more realistic than the existing time-flow impedance functions. Based on this new impedance function, we present an optimization model for a mixed-mode traffic network in which battery electric vehicles (BEVs) and gasoline vehicles (GVs) are chosen. We suggest two approaches to handle the model: One is to use the interior point (IP) algorithm and the other is to employ the sequential quadratic programming (SQP) algorithm. Three numerical examples are presented to illustrate the efficiency of these approaches. In particular, our numerical results show that more travelers prefer to choosing BEVs when the distance limit of BEVs is long enough and the unit operating cost of GVs is higher than that of BEVs, and the SQP algorithm is faster than the IP algorithm.

  14. Nonlocal multi-scale traffic flow models: analysis beyond vector spaces

    Directory of Open Access Journals (Sweden)

    Peter E. Kloeden

    2016-08-01

    Full Text Available Abstract Realistic models of traffic flow are nonlinear and involve nonlocal effects in balance laws. Flow characteristics of different types of vehicles, such as cars and trucks, need to be described differently. Two alternatives are used here, $$L^p$$ L p -valued Lebesgue measurable density functions and signed Radon measures. The resulting solution spaces are metric spaces that do not have a linear structure, so the usual convenient methods of functional analysis are no longer applicable. Instead ideas from mutational analysis will be used, in particular the method of Euler compactness will be applied to establish the well-posedness of the nonlocal balance laws. This involves the concatenation of solutions of piecewise linear systems on successive time subintervals obtained by freezing the nonlinear nonlocal coefficients to their values at the start of each subinterval. Various compactness criteria lead to a convergent subsequence. Careful estimates of the linear systems are needed to implement this program.

  15. Impacts of Traffic Tidal Flow on Pollutant Dispersion in a Non-Uniform Urban Street Canyon

    Directory of Open Access Journals (Sweden)

    Tingzhen Ming

    2018-02-01

    Full Text Available A three-dimensional geometrical model was established based on a section of street canyons in the 2nd Ring Road of Wuhan, China, and a mathematical model describing the fluid flow and pollutant dispersion characteristics in the street canyon was developed. The effect of traffic tidal flow was investigated based on the measurement results of the passing vehicles as the pollution source of the CFD method and on the spatial distribution of pollutants under various ambient crosswinds. Numerical investigation results indicated that: (i in this three-dimensional asymmetrical shallow street canyon, if the pollution source followed a non-uniform distribution due to the traffic tidal flow and the wind flow was perpendicular to the street, a leeward side source intensity stronger than the windward side intensity would cause an expansion of the pollution space even if the total source in the street is equal. When the ambient wind speed is 3 m/s, the pollutant source intensity near the leeward side that is stronger than that near the windward side (R = 2, R = 3, and R = 5 leads to an increased average concentration of CO at pedestrian breathing height by 26%, 37%, and 41%, respectively. (R is the ratio parameter of the left side pollution source and the right side pollution source; (ii However, this feature will become less significant with increasing wind speeds and changes of wind direction; (iii the pollution source intensity exerted a decisive influence on the pollutant level in the street canyon. With the decrease of the pollution source intensity, the pollutant concentration decreased proportionally.

  16. Traffic management simulation development : summary.

    Science.gov (United States)

    2011-01-01

    Increasingly, Florida traffic is monitored electronically by components of the Intelligent Traffic System (ITS), which send data to regional traffic management centers and assist management of traffic flows and incident response using software called...

  17. CONTROLLING TRAFFIC FLOW IN MULTILANE-ISOLATED INTERSECTION USING ANFIS APPROACH TECHNIQUES

    OpenAIRE

    G. R. LAI; A. CHE SOH; H. MD. SARKAN; R. Z. ABDUL RAHMAN; M. K. HASSAN

    2015-01-01

    Many controllers have applied the Adaptive Neural-Fuzzy Inference System (ANFIS) concept for optimizing the controller performance. However, there are less traffic signal controllers developed using the ANFIS concept. ANFIS traffic signal controller with its fuzzy rule base and its ability to learn from a set of sample data could improve the performance of Existing traffic signal controlling system to reduce traffic congestions at most of the busy traffic intersections in city such as Kuala L...

  18. Effect of adaptive cruise control systems on mixed traffic flow near an on-ramp

    Science.gov (United States)

    Davis, L. C.

    2007-06-01

    Mixed traffic flow consisting of vehicles equipped with adaptive cruise control (ACC) and manually driven vehicles is analyzed using car-following simulations. Simulations of merging from an on-ramp onto a freeway reported in the literature have not thus far demonstrated a substantial positive impact of ACC. In this paper cooperative merging for ACC vehicles is proposed to improve throughput and increase distance traveled in a fixed time. In such a system an ACC vehicle senses not only the preceding vehicle in the same lane but also the vehicle immediately in front in the other lane. Prior to reaching the merge region, the ACC vehicle adjusts its velocity to ensure that a safe gap for merging is obtained. If on-ramp demand is moderate, cooperative merging produces significant improvement in throughput (20%) and increases up to 3.6 km in distance traveled in 600 s for 50% ACC mixed flow relative to the flow of all-manual vehicles. For large demand, it is shown that autonomous merging with cooperation in the flow of all ACC vehicles leads to throughput limited only by the downstream capacity, which is determined by speed limit and headway time.

  19. LightFD: A Lightweight Flow Detection Mechanism for Traffic Grooming in Optical Wireless DCNs

    KAUST Repository

    Al-Ghadhban, Amer

    2018-05-05

    State of the art wireless technologies have recently shown a great potential for enabling re-configurable data center network (DCN) topologies by augmenting the cabling complexity and link inflexibility of traditional wired data centers (DCs). In this paper, we propose an optical traffic grooming (TG) method for mice flows (MFs) and elephant flows (EFs) in wireless DCNs which are interconnected with wavelength division multiplexing (WDM) capable free-space optical (FSO) links. Since handling the bandwidth-hungry EFs along with delay-sensitive MFs over the same network resources have undesirable consequences, proposed TG policy handles MFs and EFs over distinctive network resources. MFs/EFs destined to the same rack are groomed into larger rack-to-rack MF/EF flows over dedicated lightpaths whose routes and capacities are jointly determined in a load balancing manner. Performance evaluations of proposed TG policy show a significant throughput improvement thanks to efficient bandwidth utilization of the WDM-FSO links. As MFs and EFs are needed to be separated, proposed TG requires expeditious flow detection mechanisms which can immediately classify EFs with very high accuracy. Since these cannot be met by existing packet-sampling and port-mirroring based solutions, we propose a fast and lightweight in-network flow detection (LightFD) mechanism with perfect accuracy. LightFD is designed as a module on the Virtual-Switch/Hypervisor, which detects EFs based on acknowledgment sequence number of flow packets. Emulation results show that LightFD can provide up to 500 times faster detection speeds than the sampling-based methods with %100 detection precision. We also demonstrate that the EF detection speed has a considerable impact on achievable EF throughput.

  20. A hybrid flow shop model for an ice cream production scheduling problem

    Directory of Open Access Journals (Sweden)

    Imma Ribas Vila

    2009-07-01

    Full Text Available Normal 0 21 false false false ES X-NONE X-NONE /* Style Definitions */ table.MsoNormalTable {mso-style-name:"Taula normal"; mso-tstyle-rowband-size:0; mso-tstyle-colband-size:0; mso-style-noshow:yes; mso-style-priority:99; mso-style-qformat:yes; mso-style-parent:""; mso-padding-alt:0cm 5.4pt 0cm 5.4pt; mso-para-margin:0cm; mso-para-margin-bottom:.0001pt; mso-pagination:widow-orphan; font-size:10.0pt; font-family:"Times New Roman","serif";} In this paper we address the scheduling problem that comes from an ice cream manufacturing company. This production system can be modelled as a three stage nowait hybrid flow shop with batch dependent setup costs. To contribute reducing the gap between theory and practice we have considered the real constraints and the criteria used by planners. The problem considered has been formulated as a mixed integer programming. Further, two competitive heuristic procedures have been developed and one of them will be proposed to schedule in the ice cream factory.

  1. A multipopulation PSO based memetic algorithm for permutation flow shop scheduling.

    Science.gov (United States)

    Liu, Ruochen; Ma, Chenlin; Ma, Wenping; Li, Yangyang

    2013-01-01

    The permutation flow shop scheduling problem (PFSSP) is part of production scheduling, which belongs to the hardest combinatorial optimization problem. In this paper, a multipopulation particle swarm optimization (PSO) based memetic algorithm (MPSOMA) is proposed in this paper. In the proposed algorithm, the whole particle swarm population is divided into three subpopulations in which each particle evolves itself by the standard PSO and then updates each subpopulation by using different local search schemes such as variable neighborhood search (VNS) and individual improvement scheme (IIS). Then, the best particle of each subpopulation is selected to construct a probabilistic model by using estimation of distribution algorithm (EDA) and three particles are sampled from the probabilistic model to update the worst individual in each subpopulation. The best particle in the entire particle swarm is used to update the global optimal solution. The proposed MPSOMA is compared with two recently proposed algorithms, namely, PSO based memetic algorithm (PSOMA) and hybrid particle swarm optimization with estimation of distribution algorithm (PSOEDA), on 29 well-known PFFSPs taken from OR-library, and the experimental results show that it is an effective approach for the PFFSP.

  2. A Multipopulation PSO Based Memetic Algorithm for Permutation Flow Shop Scheduling

    Directory of Open Access Journals (Sweden)

    Ruochen Liu

    2013-01-01

    Full Text Available The permutation flow shop scheduling problem (PFSSP is part of production scheduling, which belongs to the hardest combinatorial optimization problem. In this paper, a multipopulation particle swarm optimization (PSO based memetic algorithm (MPSOMA is proposed in this paper. In the proposed algorithm, the whole particle swarm population is divided into three subpopulations in which each particle evolves itself by the standard PSO and then updates each subpopulation by using different local search schemes such as variable neighborhood search (VNS and individual improvement scheme (IIS. Then, the best particle of each subpopulation is selected to construct a probabilistic model by using estimation of distribution algorithm (EDA and three particles are sampled from the probabilistic model to update the worst individual in each subpopulation. The best particle in the entire particle swarm is used to update the global optimal solution. The proposed MPSOMA is compared with two recently proposed algorithms, namely, PSO based memetic algorithm (PSOMA and hybrid particle swarm optimization with estimation of distribution algorithm (PSOEDA, on 29 well-known PFFSPs taken from OR-library, and the experimental results show that it is an effective approach for the PFFSP.

  3. Effective Iterated Greedy Algorithm for Flow-Shop Scheduling Problems with Time lags

    Science.gov (United States)

    ZHAO, Ning; YE, Song; LI, Kaidian; CHEN, Siyu

    2017-05-01

    Flow shop scheduling problem with time lags is a practical scheduling problem and attracts many studies. Permutation problem(PFSP with time lags) is concentrated but non-permutation problem(non-PFSP with time lags) seems to be neglected. With the aim to minimize the makespan and satisfy time lag constraints, efficient algorithms corresponding to PFSP and non-PFSP problems are proposed, which consist of iterated greedy algorithm for permutation(IGTLP) and iterated greedy algorithm for non-permutation (IGTLNP). The proposed algorithms are verified using well-known simple and complex instances of permutation and non-permutation problems with various time lag ranges. The permutation results indicate that the proposed IGTLP can reach near optimal solution within nearly 11% computational time of traditional GA approach. The non-permutation results indicate that the proposed IG can reach nearly same solution within less than 1% computational time compared with traditional GA approach. The proposed research combines PFSP and non-PFSP together with minimal and maximal time lag consideration, which provides an interesting viewpoint for industrial implementation.

  4. An extended continuous estimation of distribution algorithm for solving the permutation flow-shop scheduling problem

    Science.gov (United States)

    Shao, Zhongshi; Pi, Dechang; Shao, Weishi

    2017-11-01

    This article proposes an extended continuous estimation of distribution algorithm (ECEDA) to solve the permutation flow-shop scheduling problem (PFSP). In ECEDA, to make a continuous estimation of distribution algorithm (EDA) suitable for the PFSP, the largest order value rule is applied to convert continuous vectors to discrete job permutations. A probabilistic model based on a mixed Gaussian and Cauchy distribution is built to maintain the exploration ability of the EDA. Two effective local search methods, i.e. revolver-based variable neighbourhood search and Hénon chaotic-based local search, are designed and incorporated into the EDA to enhance the local exploitation. The parameters of the proposed ECEDA are calibrated by means of a design of experiments approach. Simulation results and comparisons based on some benchmark instances show the efficiency of the proposed algorithm for solving the PFSP.

  5. New Mathematical Model and Algorithm for Economic Lot Scheduling Problem in Flexible Flow Shop

    Directory of Open Access Journals (Sweden)

    H. Zohali

    2018-03-01

    Full Text Available This paper addresses the lot sizing and scheduling problem for a number of products in flexible flow shop with identical parallel machines. The production stages are in series, while separated by finite intermediate buffers. The objective is to minimize the sum of setup and inventory holding costs per unit of time. The available mathematical model of this problem in the literature suffers from huge complexity in terms of size and computation. In this paper, a new mixed integer linear program is developed for delay with the huge dimentions of the problem. Also, a new meta heuristic algorithm is developed for the problem. The results of the numerical experiments represent a significant advantage of the proposed model and algorithm compared with the available models and algorithms in the literature.

  6. Rapid transporter regulation prevents substrate flow traffic jams in boron transport

    Science.gov (United States)

    Sotta, Naoyuki; Duncan, Susan; Tanaka, Mayuki; Sato, Takafumi

    2017-01-01

    Nutrient uptake by roots often involves substrate-dependent regulated nutrient transporters. For robust uptake, the system requires a regulatory circuit within cells and a collective, coordinated behaviour across the tissue. A paradigm for such systems is boron uptake, known for its directional transport and homeostasis, as boron is essential for plant growth but toxic at high concentrations. In Arabidopsis thaliana, boron uptake occurs via diffusion facilitators (NIPs) and exporters (BORs), each presenting distinct polarity. Intriguingly, although boron soil concentrations are homogenous and stable, both transporters manifest strikingly swift boron-dependent regulation. Through mathematical modelling, we demonstrate that slower regulation of these transporters leads to physiologically detrimental oscillatory behaviour. Cells become periodically exposed to potentially cytotoxic boron levels, and nutrient throughput to the xylem becomes hampered. We conclude that, while maintaining homeostasis, swift transporter regulation within a polarised tissue context is critical to prevent intrinsic traffic-jam like behaviour of nutrient flow. PMID:28870285

  7. Equation-Free Analysis of Macroscopic Behavior in Traffic and Pedestrian Flow

    DEFF Research Database (Denmark)

    Marschler, Christian; Sieber, Jan; Hjorth, Poul G.

    2014-01-01

    Equation-free methods make possible an analysis of the evolution of a few coarse-grained or macroscopic quantities for a detailed and realistic model with a large number of fine-grained or microscopic variables, even though no equations are explicitly given on the macroscopic level. This will fac......Equation-free methods make possible an analysis of the evolution of a few coarse-grained or macroscopic quantities for a detailed and realistic model with a large number of fine-grained or microscopic variables, even though no equations are explicitly given on the macroscopic level....... This will facilitate a study of how the model behavior depends on parameter values including an understanding of transitions between different types of qualitative behavior. These methods are introduced and explained for traffic jam formation and emergence of oscillatory pedestrian counter flow in a corridor...

  8. A Priority Rule-Based Heuristic for Resource Investment Project Scheduling Problem with Discounted Cash Flows and Tardiness Penalties

    Directory of Open Access Journals (Sweden)

    Amir Abbas Najafi

    2009-01-01

    Full Text Available Resource investment problem with discounted cash flows (RIPDCFs is a class of project scheduling problem. In RIPDCF, the availability levels of the resources are considered decision variables, and the goal is to find a schedule such that the net present value of the project cash flows optimizes. In this paper, we consider a new RIPDCF in which tardiness of project is permitted with defined penalty. We mathematically formulated the problem and developed a heuristic method to solve it. The results of the performance analysis of the proposed method show an effective solution approach to the problem.

  9. Traffic Management for Next Generation Transport Networks

    DEFF Research Database (Denmark)

    Yu, Hao

    required by the next generation transport network to provide Quality-of-Service (QoS) guaranteed video services. Augmenting network capacity and upgrading network nodes indicate long deployment period, replacement of equipment and thus significant cost to the network service providers. This challenge may...... slacken the steps of some network operators towards providing IPTV services. In this dissertation, the topology-based hierarchical scheduling scheme is proposed to tackle the problem addressed. The scheme simplifies the deployment process by placing an intelligent switch with centralized traffic...... management functions at the edge of the network, scheduling traffic on behalf of the other nodes. The topology-based hierarchical scheduling scheme is able to provide outstanding flow isolation due to its centralized scheduling ability, which is essential for providing IPTV services. In order to reduce...

  10. Simulation Study of the Effect of Decreasing Truck Traffic Flow on Safety on Almeria-Barcelona Corridor

    Energy Technology Data Exchange (ETDEWEB)

    Dadashova, B.

    2016-07-01

    In this paper the effect of truck traffic on road safety has been analyzed through simulation study. The main objective of the study is to quantify the effect of the decreasing average annual daily traffic of heavy duty vehicles (trucks) on road safety. As the road safety indicators the frequency road accidents is considered. The data used in the study were collected from one of the most crowded routes in Spain which connects Almeria (south-east) with Barcelona (northeast). The observed data covers year 2010 and were classified into 2 road types: dual carriageways and toll roads. The estimation was carried out using negative binomial model and Markov Chain Monte Carlo simulation. Using the estimation results new traffic scenarios were proposed where the traffic flow is assumed to change its values. A total of 33 scenarios were proposed and new accidents data were generated through MCMC sampling. The comparison of the simulated and observed accident data shows that the effect of decreasing truck traffic flow could meliorate road safety in the route. The simulation tool could be applied to evaluate the effects of freight modal shift from road to rail. (Author)

  11. Signal Control for Reducing Vehicle NOx and CO2 Emissions Based on Prediction of Arrival Traffic Flows at Intersections

    Science.gov (United States)

    Oda, Toshihiko

    Nitrogen oxide (NOx) and carbon dioxide (CO2) emissions from vehicles have been increasing every year because of the growing number of vehicles, and they cause serious environmental problems such as air pollution and global warming. To alleviate these problems, this paper proposes a new traffic signal control method for reducing vehicle NOx and CO2 emissions on arterial roads. To this end, we first model the amount of vehicle emissions as a function of the traffic delay and the number of stops at intersections. This step is necessary because it is difficult to obtain the amount of emissions directly using traffic control systems. Second, we introduce a signal control model in which the control parameters are continuously updated on the basis of predictions of arrival traffic flows at intersections. The signal timings are calculated in such a manner so as to minimize the weighted sum of the two emissions, which depend on the traffic flow. To evaluate the validity of this method, simulation experiments are carried out on an arterial road. The experiments show that the proposed method significantly outperforms existing methods in reducing both the emissions and travel time.

  12. Evaluating the performance of constructive heuristics for the blocking flow shop scheduling problem with setup times

    Directory of Open Access Journals (Sweden)

    Mauricio Iwama Takano

    2019-01-01

    Full Text Available This paper addresses the minimization of makespan for the permutation flow shop scheduling problem with blocking and sequence and machine dependent setup times, a problem not yet studied in previous studies. The 14 best known heuristics for the permutation flow shop problem with blocking and no setup times are pre-sented and then adapted to the problem in two different ways; resulting in 28 different heuristics. The heuristics are then compared using the Taillard database. As there is no other work that addresses the problem with blocking and sequence and ma-chine dependent setup times, a database for the setup times was created. The setup time value was uniformly distributed between 1% and 10%, 50%, 100% and 125% of the processing time value. Computational tests are then presented for each of the 28 heuristics, comparing the mean relative deviation of the makespan, the computational time and the percentage of successes of each method. Results show that the heuristics were capable of providing interesting results.

  13. Near-Optimal Heuristics for Just-In-Time Jobs Maximization in Flow Shop Scheduling

    Directory of Open Access Journals (Sweden)

    Helio Yochihiro Fuchigami

    2018-04-01

    Full Text Available The number of just-in-time jobs maximization in a permutation flow shop scheduling problem is considered. A mixed integer linear programming model to represent the problem as well as solution approaches based on enumeration and constructive heuristics were proposed and computationally implemented. Instances with up to 10 jobs and five machines are solved by the mathematical model in an acceptable running time (3.3 min on average while the enumeration method consumes, on average, 1.5 s. The 10 constructive heuristics proposed show they are practical especially for large-scale instances (up to 100 jobs and 20 machines, with very good-quality results and efficient running times. The best two heuristics obtain near-optimal solutions, with only 0.6% and 0.8% average relative deviations. They prove to be better than adaptations of the NEH heuristic (well-known for providing very good solutions for makespan minimization in flow shop for the considered problem.

  14. REORGANIZATION OF THE TECHNOLOGICAL FLOW AT CLOTHING COMPANY THROUGH THE PRODUCTION SCHEDULE

    Directory of Open Access Journals (Sweden)

    GHELBET Angela

    2017-05-01

    Full Text Available One of the main difficulties that light industry, namely clothing manufacturing sector faces today is inadequate organization of production processes. This is one of the most common and most serious obstacles in companies in the country, leading to low productivity. In order to reveal the causes of the problem and to develop solutions for change, it is proposed to conduct a study of a company facing difficulties in organizing the production process. It is important that the method/tool applied for the study is able to solve the problems occurring in the production process with minimum effort and maximum efficiency. The study was conducted within the process of manufacturing of a model of special clothing, namely clothing for doctors. The study was conducted within February-March 2016 at a clothing company of the Republic of Moldova. The study conducted shows that the transport issue in the technological flow can be solved by applying the production schedule, which eventually increases labor productivity by eliminating the time necessary to transport the labor object from one place of work to another, leading to economic growth considerable for the company. Following the assessments referring to the proposed improvements to organize the technological flow, there should be a 20% reduction in manufacturing time of a product, which will directly increase the revenue of the company by at least 10%.

  15. Multi-Time Scale Coordinated Scheduling Strategy with Distributed Power Flow Controllers for Minimizing Wind Power Spillage

    Directory of Open Access Journals (Sweden)

    Yi Tang

    2017-11-01

    Full Text Available The inherent variability and randomness of large-scale wind power integration have brought great challenges to power flow control and dispatch. The distributed power flow controller (DPFC has the higher flexibility and capacity in power flow control in the system with wind generation. This paper proposes a multi-time scale coordinated scheduling model with DPFC to minimize wind power spillage. Configuration of DPFCs is initially determined by stochastic method. Afterward, two sequential procedures containing day-head and real-time scales are applied for determining maximum schedulable wind sources, optimal outputs of generating units and operation setting of DPFCs. The generating plan is obtained initially in day-ahead scheduling stage and modified in real-time scheduling model, while considering the uncertainty of wind power and fast operation of DPFC. Numerical simulation results in IEEE-RTS79 system illustrate that wind power is maximum scheduled with the optimal deployment and operation of DPFC, which confirms the applicability and effectiveness of the proposed method.

  16. Traffic signal synchronization.

    Science.gov (United States)

    Huang, Ding-wei; Huang, Wei-neng

    2003-05-01

    The benefits of traffic signal synchronization are examined within the cellular automata approach. The microsimulations of traffic flow are obtained with different settings of signal period T and time delay delta. Both numerical results and analytical approximations are presented. For undersaturated traffic, the green-light wave solutions can be realized. For saturated traffic, the correlation among the traffic signals has no effect on the throughput. For oversaturated traffic, the benefits of synchronization are manifest only when stochastic noise is suppressed.

  17. CONTROLLING TRAFFIC FLOW IN MULTILANE-ISOLATED INTERSECTION USING ANFIS APPROACH TECHNIQUES

    Directory of Open Access Journals (Sweden)

    G. R. LAI

    2015-08-01

    Full Text Available Many controllers have applied the Adaptive Neural-Fuzzy Inference System (ANFIS concept for optimizing the controller performance. However, there are less traffic signal controllers developed using the ANFIS concept. ANFIS traffic signal controller with its fuzzy rule base and its ability to learn from a set of sample data could improve the performance of Existing traffic signal controlling system to reduce traffic congestions at most of the busy traffic intersections in city such as Kuala Lumpur, Malaysia. The aim of this research is to develop an ANFIS traffic signals controller for multilane-isolated four approaches intersections in order to ease traffic congestions at traffic intersections. The new concept to generate sample data for ANFIS training is introduced in this research. The sample data is generated based on fuzzy rules and can be analysed using tree diagram. This controller is simulated on multilane-isolated traffic intersection model developed using M/M/1 queuing theory and its performance in terms of average waiting time, queue length and delay time are compared with traditional controllers and fuzzy controller. Simulation result shows that the average waiting time, queue length, and delay time of ANFIS traffic signal controller are the lowest as compared to the other three controllers. In conclusion, the efficiency and performance of ANFIS controller are much better than that of fuzzy and traditional controllers in different traffic volumes.

  18. A Critical Survey of Optimization Models for Tactical and Strategic Aspects of Air Traffic Flow Management

    Science.gov (United States)

    Bertsimas, Dimitris; Odoni, Amedeo

    1997-01-01

    This document presents a critical review of the principal existing optimization models that have been applied to Air Traffic Flow Management (TFM). Emphasis will be placed on two problems, the Generalized Tactical Flow Management Problem (GTFMP) and the Ground Holding Problem (GHP), as well as on some of their variations. To perform this task, we have carried out an extensive literature review that has covered more than 40 references, most of them very recent. Based on the review of this emerging field our objectives were to: (i) identify the best available models; (ii) describe typical contexts for applications of the models; (iii) provide illustrative model formulations; and (iv) identify the methodologies that can be used to solve the models. We shall begin our presentation below by providing a brief context for the models that we are reviewing. In Section 3 we shall offer a taxonomy and identify four classes of models for review. In Sections 4, 5, and 6 we shall then review, respectively, models for the Single-Airport Ground Holding Problem, the Generalized Tactical FM P and the Multi-Airport Ground Holding Problem (for the definition of these problems see Section 3 below). In each section, we identify the best available models and discuss briefly their computational performance and applications, if any, to date. Section 7 summarizes our conclusions about the state of the art.

  19. A Hybrid Quantum Evolutionary Algorithm with Improved Decoding Scheme for a Robotic Flow Shop Scheduling Problem

    Directory of Open Access Journals (Sweden)

    Weidong Lei

    2017-01-01

    Full Text Available We aim at solving the cyclic scheduling problem with a single robot and flexible processing times in a robotic flow shop, which is a well-known optimization problem in advanced manufacturing systems. The objective of the problem is to find an optimal robot move sequence such that the throughput rate is maximized. We propose a hybrid algorithm based on the Quantum-Inspired Evolutionary Algorithm (QEA and genetic operators for solving the problem. The algorithm integrates three different decoding strategies to convert quantum individuals into robot move sequences. The Q-gate is applied to update the states of Q-bits in each individual. Besides, crossover and mutation operators with adaptive probabilities are used to increase the population diversity. A repairing procedure is proposed to deal with infeasible individuals. Comparison results on both benchmark and randomly generated instances demonstrate that the proposed algorithm is more effective in solving the studied problem in terms of solution quality and computational time.

  20. Estimation of distribution algorithm with path relinking for the blocking flow-shop scheduling problem

    Science.gov (United States)

    Shao, Zhongshi; Pi, Dechang; Shao, Weishi

    2018-05-01

    This article presents an effective estimation of distribution algorithm, named P-EDA, to solve the blocking flow-shop scheduling problem (BFSP) with the makespan criterion. In the P-EDA, a Nawaz-Enscore-Ham (NEH)-based heuristic and the random method are combined to generate the initial population. Based on several superior individuals provided by a modified linear rank selection, a probabilistic model is constructed to describe the probabilistic distribution of the promising solution space. The path relinking technique is incorporated into EDA to avoid blindness of the search and improve the convergence property. A modified referenced local search is designed to enhance the local exploitation. Moreover, a diversity-maintaining scheme is introduced into EDA to avoid deterioration of the population. Finally, the parameters of the proposed P-EDA are calibrated using a design of experiments approach. Simulation results and comparisons with some well-performing algorithms demonstrate the effectiveness of the P-EDA for solving BFSP.

  1. Parallel genetic algorithms with migration for the hybrid flow shop scheduling problem

    Directory of Open Access Journals (Sweden)

    K. Belkadi

    2006-01-01

    Full Text Available This paper addresses scheduling problems in hybrid flow shop-like systems with a migration parallel genetic algorithm (PGA_MIG. This parallel genetic algorithm model allows genetic diversity by the application of selection and reproduction mechanisms nearer to nature. The space structure of the population is modified by dividing it into disjoined subpopulations. From time to time, individuals are exchanged between the different subpopulations (migration. Influence of parameters and dedicated strategies are studied. These parameters are the number of independent subpopulations, the interconnection topology between subpopulations, the choice/replacement strategy of the migrant individuals, and the migration frequency. A comparison between the sequential and parallel version of genetic algorithm (GA is provided. This comparison relates to the quality of the solution and the execution time of the two versions. The efficiency of the parallel model highly depends on the parameters and especially on the migration frequency. In the same way this parallel model gives a significant improvement of computational time if it is implemented on a parallel architecture which offers an acceptable number of processors (as many processors as subpopulations.

  2. A Risk-Hedged Approach to Traffic Flow Management under Atmospheric Uncertainties, Phase I

    Data.gov (United States)

    National Aeronautics and Space Administration — Volcanic ash and other atmospheric hazards impact air transportation by introducing uncertainty in the National Airspace System (NAS) capacity. Deterministic traffic...

  3. A new cellular automaton for signal controlled traffic flow based on driving behaviors

    Science.gov (United States)

    Wang, Yang; Chen, Yan-Yan

    2015-03-01

    The complexity of signal controlled traffic largely stems from the various driving behaviors developed in response to the traffic signal. However, the existing models take a few driving behaviors into account and consequently the traffic dynamics has not been completely explored. Therefore, a new cellular automaton model, which incorporates the driving behaviors typically manifesting during the different stages when the vehicles are moving toward a traffic light, is proposed in this paper. Numerical simulations have demonstrated that the proposed model can produce the spontaneous traffic breakdown and the dissolution of the over-saturated traffic phenomena. Furthermore, the simulation results indicate that the slow-to-start behavior and the inch-forward behavior can foster the traffic breakdown. Particularly, it has been discovered that the over-saturated traffic can be revised to be an under-saturated state when the slow-down behavior is activated after the spontaneous breakdown. Finally, the contributions of the driving behaviors on the traffic breakdown have been examined. Project supported by the National Basic Research Program of China (Grand No. 2012CB723303) and the Beijing Committee of Science and Technology, China (Grand No. Z1211000003120100).

  4. Modified Motor Vehicles Travel Speed Models on the Basis of Curb Parking Setting under Mixed Traffic Flow

    Directory of Open Access Journals (Sweden)

    Zhenyu Mei

    2012-01-01

    Full Text Available The ongoing controversy about in what condition should we set the curb parking has few definitive answers because comprehensive research in this area has been lacking. Our goal is to present a set of heuristic urban street speed functions under mixed traffic flow by taking into account impacts of curb parking. Two impacts have been defined to classify and quantify the phenomena of motor vehicles' speed dynamics in terms of curb parking. The first impact is called Space impact, which is caused by the curb parking types. The other one is the Time impact, which results from the driver maneuvering in or out of parking space. In this paper, based on the empirical data collected from six typical urban streets in Nanjing, China, two models have been proposed to describe these phenomena for one-way traffic and two-way traffic, respectively. An intensive experiment has been conducted in order to calibrate and validate these proposed models, by taking into account the complexity of the model parameters. We also provide guidelines in terms of how to cluster and calculate those models' parameters. Results from these models demonstrated promising performance of modeling motor vehicles' speed for mixed traffic flow under the influence of curb parking.

  5. An optimal general type-2 fuzzy controller for Urban Traffic Network

    DEFF Research Database (Denmark)

    Khooban, Mohammad Hassan; Vafamand, Navid; Liaghat, Alireza

    2017-01-01

    Urban traffic network model is illustrated by state-charts and object-diagram. However, they have limitations to show the behavioral perspective of the Traffic Information flow. Consequently, a state space model is used to calculate the half-value waiting time of vehicles. In this study......, a combination of the general type-2 fuzzy logic sets and the Modified Backtracking Search Algorithm (MBSA) techniques are used in order to control the traffic signal scheduling and phase succession so as to guarantee a smooth flow of traffic with the least wait times and average queue length. The parameters...

  6. The Air Traffic Controller Work-Shift Scheduling Problem in Spain from a Multiobjective Perspective: A Metaheuristic and Regular Expression-Based Approach

    Directory of Open Access Journals (Sweden)

    Faustino Tello

    2018-01-01

    Full Text Available We address an air traffic control operator (ATCo work-shift scheduling problem. We consider a multiple objective perspective where the number of ATCos is fixed in advance and a set of ATCo labor conditions have to be satisfied. The objectives deal with the ATCo work and rest periods and positions, the structure of the solution, the number of control center changes, or the distribution of the ATCo workloads. We propose a three-phase problem-solving methodology. In the first phase, a heuristic is used to derive infeasible initial solutions on the basis of templates. Then, a multiple independent run of the simulated annealing metaheuristic is conducted aimed at reaching feasible solutions in the second phase. Finally, a multiple independent simulated annealing run is again conducted from the initial feasible solutions to optimize the objective functions. To do this, we transform the multiple to single optimization problem by using the rank-order centroid function. In the search processes in phases 2 and 3, we use regular expressions to check the ATCo labor conditions in the visited solutions. This provides high testing speed. The proposed approach is illustrated using a real example, and the optimal solution which is reached outperforms an existing template-based reference solution.

  7. Modelling CO concentrations under free-flowing and congested traffic conditions in Ireland

    Energy Technology Data Exchange (ETDEWEB)

    Broderick, B; Budd, U; Misstear, B [Dept. of Civil, Structural and Environmental Engineering, Trinity Coll. Dublin (Ireland); Ceburnis, D; Jennings, S G [Dept. of Experimental Physics, National Univ. of Ireland, Galway (Ireland)

    2004-07-01

    The assessment and management of air quality is required under the EU Air Quality Framework Directive and its Daughter Directives (CEC, 1996, 1999, 2000) which specify the limits for certain pollutants, including carbon monoxide (CO). Air quality modelling is used to predict the future impact of road improvements, often as part of an Environmental Impact Assessment. The U.S. National Commission on Air Quality found in 1981 that such models may typically overpredict or underpredict actual concentrations by a factor of two. Even twenty years later the U.K. Department of the Environment Transport and the Regions (UK DETR, 2001) concurred that ''If the prediction of an annual mean concentration lies within {+-}50% of the measurement, a user would not consider that the model has behaved badly.'' The Daughter Directive (CEC, 2000) concerned with CO allows 50% uncertainty in modelling of the eight-hour average concentration. An assessment of CALINE4 was performed for two contrasting sites: a free-flowing motorway and a periodically-congested roundabout. Air quality was continuously monitored over a one-year period at both sites. The data collected was compared with model predictions based on local and regional meteorological data, site geometry and traffic volumes. The modelled and monitored results were compared through both graphical and statistical analysis (Broderick B.M. et al., 2003). (orig.)

  8. An Efficient Methodology for Calibrating Traffic Flow Models Based on Bisection Analysis

    Directory of Open Access Journals (Sweden)

    Enzo C. Jia

    2014-01-01

    Full Text Available As urban planning becomes more sophisticated, the accurate detection and counting of pedestrians and cyclists become more important. Accurate counts can be used to determine the need for additional pedestrian walkways and intersection reorganization, among other planning initiatives. In this project, a camera-based approach is implemented to create a real-time pedestrian and cyclist counting system which is regularly accurate to 85% and often achieves higher accuracy. The approach retasks a state-of-the-art traffic camera, the Autoscope Solo Terra, for pedestrian and bicyclist counting. Object detection regions are sized to identify multiple pedestrians moving in either direction on an urban sidewalk and bicyclists in an adjacent bicycle lane. Collected results are processed in real time, eliminating the need for video storage and postprocessing. In this paper, results are presented for a pedestrian walkway for pedestrian flow up to 108 persons/min and the limitations of the implemented system are enumerated. Both pedestrian and cyclist counting accuracy of over 90% is achieved.

  9. Evolutionary Hybrid Particle Swarm Optimization Algorithm for Solving NP-Hard No-Wait Flow Shop Scheduling Problems

    Directory of Open Access Journals (Sweden)

    Laxmi A. Bewoor

    2017-10-01

    Full Text Available The no-wait flow shop is a flowshop in which the scheduling of jobs is continuous and simultaneous through all machines without waiting for any consecutive machines. The scheduling of a no-wait flow shop requires finding an appropriate sequence of jobs for scheduling, which in turn reduces total processing time. The classical brute force method for finding the probabilities of scheduling for improving the utilization of resources may become trapped in local optima, and this problem can hence be observed as a typical NP-hard combinatorial optimization problem that requires finding a near optimal solution with heuristic and metaheuristic techniques. This paper proposes an effective hybrid Particle Swarm Optimization (PSO metaheuristic algorithm for solving no-wait flow shop scheduling problems with the objective of minimizing the total flow time of jobs. This Proposed Hybrid Particle Swarm Optimization (PHPSO algorithm presents a solution by the random key representation rule for converting the continuous position information values of particles to a discrete job permutation. The proposed algorithm initializes population efficiently with the Nawaz-Enscore-Ham (NEH heuristic technique and uses an evolutionary search guided by the mechanism of PSO, as well as simulated annealing based on a local neighborhood search to avoid getting stuck in local optima and to provide the appropriate balance of global exploration and local exploitation. Extensive computational experiments are carried out based on Taillard’s benchmark suite. Computational results and comparisons with existing metaheuristics show that the PHPSO algorithm outperforms the existing methods in terms of quality search and robustness for the problem considered. The improvement in solution quality is confirmed by statistical tests of significance.

  10. Some Considerations on the Problem of Non-Steady State Traffic Flow Optimization

    Science.gov (United States)

    2007-01-01

    Poor traffic signal timing accounts for an estimated 10 percent of all traffic delay about 300 million vehicle-hours on major roadways alone. Americans agree that this is a problem: one U.S. Department of Transportation (DOT) survey found tha...

  11. Estimation of traffic recovery time for different flow regimes on freeways.

    Science.gov (United States)

    2008-06-01

    This study attempts to estimate post-incident traffic recovery time along a freeway using Monte Carlo simulation techniques. It has been found that there is a linear relationship between post-incident traffic recovery time, and incident time and traf...

  12. Cellular automata models for diffusion of information and highway traffic flow

    Science.gov (United States)

    Fuks, Henryk

    In the first part of this work we study a family of deterministic models for highway traffic flow which generalize cellular automaton rule 184. This family is parameterized by the speed limit m and another parameter k that represents degree of 'anticipatory driving'. We compare two driving strategies with identical maximum throughput: 'conservative' driving with high speed limit and 'anticipatory' driving with low speed limit. Those two strategies are evaluated in terms of accident probability. We also discuss fundamental diagrams of generalized traffic rules and examine limitations of maximum achievable throughput. Possible modifications of the model are considered. For rule 184, we present exact calculations of the order parameter in a transition from the moving phase to the jammed phase using the method of preimage counting, and use this result to construct a solution to the density classification problem. In the second part we propose a probabilistic cellular automaton model for the spread of innovations, rumors, news, etc., in a social system. We start from simple deterministic models, for which exact expressions for the density of adopters are derived. For a more realistic model, based on probabilistic cellular automata, we study the influence of a range of interaction R on the shape of the adoption curve. When the probability of adoption is proportional to the local density of adopters, and individuals can drop the innovation with some probability p, the system exhibits a second order phase transition. Critical line separating regions of parameter space in which asymptotic density of adopters is positive from the region where it is equal to zero converges toward the mean-field line when the range of the interaction increases. In a region between R=1 critical line and the mean-field line asymptotic density of adopters depends on R, becoming zero if R is too small (smaller than some critical value). This result demonstrates the importance of connectivity in

  13. Discrete particle swarm optimization to solve multi-objective limited-wait hybrid flow shop scheduling problem

    Science.gov (United States)

    Santosa, B.; Siswanto, N.; Fiqihesa

    2018-04-01

    This paper proposes a discrete Particle Swam Optimization (PSO) to solve limited-wait hybrid flowshop scheduing problem with multi objectives. Flow shop schedulimg represents the condition when several machines are arranged in series and each job must be processed at each machine with same sequence. The objective functions are minimizing completion time (makespan), total tardiness time, and total machine idle time. Flow shop scheduling model always grows to cope with the real production system accurately. Since flow shop scheduling is a NP-Hard problem then the most suitable method to solve is metaheuristics. One of metaheuristics algorithm is Particle Swarm Optimization (PSO), an algorithm which is based on the behavior of a swarm. Originally, PSO was intended to solve continuous optimization problems. Since flow shop scheduling is a discrete optimization problem, then, we need to modify PSO to fit the problem. The modification is done by using probability transition matrix mechanism. While to handle multi objectives problem, we use Pareto Optimal (MPSO). The results of MPSO is better than the PSO because the MPSO solution set produced higher probability to find the optimal solution. Besides the MPSO solution set is closer to the optimal solution

  14. Cross-layer based adaptive wireless traffic control for per-flow and per-station fairness

    Directory of Open Access Journals (Sweden)

    Siwamogsatham Siwaruk

    2011-01-01

    Full Text Available Abstract In the IEEE 802.11 wireless LANs, the bandwidth is not fairly shared among stations due to the distributed coordination function (DCF mechanism in the IEEE 802.11 MAC protocol. It introduces the per-flow and per-station unfairness problems between uplink and downlink flows, as the uplink flows usually dominate the downlink flows. In addition, some users may use greedy applications such as video streaming, which may prevent other applications from connecting to the Internet. In this article, we propose an adaptive cross-layer bandwidth allocation mechanism to provide per-station and per-flow fairness. To verify the effectiveness and scalability, our scheme is implemented on a wireless access router and numerous experiments in a typical wireless environment with both TCP and UDP traffic are conducted to evaluate performance of the proposed scheme.

  15. An effective PSO-based memetic algorithm for flow shop scheduling.

    Science.gov (United States)

    Liu, Bo; Wang, Ling; Jin, Yi-Hui

    2007-02-01

    This paper proposes an effective particle swarm optimization (PSO)-based memetic algorithm (MA) for the permutation flow shop scheduling problem (PFSSP) with the objective to minimize the maximum completion time, which is a typical non-deterministic polynomial-time (NP) hard combinatorial optimization problem. In the proposed PSO-based MA (PSOMA), both PSO-based searching operators and some special local searching operators are designed to balance the exploration and exploitation abilities. In particular, the PSOMA applies the evolutionary searching mechanism of PSO, which is characterized by individual improvement, population cooperation, and competition to effectively perform exploration. On the other hand, the PSOMA utilizes several adaptive local searches to perform exploitation. First, to make PSO suitable for solving PFSSP, a ranked-order value rule based on random key representation is presented to convert the continuous position values of particles to job permutations. Second, to generate an initial swarm with certain quality and diversity, the famous Nawaz-Enscore-Ham (NEH) heuristic is incorporated into the initialization of population. Third, to balance the exploration and exploitation abilities, after the standard PSO-based searching operation, a new local search technique named NEH_1 insertion is probabilistically applied to some good particles selected by using a roulette wheel mechanism with a specified probability. Fourth, to enrich the searching behaviors and to avoid premature convergence, a simulated annealing (SA)-based local search with multiple different neighborhoods is designed and incorporated into the PSOMA. Meanwhile, an effective adaptive meta-Lamarckian learning strategy is employed to decide which neighborhood to be used in SA-based local search. Finally, to further enhance the exploitation ability, a pairwise-based local search is applied after the SA-based search. Simulation results based on benchmarks demonstrate the effectiveness

  16. Exact and grid-free solutions to the Lighthill-Whitham-Richards traffic flow model with bounded acceleration for a class of fundamental diagrams

    KAUST Repository

    Qiu, Shanwen; Abdelaziz, Mohamed Ewis; Abdel Latif, Fadl Hicham Fadl; Claudel, Christian G.

    2013-01-01

    In this article, we propose a new exact and grid-free numerical scheme for computing solutions associated with an hybrid traffic flow model based on the Lighthill-Whitham-Richards (LWR) partial differential equation, for a class of fundamental

  17. Pedestrian Friendly Traffic Signal Control.

    Science.gov (United States)

    2016-01-01

    This project continues research aimed at real-time detection and use of pedestrian : traffic flow information to enhance adaptive traffic signal control in urban areas : where pedestrian traffic is substantial and must be given appropriate attention ...

  18. Acoustic, Visual and Spatial Indicators for the Description of the Soundscape of Waterfront Areas with and without Road Traffic Flow

    Directory of Open Access Journals (Sweden)

    Virginia Puyana Romero

    2016-09-01

    Full Text Available High flows of road traffic noise in urban agglomerations can negatively affect the livability of squares and parks located at the neighborhood, district and city levels, therefore pushing anyone who wants to enjoy calmer, quieter areas to move to non-urban parks. Due to the distances between these areas, it is not possible to go as regularly as would be necessary to satisfy any needs. Even if cities are densely populated, the presence of a sea or riverfront offers the possibility of large restorative places, or at least with potential features for being the natural core of an urban nucleus after a renewal intervention. This study evaluates the soundscape of the Naples waterfront, presenting an overview of the most significant visual, acoustic and spatial factors related to the pedestrian areas, as well as areas open to road traffic and others where the road traffic is limited. The factors were chosen with feature selection methods and artificial neural networks. The results show how certain factors, such as the perimeter between the water and promenade, the visibility of the sea or the density of green areas, can affect the perception of the soundscape quality in the areas with road traffic. In the pedestrian areas, acoustic factors, such as loudness or the A-weighted sound level exceeded for 10% of the measurement duration (LA10, influence the perceived quality of the soundscape.

  19. Probabilistic physical characteristics of phase transitions at highway bottlenecks: incommensurability of three-phase and two-phase traffic-flow theories.

    Science.gov (United States)

    Kerner, Boris S; Klenov, Sergey L; Schreckenberg, Michael

    2014-05-01

    Physical features of induced phase transitions in a metastable free flow at an on-ramp bottleneck in three-phase and two-phase cellular automaton (CA) traffic-flow models have been revealed. It turns out that at given flow rates at the bottleneck, to induce a moving jam (F → J transition) in the metastable free flow through the application of a time-limited on-ramp inflow impulse, in both two-phase and three-phase CA models the same critical amplitude of the impulse is required. If a smaller impulse than this critical one is applied, neither F → J transition nor other phase transitions can occur in the two-phase CA model. We have found that in contrast with the two-phase CA model, in the three-phase CA model, if the same smaller impulse is applied, then a phase transition from free flow to synchronized flow (F → S transition) can be induced at the bottleneck. This explains why rather than the F → J transition, in the three-phase theory traffic breakdown at a highway bottleneck is governed by an F → S transition, as observed in real measured traffic data. None of two-phase traffic-flow theories incorporates an F → S transition in a metastable free flow at the bottleneck that is the main feature of the three-phase theory. On the one hand, this shows the incommensurability of three-phase and two-phase traffic-flow theories. On the other hand, this clarifies why none of the two-phase traffic-flow theories can explain the set of fundamental empirical features of traffic breakdown at highway bottlenecks.

  20. Evaluation of dynamic message signs and their potential impact on traffic flow.

    Science.gov (United States)

    2013-04-01

    Maryland State Highway Administration (SHA) has a rich data archive of the messages posted to the : Dynamic Message Signs (DMS) and the time stamps when they were posted and taken down. The archive : also contains traffic information surrounding the ...

  1. The indicative effects of inefficient urban traffic flow on fuel cost and exhaust air pollutant emissions

    CSIR Research Space (South Africa)

    Moselakgomo, M

    2015-07-01

    Full Text Available Poor urban traffic management such as poor intersection controls, congestions, illegal roadway blockages and construction works causes “stop-go” driving conditions with excessive idling resulting in wasted fuel and increased air pollutant emissions...

  2. A State-of-the-Art Review of the Sensor Location, Flow Observability, Estimation, and Prediction Problems in Traffic Networks

    Directory of Open Access Journals (Sweden)

    Enrique Castillo

    2015-01-01

    Full Text Available A state-of-the-art review of flow observability, estimation, and prediction problems in traffic networks is performed. Since mathematical optimization provides a general framework for all of them, an integrated approach is used to perform the analysis of these problems and consider them as different optimization problems whose data, variables, constraints, and objective functions are the main elements that characterize the problems proposed by different authors. For example, counted, scanned or “a priori” data are the most common data sources; conservation laws, flow nonnegativity, link capacity, flow definition, observation, flow propagation, and specific model requirements form the most common constraints; and least squares, likelihood, possible relative error, mean absolute relative error, and so forth constitute the bases for the objective functions or metrics. The high number of possible combinations of these elements justifies the existence of a wide collection of methods for analyzing static and dynamic situations.

  3. Competition between Local Collisions and Collective Hydrodynamic Feedback Controls Traffic Flows in Microfluidic Networks

    Science.gov (United States)

    Belloul, M.; Engl, W.; Colin, A.; Panizza, P.; Ajdari, A.

    2009-05-01

    By studying the repartition of monodisperse droplets at a simple T junction, we show that the traffic of discrete fluid systems in microfluidic networks results from two competing mechanisms, whose significance is driven by confinement. Traffic is dominated by collisions occurring at the junction for small droplets and by collective hydrodynamic feedback for large ones. For each mechanism, we present simple models in terms of the pertinent dimensionless parameters of the problem.

  4. Managing Traffic Flows for Cleaner Cities: The Role of Green Navigation Systems

    Directory of Open Access Journals (Sweden)

    Fiamma Perez-Prada

    2017-06-01

    Full Text Available Cities worldwide suffer from serious air pollution problems and are main contributors to climate change. Green Navigation systems have a great potential to reduce fuel consumption and exhaust emissions from traffic. This research evaluates the impacts of different percentages of green drivers on traffic, CO2, and NOx over the entire Madrid Region. A macroscopic traffic model was combined with an enhanced macroscopic emissions model and a GIS (Geographic Information Systems to simulate emissions on the basis of average vehicle speeds and traffic intensity at the link level. NOx emissions are evaluated, taking into account not only the exhaust emissions produced by transport activity, but also the amount of the population exposed to these air pollutants. Results show up to 10.4% CO2 and 13.8% NOx reductions in congested traffic conditions for a 90% penetration of green drivers; however, the population’s exposure to NOx increases up to 20.2%. Moreover, while traffic volumes decrease by 13.5% for the entire region, they increase by up to 16.4% downtown. Travel times also increase by 28.7%. Since green drivers tend to choose shorter routes through downtown areas, eco-routing systems are an effective tool for fighting climate change, but are ineffective to reduce air pollution in dense urban areas.

  5. A Novel Through Capacity Model for One-way Channel Based on Characteristics of the Vessel Traffic Flow

    Directory of Open Access Journals (Sweden)

    Yuanyuan Nie

    2017-09-01

    Full Text Available Vessel traffic flow is a key parameter for channel-through capacity and is of great significance to vessel traffic management, channel and port design and navigational risk evaluation. Based on the study of parameters of characteristics of vessel traffic flow related to channel-through capacity, this paper puts forward a brand-new mathematical model for one-way channel-through capacity in which parameters of channel length, vessel arrival rate and velocity difference in different vessels are involved and a theoretical calculating mechanism for the channel-through capacity is provided. In order to verify availability and reliability of the model, extensive simulation studies have been carried out and based on the historical AIS data, an analytical case study on the Xiazhimen Channel validating the proposed model is presented. Both simulation studies and the case study show that the proposed model is valid and all relative parameters can be readjusted and optimized to further improve the channel-through capacity. Thus, all studies demonstrate that the model is valuable for channel design and vessel management.

  6. A discrete firefly meta-heuristic with local search for makespan minimization in permutation flow shop scheduling problems

    Directory of Open Access Journals (Sweden)

    Nader Ghaffari-Nasab

    2010-07-01

    Full Text Available During the past two decades, there have been increasing interests on permutation flow shop with different types of objective functions such as minimizing the makespan, the weighted mean flow-time etc. The permutation flow shop is formulated as a mixed integer programming and it is classified as NP-Hard problem. Therefore, a direct solution is not available and meta-heuristic approaches need to be used to find the near-optimal solutions. In this paper, we present a new discrete firefly meta-heuristic to minimize the makespan for the permutation flow shop scheduling problem. The results of implementation of the proposed method are compared with other existing ant colony optimization technique. The preliminary results indicate that the new proposed method performs better than the ant colony for some well known benchmark problems.

  7. An Enhanced Discrete Artificial Bee Colony Algorithm to Minimize the Total Flow Time in Permutation Flow Shop Scheduling with Limited Buffers

    Directory of Open Access Journals (Sweden)

    Guanlong Deng

    2016-01-01

    Full Text Available This paper presents an enhanced discrete artificial bee colony algorithm for minimizing the total flow time in the flow shop scheduling problem with buffer capacity. First, the solution in the algorithm is represented as discrete job permutation to directly convert to active schedule. Then, we present a simple and effective scheme called best insertion for the employed bee and onlooker bee and introduce a combined local search exploring both insertion and swap neighborhood. To validate the performance of the presented algorithm, a computational campaign is carried out on the Taillard benchmark instances, and computations and comparisons show that the proposed algorithm is not only capable of solving the benchmark set better than the existing discrete differential evolution algorithm and iterated greedy algorithm, but also capable of performing better than two recently proposed discrete artificial bee colony algorithms.

  8. Estimation and Control of Networked Distributed Parameter Systems: Application to Traffic Flow

    KAUST Repository

    Canepa, Edward

    2016-11-01

    The management of large-scale transportation infrastructure is becoming a very complex task for the urban areas of this century which are covering bigger geographic spaces and facing the inclusion of connected and self-controlled vehicles. This new system paradigm can leverage many forms of sensing and interaction, including a high-scale mobile sensing approach. To obtain a high penetration sensing system on urban areas more practical and scalable platforms are needed, combined with estimation algorithms suitable to the computational capabilities of these platforms. The purpose of this work was to develop a transportation framework that is able to handle different kinds of sensing data (e.g., connected vehicles, loop detectors) and optimize the traffic state on a defined traffic network. The framework estimates the traffic on road networks modeled by a family of Lighthill-Whitham-Richards equations. Based on an equivalent formulation of the problem using a Hamilton-Jacobi equation and using a semi-analytic formula, I will show that the model constraints resulting from the Hamilton-Jacobi equation are linear, albeit with unknown integer variables. This general framework solve exactly a variety of problems arising in transportation networks: traffic estimation, traffic control (including robust control), cybersecurity and sensor fault detection, or privacy analysis of users in probe-based traffic monitoring systems. This framework is very flexible, fast, and yields exact results. The recent advances in sensors (GPS, inertial measurement units) and microprocessors enable the development low-cost dedicated devices for traffic sensing in cities, 5 which are highly scalable, providing a feasible solution to cover large urban areas. However, one of the main problems to address is the privacy of the users of the transportation system, the framework presented here is a viable option to guarantee the privacy of the users by design.

  9. Modeling the Hybrid Flow Shop Scheduling Problem Followed by an Assembly Stage Considering Aging Effects and Preventive Maintenance Activities

    Directory of Open Access Journals (Sweden)

    Seyyed Mohammad Hassan Hosseini

    2016-05-01

    Full Text Available Scheduling problem for the hybrid flow shop scheduling problem (HFSP followed by an assembly stage considering aging effects additional preventive and maintenance activities is studied in this paper. In this production system, a number of products of different kinds are produced. Each product is assembled with a set of several parts. The first stage is a hybrid flow shop to produce parts. All machines can process all kinds of parts in this stage but each machine can process only one part at the same time. The second stage is a single assembly machine or a single assembly team of workers. The aim is to schedule the parts on the machines and assembly sequence and also determine when the preventive maintenance activities get done in order to minimize the completion time of all products (makespan. A mathematical modeling is presented and its validation is shown by solving an example in small scale. Since this problem has been proved strongly NP-hard, in order to solve the problem in medium and large scale, four heuristic algorithms is proposed based on the Johnson’s algorithm. The numerical experiments are used to run the mathematical model and evaluate the performance of the proposed algorithms.

  10. Integration of scheduling and discrete event simulation systems to improve production flow planning

    Science.gov (United States)

    Krenczyk, D.; Paprocka, I.; Kempa, W. M.; Grabowik, C.; Kalinowski, K.

    2016-08-01

    The increased availability of data and computer-aided technologies such as MRPI/II, ERP and MES system, allowing producers to be more adaptive to market dynamics and to improve production scheduling. Integration of production scheduling and computer modelling, simulation and visualization systems can be useful in the analysis of production system constraints related to the efficiency of manufacturing systems. A integration methodology based on semi-automatic model generation method for eliminating problems associated with complexity of the model and labour-intensive and time-consuming process of simulation model creation is proposed. Data mapping and data transformation techniques for the proposed method have been applied. This approach has been illustrated through examples of practical implementation of the proposed method using KbRS scheduling system and Enterprise Dynamics simulation system.

  11. Traffic in the operating room: a review of factors influencing air flow and surgical wound contamination.

    Science.gov (United States)

    Pokrywka, Marian; Byers, Karin

    2013-06-01

    Surgical wound contamination leading to surgical site infection can result from disruption of the intended airflow in the operating room (OR). When personnel enter and exit the OR, or create unnecessary movement and traffic during the procedure, the intended airflow in the vicinity of the open wound becomes disrupted and does not adequately remove airborne contaminants from the sterile field. An increase in the bacterial counts of airborne microorganisms is noted during increased activity levels within the OR. Researchers have studied OR traffic and door openings as a determinant of air contamination. During a surgical procedure the door to the operating room may be open as long as 20 minutes out of each surgical hour during critical procedures involving implants. Interventions into limiting excessive movement and traffic in the OR may lead to reductions in surgical site infections in select populations.

  12. Combining Kohonen maps with Arima time series models to forecast traffic flow

    NARCIS (Netherlands)

    van der Voort, Mascha C.; Dougherty, Mark; Dougherty, M.S.; Watson, Susan

    1996-01-01

    A hybrid method of short-term traffic forecasting is introduced; the KARIMA method. The technique uses a Kohonen self-organizing map as an initial classifier; each class has an individually tuned ARIMA model associated with it. Using a Kohonen map which is hexagonal in layout eases the problem of

  13. Airspace Technology Demonstration 3 (ATD-3): Applied Traffic Flow Management Project Overview

    Science.gov (United States)

    Gong, Chester

    2016-01-01

    ATD-3 Project Overview for 3rd Joint Workshop for KAIA-KARI - NASA ATM Research Collaboration. This presentation gives a high level description of the ATD-3 project and related technologies. These technologies include Multi-Flight Common Routes (MFCR), Traffic Aware Strategic Aircrew Requests (TASAR) and Dynamic Routes for Arrivals in Weather (DRAW).

  14. Dynamic Flow Migration for Delay Constrained Traffic in Software-Defined Networks

    NARCIS (Netherlands)

    Berger, Andre; Gross, James; Danielis, Peter; Dán, György

    2017-01-01

    Various industrial control applications have stringent end-to-end latency requirements in the order of a few milliseconds. Software-defined networking (SDN) is a promising solution in order to meet these stringent requirements under varying traffic patterns, as it enables the flexible management of

  15. Optimal Re-Routes and Ground Delays Using a Route-Based Aggregate Air Traffic Flow Model

    Science.gov (United States)

    Soler, Lluis

    The National Airspace System (NAS) is very complex and with a high level of uncertainty. For this reason, developing an automated conflict resolution tool at NAS level is presented as a big challenge. One way to address the problem is by using aggregate models, which can significantly reduce its dimension and complexity. Significant effort has been made to develop an air traffic aggregate model capable to effectively state and solve the problem. In this study, a Route-Based Aggregate Model is developed and tested. It consists in a modification of several existing models and overcomes some issues identified in previous aggregate models. It allows the implementation of Traffic Flow Management conventional controls, such as ground delay and rerouting. These control strategies can be used to avoid congestion conflicts based on sectors and airports capacity as well as regions affected by convective weather. The optimization problem is posed as a Linear Programming routine, which guarantees an optimal solution that minimizes the total accumulated delay required to avoid such capacity conflicts. The solutions can be directly translated into specific instructions at aircraft level, via modification of the times of departure and flight plans. The model is integrated with Future Air Traffic Management Concepts Evaluation Tool (FACET), a state of the art air traffic simulation tool, and uses its files as both input and output. This allows simulating in FACET the solution obtained from the aggregate domain. The approach is validated by applying it in three realistic scenarios at different scales. Results show that, for time horizons larger than 2 hours, the accuracy of the aggregate model is similar to other simulation tools. Also, the modified flight plans, the product of the disaggregated solution, reduce the number of capacity conflicts in the FACET simulation. Future research will study the robustness of these solutions and determine the most appropriate scenarios where to

  16. A cellular automata model for traffic flow based on kinetics theory, vehicles capabilities and driver reactions

    Science.gov (United States)

    Guzmán, H. A.; Lárraga, M. E.; Alvarez-Icaza, L.; Carvajal, J.

    2018-02-01

    In this paper, a reliable cellular automata model oriented to faithfully reproduce deceleration and acceleration according to realistic reactions of drivers, when vehicles with different deceleration capabilities are considered is presented. The model focuses on describing complex traffic phenomena by coding in its rules the basic mechanisms of drivers behavior, vehicles capabilities and kinetics, while preserving simplicity. In particular, vehiclés kinetics is based on uniform accelerated motion, rather than in impulsive accelerated motion as in most existing CA models. Thus, the proposed model calculates in an analytic way three safe preserving distances to determine the best action a follower vehicle can take under a worst case scenario. Besides, the prediction analysis guarantees that under the proper assumptions, collision between vehicles may not happen at any future time. Simulations results indicate that all interactions of heterogeneous vehicles (i.e., car-truck, truck-car, car-car and truck-truck) are properly reproduced by the model. In addition, the model overcomes one of the major limitations of CA models for traffic modeling: the inability to perform smooth approach to slower or stopped vehicles. Moreover, the model is also capable of reproducing most empirical findings including the backward speed of the downstream front of the traffic jam, and different congested traffic patterns induced by a system with open boundary conditions with an on-ramp. Like most CA models, integer values are used to make the model run faster, which makes the proposed model suitable for real time traffic simulation of large networks.

  17. ROBUST-HYBRID GENETIC ALGORITHM FOR A FLOW-SHOP SCHEDULING PROBLEM (A Case Study at PT FSCM Manufacturing Indonesia

    Directory of Open Access Journals (Sweden)

    Johan Soewanda

    2007-01-01

    Full Text Available This paper discusses the application of Robust Hybrid Genetic Algorithm to solve a flow-shop scheduling problem. The proposed algorithm attempted to reach minimum makespan. PT. FSCM Manufacturing Indonesia Plant 4's case was used as a test case to evaluate the performance of the proposed algorithm. The proposed algorithm was compared to Ant Colony, Genetic-Tabu, Hybrid Genetic Algorithm, and the company's algorithm. We found that Robust Hybrid Genetic produces statistically better result than the company's, but the same as Ant Colony, Genetic-Tabu, and Hybrid Genetic. In addition, Robust Hybrid Genetic Algorithm required less computational time than Hybrid Genetic Algorithm

  18. Asymptotic analysis of SPTA-based algorithms for no-wait flow shop scheduling problem with release dates.

    Science.gov (United States)

    Ren, Tao; Zhang, Chuan; Lin, Lin; Guo, Meiting; Xie, Xionghang

    2014-01-01

    We address the scheduling problem for a no-wait flow shop to optimize total completion time with release dates. With the tool of asymptotic analysis, we prove that the objective values of two SPTA-based algorithms converge to the optimal value for sufficiently large-sized problems. To further enhance the performance of the SPTA-based algorithms, an improvement scheme based on local search is provided for moderate scale problems. New lower bound is presented for evaluating the asymptotic optimality of the algorithms. Numerical simulations demonstrate the effectiveness of the proposed algorithms.

  19. Asymptotic Analysis of SPTA-Based Algorithms for No-Wait Flow Shop Scheduling Problem with Release Dates

    Directory of Open Access Journals (Sweden)

    Tao Ren

    2014-01-01

    Full Text Available We address the scheduling problem for a no-wait flow shop to optimize total completion time with release dates. With the tool of asymptotic analysis, we prove that the objective values of two SPTA-based algorithms converge to the optimal value for sufficiently large-sized problems. To further enhance the performance of the SPTA-based algorithms, an improvement scheme based on local search is provided for moderate scale problems. New lower bound is presented for evaluating the asymptotic optimality of the algorithms. Numerical simulations demonstrate the effectiveness of the proposed algorithms.

  20. Robust Vehicle Detection under Various Environments to Realize Road Traffic Flow Surveillance Using an Infrared Thermal Camera

    Science.gov (United States)

    Iwasaki, Yoichiro; Misumi, Masato; Nakamiya, Toshiyuki

    2015-01-01

    To realize road traffic flow surveillance under various environments which contain poor visibility conditions, we have already proposed two vehicle detection methods using thermal images taken with an infrared thermal camera. The first method uses pattern recognition for the windshields and their surroundings to detect vehicles. However, the first method decreases the vehicle detection accuracy in winter season. To maintain high vehicle detection accuracy in all seasons, we developed the second method. The second method uses tires' thermal energy reflection areas on a road as the detection targets. The second method did not achieve high detection accuracy for vehicles on left-hand and right-hand lanes except for two center-lanes. Therefore, we have developed a new method based on the second method to increase the vehicle detection accuracy. This paper proposes the new method and shows that the detection accuracy for vehicles on all lanes is 92.1%. Therefore, by combining the first method and the new method, high vehicle detection accuracies are maintained under various environments, and road traffic flow surveillance can be realized. PMID:25763384

  1. Robust Vehicle Detection under Various Environments to Realize Road Traffic Flow Surveillance Using an Infrared Thermal Camera

    Directory of Open Access Journals (Sweden)

    Yoichiro Iwasaki

    2015-01-01

    Full Text Available To realize road traffic flow surveillance under various environments which contain poor visibility conditions, we have already proposed two vehicle detection methods using thermal images taken with an infrared thermal camera. The first method uses pattern recognition for the windshields and their surroundings to detect vehicles. However, the first method decreases the vehicle detection accuracy in winter season. To maintain high vehicle detection accuracy in all seasons, we developed the second method. The second method uses tires’ thermal energy reflection areas on a road as the detection targets. The second method did not achieve high detection accuracy for vehicles on left-hand and right-hand lanes except for two center-lanes. Therefore, we have developed a new method based on the second method to increase the vehicle detection accuracy. This paper proposes the new method and shows that the detection accuracy for vehicles on all lanes is 92.1%. Therefore, by combining the first method and the new method, high vehicle detection accuracies are maintained under various environments, and road traffic flow surveillance can be realized.

  2. Robust vehicle detection under various environments to realize road traffic flow surveillance using an infrared thermal camera.

    Science.gov (United States)

    Iwasaki, Yoichiro; Misumi, Masato; Nakamiya, Toshiyuki

    2015-01-01

    To realize road traffic flow surveillance under various environments which contain poor visibility conditions, we have already proposed two vehicle detection methods using thermal images taken with an infrared thermal camera. The first method uses pattern recognition for the windshields and their surroundings to detect vehicles. However, the first method decreases the vehicle detection accuracy in winter season. To maintain high vehicle detection accuracy in all seasons, we developed the second method. The second method uses tires' thermal energy reflection areas on a road as the detection targets. The second method did not achieve high detection accuracy for vehicles on left-hand and right-hand lanes except for two center-lanes. Therefore, we have developed a new method based on the second method to increase the vehicle detection accuracy. This paper proposes the new method and shows that the detection accuracy for vehicles on all lanes is 92.1%. Therefore, by combining the first method and the new method, high vehicle detection accuracies are maintained under various environments, and road traffic flow surveillance can be realized.

  3. 14 CFR 291.45 - BTS Schedule T-100, U.S. Air Carrier Traffic and Capacity Data by Nonstop Segment and On-Flight...

    Science.gov (United States)

    2010-01-01

    ... 14 Aeronautics and Space 4 2010-01-01 2010-01-01 false BTS Schedule T-100, U.S. Air Carrier... CARGO OPERATIONS IN INTERSTATE AIR TRANSPORTATION Reporting Rules § 291.45 BTS Schedule T-100, U.S. Air... questions about reporting a joint-service operation, contact the BTS Assistant Director—Airline Information...

  4. Dispersion of pollutants in a street canyon and street intersection under traffic-induced flow and turbulence using a low Re k-{epsilon} model

    Energy Technology Data Exchange (ETDEWEB)

    Jicha, M.; Katolicky, J.; Pospisil, J. [Brno University of Technology (Czech Republic). Faculty of Mechanical Engineering

    2002-07-01

    A 3-D Eulerian-Lagrangian approach to moving vehicles is presented that takes into account the traffic-induced flow rate and turbulence. The method is applied to pollutant dispersion in an individual street canyon and a system of two street canyons forming a perpendicular intersection. The approach is based on computational fluid dynamics (CFD) calculations using a Eulerian approach for continuous phase and a Lagrangian approach for moving vehicles. The wind speed was assigned values of 4, 7 and 12 m/s. One-way and two-way traffic with different traffic rates per lane is considered. In the case of the intersection, a longitudinal wind direction was assumed. Predictions show differences in the pollutant dispersion in the case of one-way and two-way traffic. (author)

  5. Robust Vehicle Detection under Various Environmental Conditions Using an Infrared Thermal Camera and Its Application to Road Traffic Flow Monitoring

    Directory of Open Access Journals (Sweden)

    Toshiyuki Nakamiya

    2013-06-01

    Full Text Available We have already proposed a method for detecting vehicle positions and their movements (henceforth referred to as “our previous method” using thermal images taken with an infrared thermal camera. Our experiments have shown that our previous method detects vehicles robustly under four different environmental conditions which involve poor visibility conditions in snow and thick fog. Our previous method uses the windshield and its surroundings as the target of the Viola-Jones detector. Some experiments in winter show that the vehicle detection accuracy decreases because the temperatures of many windshields approximate those of the exterior of the windshields. In this paper, we propose a new vehicle detection method (henceforth referred to as “our new method”. Our new method detects vehicles based on tires’ thermal energy reflection. We have done experiments using three series of thermal images for which the vehicle detection accuracies of our previous method are low. Our new method detects 1,417 vehicles (92.8% out of 1,527 vehicles, and the number of false detection is 52 in total. Therefore, by combining our two methods, high vehicle detection accuracies are maintained under various environmental conditions. Finally, we apply the traffic information obtained by our two methods to traffic flow automatic monitoring, and show the effectiveness of our proposal.

  6. Robust vehicle detection under various environmental conditions using an infrared thermal camera and its application to road traffic flow monitoring.

    Science.gov (United States)

    Iwasaki, Yoichiro; Misumi, Masato; Nakamiya, Toshiyuki

    2013-06-17

    We have already proposed a method for detecting vehicle positions and their movements (henceforth referred to as "our previous method") using thermal images taken with an infrared thermal camera. Our experiments have shown that our previous method detects vehicles robustly under four different environmental conditions which involve poor visibility conditions in snow and thick fog. Our previous method uses the windshield and its surroundings as the target of the Viola-Jones detector. Some experiments in winter show that the vehicle detection accuracy decreases because the temperatures of many windshields approximate those of the exterior of the windshields. In this paper, we propose a new vehicle detection method (henceforth referred to as "our new method"). Our new method detects vehicles based on tires' thermal energy reflection. We have done experiments using three series of thermal images for which the vehicle detection accuracies of our previous method are low. Our new method detects 1,417 vehicles (92.8%) out of 1,527 vehicles, and the number of false detection is 52 in total. Therefore, by combining our two methods, high vehicle detection accuracies are maintained under various environmental conditions. Finally, we apply the traffic information obtained by our two methods to traffic flow automatic monitoring, and show the effectiveness of our proposal.

  7. Applying Graph Theory to Problems in Air Traffic Management

    Science.gov (United States)

    Farrahi, Amir H.; Goldberg, Alan T.; Bagasol, Leonard N.; Jung, Jaewoo

    2017-01-01

    Graph theory is used to investigate three different problems arising in air traffic management. First, using a polynomial reduction from a graph partitioning problem, it isshown that both the airspace sectorization problem and its incremental counterpart, the sector combination problem are NP-hard, in general, under several simple workload models. Second, using a polynomial time reduction from maximum independent set in graphs, it is shown that for any fixed e, the problem of finding a solution to the minimum delay scheduling problem in traffic flow management that is guaranteed to be within n1-e of the optimal, where n is the number of aircraft in the problem instance, is NP-hard. Finally, a problem arising in precision arrival scheduling is formulated and solved using graph reachability. These results demonstrate that graph theory provides a powerful framework for modeling, reasoning about, and devising algorithmic solutions to diverse problems arising in air traffic management.

  8. Scheduling and Fluid Routing for Flow-Based Microfluidic Laboratories-on-a-Chip

    DEFF Research Database (Denmark)

    Minhass, Wajid Hassan; McDaniel, Jeffrey; Raagaard, Michael Lander

    2017-01-01

    Microfluidic laboratories-on-chip (LoCs) are replacing the conventional biochemical analyzers and are able to integrate the necessary functions for biochemical analysis onchip. There are several types of LoCs, each having its advantages and limitations. In this paper we are interested in flow-bas...

  9. Model petri net of adaptive traffic lights and its collaboration with a special event

    Directory of Open Access Journals (Sweden)

    Tristono Tomi

    2018-01-01

    Full Text Available Traffic lights have an important role as the system control of vehicles flow on the urban network. Commonly, most countries still using fixed time strategy. Our research proposes the adaptive traffic lights model to response the traffic demand. It uses basic Petri net as a general modeling framework. Foractuating method of minimum and maximum green signal time interval, the green traffic lights have three-time extension units. Next, we collaborate on a case of the existence of railways that crosses on the southern arm of an intersection. We introduce both of collaboration model design of traffic lights and the railway's gate which always closes while a train passing. Verification and validation of the model are based on the simulation result of vehicles queue. The collaboration model design of traffic lights has excellent performance, and it can resolve the congestion problem better than conventional schedule.

  10. MODELING AND SIMULATION OF TRAFFIC FLOWS ON INCLINED ROAD DURING EVACUATION PROCESS OF THE VOLCANO DISASTER WITH FINITE DIFFERENCE METHOD

    Directory of Open Access Journals (Sweden)

    Richasanty Septima S

    2017-03-01

    Full Text Available The research in this thesis was done to examine the model of traffic flow of volcanic disaster evacuation path for uphill and downhill roads. The assessment was focused on the area of disaster evacuation path from the Pante Raya Bener Meriah intersection to Takengon. This model is assessed for two different types of time when which a disaster occurs; the disaster occurred at night and the disaster occurred during the day, especially during peak hours (working hours. The model was developed with attention to the exixtence of inflow and outflow along the evacuation route. Furthermore, the model obtained is solved numerically by using finite difference method. The chosen approach of this method is upwind scheme with time and space steps using forward difference and backward difference. The solution of this model in the form of simulated vehicle density along evacuation pathways. The research conducted is in the form of a model of traffic flow on evacuation paths and restricted to the inflow and outflow without alternative path as well as the conditions of the road which are uphill and downhill, showed a high density of vehicles either at night or during the day. Uphill road conditions resulted in decreased vehicle speed and vehicle density will increase, while downhill road conditions resulted in increased vehicle speed and vehicle density will decrease, meaning that the road conditions which are uphill and downhill will greatly affect the process of evacuation. Degree vehicles of evacuation efficiency occuring at night without an alternative pathway produces a high efficiency so that it can be interpreted that the evacuation process in the evening was successful and runs better than the evacuation process during the day, and this is caused by the existence of vehicles on the road evacuation process started thus affecting the efficiency levels.

  11. Revisiting the NEH algorithm- the power of job insertion technique for optimizing the makespan in permutation flow shop scheduling

    Directory of Open Access Journals (Sweden)

    A. Baskar

    2016-04-01

    Full Text Available Permutation flow shop scheduling problems have been an interesting area of research for over six decades. Out of the several parameters, minimization of makespan has been studied much over the years. The problems are widely regarded as NP-Complete if the number of machines is more than three. As the computation time grows exponentially with respect to the problem size, heuristics and meta-heuristics have been proposed by many authors that give reasonably accurate and acceptable results. The NEH algorithm proposed in 1983 is still considered as one of the best simple, constructive heuristics for the minimization of makespan. This paper analyses the powerful job insertion technique used by NEH algorithm and proposes seven new variants, the complexity level remains same. 120 numbers of problem instances proposed by Taillard have been used for the purpose of validating the algorithms. Out of the seven, three produce better results than the original NEH algorithm.

  12. Relaxation approximations to second-order traffic flow models by high-resolution schemes

    International Nuclear Information System (INIS)

    Nikolos, I.K.; Delis, A.I.; Papageorgiou, M.

    2015-01-01

    A relaxation-type approximation of second-order non-equilibrium traffic models, written in conservation or balance law form, is considered. Using the relaxation approximation, the nonlinear equations are transformed to a semi-linear diagonilizable problem with linear characteristic variables and stiff source terms with the attractive feature that neither Riemann solvers nor characteristic decompositions are in need. In particular, it is only necessary to provide the flux and source term functions and an estimate of the characteristic speeds. To discretize the resulting relaxation system, high-resolution reconstructions in space are considered. Emphasis is given on a fifth-order WENO scheme and its performance. The computations reported demonstrate the simplicity and versatility of relaxation schemes as numerical solvers

  13. Reducing travel delay by in-car advice on speed, headway and lane use based on downstream traffic flow conditions - a simulation study

    NARCIS (Netherlands)

    Schakel, W.J.; Klunder, G.; van Arem, B.; Harmsen, E.; Hagenzieker, M.P.

    2012-01-01

    A new advisory ADAS system is implemented in micro simulation to asses the effects on traffic flow as well as on safety. The system uses loop detector data from which situations may be recognized where advices are given to drivers in-car. Advice is given on speed, headway and lane use. Effectively

  14. Traffic theory

    National Research Council Canada - National Science Library

    Gazis, Denos C

    2002-01-01

    ... of traffic signal settings The vehicle-actuated traffic signal 87 89 77 CHAPTER 3. TRAFFIC CONTROL 101 Objectives of Traffic Control 103 Single, Isolated Intersection 105 Synchronization Scheme...

  15. Nonlinear analysis and simulation of soliton in the traffic flow; Kotsu jutai soliton no hassei kiko nikansuru kenkyu

    Energy Technology Data Exchange (ETDEWEB)

    Matsumura, M. [Shizuoka University, Shizuoka (Japan); Nagatani, T. [Shizuoka University, Shizuoka (Japan). Faculty of Engineering

    1999-07-25

    Traffic jams are investigated numerically and analystically in the optimal velocity model on a single-line highway. The condition is found whether or not traffic jams occur when a car stops instantly. It is shown that traffic soliton appears at the threshold of occurrence of traffic jams. The Korteweg-de Vries (KdV) equation is derived from the optimal velocity model by the use of the nonlinear analysis. It is found that the traffic soliton appears only near the neutral stability point. The soliton obtained from the nonlinear analysis is consistent with that of the numerical simulation. (author)

  16. Improved Low Power FPGA Binding of Datapaths from Data Flow Graphs with NSGA II -based Schedule Selection

    Directory of Open Access Journals (Sweden)

    BHUVANESWARI, M. C.

    2013-11-01

    Full Text Available FPGAs are increasingly being used to implement data path intensive algorithms for signal processing and image processing applications. In High Level Synthesis of Data Flow Graphs targeted at FPGAs, the effect of interconnect resources such as multiplexers must be considered since they contribute significantly to the area and switching power. We propose a binding framework for behavioral synthesis of Data Flow Graphs (DFGs onto FPGA targets with power reduction as the main criterion. The technique uses a multi-objective GA, NSGA II for design space exploration to identify schedules that have the potential to yield low-power bindings from a population of non-dominated solutions. A greedy constructive binding technique reported in the literature is adapted for interconnect minimization. The binding is further subjected to a perturbation process by altering the register and multiplexer assignments. Results obtained on standard DFG benchmarks indicate that our technique yields better power aware bindings than the constructive binding approach with little or no area overhead.

  17. Short-term traffic flow prediction model using particle swarm optimization–based combined kernel function-least squares support vector machine combined with chaos theory

    Directory of Open Access Journals (Sweden)

    Qiang Shang

    2016-08-01

    Full Text Available Short-term traffic flow prediction is an important part of intelligent transportation systems research and applications. For further improving the accuracy of short-time traffic flow prediction, a novel hybrid prediction model (multivariate phase space reconstruction–combined kernel function-least squares support vector machine based on multivariate phase space reconstruction and combined kernel function-least squares support vector machine is proposed. The C-C method is used to determine the optimal time delay and the optimal embedding dimension of traffic variables’ (flow, speed, and occupancy time series for phase space reconstruction. The G-P method is selected to calculate the correlation dimension of attractor which is an important index for judging chaotic characteristics of the traffic variables’ series. The optimal input form of combined kernel function-least squares support vector machine model is determined by multivariate phase space reconstruction, and the model’s parameters are optimized by particle swarm optimization algorithm. Finally, case validation is carried out using the measured data of an expressway in Xiamen, China. The experimental results suggest that the new proposed model yields better predictions compared with similar models (combined kernel function-least squares support vector machine, multivariate phase space reconstruction–generalized kernel function-least squares support vector machine, and phase space reconstruction–combined kernel function-least squares support vector machine, which indicates that the new proposed model exhibits stronger prediction ability and robustness.

  18. CoreFlow: Enriching Bro security events using network traffic monitoring data

    NARCIS (Netherlands)

    Koning, R.; Buraglio, N.; de Laat, C.; Grosso, P.

    Attacks against network infrastructures can be detected by Intrusion Detection Systems (IDS). Still reaction to these events are often limited by the lack of larger contextual information in which they occurred. In this paper we present CoreFlow, a framework for the correlation and enrichment of IDS

  19. Exact and grid-free solutions to the Lighthill-Whitham-Richards traffic flow model with bounded acceleration for a class of fundamental diagrams

    KAUST Repository

    Qiu, Shanwen

    2013-09-01

    In this article, we propose a new exact and grid-free numerical scheme for computing solutions associated with an hybrid traffic flow model based on the Lighthill-Whitham-Richards (LWR) partial differential equation, for a class of fundamental diagrams. In this hybrid flow model, the vehicles satisfy the LWR equation whenever possible, and have a constant acceleration otherwise. We first propose a mathematical definition of the solution as a minimization problem. We use this formulation to build a grid-free solution method for this model based on the minimization of component function. We then derive these component functions analytically for triangular fundamental diagrams, which are commonly used to model traffic flow. We also show that the proposed computational method can handle fixed or moving bottlenecks. A toolbox implementation of the resulting algorithm is briefly discussed, and posted at https://dl.dropbox.com/u/1318701/Toolbox.zip. © 2013 Elsevier Ltd.

  20. Trajectory Based Traffic Analysis

    DEFF Research Database (Denmark)

    Krogh, Benjamin Bjerre; Andersen, Ove; Lewis-Kelham, Edwin

    2013-01-01

    We present the INTRA system for interactive path-based traffic analysis. The analyses are developed in collaboration with traffic researchers and provide novel insights into conditions such as congestion, travel-time, choice of route, and traffic-flow. INTRA supports interactive point-and-click a......We present the INTRA system for interactive path-based traffic analysis. The analyses are developed in collaboration with traffic researchers and provide novel insights into conditions such as congestion, travel-time, choice of route, and traffic-flow. INTRA supports interactive point......-and-click analysis, due to a novel and efficient indexing structure. With the web-site daisy.aau.dk/its/spqdemo/we will demonstrate several analyses, using a very large real-world data set consisting of 1.9 billion GPS records (1.5 million trajectories) recorded from more than 13000 vehicles, and touching most...

  1. An efficient genetic algorithm for a hybrid flow shop scheduling problem with time lags and sequence-dependent setup time

    Directory of Open Access Journals (Sweden)

    Farahmand-Mehr Mohammad

    2014-01-01

    Full Text Available In this paper, a hybrid flow shop scheduling problem with a new approach considering time lags and sequence-dependent setup time in realistic situations is presented. Since few works have been implemented in this field, the necessity of finding better solutions is a motivation to extend heuristic or meta-heuristic algorithms. This type of production system is found in industries such as food processing, chemical, textile, metallurgical, printed circuit board, and automobile manufacturing. A mixed integer linear programming (MILP model is proposed to minimize the makespan. Since this problem is known as NP-Hard class, a meta-heuristic algorithm, named Genetic Algorithm (GA, and three heuristic algorithms (Johnson, SPTCH and Palmer are proposed. Numerical experiments of different sizes are implemented to evaluate the performance of presented mathematical programming model and the designed GA in compare to heuristic algorithms and a benchmark algorithm. Computational results indicate that the designed GA can produce near optimal solutions in a short computational time for different size problems.

  2. Planning and managing rural recreational traffic flows: why the future can’t be more like the past

    NARCIS (Netherlands)

    Jaarsma, C.F.; Vries, de J.R.; Beunen, R.

    2009-01-01

    The increasing popularity of rural tourism can cause traffic related problems at certain areas. Traffic congestion and parking problems are likely to occur as the infrastructure at these countryside destinations is seldom capable of dealing with the growing number of cars. Values which make the

  3. Design and Operational Evaluation of the Traffic Management Advisor at the Ft. Worth Air Route Traffic Control Center

    Science.gov (United States)

    Swenson, Harry N.; Vincent, Danny; Tobias, Leonard (Technical Monitor)

    1997-01-01

    NASA and the FAA have designed and developed and an automation tool known as the Traffic Management Advisor (TMA). The system was operationally evaluated at the Ft. Worth Air Route Traffic Control Center (ARTCC). The TMA is a time-based strategic planning tool that provides Traffic Management Coordinators and En Route Air Traffic Controllers the ability to efficiently optimize the capacity of a demand impacted airport. The TMA consists of trajectory prediction, constraint-based runway scheduling, traffic flow visualization and controllers advisories. The TMA was used and operationally evaluated for forty-one rush traffic periods during a one month period in the Summer of 1996. The evaluations included all shifts of air traffic operations as well as periods of inclement weather. Performance data was collected for engineering and human factor analysis and compared with similar operations without the TMA. The engineering data indicates that the operations with the TMA show a one to two minute per aircraft delay reduction during rush periods. The human factor data indicate a perceived reduction in en route controller workload as well as an increase in job satisfaction. Upon completion of the evaluation, the TMA has become part of the normal operations at the Ft. Worth ARTCC.

  4. Dynamic control of traffic lights

    NARCIS (Netherlands)

    Haijema, Rene; Hendrix, Eligius M.T.; Wal, van der Jan

    2017-01-01

    Traffic lights are put in place to dynamically change priority between traffic participants. Commonly, the duration of green intervals and the grouping, and ordering in which traffic flows are served are pre-fixed. In this chapter, the problem of minimizing vehicle delay at isolated intersections is

  5. Scheduling by positional completion times: analysis of a two-stage flow shop problem with a batching machine

    NARCIS (Netherlands)

    Hoogeveen, J.A.; Velde, van de S.L.

    1998-01-01

    We consider a scheduling problem introduced by Ahmadi et al., Batching and scheduling jobs on batch and discrete processors, Operation Research 40 (1992) 750–763, in which each job has to be prepared before it can be processed. The preparation is performed by a batching machine; it can prepare at

  6. Accurate Traffic Flow Prediction in Heterogeneous Vehicular Networks in an Intelligent Transport System Using a Supervised Non-Parametric Classifier

    Directory of Open Access Journals (Sweden)

    Hesham El-Sayed

    2018-05-01

    Full Text Available Heterogeneous vehicular networks (HETVNETs evolve from vehicular ad hoc networks (VANETs, which allow vehicles to always be connected so as to obtain safety services within intelligent transportation systems (ITSs. The services and data provided by HETVNETs should be neither interrupted nor delayed. Therefore, Quality of Service (QoS improvement of HETVNETs is one of the topics attracting the attention of researchers and the manufacturing community. Several methodologies and frameworks have been devised by researchers to address QoS-prediction service issues. In this paper, to improve QoS, we evaluate various traffic characteristics of HETVNETs and propose a new supervised learning model to capture knowledge on all possible traffic patterns. This model is a refinement of support vector machine (SVM kernels with a radial basis function (RBF. The proposed model produces better results than SVMs, and outperforms other prediction methods used in a traffic context, as it has lower computational complexity and higher prediction accuracy.

  7. An Integer Batch Scheduling Model for a Single Machine with Simultaneous Learning and Deterioration Effects to Minimize Total Actual Flow Time

    Science.gov (United States)

    Yusriski, R.; Sukoyo; Samadhi, T. M. A. A.; Halim, A. H.

    2016-02-01

    In the manufacturing industry, several identical parts can be processed in batches, and setup time is needed between two consecutive batches. Since the processing times of batches are not always fixed during a scheduling period due to learning and deterioration effects, this research deals with batch scheduling problems with simultaneous learning and deterioration effects. The objective is to minimize total actual flow time, defined as a time interval between the arrival of all parts at the shop and their common due date. The decision variables are the number of batches, integer batch sizes, and the sequence of the resulting batches. This research proposes a heuristic algorithm based on the Lagrange Relaxation. The effectiveness of the proposed algorithm is determined by comparing the resulting solutions of the algorithm to the respective optimal solution obtained from the enumeration method. Numerical experience results show that the average of difference among the solutions is 0.05%.

  8. An Integer Batch Scheduling Model for a Single Machine with Simultaneous Learning and Deterioration Effects to Minimize Total Actual Flow Time

    International Nuclear Information System (INIS)

    Yusriski, R; Sukoyo; Samadhi, T M A A; Halim, A H

    2016-01-01

    In the manufacturing industry, several identical parts can be processed in batches, and setup time is needed between two consecutive batches. Since the processing times of batches are not always fixed during a scheduling period due to learning and deterioration effects, this research deals with batch scheduling problems with simultaneous learning and deterioration effects. The objective is to minimize total actual flow time, defined as a time interval between the arrival of all parts at the shop and their common due date. The decision variables are the number of batches, integer batch sizes, and the sequence of the resulting batches. This research proposes a heuristic algorithm based on the Lagrange Relaxation. The effectiveness of the proposed algorithm is determined by comparing the resulting solutions of the algorithm to the respective optimal solution obtained from the enumeration method. Numerical experience results show that the average of difference among the solutions is 0.05%. (paper)

  9. Traffic Games: Modeling Freeway Traffic with Game Theory.

    Science.gov (United States)

    Cortés-Berrueco, Luis E; Gershenson, Carlos; Stephens, Christopher R

    2016-01-01

    We apply game theory to a vehicular traffic model to study the effect of driver strategies on traffic flow. The resulting model inherits the realistic dynamics achieved by a two-lane traffic model and aims to incorporate phenomena caused by driver-driver interactions. To achieve this goal, a game-theoretic description of driver interaction was developed. This game-theoretic formalization allows one to model different lane-changing behaviors and to keep track of mobility performance. We simulate the evolution of cooperation, traffic flow, and mobility performance for different modeled behaviors. The analysis of these results indicates a mobility optimization process achieved by drivers' interactions.

  10. Design of an Ecological Flow-based Interface for 4D Trajectory Management in Air Traffic Control

    NARCIS (Netherlands)

    Pinto, J.; Klomp, R.E.; Borst, C.; Van Paassen, M.M.; Mulder, M.

    2015-01-01

    The concept of trajectory-based operations as proposed by SESAR and NextGen seeks to increase airspace efficiency and capacity by introducing time as an explicit control variable. Such form of operations lean heavily on the introduction of higher levels of automation to support the human air traffic

  11. Air traffic management evaluation tool

    Science.gov (United States)

    Sridhar, Banavar (Inventor); Sheth, Kapil S. (Inventor); Chatterji, Gano Broto (Inventor); Bilimoria, Karl D. (Inventor); Grabbe, Shon (Inventor); Schipper, John F. (Inventor)

    2012-01-01

    Methods for evaluating and implementing air traffic management tools and approaches for managing and avoiding an air traffic incident before the incident occurs. A first system receives parameters for flight plan configurations (e.g., initial fuel carried, flight route, flight route segments followed, flight altitude for a given flight route segment, aircraft velocity for each flight route segment, flight route ascent rate, flight route descent route, flight departure site, flight departure time, flight arrival time, flight destination site and/or alternate flight destination site), flight plan schedule, expected weather along each flight route segment, aircraft specifics, airspace (altitude) bounds for each flight route segment, navigational aids available. The invention provides flight plan routing and direct routing or wind optimal routing, using great circle navigation and spherical Earth geometry. The invention provides for aircraft dynamics effects, such as wind effects at each altitude, altitude changes, airspeed changes and aircraft turns to provide predictions of aircraft trajectory (and, optionally, aircraft fuel use). A second system provides several aviation applications using the first system. Several classes of potential incidents are analyzed and averted, by appropriate change en route of one or more parameters in the flight plan configuration, as provided by a conflict detection and resolution module and/or traffic flow management modules. These applications include conflict detection and resolution, miles-in trail or minutes-in-trail aircraft separation, flight arrival management, flight re-routing, weather prediction and analysis and interpolation of weather variables based upon sparse measurements. The invention combines these features to provide an aircraft monitoring system and an aircraft user system that interact and negotiate changes with each other.

  12. Systemic Approach to Traffic Evaluation of Mostar Airport

    Directory of Open Access Journals (Sweden)

    Eldo Raguž

    2005-11-01

    Full Text Available The attempt of this work is to systematically find solutionsfor Mostar Airport development through technical and technologicalharmonization of traffic processes undertaken in twoseparate organizations - airport and air traffic control and coordinationbetween other traffic branches. The work uses theindicators of traffic flows and tourist trends in the region, andtogether with the mentioned simulations it attempts to evaluatethe traffic potentials in the region by affecting the change in thecurrent negative traffic flows at Mostar Airport.

  13. An Exact and Grid-free Numerical Scheme for the Hybrid Two Phase Traffic Flow Model Based on the Lighthill-Whitham-Richards Model with Bounded Acceleration

    KAUST Repository

    Qiu, Shanwen

    2012-07-01

    In this article, we propose a new grid-free and exact solution method for computing solutions associated with an hybrid traffic flow model based on the Lighthill- Whitham-Richards (LWR) partial differential equation. In this hybrid flow model, the vehicles satisfy the LWR equation whenever possible, and have a fixed acceleration otherwise. We first present a grid-free solution method for the LWR equation based on the minimization of component functions. We then show that this solution method can be extended to compute the solutions to the hybrid model by proper modification of the component functions, for any concave fundamental diagram. We derive these functions analytically for the specific case of a triangular fundamental diagram. We also show that the proposed computational method can handle fixed or moving bottlenecks.

  14. U18 : Traffic signal safety (phase B).

    Science.gov (United States)

    2009-08-01

    Efficiently scheduling traffic, particularly heavy vehicles, remains a key challenge in transportation engineering. This project has focused on the development of a novel trafficsignal-control methodology to improve the safety of heavy vehicles on...

  15. Steady traffic scheduler for internet video traffic across large delay ...

    African Journals Online (AJOL)

    Journal of Computer Science and Its Application. Journal Home · ABOUT THIS JOURNAL · Advanced Search · Current Issue · Archives · Journal Home > Vol 22, No 2 (2015) >. Log in or Register to get access to full text downloads.

  16. Refinery scheduling

    Energy Technology Data Exchange (ETDEWEB)

    Magalhaes, Marcus V.; Fraga, Eder T. [PETROBRAS, Rio de Janeiro, RJ (Brazil); Shah, Nilay [Imperial College, London (United Kingdom)

    2004-07-01

    This work addresses the refinery scheduling problem using mathematical programming techniques. The solution adopted was to decompose the entire refinery model into a crude oil scheduling and a product scheduling problem. The envelope for the crude oil scheduling problem is composed of a terminal, a pipeline and the crude area of a refinery, including the crude distillation units. The solution method adopted includes a decomposition technique based on the topology of the system. The envelope for the product scheduling comprises all tanks, process units and products found in a refinery. Once crude scheduling decisions are Also available the product scheduling is solved using a rolling horizon algorithm. All models were tested with real data from PETROBRAS' REFAP refinery, located in Canoas, Southern Brazil. (author)

  17. Traffic Management System on Airport Manoeuvring Areas

    Directory of Open Access Journals (Sweden)

    Miroslav Borković

    2006-11-01

    Full Text Available In the last twenty years the number of flights at the busiestairports in the world has doubled, which, in the meantime hasled to a situation in which runways and taxi ways (manoeuvringareas cannot follow such substantial increase. As the result,many airports could not use their capacities in the full range interms of handling passengers and cargo. As a consequence,there were delays and traffic congestion, fuel was unnecessarilywasted, all of which caused negative impact on the environment.Traffic capacity increase on the ground cannot be consideredwithout the development and implementation of thesystem infrastructure that would optimize traffic flows and itsdistribution on the airport itself In these terms, and for positivesolution of these problems, a new system for surveillance andcontrol of aircraft on the airport manoeuvring areas is necessary,one which could be implemented fairly quickly, would becomplementary with the existing international standards andwould be upgraded to the existing and available technology andinfrastructure. With the implementation of the Advanced SurfaceMonitoring and Control System (A-SMGCS the aircrafttaxiing time could be significantly shortened and could be determinedmore accurately, which would have positive impacton the flight schedule. The unnecessary aircraft braking actionscould be also avoided, and this would reduce the fuel consumption,as well as noise and environmental pollution.

  18. Outflow of traffic from the national capital Kuala Lumpur to the north, south and east coast highways using flow, speed and density relationships

    Institute of Scientific and Technical Information of China (English)

    Nik Hashim Nik Mustapha; Nik Nur Wahidah Nik Hashim

    2016-01-01

    The functional relationships between flow (veh/km), density (veh/h) and speed (km/h) in traffic congestion have a long history of research. However, their findings and techniques persist to be relevant to this day. The analysis is pertinent, particularly in finding the best fit for the three major highways in Malaysia, namely the KL-Karak Highway, KL-Seremban Highway and KL-Ipoh Highway. The trans-logarithm function of density—speed model was compared to the classical models of Greenshields, Greenberg, Underwood and Drake et al. using data provided by the Transport Statistics Malaysia 2014. The results of regression analysis revealed that the Greenshields and Greenberg models were statistically signifi-cant. The trans-logarithm function was also tested and the results were nonetheless without exception. Its usefulness in addition to statistical significance related to the derived economic concepts of maximum speed and the related number of vehicles, flow and density and the limits of free speed were relevant in comparing the individual levels of traffic congestion between highways. For instance, KL-Karak Highway was least congested compared to KL-Seremban Highway and KL-Ipoh Highway. Their maximum speeds, based on three lanes carriage capacity of one direction, were 33.4 km/h for KL-Karak, 15.9 km/h for KL-Seremban, and 21.1 km/h for KL-Ipoh. Their corresponding flows were approxi-mated at 1080.9 veh/h, 1555.4 veh/h, and 1436.6 veh/h.

  19. Outflow of traffic from the national capital Kuala Lumpur to the north, south and east coast highways using flow, speed and density relationships

    Directory of Open Access Journals (Sweden)

    Nik Hashim Nik Mustapha

    2016-12-01

    Full Text Available The functional relationships between flow (veh/km, density (veh/h and speed (km/h in traffic congestion have a long history of research. However, their findings and techniques persist to be relevant to this day. The analysis is pertinent, particularly in finding the best fit for the three major highways in Malaysia, namely the KL-Karak Highway, KL-Seremban Highway and KL-Ipoh Highway. The trans-logarithm function of density–speed model was compared to the classical models of Greenshields, Greenberg, Underwood and Drake et al. using data provided by the Transport Statistics Malaysia 2014. The results of regression analysis revealed that the Greenshields and Greenberg models were statistically significant. The trans-logarithm function was also tested and the results were nonetheless without exception. Its usefulness in addition to statistical significance related to the derived economic concepts of maximum speed and the related number of vehicles, flow and density and the limits of free speed were relevant in comparing the individual levels of traffic congestion between highways. For instance, KL-Karak Highway was least congested compared to KL-Seremban Highway and KL-Ipoh Highway. Their maximum speeds, based on three lanes carriage capacity of one direction, were 33.4 km/h for KL-Karak, 15.9 km/h for KL-Seremban, and 21.1 km/h for KL-Ipoh. Their corresponding flows were approximated at 1080.9 veh/h, 1555.4 veh/h, and 1436.6 veh/h.

  20. GPS queues with heterogeneous traffic classes

    NARCIS (Netherlands)

    Borst, Sem; Mandjes, M.R.H.; van Uitert, Miranda

    2002-01-01

    We consider a queue fed by a mixture of light-tailed and heavy-tailed traffic. The two traffic classes are served in accordance with the generalized processor sharing (GPS) discipline. GPS-based scheduling algorithms, such as weighted fair queueing (WFQ), have emerged as an important mechanism for

  1. Reports on internet traffic statistics

    NARCIS (Netherlands)

    Hoogesteger, Martijn; de Oliveira Schmidt, R.; Sperotto, Anna; Pras, Aiko

    2013-01-01

    Internet traffic statistics can provide valuable information to network analysts and researchers about the way nowadays networks are used. In the past, such information was provided by Internet2 in a public website called Internet2 NetFlow: Weekly Reports. The website reported traffic statistics

  2. TAGUCHI METHOD FOR THREE-STAGE ASSEMBLY FLOW SHOP SCHEDULING PROBLEM WITH BLOCKING AND SEQUENCE-DEPENDENT SET UP TIMES

    Directory of Open Access Journals (Sweden)

    AREF MALEKI-DARONKOLAEI

    2013-10-01

    Full Text Available This article considers a three-stage assembly flowshop scheduling problem minimizing the weighted sum of mean completion time and makespan with sequence-dependent setup times at the first stage and blocking times between each stage. To tackle such an NP-hard, two meta-heuristic algorithms are presented. The novelty of our approach is to develop a variable neighborhood search algorithm (VNS and a well-known simulated annealing (SA for the problem. Furthermore, to enhance the performance of the (SA, its parameters are optimized by the use of Taguchi method, but to setting parameters of VNS just one parameter has been used without Taguchi. The computational results show that the proposed VNS is better in mean and standard deviation for all sizes of the problem than SA, but on the contrary about CPU Time SA outperforms VNS.

  3. Comparison of Firefly algorithm and Artificial Immune System algorithm for lot streaming in -machine flow shop scheduling

    Directory of Open Access Journals (Sweden)

    G. Vijay Chakaravarthy

    2012-11-01

    Full Text Available Lot streaming is a technique used to split the processing of lots into several sublots (transfer batches to allow the overlapping of operations in a multistage manufacturing systems thereby shortening the production time (makespan. The objective of this paper is to minimize the makespan and total flow time of -job, -machine lot streaming problem in a flow shop with equal and variable size sublots and also to determine the optimal sublot size. In recent times researchers are concentrating and applying intelligent heuristics to solve flow shop problems with lot streaming. In this research, Firefly Algorithm (FA and Artificial Immune System (AIS algorithms are used to solve the problem. The results obtained by the proposed algorithms are also compared with the performance of other worked out traditional heuristics. The computational results shows that the identified algorithms are more efficient, effective and better than the algorithms already tested for this problem.

  4. How do Air Traffic Controllers Use Automation and Tools Differently During High Demand Situations?

    Science.gov (United States)

    Kraut, Joshua M.; Mercer, Joey; Morey, Susan; Homola, Jeffrey; Gomez, Ashley; Prevot, Thomas

    2013-01-01

    In a human-in-the-loop simulation, two air traffic controllers managed identical airspace while burdened with higher than average workload, and while using advanced tools and automation designed to assist with scheduling aircraft on multiple arrival flows to a single meter fix. This paper compares the strategies employed by each controller, and investigates how the controllers' strategies change while managing their airspace under more normal workload conditions and a higher workload condition. Each controller engaged in different methods of maneuvering aircraft to arrive on schedule, and adapted their strategies to cope with the increased workload in different ways. Based on the conclusions three suggestions are made: that quickly providing air traffic controllers with recommendations and information to assist with maneuvering and scheduling aircraft when burdened with increased workload will improve the air traffic controller's effectiveness, that the tools should adapt to the strategy currently employed by a controller, and that training should emphasize which traffic management strategies are most effective given specific airspace demands.

  5. Phase diagram distortion from traffic parameter averaging.

    NARCIS (Netherlands)

    Stipdonk, H. Toorenburg, J. van & Postema, M.

    2010-01-01

    Motorway traffic congestion is a major bottleneck for economic growth. Therefore, research of traffic behaviour is carried out in many countries. Although well describing the undersaturated free flow phase as an almost straight line in a (k,q)-phase diagram, congested traffic observations and

  6. Some random models in traffic science

    Energy Technology Data Exchange (ETDEWEB)

    Hjorth, U.

    1996-06-01

    We give an overview of stochastic models for the following traffic phenomena. Models for traffic flow including gaps and capacities for lanes, crossings and roundabouts. Models for wanted and achieved speed distributions. Mode selection models including dispersed equilibrium models and traffic accident models. Also some statistical questions are discussed. 60 refs, 1 tab

  7. Design and Evaluation of the Terminal Area Precision Scheduling and Spacing System

    Science.gov (United States)

    Swenson, Harry N.; Thipphavong, Jane; Sadovsky, Alex; Chen, Liang; Sullivan, Chris; Martin, Lynne

    2011-01-01

    This paper describes the design, development and results from a high fidelity human-in-the-loop simulation of an integrated set of trajectory-based automation tools providing precision scheduling, sequencing and controller merging and spacing functions. These integrated functions are combined into a system called the Terminal Area Precision Scheduling and Spacing (TAPSS) system. It is a strategic and tactical planning tool that provides Traffic Management Coordinators, En Route and Terminal Radar Approach Control air traffic controllers the ability to efficiently optimize the arrival capacity of a demand-impacted airport while simultaneously enabling fuel-efficient descent procedures. The TAPSS system consists of four-dimensional trajectory prediction, arrival runway balancing, aircraft separation constraint-based scheduling, traffic flow visualization and trajectory-based advisories to assist controllers in efficient metering, sequencing and spacing. The TAPSS system was evaluated and compared to today's ATC operation through extensive series of human-in-the-loop simulations for arrival flows into the Los Angeles International Airport. The test conditions included the variation of aircraft demand from a baseline of today's capacity constrained periods through 5%, 10% and 20% increases. Performance data were collected for engineering and human factor analysis and compared with similar operations both with and without the TAPSS system. The engineering data indicate operations with the TAPSS show up to a 10% increase in airport throughput during capacity constrained periods while maintaining fuel-efficient aircraft descent profiles from cruise to landing.

  8. Schedule Analytics

    Science.gov (United States)

    2016-04-30

    Warfare, Naval Sea Systems Command Acquisition Cycle Time : Defining the Problem David Tate, Institute for Defense Analyses Schedule Analytics Jennifer...research was comprised of the following high- level steps :  Identify and review primary data sources 1...research. However, detailed reviews of the OMB IT Dashboard data revealed that schedule data is highly aggregated. Program start date and program end date

  9. Integer batch scheduling problems for a single-machine with simultaneous effect of learning and forgetting to minimize total actual flow time

    Directory of Open Access Journals (Sweden)

    Rinto Yusriski

    2015-09-01

    Full Text Available This research discusses an integer batch scheduling problems for a single-machine with position-dependent batch processing time due to the simultaneous effect of learning and forgetting. The decision variables are the number of batches, batch sizes, and the sequence of the resulting batches. The objective is to minimize total actual flow time, defined as total interval time between the arrival times of parts in all respective batches and their common due date. There are two proposed algorithms to solve the problems. The first is developed by using the Integer Composition method, and it produces an optimal solution. Since the problems can be solved by the first algorithm in a worst-case time complexity O(n2n-1, this research proposes the second algorithm. It is a heuristic algorithm based on the Lagrange Relaxation method. Numerical experiments show that the heuristic algorithm gives outstanding results.

  10. Effects of an alternating work shift on air traffic controllers and the relationship with excessive daytime sleepiness and stress.

    Science.gov (United States)

    Freitas, Ângela M; Portuguez, Mirna Wetters; Russomano, Thaís; Freitas, Marcos de; Silvello, Silvio Luis da Silva; Costa, Jaderson Costa da

    2017-10-01

    To evaluate symptoms of stress and excessive daytime sleepiness (EDS) in air traffic control (ATC) officers in Brazil. Fifty-two ATC officers participated, based at three air traffic control units, identified as A, B and C. Stress symptoms were assessed using the Lipp Inventory of Stress Symptoms for Adults, and EDS by the Epworth Sleepiness Scale. The sample mean age was 37 years, 76.9% of whom were male. Excessive daytime sleepiness was identified in 25% of the ATC officers, with 84.6% of these based at air traffic control unit A, which has greater air traffic flow, operating a 24-hour alternating work shift schedule. A total of 16% of the ATC officers had stress symptoms, and of these, 62% showed a predominance of physical symptoms. The high percentage of ATC officers with EDS identified in group A may be related to chronodisruption due to night work and alternating shifts.

  11. The fundamental diagram : a macroscopic traffic flow model. Paper and shortened version presented to the OECD Symposium on Methods for determining geometric road design standards 1976, Helsingor, Denmark, 10-12 May 1976.

    NARCIS (Netherlands)

    Botma, H.

    1976-01-01

    In the theory and models of traffic-flow the emphasis lies on the interaction between vehicles, based on the characteristics of the road, the drivers and vehicles, and not on the interaction between a single vehicle and the road. Three levels of models, arranged in the order of increasing detail can

  12. Physics of traffic gridlock in a city

    OpenAIRE

    Kerner, Boris S.

    2011-01-01

    Based of simulations of a stochastic three-phase traffic flow model, we reveal that at a signalized city intersection under small link inflow rates at which a vehicle queue developed during the red phase of light signal dissolves fully during the green phase, i.e., no traffic gridlock should be expected, nevertheless, traffic breakdown with the subsequent city gridlock occurs with some probability after a random time delay. This traffic breakdown is initiated by a first-order phase transition...

  13. 33 CFR 401.58 - Pleasure craft scheduling.

    Science.gov (United States)

    2010-07-01

    ... 33 Navigation and Navigable Waters 3 2010-07-01 2010-07-01 false Pleasure craft scheduling. 401.58... OF TRANSPORTATION SEAWAY REGULATIONS AND RULES Regulations Seaway Navigation § 401.58 Pleasure craft scheduling. (a) The transit of pleasure craft shall be scheduled by the traffic controller or the officer in...

  14. Modelling Truck Weigh Stations’ Locations based on Truck Traffic Flow and Overweight Violation: A Case Study in Bosnia and Herzegovina

    Directory of Open Access Journals (Sweden)

    Mirsad Kulović

    2018-04-01

    Full Text Available The number of registered commercial freight vehicles is constantly increasing, increasing therefore as well the traffic load on the roads in Bosnia and Herzegovina. A significant part of freight vehicles moving along the main and regional roads are overloaded and cause significant damage to road infrastructure, affect road safety and result in an increase of emissions of harmful gases for people and the environment. The overloading rate is extremely high, in particular with 5-axle trucks representing 58.7%. The research showed that the increased overload level ranges from 10-20% of the maximum permissible weight. The importance of load limits was recognized early in the history of road development. This interrelation led directly to limitations on vehicle loads, and laws were enacted in many countries to establish the maximum allowable motor vehicle sizes and weights. Strict enforcement of motor vehicle size and weight laws is a step toward reducing motor vehicle size and weight violations, heavy truck accidents, and, even more, improving road maintenance, rehabilitation expenditures and road safety. Thus, based on the applied model the objective of this paper is to evaluate and optimize the locations of truck weigh stations on the road network of Bosnia and Herzegovina.

  15. Cyclic delivery scheduling to customers with different priorities

    Directory of Open Access Journals (Sweden)

    Katarzyna Zofia Gdowska

    2013-12-01

    Full Text Available Background: In this paper a cyclic delivery scheduling problem for customers with different priorities is presented. Shops, which are provided with deliveries, are occasionally located in places which are crucial for the proper flow of traffic. In such places coordination of deliveries is crucial; therefore it allows to completely eliminate the phenomenon of the simultaneous arrivals of suppliers. Methods: In this paper the cyclic delivery scheduling problem for customers with different priorities was presented. To this theoretical problem a mix integer programming model was developed. Specific approach to the cyclic delivery scheduling problem is inspired by timetabling problem for urban public transport. Results: Mixed integer programming model was employed for solving four cases of cyclic delivery scheduling problem for customers with different priorities. When the value of the synchronization priority assigned to a single customer raised then the total number of synchronizations in the whole network decreased. In order to compare solutions a synchronization rate was utilized. A simple factor was utilized - the proportion of number of synchronizations of deliveries to a given customer to the total number of synchronizations obtained for the whole network. When the value of synchronization priority raised then the value of synchronization rate of this customer improved significantly. Conclusions: The mixed integer programming model for the cyclic delivery scheduling problem for customers with different priorities presented in this paper can be utilized for generating schedules of serving customers located in places where only one delivery can be received and unloaded at one go and where there is no space for other suppliers to wait in a queue. Such a schedule can be very useful for organizing deliveries to small shops united in a franchising network, since they operate in a way that is very similar to the network presented in this paper

  16. Coordinated Traffic Incident and Congestion Management (TIM-CM) : Mitigating Regional Impacts of Major Traffic Incidents in the Seattle I-5 Corridor

    Science.gov (United States)

    2018-02-02

    Within the Seattle metropolitan area, traffic incident management (TIM) operations provide a multi-jurisdictional and coordinated strategy to detect, respond to, and clear traffic incidents so that traffic flow can be restored quickly and safely. The...

  17. Multiagent reinforcement learning for urban traffic control using coordination graphs

    NARCIS (Netherlands)

    Kuyer, L.; Whiteson, S.; Bakker, B.; Vlassis, N.

    2008-01-01

    Since traffic jams are ubiquitous in the modern world, optimizing the behavior of traffic lights for efficient traffic flow is a critically important goal. Though most current traffic lights use simple heuristic protocols, more efficient controllers can be discovered automatically via multiagent

  18. Freight railway transport: Critical variables to improve the transport applied to infrastructure costs and its associated traffic flow

    Energy Technology Data Exchange (ETDEWEB)

    Zakowska, L.; Pulawska-Obiedowska, S.

    2016-07-01

    The developed societies have as challenge, among others, to achieve a mobility development based on economic models of low carbon and energy efficient, making it accessible to the entire population. In this context, the sustainable mobility seems to meet the economic, social and environmental needs, minimizing their negative impact. There are three factors that are relevant: (1) infrastructures; (2) modes of transport more ecological and safe, and (3) operations and services for passengers and freights.The objective of this research is to provide guidance to investment in sustainable transport infrastructures that are truly useful and effective. In particular we have studied the case of the railway, using the following information: details of the infrastructure; cost of construction (per kilometre); maintenance cost, and life cycle. This information may be relevant to consider their possible business models.The methodology of this research was focused in the detailed analysis of the infrastructure use and maintenance criteria, the market opportunities for freight development and the available data to validate the obtained results from the software tool reached in this work. Our research includes the different following aspects:• Evaluation of the supported traffic by the rail line.• Relevant items to be considered in the rail infrastructure. Defining the track, we can group items in two sets: civil and rail installations.• Rolling stock available. Locomotives and wagons are modelled to introduce the data as convenience for the user.Besides our research includes the development of software, Decision System Tool (DST), for studying the construction and maintenance cost of railway infrastructure. It is developed in a common and open source program, providing the user the interaction with the critical variable of the line. It has been adjusted using the following references: MOM PlanCargorail; EcoTransIT, and Projects funded by Framework Program of EU (New

  19. Location-based Scheduling

    DEFF Research Database (Denmark)

    Andersson, Niclas; Christensen, Knud

    on the market. However, CPM is primarily an activity based method that takes the activity as the unit of focus and there is criticism raised, specifically in the case of construction projects, on the method for deficient management of construction work and continuous flow of resources. To seek solutions...... to the identified limitations of the CPM method, an alternative planning and scheduling methodology that includes locations is tested. Location-based Scheduling (LBS) implies a shift in focus, from primarily the activities to the flow of work through the various locations of the project, i.e. the building. LBS uses...... the graphical presentation technique of Line-of-balance, which is adapted for planning and management of work-flows that facilitates resources to perform their work without interruptions caused by other resources working with other activities in the same location. As such, LBS and Lean Construction share...

  20. Examining perimeter gating control of urban traffic networkswith locally adaptive traffic signals

    NARCIS (Netherlands)

    Keyvan Ekbatani, M.; Gao, X.; Gayah, V.V.; Knoop, V.L.

    2015-01-01

    Traditionally, urban traffic is controlled by traffic lights. Recent findings of the Macroscopic or Network Fundamental Diagram (MFD or NFD) have led to the development of novel traffic control strategies that can be applied at a networkwide level. One pertinent example is perimeter flow control

  1. Spoofing cyber attack detection in probe-based traffic monitoring systems using mixed integer linear programming

    KAUST Repository

    Canepa, Edward S.; Claudel, Christian G.

    2013-01-01

    in traffic flow monitoring systems by using the underlying traffic flow model. The state of traffic is modeled by the Lighthill-Whitham- Richards traffic flow model, which is a first order scalar conservation law with concave flux function. Given a set

  2. Identifying factors affecting the safety of mid-block bicycle lanes considering mixed 2-wheeled traffic flow.

    Science.gov (United States)

    Bai, Lu; Chan, Ching-Yao; Liu, Pan; Xu, Chengcheng

    2017-10-03

    Electric bikes (e-bikes) have been one of the fastest growing trip modes in Southeast Asia over the past 2 decades. The increasing popularity of e-bikes raised some safety concerns regarding urban transport systems. The primary objective of this study was to identify whether and how the generalized linear regression model (GLM) could be used to relate cyclists' safety with various contributing factors when riding in a mid-block bike lane. The types of 2-wheeled vehicles in the study included bicycle-style electric bicycles (BSEBs), scooter-style electric bicycles (SSEBs), and regular bicycles (RBs). Traffic conflict technology was applied as a surrogate measure to evaluate the safety of 2-wheeled vehicles. The safety performance model was developed by adopting a generalized linear regression model for relating the frequency of rear-end conflicts between e-bikes and regular bikes to the operating speeds of BSEBs, SSEBs, and RBs in mid-block bike lanes. The frequency of rear-end conflicts between e-bikes and bikes increased with an increase in the operating speeds of e-bikes and the volume of e-bikes and bikes and decreased with an increase in the width of bike lanes. The large speed difference between e-bikes and bikes increased the frequency of rear-end conflicts between e-bikes and bikes in mid-block bike lanes. A 1% increase in the average operating speed of e-bikes would increase the expected number of rear-end conflicts between e-bikes and bikes by 1.48%. A 1% increase in the speed difference between e-bikes and bikes would increase the expected number of rear-end conflicts between e-bikes/bikes by 0.16%. The conflict frequency in mid-block bike lanes can be modeled using generalized linear regression models. The factors that significantly affected the frequency of rear-end conflicts included the operating speeds of e-bikes, the speed difference between e-bikes and regular bikes, the volume of e-bikes, the volume of bikes, and the width of bike lanes. The

  3. 网联辅助驾驶混合交通流稳定性及安全性分析%Analysis on stability and safety for mixed traffic flow with connected auxiliary driving

    Institute of Scientific and Technical Information of China (English)

    秦严严; 王昊; 王炜

    2018-01-01

    Focusing on the traffic flow randomly mixed with regular manual driven vehicles and con-nected auxiliary driven vehicles,the stability and the safety are analyzed.A mathematical expecta-tion is proposed for the case of degeneration from the connected vehicles to regular vehicles, based on the car-following characteristics of connected vehicles that follow regular vehicles and degenerate to regular vehicles.Then,a generalized method for stability analysis of the mixed traffic flow with connected vehicles is built.The full velocity difference model and the intelligent driver model are se-lected as the car-following models of regular and connected vehicles,respectively.Based on this,a case study of stability of the mixed traffic flow is analyzed.Additionally,numerical simulations are designed for the traffic safety impacts on the on-ramp bottleneck,considering the randomness of rela-tive numbers and spatial locations of regular and connected vehicles.Research results show that the connected vehicles are helpful to improve traffic flow stability and safety.The critical value of the connected vehicle market rate,which must satisfy the needs of stable state of the mixed traffic flow, is larger when the equilibrium speed is closer to the speed range from 9.8 to 10.6 m/s.Moreover, the mixed traffic flow can be stable at any equilibrium speed if the connected vehicle market rate is greater than 0.37.Besides,the traffic flow of the connected vehicles can promote the safety level by 54.29%to 71.36%,compared with the traffic flow of regular vehicles.%针对常规人工驾驶车辆和网联辅助驾驶车辆随机混合的交通流,分析其稳定性与安全性.基于紧跟常规车的网联车退化为常规车的跟驰特性,提出了网联车随机退化为常规车情形的数学期望表达式,进而建立网联车混合交通流稳定性的一般性分析方法.选取全速度差模型和智能驾驶员模型分别作为常规车和网联车跟驰模型,进行混合交

  4. Modeling the heterogeneous traffic correlations in urban road systems using traffic-enhanced community detection approach

    Science.gov (United States)

    Lu, Feng; Liu, Kang; Duan, Yingying; Cheng, Shifen; Du, Fei

    2018-07-01

    A better characterization of the traffic influence among urban roads is crucial for traffic control and traffic forecasting. The existence of spatial heterogeneity imposes great influence on modeling the extent and degree of road traffic correlation, which is usually neglected by the traditional distance based method. In this paper, we propose a traffic-enhanced community detection approach to spatially reveal the traffic correlation in city road networks. First, the road network is modeled as a traffic-enhanced dual graph with the closeness between two road segments determined not only by their topological connection, but also by the traffic correlation between them. Then a flow-based community detection algorithm called Infomap is utilized to identify the road segment clusters. Evaluated by Moran's I, Calinski-Harabaz Index and the traffic interpolation application, we find that compared to the distance based method and the community based method, our proposed traffic-enhanced community based method behaves better in capturing the extent of traffic relevance as both the topological structure of the road network and the traffic correlations among urban roads are considered. It can be used in more traffic-related applications, such as traffic forecasting, traffic control and guidance.

  5. Emergency automatic signalling system using time scheduling

    Science.gov (United States)

    Rayavel, P.; Surenderanath, S.; Rathnavel, P.; Prakash, G.

    2018-04-01

    It is difficult to handle traffic congestion and maintain roads during traffic mainly in India. As the people migrate from rural to urban and sub-urban areas, it becomes still more critical. Presently Roadways is a standout amongst the most vital transportation. At the point when a car crash happens, crisis vehicles, for example, ambulances and fire trucks must rush to the mischance scene. There emerges a situation where a portion of the crisis vehicles may cause another car crash. Therefore it becomes still more difficult for emergency vehicle to reach the destination within a predicted time. To avoid that kind of problem we have come out with an effective idea which can reduce the potential in the traffic system. The traffic system is been modified using a wireless technology and high speed micro controller to provide smooth and clear flow of traffic for ambulance to reach the destination on time. This is achieved by using RFID Tag at the ambulance and RFID Reader at the traffic system i.e., traffic signal. This mainly deals with identifying the emergency vehicle and providing a green signal to traffic signal at time of traffic jam. — By assigning priorities to various traffic movements, we can control the traffic jam. In some moments like ambulance emergency, high delegates arrive people facing lot of trouble. To overcome this problem in this paper we propose a time priority based traffic system achieved by using RFID transmitter at the emergency vehicle and RFID receiver at the traffic system i.e., traffic signal. The signal from the emergency vehicle is sent to traffic system which after detecting it sends it to microcontroller which controls the traffic signal. If any emergency vehicle is detected the system goes to emergency system mode where signal switch to green and if it is not detected normal system mode.

  6. PROBLEM SETTING AND SOLUTION OF THE RESPONSE CORRECTION OF ARRIVAL AND DEPARTURE AIR TRAFFIC FLOW IN THE VICINITY OF THE FIELD BY MEANS OF THE GENETIC ALGORITHM

    Directory of Open Access Journals (Sweden)

    Georgii N. Lebedev

    2017-01-01

    Full Text Available The improvement in the effectiveness of airfield operation largely depends on the problem solving quality on the interaction boundaries of different technological sections. One of such hotspots is the use of the same runway by inbound and outbound aircraft. At certain intensity of outbound and inbound air traffic flow the conflict of aircraft interests appears, where it may be quite difficult to sort out priorities even for experienced controllers, in consequence of which mistakes in decision-making unavoidably appear.In this work the task of response correction of landing and takeoff time of the aircraft using the same RW, in condition of the conflict of interests “arrival – departure” at the increased operating intensity is formulated. The choice of optimal solution is made taking into account mutual interests without the complete sorting and the evaluation of all solutions.Accordingly, the genetic algorithm, which offers a simple and effective approach to optimal control problem solution by providing flight safety at an acceptably high level, is proposed. The estimation of additional aviation fuel consumption is used as optimal choice evaluation criterion.The advantages of the genetic algorithm application at decision-making in comparison with today’s “team” solution of the conflict “departure – arrival” in the airfield area are shown.

  7. Optimization of TTEthernet Networks to Support Best-Effort Traffic

    DEFF Research Database (Denmark)

    Tamas-Selicean, Domitian; Pop, Paul

    2014-01-01

    This paper focuses on the optimization of the TTEthernet communication protocol, which offers three traffic classes: time-triggered (TT), sent according to static schedules, rate-constrained (RC) that has bounded end-to-end latency, and best-effort (BE), the classic Ethernet traffic, with no timing...... guarantees. In our earlier work we have proposed an optimization approach named DOTTS that performs the routing, scheduling and packing / fragmenting of TT and RC messages, such that the TT and RC traffic is schedulable. Although backwards compatibility with classic Ethernet networks is one of TTEthernet...

  8. Strategic Air Traffic Planning Using Eulerian Route Based Modeling and Optimization

    Science.gov (United States)

    Bombelli, Alessandro

    Due to a soaring air travel growth in the last decades, air traffic management has become increasingly challenging. As a consequence, planning tools are being devised to help human decision-makers achieve a better management of air traffic. Planning tools are divided into two categories, strategic and tactical. Strategic planning generally addresses a larger planning domain and is performed days to hours in advance. Tactical planning is more localized and is performed hours to minutes in advance. An aggregate route model for strategic air traffic flow management is presented. It is an Eulerian model, describing the flow between cells of unidirectional point-to-point routes. Aggregate routes are created from flight trajectory data based on similarity measures. Spatial similarity is determined using the Frechet distance. The aggregate routes approximate actual well-traveled traffic patterns. By specifying the model resolution, an appropriate balance between model accuracy and model dimension can be achieved. For a particular planning horizon, during which weather is expected to restrict the flow, a procedure for designing airborne reroutes and augmenting the traffic flow model is developed. The dynamics of the traffic flow on the resulting network take the form of a discrete-time, linear time-invariant system. The traffic flow controls are ground holding, pre-departure rerouting and airborne rerouting. Strategic planning--determining how the controls should be used to modify the future traffic flow when local capacity violations are anticipated--is posed as an integer programming problem of minimizing a weighted sum of flight delays subject to control and capacity constraints. Several tests indicate the effectiveness of the modeling and strategic planning approach. In the final, most challenging, test, strategic planning is demonstrated for the six western-most Centers of the 22-Center national airspace. The planning time horizon is four hours long, and there is

  9. Iterated greedy algorithms to minimize the total family flow time for job-shop scheduling with job families and sequence-dependent set-ups

    Science.gov (United States)

    Kim, Ji-Su; Park, Jung-Hyeon; Lee, Dong-Ho

    2017-10-01

    This study addresses a variant of job-shop scheduling in which jobs are grouped into job families, but they are processed individually. The problem can be found in various industrial systems, especially in reprocessing shops of remanufacturing systems. If the reprocessing shop is a job-shop type and has the component-matching requirements, it can be regarded as a job shop with job families since the components of a product constitute a job family. In particular, sequence-dependent set-ups in which set-up time depends on the job just completed and the next job to be processed are also considered. The objective is to minimize the total family flow time, i.e. the maximum among the completion times of the jobs within a job family. A mixed-integer programming model is developed and two iterated greedy algorithms with different local search methods are proposed. Computational experiments were conducted on modified benchmark instances and the results are reported.

  10. Reports on internet traffic statistics

    OpenAIRE

    Hoogesteger, Martijn; de Oliveira Schmidt, R.; Sperotto, Anna; Pras, Aiko

    2013-01-01

    Internet traffic statistics can provide valuable information to network analysts and researchers about the way nowadays networks are used. In the past, such information was provided by Internet2 in a public website called Internet2 NetFlow: Weekly Reports. The website reported traffic statistics from the Abilene network on a weekly basis. At that time, the network connected 230 research institutes with a 10Gb/s link. Although these reports were limited to the behavior of the Albeline's users,...

  11. Knowledge-based scheduling of arrival aircraft

    Science.gov (United States)

    Krzeczowski, K.; Davis, T.; Erzberger, H.; Lev-Ram, I.; Bergh, C.

    1995-01-01

    A knowledge-based method for scheduling arrival aircraft in the terminal area has been implemented and tested in real-time simulation. The scheduling system automatically sequences, assigns landing times, and assigns runways to arrival aircraft by utilizing continuous updates of aircraft radar data and controller inputs. The scheduling algorithms is driven by a knowledge base which was obtained in over two thousand hours of controller-in-the-loop real-time simulation. The knowledge base contains a series of hierarchical 'rules' and decision logic that examines both performance criteria, such as delay reduction, as well as workload reduction criteria, such as conflict avoidance. The objective of the algorithms is to devise an efficient plan to land the aircraft in a manner acceptable to the air traffic controllers. This paper will describe the scheduling algorithms, give examples of their use, and present data regarding their potential benefits to the air traffic system.

  12. 行人交通流基本特性研究现状与展望∗%A Review of Existing Methods and the Perspective of Studying the Features of Pedestrian Traffic Flow

    Institute of Scientific and Technical Information of China (English)

    周继彪; 董升; 陈红; 张敏捷

    2015-01-01

    以行人交通流基本特性为研究对象,总结了行人交通流基本特性研究的发展历程和研究现状,分析了行人交通流未来发展趋势.介绍了行人交通流基础数据采集方法,例如人工调查法、视频检测法和泰森多边形法等.总结了行人交通流宏观特性和微观特性,阐释了行人流交通特性基本关系图和行人流的整体运动特性,讨论了人群中个体的速度特性及个体间的相互作用,行人交通流的微观特性是宏观特性的自然展现.分析结果表明:行人流动力学所表现出来的各种集群效应是由于行人个体之间的非线性作用而引起的,行人交通流特性存在显著的个性化特征,即:出行目的的多元化、出行行为的自组织性、出行过程的避让性.行人速度随着密度的增大而减小,当密度低于1.0~2.0 p/m2值时,行人流完全处于自由流状态,此时行人速度不受密度的影响,完全由个人喜好、舒适程度和个人出行目的等决定;当密度增加到4~5 p/m2时,行人速度已经下降到0.2 m/s,即行人基本上处于拥挤状态,很难继续往前移动.由于行人性别、生理、心理以及年龄、出行目的、调查地点的不同,其速度变化范围为0.9~1.9 m/s,密度变化范围为1.7~7.0 p/m2,而最大阻塞密度则从3.8~10.0 p/m2变化.行人交通流数据采集方法、行人交通仿真与模拟、行人交通建模与实证是未来需要关注的研究趋势.%Taking the pedestrian traffic flow characteristics as the object,this paper summarizes the development history and current studies on the features of pedestrian traffic flow,and analyzes its development trend.Firstly,data col-lection methods for studying pedestrian traffic flow are reviewed such as manual investigation method,video detection method,Voronoi method.Secondly,the macroscopic and microscopic features of the pedestrian traffic flow are summa-rized.Meanwhile,the relational

  13. Traffic flow models and impact of combined lane change and speed limit control on environment in case of high truck traffic volumes. A Research Report from the National Center for Sustainable Transportation.

    NARCIS (Netherlands)

    Ioannou, P. Zhang, Y. & Zhao, Y.

    2017-01-01

    This report presents the work performed in collaboration with University of California, Riverside (UCR) as part of a project to University of California, Davis funded by the California Energy Commission (CEC). The aim of the project is to research intelligent traffic control strategies, which will

  14. Traffic Perturbation

    CERN Multimedia

    C. Colloca TS/FM

    2004-01-01

    TS/FM group informs you that, for the progress of the works at the Prévessin site entrance, some perturbation of the traffic may occur during the week between the 14th and 18th of June for a short duration. Access will be assured at any time. For more information, please contact 160239. C. Colloca TS/FM

  15. Decline traffic information system

    Energy Technology Data Exchange (ETDEWEB)

    Du Plessis, K [Computer Sciences Corporation (CSC), Sydney (Australia)

    2007-09-06

    BHP Billion (BHPB) Cannington has experienced problems in regards to their traffic flow in the decline at the mine. The problems related to reports on near misses of vehicles moving towards each other in the decline. The decline is also to narrow for trucks to pass each other and the operators need to be aware of oncoming traffic in the decline to ensure they could take early evasive steps to ensure the rules of right of way in the decline are adhered to. BHPB Cannington requested CSC to conduct a problem analysis and to provide a solutions proposal to Cannington. The solution was put forward as an augmentation of their current safety procedures used with in the decline. During this phase of the project CSC developed a solutions architecture which involved the use of Active (Radio Frequency Identification) RFID tagging which will enable vehicle movement tracking on a real time basis after which the appropriate traffic movement can be relayed to the operators in the decline. The primary objective of the DTIS is to provide accurate information of traffic movement in the decline and present that information to the operators of the decline IN THE DECLINE upon which they would make their decisions. (orig.)

  16. On vehicular traffic data analysis

    Energy Technology Data Exchange (ETDEWEB)

    Brics, Martins; Mahnke, Reinhard [Institute of Physics, Rostock University (Germany)

    2011-07-01

    This contribution consists of analysis of empirical vehicular traffic flow data. The main focus lies on the Next Generation Simulation (NGSIM) data. The first findings show that there are artificial structures within the data due to errors of monitoring as well as smoothing position measurement data. As a result speed data show discretisation in 5 feet per second. The aim of this investigation is to construct microscopic traffic flow models which are in agreement to the analysed empirical data. The ongoing work follows the subject of research summarized by Christof Liebe in his PhD thesis entitled ''Physics of traffic flow: Empirical data and dynamical models'' (Rostock, 2010).

  17. Scheduling the scheduling task : a time management perspective on scheduling

    NARCIS (Netherlands)

    Larco Martinelli, J.A.; Wiers, V.C.S.; Fransoo, J.C.

    2013-01-01

    Time is the most critical resource at the disposal of schedulers. Hence, an adequate management of time from the schedulers may impact positively on the scheduler’s productivity and responsiveness to uncertain scheduling environments. This paper presents a field study of how schedulers make use of

  18. Traffic breakdown at a signal: classical theory versus the three-phase theory of city traffic

    International Nuclear Information System (INIS)

    Kerner, Boris S; Schreckenberg, Michael; Klenov, Sergey L

    2014-01-01

    Physical reasons for a crucial difference between the results of a three-phase theory developed recently (Kerner 2011 Phys. Rev. E 84 045102(R); 2013 Europhys. Lett. 102 28010; 2014 Physica A 397 76) and the classical theory are explained. Microscopic characteristics of traffic passing a traffic signal during the green signal phase and their dependence on the duration of the green phase have been found. It turns out that a moving synchronized flow pattern (MSP), which occurs in under-saturated traffic at the signal, causes ‘compression’ of traffic flow: the rate of MSP discharge can be considerably larger than the saturation flow rate of the classical traffic theory of city traffic. This leads to a considerably larger rate of traffic passing the signal in comparison with the saturation flow rate. This effect together with traffic behavior at the upstream queue front explains the metastability of under-saturated traffic with respect to a random time-delayed traffic breakdown. (paper)

  19. A rapid appraisal of traffic policemen about auditory effects of traffic noise pollution from Ambala city

    Directory of Open Access Journals (Sweden)

    Abhishek Singh

    2015-01-01

    Full Text Available Context: Traffic policemen are at an increased risk of suffering from hazards of noise pollution because they are engaged in controlling traffic noise, particularly at heavy traffic junctions. The effect is more in this subgroup because they are continuously exposed to it. Aim: The present study was aimed at assessing the knowledge, attitude and practices of traffic policemen regarding auditory effects of traffic noise pollution in Ambala city. Settings and Design: Cross-sectional workplace survey. Materials and Methods: The present descriptive study was carried out in different traffic zones of Ambala city during April-June 2013. The study population consisted of 100 traffic policemen working in different traffic intersections of Ambala city. Statistical Analysis Used: Structured interview schedule was used to collect the data. SPSS version 17.0 was used for analysis. Interpretation of data was performed using percentages and proportions. Results: Majority (75% of the study subjects were exposed to traffic noise pollution for more than 5 years. Of the total subjects, 5% of respondents reported below-average hearing on self-assessment of hearing ability. Seventeen percent of the study population accepted that while hearing over phone they do miss some conversation. Most (98% of the traffic police did not use any personal protective equipment (PPEs like earplugs/earmuffs, and the non-availability of these PPEs (90% is the common reason for the hearing loss. Conclusions: The study concludes that traffic policemen are not much aware regarding impending auditory effects of traffic noise pollution. Duty rotation, duty scheduling and other forms of preventive modalities for exposure limitation are suggested.

  20. Breakdown in traffic networks fundamentals of transportation science

    CERN Document Server

    Kerner, Boris S

    2017-01-01

    This book offers a detailed investigation of breakdowns in traffic and transportation networks. It shows empirically that transitions from free flow to so-called synchronized flow, initiated by local disturbances at network bottlenecks, display a nucleation-type behavior: while small disturbances in free flow decay, larger ones grow further and lead to breakdowns at the bottlenecks. Further, it discusses in detail the significance of this nucleation effect for traffic and transportation theories, and the consequences this has for future automatic driving, traffic control, dynamic traffic assignment, and optimization in traffic and transportation networks. Starting from a large volume of field traffic data collected from various sources obtained solely through measurements in real world traffic, the author develops his insights, with an emphasis less on reviewing existing methodologies, models and theories, and more on providing a detailed analysis of empirical traffic data and drawing consequences regarding t...

  1. Physics of traffic gridlock in a city.

    Science.gov (United States)

    Kerner, Boris S

    2011-10-01

    Based on simulations of stochastic three-phase and two-phase traffic flow models, we reveal that at a signalized city intersection under small link inflow rates at which a vehicle queue developed during the red phase of the light signal dissolves fully during the green phase, i.e., no traffic gridlock should be expected, nevertheless, spontaneous traffic breakdown with subsequent city gridlock occurs with some probability after a random time delay. In most cases, this traffic breakdown is initiated by a phase transition from free flow to a synchronized flow occurring upstream of the queue at the light signal. The probability of traffic breakdown at the light signal is an increasing function of the link inflow rate and duration of the red phase of the light signal.

  2. Solving no-wait two-stage flexible flow shop scheduling problem with unrelated parallel machines and rework time by the adjusted discrete Multi Objective Invasive Weed Optimization and fuzzy dominance approach

    Energy Technology Data Exchange (ETDEWEB)

    Jafarzadeh, Hassan; Moradinasab, Nazanin; Gerami, Ali

    2017-07-01

    Adjusted discrete Multi-Objective Invasive Weed Optimization (DMOIWO) algorithm, which uses fuzzy dominant approach for ordering, has been proposed to solve No-wait two-stage flexible flow shop scheduling problem. Design/methodology/approach: No-wait two-stage flexible flow shop scheduling problem by considering sequence-dependent setup times and probable rework in both stations, different ready times for all jobs and rework times for both stations as well as unrelated parallel machines with regards to the simultaneous minimization of maximum job completion time and average latency functions have been investigated in a multi-objective manner. In this study, the parameter setting has been carried out using Taguchi Method based on the quality indicator for beater performance of the algorithm. Findings: The results of this algorithm have been compared with those of conventional, multi-objective algorithms to show the better performance of the proposed algorithm. The results clearly indicated the greater performance of the proposed algorithm. Originality/value: This study provides an efficient method for solving multi objective no-wait two-stage flexible flow shop scheduling problem by considering sequence-dependent setup times, probable rework in both stations, different ready times for all jobs, rework times for both stations and unrelated parallel machines which are the real constraints.

  3. Solving no-wait two-stage flexible flow shop scheduling problem with unrelated parallel machines and rework time by the adjusted discrete Multi Objective Invasive Weed Optimization and fuzzy dominance approach

    International Nuclear Information System (INIS)

    Jafarzadeh, Hassan; Moradinasab, Nazanin; Gerami, Ali

    2017-01-01

    Adjusted discrete Multi-Objective Invasive Weed Optimization (DMOIWO) algorithm, which uses fuzzy dominant approach for ordering, has been proposed to solve No-wait two-stage flexible flow shop scheduling problem. Design/methodology/approach: No-wait two-stage flexible flow shop scheduling problem by considering sequence-dependent setup times and probable rework in both stations, different ready times for all jobs and rework times for both stations as well as unrelated parallel machines with regards to the simultaneous minimization of maximum job completion time and average latency functions have been investigated in a multi-objective manner. In this study, the parameter setting has been carried out using Taguchi Method based on the quality indicator for beater performance of the algorithm. Findings: The results of this algorithm have been compared with those of conventional, multi-objective algorithms to show the better performance of the proposed algorithm. The results clearly indicated the greater performance of the proposed algorithm. Originality/value: This study provides an efficient method for solving multi objective no-wait two-stage flexible flow shop scheduling problem by considering sequence-dependent setup times, probable rework in both stations, different ready times for all jobs, rework times for both stations and unrelated parallel machines which are the real constraints.

  4. Construction schedules slack time minimizing

    Science.gov (United States)

    Krzemiński, Michał

    2017-07-01

    The article presents two copyright models for minimizing downtime working brigades. Models have been developed for construction schedules performed using the method of work uniform. Application of flow shop models is possible and useful for the implementation of large objects, which can be divided into plots. The article also presents a condition describing gives which model should be used, as well as a brief example of optimization schedule. The optimization results confirm the legitimacy of the work on the newly-developed models.

  5. Scheduling and Topology Design in Networks with Directional Antennas

    Science.gov (United States)

    2017-05-19

    Scheduling and Topology Design in Networks with Directional Antennas Thomas Stahlbuhk, Nathaniel M. Jones, Brooke Shrader Lincoln Laboratory...controllers must choose which pairs of nodes should communicate in order to establish a topology over which traffic can be sent. Additionally...interacting effects of topology design and transmission scheduling in wireless networks, in particular focusing on networks where nodes are divided into

  6. Consistency analysis of network traffic repositories

    NARCIS (Netherlands)

    Lastdrager, Elmer; Lastdrager, E.E.H.; Pras, Aiko

    Traffic repositories with TCP/IP header information are very important for network analysis. Researchers often assume that such repositories reliably represent all traffic that has been flowing over the network; little thoughts are made regarding the consistency of these repositories. Still, for

  7. Algorithm for Public Electric Transport Schedule Control for Intelligent Embedded Devices

    Science.gov (United States)

    Alps, Ivars; Potapov, Andrey; Gorobetz, Mikhail; Levchenkov, Anatoly

    2010-01-01

    In this paper authors present heuristics algorithm for precise schedule fulfilment in city traffic conditions taking in account traffic lights. The algorithm is proposed for programmable controller. PLC is proposed to be installed in electric vehicle to control its motion speed and signals of traffic lights. Algorithm is tested using real controller connected to virtual devices and real functional models of real tram devices. Results of experiments show high precision of public transport schedule fulfilment using proposed algorithm.

  8. Traffic experiment reveals the nature of car-following.

    Science.gov (United States)

    Jiang, Rui; Hu, Mao-Bin; Zhang, H M; Gao, Zi-You; Jia, Bin; Wu, Qing-Song; Wang, Bing; Yang, Ming

    2014-01-01

    As a typical self-driven many-particle system far from equilibrium, traffic flow exhibits diverse fascinating non-equilibrium phenomena, most of which are closely related to traffic flow stability and specifically the growth/dissipation pattern of disturbances. However, the traffic theories have been controversial due to a lack of precise traffic data. We have studied traffic flow from a new perspective by carrying out large-scale car-following experiment on an open road section, which overcomes the intrinsic deficiency of empirical observations. The experiment has shown clearly the nature of car-following, which runs against the traditional traffic flow theory. Simulations show that by removing the fundamental notion in the traditional car-following models and allowing the traffic state to span a two-dimensional region in velocity-spacing plane, the growth pattern of disturbances has changed qualitatively and becomes qualitatively or even quantitatively in consistent with that observed in the experiment.

  9. Benefit Opportunities for Integrated Surface and Airspace Departure Scheduling: A Study of Operations at Charlotte-Douglas International Airport

    Science.gov (United States)

    Coppenbarger, Rich; Jung, Yoon; Kozon, Tom; Farrahi, Amir; Malik, Wakar; Lee, Hanbong; Chevalley, Eric; Kistler, Matt

    2016-01-01

    NASA is collaborating with the FAA and aviation industry to develop and demonstrate new capabilities that integrate arrival, departure, and surface air-traffic operations. The concept relies on trajectory-based departure scheduling and collaborative decision making to reduce delays and uncertainties in taxi and climb operations. The paper describes the concept and benefit mechanisms aimed at improving flight efficiency and predictability while maintaining or improving operational throughput. The potential impact of the technology is studied and discussed through a quantitative analysis of relevant shortfalls at the site identified for initial deployment and demonstration in 2017: Charlotte-Douglas International Airport. Results from trajectory analysis indicate substantial opportunity to reduce taxi delays for both departures and arrivals by metering departures at the gate in a manner that maximizes throughput while adhering to takeoff restrictions due mostly to airspace constraints. Substantial taxi-out delay reduction is shown for flights subject to departure restrictions stemming from traffic flow management initiatives. Opportunities to improve the predictability of taxi, takeoff, and climb operations are examined and their potential impact on airline scheduling decisions and air-traffic forecasting is discussed. In addition, the potential to improve throughput with departure scheduling that maximizes use of available runway and airspace capacity is analyzed.

  10. A queuing model for road traffic simulation

    International Nuclear Information System (INIS)

    Guerrouahane, N.; Aissani, D.; Bouallouche-Medjkoune, L.; Farhi, N.

    2015-01-01

    We present in this article a stochastic queuing model for the raod traffic. The model is based on the M/G/c/c state dependent queuing model, and is inspired from the deterministic Godunov scheme for the road traffic simulation. We first propose a variant of M/G/c/c state dependent model that works with density-flow fundamental diagrams rather than density-speed relationships. We then extend this model in order to consider upstream traffic demand as well as downstream traffic supply. Finally, we show how to model a whole raod by concatenating raod sections as in the deterministic Godunov scheme

  11. Air Traffic Management Research at NASA Ames

    Science.gov (United States)

    Davis, Thomas J.

    2012-01-01

    The Aviation Systems Division at the NASA Ames Research Center conducts leading edge research in air traffic management concepts and technologies. This overview will present concepts and simulation results for research in traffic flow management, safe and efficient airport surface operations, super density terminal area operations, separation assurance and system wide modeling and simulation. A brief review of the ongoing air traffic management technology demonstration (ATD-1) will also be presented. A panel discussion, with Mr. Davis serving as a panelist, on air traffic research will follow the briefing.

  12. The development of area wide traffic management scenarios

    NARCIS (Netherlands)

    Van Zuylen, H.J.; Lu, S.; Li, J.; Yusen, C.

    2014-01-01

    Traffic management in cities with congestion is a big challenge with still unused opportunities. Intersection control is a corner stone but this should be done in an area-wide context. The dominant traffic process on urban roads is the traffic flow on the intersections. Spill back is a most

  13. Sleep/wake scheduling scheme for minimizing end-to-end delay in multi-hop wireless sensor networks

    OpenAIRE

    Madani Sajjad; Nazir Babar; Hasbullah Halabi

    2011-01-01

    Abstract We present a sleep/wake schedule protocol for minimizing end-to-end delay for event driven multi-hop wireless sensor networks. In contrast to generic sleep/wake scheduling schemes, our proposed algorithm performs scheduling that is dependent on traffic loads. Nodes adapt their sleep/wake schedule based on traffic loads in response to three important factors, (a) the distance of the node from the sink node, (b) the importance of the node's location from connectivity's perspective, and...

  14. Stochastic control of traffic patterns

    DEFF Research Database (Denmark)

    Gaididei, Yuri B.; Gorria, Carlos; Berkemer, Rainer

    2013-01-01

    A stochastic modulation of the safety distance can reduce traffic jams. It is found that the effect of random modulation on congestive flow formation depends on the spatial correlation of the noise. Jam creation is suppressed for highly correlated noise. The results demonstrate the advantage of h...

  15. Traffic Predictive Control: Case Study and Evaluation

    Science.gov (United States)

    2017-06-26

    This project developed a quantile regression method for predicting future traffic flow at a signalized intersection by combining both historical and real-time data. The algorithm exploits nonlinear correlations in historical measurements and efficien...

  16. Fixed Point Learning Based Intelligent Traffic Control System

    Science.gov (United States)

    Zongyao, Wang; Cong, Sui; Cheng, Shao

    2017-10-01

    Fixed point learning has become an important tool to analyse large scale distributed system such as urban traffic network. This paper presents a fixed point learning based intelligence traffic network control system. The system applies convergence property of fixed point theorem to optimize the traffic flow density. The intelligence traffic control system achieves maximum road resources usage by averaging traffic flow density among the traffic network. The intelligence traffic network control system is built based on decentralized structure and intelligence cooperation. No central control is needed to manage the system. The proposed system is simple, effective and feasible for practical use. The performance of the system is tested via theoretical proof and simulations. The results demonstrate that the system can effectively solve the traffic congestion problem and increase the vehicles average speed. It also proves that the system is flexible, reliable and feasible for practical use.

  17. A bi-objective integer programming model for partly-restricted flight departure scheduling.

    Science.gov (United States)

    Zhong, Han; Guan, Wei; Zhang, Wenyi; Jiang, Shixiong; Fan, Lingling

    2018-01-01

    The normal studies on air traffic departure scheduling problem (DSP) mainly deal with an independent airport in which the departure traffic is not affected by surrounded airports, which, however, is not a consistent case. In reality, there still exist cases where several commercial airports are closely located and one of them possesses a higher priority. During the peak hours, the departure activities of the lower-priority airports are usually required to give way to those of higher-priority airport. These giving-way requirements can inflict a set of changes on the modeling of departure scheduling problem with respect to the lower-priority airports. To the best of our knowledge, studies on DSP under this condition are scarce. Accordingly, this paper develops a bi-objective integer programming model to address the flight departure scheduling of the partly-restricted (e.g., lower-priority) one among several adjacent airports. An adapted tabu search algorithm is designed to solve the current problem. It is demonstrated from the case study of Tianjin Binhai International Airport in China that the proposed method can obviously improve the operation efficiency, while still realizing superior equity and regularity among restricted flows.

  18. Distributed traffic signal control using fuzzy logic

    Science.gov (United States)

    Chiu, Stephen

    1992-01-01

    We present a distributed approach to traffic signal control, where the signal timing parameters at a given intersection are adjusted as functions of the local traffic condition and of the signal timing parameters at adjacent intersections. Thus, the signal timing parameters evolve dynamically using only local information to improve traffic flow. This distributed approach provides for a fault-tolerant, highly responsive traffic management system. The signal timing at an intersection is defined by three parameters: cycle time, phase split, and offset. We use fuzzy decision rules to adjust these three parameters based only on local information. The amount of change in the timing parameters during each cycle is limited to a small fraction of the current parameters to ensure smooth transition. We show the effectiveness of this method through simulation of the traffic flow in a network of controlled intersections.

  19. Spectral Analysis of Traffic Functions in Urban Areas

    Directory of Open Access Journals (Sweden)

    Florin Nemtanu

    2015-12-01

    Full Text Available The paper is focused on the Fourier transform application in urban traffic analysis and the use of said transform in traffic decomposition. The traffic function is defined as traffic flow generated by different categories of traffic participants. A Fourier analysis was elaborated in terms of identifying the main traffic function components, called traffic sub-functions. This paper presents the results of the method being applied in a real case situation, that is, an intersection in the city of Bucharest where the effect of a bus line was analysed. The analysis was done using different time scales, while three different traffic functions were defined to demonstrate the theoretical effect of the proposed method of analysis. An extension of the method is proposed to be applied in urban areas, especially in the areas covered by predictive traffic control.

  20. A time-based concept for terminal-area traffic management

    Science.gov (United States)

    Erzberger, Heinz; Tobias, Leonard

    1986-01-01

    An automated air-traffic-management concept that has the potential for significantly increasing the efficiency of traffic flows in high-density terminal areas is discussed. The concept's implementation depends on techniques for controlling the landing time of all aircraft entering the terminal area, both those that are equipped with on-board four-dimensional (4D) guidance systems as well as those aircraft types that are conventionally equipped. The two major ground-based elements of the system are a scheduler which assigns conflict-free landing times and a profile descent advisor. Landing time provided by the scheduler is uplinked to equipped aircraft and translated into the appropriate 4D trajectory by the-board flight-management system. The controller issues descent advisories to unequipped aircraft to help them achieve the assigned landing times. Air traffic control simulations have established that the concept provides an efficient method for controlling various mixes of 4D-equipped and unequipped, as well as low- and high-performance, aircraft. Piloted simulations of profiles flown with the aid of advisories have verified the ability to meet specified descent times with prescribed accuracy.

  1. TRAFFIC SIMULATION FOR MIXED TRAFFIC SYSTEMS

    African Journals Online (AJOL)

    EGETE

    2012-05-04

    May 4, 2012 ... Traffic problem is classified into single and mixed, especially in most developing countries, where motorbikes are ..... The traffic light control system presented by its location on ... multi-destination dynamic routing and real-time.

  2. A knowledge-based system for controlling automobile traffic

    Science.gov (United States)

    Maravas, Alexander; Stengel, Robert F.

    1994-01-01

    Transportation network capacity variations arising from accidents, roadway maintenance activity, and special events as well as fluctuations in commuters' travel demands complicate traffic management. Artificial intelligence concepts and expert systems can be useful in framing policies for incident detection, congestion anticipation, and optimal traffic management. This paper examines the applicability of intelligent route guidance and control as decision aids for traffic management. Basic requirements for managing traffic are reviewed, concepts for studying traffic flow are introduced, and mathematical models for modeling traffic flow are examined. Measures for quantifying transportation network performance levels are chosen, and surveillance and control strategies are evaluated. It can be concluded that automated decision support holds great promise for aiding the efficient flow of automobile traffic over limited-access roadways, bridges, and tunnels.

  3. Intelligent driving in traffic systems with partial lane discipline

    Science.gov (United States)

    Assadi, Hamid; Emmerich, Heike

    2013-04-01

    It is a most common notion in traffic theory that driving in lanes and keeping lane changes to a minimum leads to smooth and laminar traffic flow, and hence to increased traffic capacity. On the other hand, there exist persistent vehicular traffic systems that are characterised by habitual disregarding of lane markings, and partial or complete loss of laminar traffic flow. Here, we explore the stability of such systems through a microscopic traffic flow model, where the degree of lane-discipline is taken as a variable, represented by the fraction of drivers that disregard lane markings completely. The results show that lane-free traffic may win over completely ordered traffic at high densities, and that partially ordered traffic leads to the poorest overall flow, while not considering the crash probability. Partial order in a lane-free system is similar to partial disorder in a lane-disciplined system in that both lead to decreased traffic capacity. This could explain the reason why standard enforcement methods, which rely on continuous increase of order, often fail to incur order to lane-free traffic systems. The results also provide an insight into the cooperative phenomena in open systems with self-driven particles.

  4. A theory of traffic congestion at moving bottlenecks

    Energy Technology Data Exchange (ETDEWEB)

    Kerner, Boris S [Daimler AG, GR/PTF, HPC: G021, 71059 Sindelfingen (Germany); Klenov, Sergey L, E-mail: boris.kerner@daimler.co [Department of Physics, Moscow Institute of Physics and Technology, 141700 Dolgoprudny, Moscow Region (Russian Federation)

    2010-10-22

    The physics of traffic congestion occurring at a moving bottleneck on a multi-lane road is revealed based on the numerical analyses of vehicular traffic with a discrete stochastic traffic flow model in the framework of three-phase traffic theory. We find that there is a critical speed of a moving bottleneck at which traffic breakdown, i.e. a first-order phase transition from free flow to synchronized flow, occurs spontaneously at the moving bottleneck, if the flow rate upstream of the bottleneck is great enough. The greater the flow rate, the higher the critical speed of the moving bottleneck. A diagram of congested traffic patterns at the moving bottleneck is found, which shows regions in the flow-rate-moving-bottleneck-speed plane in which congested patterns emerge spontaneously or can be induced through large enough disturbances in an initial free flow. A comparison of features of traffic breakdown and resulting congested patterns at the moving bottleneck with known ones at an on-ramp (and other motionless) bottleneck is made. Nonlinear features of complex interactions and transformations of congested traffic patterns occurring at on- and off-ramp bottlenecks due to the existence of the moving bottleneck are found. The physics of the phenomenon of traffic congestion due to 'elephant racing' on a multi-lane road is revealed.

  5. A theory of traffic congestion at moving bottlenecks

    International Nuclear Information System (INIS)

    Kerner, Boris S; Klenov, Sergey L

    2010-01-01

    The physics of traffic congestion occurring at a moving bottleneck on a multi-lane road is revealed based on the numerical analyses of vehicular traffic with a discrete stochastic traffic flow model in the framework of three-phase traffic theory. We find that there is a critical speed of a moving bottleneck at which traffic breakdown, i.e. a first-order phase transition from free flow to synchronized flow, occurs spontaneously at the moving bottleneck, if the flow rate upstream of the bottleneck is great enough. The greater the flow rate, the higher the critical speed of the moving bottleneck. A diagram of congested traffic patterns at the moving bottleneck is found, which shows regions in the flow-rate-moving-bottleneck-speed plane in which congested patterns emerge spontaneously or can be induced through large enough disturbances in an initial free flow. A comparison of features of traffic breakdown and resulting congested patterns at the moving bottleneck with known ones at an on-ramp (and other motionless) bottleneck is made. Nonlinear features of complex interactions and transformations of congested traffic patterns occurring at on- and off-ramp bottlenecks due to the existence of the moving bottleneck are found. The physics of the phenomenon of traffic congestion due to 'elephant racing' on a multi-lane road is revealed.

  6. A hybrid job-shop scheduling system

    Science.gov (United States)

    Hellingrath, Bernd; Robbach, Peter; Bayat-Sarmadi, Fahid; Marx, Andreas

    1992-01-01

    The intention of the scheduling system developed at the Fraunhofer-Institute for Material Flow and Logistics is the support of a scheduler working in a job-shop. Due to the existing requirements for a job-shop scheduling system the usage of flexible knowledge representation and processing techniques is necessary. Within this system the attempt was made to combine the advantages of symbolic AI-techniques with those of neural networks.

  7. Long-range correlation analysis of urban traffic data

    International Nuclear Information System (INIS)

    Peng, Sheng; Jun-Feng, Wang; Shu-Long, Zhao; Tie-Qiao, Tang

    2010-01-01

    This paper investigates urban traffic data by analysing the long-range correlation with detrended fluctuation analysis. Through a large number of real data collected by the travel time detection system in Beijing, the variation of flow in different time periods and intersections is studied. According to the long-range correlation in different time scales, it mainly discusses the effect of intersection location in road net, people activity customs and special traffic controls on urban traffic flow. As demonstrated by the obtained results, the urban traffic flow represents three-phase characters similar to highway traffic. Moreover, compared by the two groups of data obtained before and after the special traffic restrictions (vehicles with special numbered plates only run in a special workday) enforcement, it indicates that the rules not only reduce the flow but also avoid irregular fluctuation. (general)

  8. Congestion and communication in confined ant traffic

    Science.gov (United States)

    Gravish, Nick; Gold, Gregory; Zangwill, Andrew; Goodisman, Michael A. D.; Goldman, Daniel I.

    2014-03-01

    Many social animals move and communicate within confined spaces. In subterranean fire ants Solenopsis invicta, mobility within crowded nest tunnels is important for resource and information transport. Within confined tunnels, communication and traffic flow are at odds: trafficking ants communicate through tactile interactions while stopped, yet ants that stop to communicate impose physical obstacles on the traffic. We monitor the bi-directional flow of fire ant workers in laboratory tunnels of varied diameter D. The persistence time of communicating ant aggregations, τ, increases approximately linearly with the number of participating ants, n. The sensitivity of traffic flow increases as D decreases and diverges at a minimum diameter, Dc. A cellular automata model incorporating minimal traffic features--excluded volume and communication duration--reproduces features of the experiment. From the model we identify a competition between information transfer and the need to maintain jam-free traffic flow. We show that by balancing information transfer and traffic flow demands, an optimum group strategy exists which maximizes information throughput. We acknowledge funding from NSF PoLS #0957659 and #PHY-1205878.

  9. Traffic Modelling for Moving-Block Train Control System

    International Nuclear Information System (INIS)

    Tang Tao; Li Keping

    2007-01-01

    This paper presents a new cellular automaton (CA) model for train control system simulation. In the proposed CA model, the driver reactions to train movements are captured by some updated rules. The space-time diagram of traffic flow and the trajectory of train movement is used to obtain insight into the characteristic behavior of railway traffic flow. A number of simulation results demonstrate that the proposed CA model can be successfully used for the simulations of railway traffic. Not only the characteristic behavior of railway traffic flow can be reproduced, but also the simulation values of the minimum time headway are close to the theoretical values.

  10. Queueing and traffic

    NARCIS (Netherlands)

    Baër, Niek

    2015-01-01

    Traffic jams are everywhere, some are caused by constructions or accidents but a large portion occurs naturally. These "natural" traffic jams are a result of variable driving speeds combined with a high number of vehicles. To prevent these traffic jams, we must understand traffic in general, and to

  11. Susceptibility of optimal train schedules to stochastic disturbances of process times

    DEFF Research Database (Denmark)

    Larsen, Rune; Pranzo, Marco; D’Ariano, Andrea

    2013-01-01

    study, an advanced branch and bound algorithm, on average, outperforms a First In First Out scheduling rule both in deterministic and stochastic traffic scenarios. However, the characteristic of the stochastic processes and the way a stochastic instance is handled turn out to have a serious impact...... and dwell times). In fact, the objective of railway traffic management is to reduce delay propagation and to increase disturbance robustness of train schedules at a network scale. We present a quantitative study of traffic disturbances and their effects on the schedules computed by simple and advanced...

  12. Reducing habitat fragmentation on minor rural roads through traffic calming

    NARCIS (Netherlands)

    Jaarsma, C.F.; Willems, G.P.A.

    2002-01-01

    The rural road network suffers continually from ambiguity. On the one hand, the presence of this network and its traffic flows offer accessibility and make a contribution to economic development. While on the other, its presence and its traffic flows cause fragmentation. The actual ecological impact

  13. Controlling traffic jams by time modulating the safety distance

    DEFF Research Database (Denmark)

    Gaididei, Yu B.; Gorria, C.; Berkemer, R.

    2013-01-01

    The possibility of controlling traffic dynamics by applying high-frequency time modulation of traffic flow parameters is studied. It is shown that the region of the car density where the uniform (free) flow is unstable changes in the presence of time modulation compared with the unmodulated case....

  14. Capacity Drop on Freeways: Traffic Dynamics, Theory and Modeling

    NARCIS (Netherlands)

    Yuan, K.

    2016-01-01

    Earlier studies on the traffic flow on freeways reveal that queue discharge rate cannot
    reach as high as the free-flow capacity. This important phenomenon is called the
    “Capacity drop”, which indicates that the potential freeway capacity cannot be fully
    utilized when discharging traffic

  15. Phase Plane Analysis Method of Nonlinear Traffic Phenomena

    Directory of Open Access Journals (Sweden)

    Wenhuan Ai

    2015-01-01

    Full Text Available A new phase plane analysis method for analyzing the complex nonlinear traffic phenomena is presented in this paper. This method makes use of variable substitution to transform a traditional traffic flow model into a new model which is suitable for the analysis in phase plane. According to the new model, various traffic phenomena, such as the well-known shock waves, rarefaction waves, and stop-and-go waves, are analyzed in the phase plane. From the phase plane diagrams, we can see the relationship between traffic jams and system instability. So the problem of traffic flow could be converted into that of system stability. The results show that the traffic phenomena described by the new method is consistent with that described by traditional methods. Moreover, the phase plane analysis highlights the unstable traffic phenomena we are chiefly concerned about and describes the variation of density or velocity with time or sections more clearly.

  16. Monitoring road traffic congestion using a macroscopic traffic model and a statistical monitoring scheme

    KAUST Repository

    Zeroual, Abdelhafid

    2017-08-19

    Monitoring vehicle traffic flow plays a central role in enhancing traffic management, transportation safety and cost savings. In this paper, we propose an innovative approach for detection of traffic congestion. Specifically, we combine the flexibility and simplicity of a piecewise switched linear (PWSL) macroscopic traffic model and the greater capacity of the exponentially-weighted moving average (EWMA) monitoring chart. Macroscopic models, which have few, easily calibrated parameters, are employed to describe a free traffic flow at the macroscopic level. Then, we apply the EWMA monitoring chart to the uncorrelated residuals obtained from the constructed PWSL model to detect congested situations. In this strategy, wavelet-based multiscale filtering of data has been used before the application of the EWMA scheme to improve further the robustness of this method to measurement noise and reduce the false alarms due to modeling errors. The performance of the PWSL-EWMA approach is successfully tested on traffic data from the three lane highway portion of the Interstate 210 (I-210) highway of the west of California and the four lane highway portion of the State Route 60 (SR60) highway from the east of California, provided by the Caltrans Performance Measurement System (PeMS). Results show the ability of the PWSL-EWMA approach to monitor vehicle traffic, confirming the promising application of this statistical tool to the supervision of traffic flow congestion.

  17. Monitoring road traffic congestion using a macroscopic traffic model and a statistical monitoring scheme

    KAUST Repository

    Zeroual, Abdelhafid; Harrou, Fouzi; Sun, Ying; Messai, Nadhir

    2017-01-01

    Monitoring vehicle traffic flow plays a central role in enhancing traffic management, transportation safety and cost savings. In this paper, we propose an innovative approach for detection of traffic congestion. Specifically, we combine the flexibility and simplicity of a piecewise switched linear (PWSL) macroscopic traffic model and the greater capacity of the exponentially-weighted moving average (EWMA) monitoring chart. Macroscopic models, which have few, easily calibrated parameters, are employed to describe a free traffic flow at the macroscopic level. Then, we apply the EWMA monitoring chart to the uncorrelated residuals obtained from the constructed PWSL model to detect congested situations. In this strategy, wavelet-based multiscale filtering of data has been used before the application of the EWMA scheme to improve further the robustness of this method to measurement noise and reduce the false alarms due to modeling errors. The performance of the PWSL-EWMA approach is successfully tested on traffic data from the three lane highway portion of the Interstate 210 (I-210) highway of the west of California and the four lane highway portion of the State Route 60 (SR60) highway from the east of California, provided by the Caltrans Performance Measurement System (PeMS). Results show the ability of the PWSL-EWMA approach to monitor vehicle traffic, confirming the promising application of this statistical tool to the supervision of traffic flow congestion.

  18. Integrating Preventive Maintenance Scheduling As Probability Machine Failure And Batch Production Scheduling

    Directory of Open Access Journals (Sweden)

    Zahedi Zahedi

    2016-06-01

    Full Text Available This paper discusses integrated model of batch production scheduling and machine maintenance scheduling. Batch production scheduling uses minimize total actual flow time criteria and machine maintenance scheduling uses the probability of machine failure based on Weibull distribution. The model assumed no nonconforming parts in a planning horizon. The model shows an increase in the number of the batch (length of production run up to a certain limit will minimize the total actual flow time. Meanwhile, an increase in the length of production run will implicate an increase in the number of PM. An example was given to show how the model and algorithm work.

  19. Runway Scheduling for Charlotte Douglas International Airport

    Science.gov (United States)

    Malik, Waqar A.; Lee, Hanbong; Jung, Yoon C.

    2016-01-01

    This paper describes the runway scheduler that was used in the 2014 SARDA human-in-the-loop simulations for CLT. The algorithm considers multiple runways and computes optimal runway times for departures and arrivals. In this paper, we plan to run additional simulation on the standalone MRS algorithm and compare the performance of the algorithm against a FCFS heuristic where aircraft avail of runway slots based on a priority given by their positions in the FCFS sequence. Several traffic scenarios corresponding to current day traffic level and demand profile will be generated. We also plan to examine the effect of increase in traffic level (1.2x and 1.5x) and observe trends in algorithm performance.

  20. A Network Traffic Control Enhancement Approach over Bluetooth Networks

    DEFF Research Database (Denmark)

    Son, L.T.; Schiøler, Henrik; Madsen, Ole Brun

    2003-01-01

    This paper analyzes network traffic control issues in Bluetooth data networks as convex optimization problem. We formulate the problem of maximizing of total network flows and minimizing the costs of flows. An adaptive distributed network traffic control scheme is proposed as an approximated solu...... as capacity limitations and flow requirements in the network. Simulation shows that the performance of Bluetooth networks could be improved by applying the adaptive distributed network traffic control scheme...... solution of the stated optimization problem that satisfies quality of service requirements and topologically induced constraints in Bluetooth networks, such as link capacity and node resource limitations. The proposed scheme is decentralized and complies with frequent changes of topology as well......This paper analyzes network traffic control issues in Bluetooth data networks as convex optimization problem. We formulate the problem of maximizing of total network flows and minimizing the costs of flows. An adaptive distributed network traffic control scheme is proposed as an approximated...

  1. Sabkha Trafficability,

    Science.gov (United States)

    1981-01-01

    southwest Arabian Gulf (Figure 2). Between Ras Ghanda in the east to the Qatar peninsula on the west an essentially unbroken coastal sabkha stretches for...were found embedded in lightly cemented surficial crusts of the end of a 20 year old jetty in Qatar . It may also be of interest to note that beer cans...flows underground in aquifers . The uppermost aquifer in Jubail is the Neogene Formation, sur- ficial unconsolidated aeolian and marine calcareous

  2. A Pareto-Based Adaptive Variable Neighborhood Search for Biobjective Hybrid Flow Shop Scheduling Problem with Sequence-Dependent Setup Time

    Directory of Open Access Journals (Sweden)

    Huixin Tian

    2016-01-01

    Full Text Available Different from most researches focused on the single objective hybrid flowshop scheduling (HFS problem, this paper investigates a biobjective HFS problem with sequence dependent setup time. The two objectives are the minimization of total weighted tardiness and the total setup time. To efficiently solve this problem, a Pareto-based adaptive biobjective variable neighborhood search (PABOVNS is developed. In the proposed PABOVNS, a solution is denoted as a sequence of all jobs and a decoding procedure is presented to obtain the corresponding complete schedule. In addition, the proposed PABOVNS has three major features that can guarantee a good balance of exploration and exploitation. First, an adaptive selection strategy of neighborhoods is proposed to automatically select the most promising neighborhood instead of the sequential selection strategy of canonical VNS. Second, a two phase multiobjective local search based on neighborhood search and path relinking is designed for each selected neighborhood. Third, an external archive with diversity maintenance is adopted to store the nondominated solutions and at the same time provide initial solutions for the local search. Computational results based on randomly generated instances show that the PABOVNS is efficient and even superior to some other powerful multiobjective algorithms in the literature.

  3. Overtaking as Indicator of Road Traffic Conditions

    Directory of Open Access Journals (Sweden)

    Dražen Topolnik

    2012-10-01

    Full Text Available Overtaking is presemed as one of the indicators of roadtraffic flow. The possibility of overtaking depends on the existenceof an intetval in the opposing traffic flow sufficient to performovertaking. It also analyses the probability of overtakingby applying adequate equations and graphical presentations

  4. Validating the passenger traffic model for Copenhagen

    DEFF Research Database (Denmark)

    Overgård, Christian Hansen; VUK, Goran

    2006-01-01

    The paper presents a comprehensive validation procedure for the passenger traffic model for Copenhagen based on external data from the Danish national travel survey and traffic counts. The model was validated for the years 2000 to 2004, with 2004 being of particular interest because the Copenhagen...... matched the observed traffic better than those of the transit assignment model. With respect to the metro forecasts, the model over-predicts metro passenger flows by 10% to 50%. The wide range of findings from the project resulted in two actions. First, a project was started in January 2005 to upgrade...

  5. Traffic planning for non-homogeneous traffic

    Indian Academy of Sciences (India)

    Vehicles based on similar traffic operating characteristics are grouped into ... of distances to the video monitor involved using a measuring wheel to mark ... Secondly, the observers reviewed the videotape to sample traffic entity ...... makes a strong case for including service lanes for slow moving vehicles for improving the.

  6. State Traffic Safety Information

    Data.gov (United States)

    Department of Transportation — The State Traffic Safety Information (STSI) portal is part of the larger Fatality Analysis Reporting System (FARS) Encyclopedia. STSI provides state-by-state traffic...

  7. Traffic management simulation development.

    Science.gov (United States)

    2011-01-03

    Microscopic simulation can provide significant support to traffic management center (TMC) operations. However, traffic simulation applications require data that are expensive and time-consuming to collect. Data collected by TMCs can be used as a prim...

  8. The comparison of predictive scheduling algorithms for different sizes of job shop scheduling problems

    Science.gov (United States)

    Paprocka, I.; Kempa, W. M.; Grabowik, C.; Kalinowski, K.; Krenczyk, D.

    2016-08-01

    In the paper a survey of predictive and reactive scheduling methods is done in order to evaluate how the ability of prediction of reliability characteristics influences over robustness criteria. The most important reliability characteristics are: Mean Time to Failure, Mean Time of Repair. Survey analysis is done for a job shop scheduling problem. The paper answers the question: what method generates robust schedules in the case of a bottleneck failure occurrence before, at the beginning of planned maintenance actions or after planned maintenance actions? Efficiency of predictive schedules is evaluated using criteria: makespan, total tardiness, flow time, idle time. Efficiency of reactive schedules is evaluated using: solution robustness criterion and quality robustness criterion. This paper is the continuation of the research conducted in the paper [1], where the survey of predictive and reactive scheduling methods is done only for small size scheduling problems.

  9. Probabilistic Predictions of Traffic Demand for En Route Sectors Based on Individual Flight Data

    Science.gov (United States)

    2010-01-01

    The Traffic Flow Management System (TFMS) predicts the demand for each sector, and traffic managers use these predictions to spot possible congestion and to take measures to prevent it. These predictions of sector demand, however, are currently made ...

  10. Spoofing cyber attack detection in probe-based traffic monitoring systems using mixed integer linear programming

    KAUST Repository

    Canepa, Edward S.; Bayen, Alexandre M.; Claudel, Christian G.

    2013-01-01

    Traffic sensing systems rely more and more on user generated (insecure) data, which can pose a security risk whenever the data is used for traffic flow control. In this article, we propose a new formulation for detecting malicious data injection

  11. A Wavelet Analysis Approach for Categorizing Air Traffic Behavior

    Science.gov (United States)

    Drew, Michael; Sheth, Kapil

    2015-01-01

    In this paper two frequency domain techniques are applied to air traffic analysis. The Continuous Wavelet Transform (CWT), like the Fourier Transform, is shown to identify changes in historical traffic patterns caused by Traffic Management Initiatives (TMIs) and weather with the added benefit of detecting when in time those changes take place. Next, with the expectation that it could detect anomalies in the network and indicate the extent to which they affect traffic flows, the Spectral Graph Wavelet Transform (SGWT) is applied to a center based graph model of air traffic. When applied to simulations based on historical flight plans, it identified the traffic flows between centers that have the greatest impact on either neighboring flows, or flows between centers many centers away. Like the CWT, however, it can be difficult to interpret SGWT results and relate them to simulations where major TMIs are implemented, and more research may be warranted in this area. These frequency analysis techniques can detect off-nominal air traffic behavior, but due to the nature of air traffic time series data, so far they prove difficult to apply in a way that provides significant insight or specific identification of traffic patterns.

  12. Rerouting algorithms solving the air traffic congestion

    Science.gov (United States)

    Adacher, Ludovica; Flamini, Marta; Romano, Elpidio

    2017-06-01

    Congestion in the air traffic network is a problem with an increasing relevance for airlines costs as well as airspace safety. One of the major issue is the limited operative capacity of the air network. In this work an Autonomous Agent approach is proposed to solve in real time the problem of air traffic congestion. The air traffic infrastructures are modeled with a graph and are considered partitioned in different sectors. Each sector has its own decision agent dealing with the air traffic control involved in it. Each agent sector imposes a real time aircraft scheduling to respect both delay and capacity constrains. When a congestion is predicted, a new aircraft scheduling is computed. Congestion is solved when the capacity constrains are satisfied once again. This can be done by delaying on ground aircraft or/and rerouting aircraft and/or postponing the congestion. We have tested two different algorithms that calculate K feasible paths for each aircraft involved in the congestion. Some results are reported on North Italian air space.

  13. Collective benefits in traffic during mega events via the use of information technologies.

    Science.gov (United States)

    Xu, Yanyan; González, Marta C

    2017-04-01

    Information technologies today can inform each of us about the route with the shortest time, but they do not contain incentives to manage travellers such that we all get collective benefits in travel times. To that end we need travel demand estimates and target strategies to reduce the traffic volume from the congested roads during peak hours in a feasible way. During large events, the traffic inconveniences in large cities are unusually high, yet temporary, and the entire population may be more willing to adopt collective recommendations for collective benefits in traffic. In this paper, we integrate, for the first time, big data resources to estimate the impact of events on traffic and propose target strategies for collective good at the urban scale. In the context of the Olympic Games in Rio de Janeiro, we first predict the expected increase in traffic. To that end, we integrate data from mobile phones, Airbnb, Waze and transit information, with game schedules and expected attendance in each venue. Next, we evaluate different route choice scenarios for drivers during the peak hours. Finally, we gather information on the trips that contribute the most to the global congestion which could be redirected from vehicles to transit. Interestingly, we show that (i) following new route alternatives during the event with individual shortest times can save more collective travel time than keeping the routine routes used before the event, uncovering the positive value of information technologies during events; (ii) with only a small proportion of people selected from specific areas switching from driving to public transport, the collective travel time can be reduced to a great extent. Results are presented online for evaluation by the public and policymakers (www.flows-rio2016.com (last accessed 3 September 2017)). © 2017 The Author(s).

  14. Improvement of driving safety in road traffic system

    Science.gov (United States)

    Li, Ke-Ping; Gao, Zi-You

    2005-05-01

    A road traffic system is a complex system in which humans participate directly. In this system, human factors play a very important role. In this paper, a kind of control signal is designated at a given site (i.e., signal point) of the road. Under the effect of the control signal, the drivers will decrease their velocities when their vehicles pass the signal point. Our aim is to transit the traffic flow states from disorder to order and then improve the traffic safety. We have tested this technique for the two-lane traffic model that is based on the deterministic Nagel-Schreckenberg (NaSch) traffic model. The simulation results indicate that the traffic flow states can be transited from disorder to order. Different order states can be observed in the system and these states are safer.

  15. Immunization Schedules for Adults

    Science.gov (United States)

    ... ACIP Vaccination Recommendations Why Immunize? Vaccines: The Basics Immunization Schedule for Adults (19 Years of Age and ... diseases that can be prevented by vaccines . 2018 Immunization Schedule Recommended Vaccinations for Adults by Age and ...

  16. Instant Childhood Immunization Schedule

    Science.gov (United States)

    ... Recommendations Why Immunize? Vaccines: The Basics Instant Childhood Immunization Schedule Recommend on Facebook Tweet Share Compartir Get ... date. See Disclaimer for additional details. Based on Immunization Schedule for Children 0 through 6 Years of ...

  17. Heuristics in dynamic scheduling : A practical framework with a case study in elevator dispatching

    NARCIS (Netherlands)

    De Jong, J.L.

    2012-01-01

    Dynamic scheduling problems are ubiquitous: traffic lights, elevators, planning of manufacturing plants, air traffic control, etc. Tasks have to be put on a timeline as smart as possible to reach certain goals. These goals may be related to production costs, the use of (scarce) resources, deadlines.

  18. Multi-Level Round-Robin Multicast Scheduling with Look-Ahead Mechanism

    DEFF Research Database (Denmark)

    Yu, Hao; Ruepp, Sarah Renée; Berger, Michael Stübert

    2011-01-01

    constructs the Traffic Matrix before each cell transmission based on the fan-out vectors of the cells in the queues. A scheduling pointer independently moves on each column of the Traffic Matrix in a round-robin fashion and returns the decision to the Decision Matrix. The sync procedure is carried out...

  19. HOLD MODE BASED DYNAMIC PRIORITY LOAD ADAPTIVE INTERPICONET SCHEDULING FOR BLUETOOTH SCATTERNETS

    Directory of Open Access Journals (Sweden)

    G.S. Mahalakshmi

    2011-09-01

    Full Text Available Scheduling in piconets has emerged as a challenging research area. Interpiconet scheduling focuses on when a bridge is switched among various piconets and how a bridge node communicates with the masters in different piconets. This paper proposes an interpiconet scheduling algorithm named, hold mode based dynamic traffic priority load adaptive scheduling. The bridges are adaptively switched between the piconets according to various traffic loads. The main goal is to maximize the utilization of the bridge by reducing the bridge switch wastes, utilize intelligent decision making algorithm, resolve conflict between the masters, and allow negotiation for bridge utilization in HDPLIS using bridge failure-bridge repair procedure . The Hold mode - dynamic traffic - priority based - load adaptive scheduling reduces the number of bridge switch wastes and hence increases the efficiency of the bridge which results in increased performance of the system.

  20. FLOWSHOP SCHEDULING USING A NETWORK APPROACH ...

    African Journals Online (AJOL)

    eobe

    time when the last job completes on the last machine. The objective ... more jobs in a permutation flow shop scheduling problem ... processing time of a job on a machine is zero, it ..... hybrid flow shops with sequence dependent setup times ...