931 research outputs found

    Applications of Genetic Algorithm and Its Variants in Rail Vehicle Systems: A Bibliometric Analysis and Comprehensive Review

    Get PDF
    Railway systems are time-varying and complex systems with nonlinear behaviors that require effective optimization techniques to achieve optimal performance. Evolutionary algorithms methods have emerged as a popular optimization technique in recent years due to their ability to handle complex, multi-objective issues of such systems. In this context, genetic algorithm (GA) as one of the powerful optimization techniques has been extensively used in the railway sector, and applied to various problems such as scheduling, routing, forecasting, design, maintenance, and allocation. This paper presents a review of the applications of GAs and their variants in the railway domain together with bibliometric analysis. The paper covers highly cited and recent studies that have employed GAs in the railway sector and discuss the challenges and opportunities of using GAs in railway optimization problems. Meanwhile, the most popular hybrid GAs as the combination of GA and other evolutionary algorithms methods such as particle swarm optimization (PSO), ant colony optimization (ACO), neural network (NN), fuzzy-logic control, etc with their dedicated application in the railway domain are discussed too. More than 250 publications are listed and classified to provide a comprehensive analysis and road map for experts and researchers in the field helping them to identify research gaps and opportunities

    Optimization Methods in Modern Transportation Systems

    Get PDF
    One of the greatest challenges in the public transportation network is the optimization of the passengers waiting time, where it is necessary to find a compromise between the satisfaction of the passengers and the requirements of the transport companies. This paper presents a detailed review of the available literature dealing with the problem of passenger transport in order to optimize the passenger waiting time at the station and to meet the requirements of companies (maximize profits or minimize cost). After a detailed discussion, the paper clarifies the most important objectives in solving a timetabling problem: the requirements and satisfaction of passengers, passenger waiting time and capacity of vehicles. At the end, the appropriate algorithms for solving the set of optimization models are presented

    Dispatching and Rescheduling Tasks and Their Interactions with Travel Demand and the Energy Domain: Models and Algorithms

    Get PDF
    Abstract The paper aims to provide an overview of the key factors to consider when performing reliable modelling of rail services. Given our underlying belief that to build a robust simulation environment a rail service cannot be considered an isolated system, also the connected systems, which influence and, in turn, are influenced by such services, must be properly modelled. For this purpose, an extensive overview of the rail simulation and optimisation models proposed in the literature is first provided. Rail simulation models are classified according to the level of detail implemented (microscopic, mesoscopic and macroscopic), the variables involved (deterministic and stochastic) and the processing techniques adopted (synchronous and asynchronous). By contrast, within rail optimisation models, both planning (timetabling) and management (rescheduling) phases are discussed. The main issues concerning the interaction of rail services with travel demand flows and the energy domain are also described. Finally, in an attempt to provide a comprehensive framework an overview of the main metaheuristic resolution techniques used in the planning and management phases is shown

    IEEE Access Special Section Editorial: Big Data Technology and Applications in Intelligent Transportation

    Get PDF
    During the last few years, information technology and transportation industries, along with automotive manufacturers and academia, are focusing on leveraging intelligent transportation systems (ITS) to improve services related to driver experience, connected cars, Internet data plans for vehicles, traffic infrastructure, urban transportation systems, traffic collaborative management, road traffic accidents analysis, road traffic flow prediction, public transportation service plan, personal travel route plans, and the development of an effective ecosystem for vehicles, drivers, traffic controllers, city planners, and transportation applications. Moreover, the emerging technologies of the Internet of Things (IoT) and cloud computing have provided unprecedented opportunities for the development and realization of innovative intelligent transportation systems where sensors and mobile devices can gather information and cloud computing, allowing knowledge discovery, information sharing, and supported decision making. However, the development of such data-driven ITS requires the integration, processing, and analysis of plentiful information obtained from millions of vehicles, traffic infrastructures, smartphones, and other collaborative systems like weather stations and road safety and early warning systems. The huge amount of data generated by ITS devices is only of value if utilized in data analytics for decision-making such as accident prevention and detection, controlling road risks, reducing traffic carbon emissions, and other applications which bring big data analytics into the picture

    Trip-Based Public Transit Routing Using Condensed Search Trees

    Get PDF
    We study the problem of planning Pareto-optimal journeys in public transit networks. Most existing algorithms and speed-up techniques work by computing subjourneys to intermediary stops until the destination is reached. In contrast, the trip-based model focuses on trips and transfers between them, constructing journeys as a sequence of trips. In this paper, we develop a speed-up technique for this model inspired by principles behind existing state-of-the-art speed-up techniques, Transfer Pattern and Hub Labelling. The resulting algorithm allows us to compute Pareto-optimal (with respect to arrival time and number of transfers) 24-hour profiles on very large real-world networks in less than half a millisecond. Compared to the current state of the art for bicriteria queries on public transit networks, this is up to two orders of magnitude faster, while increasing preprocessing overhead by at most one order of magnitude

    The Analysis and Calculation Method of Urban Rail Transit Carrying Capacity Based on Express-Slow Mode

    Get PDF
    Urban railway transport that connects suburbs and city areas is characterized by uneven temporal and spatial distribution in terms of passenger flow and underutilized carrying capacity. This paper aims to develop methodologies to measure the carrying capacity of the urban railway by introducing a concept of the express-slow mode. We first explore factors influencing the carrying capacity under the express-slow mode and the interactive relationships among these factors. Then we establish seven different scenarios to measure the carrying capacity by considering the ratio of the number of the express trains and the slow trains, the station where overtaking takes place, and the number of overtaking maneuvers. Taking Shanghai Metro Line 16 as an empirical study, the proposed methods to measure the carrying capacity under different express-slow mode are proved to be valid. This paper contributes to the literature by remodifying the traditional methods to measure the carrying capacity when different express-slow modes are applied to improve the carrying capacity of the suburban railway

    Evolutionary Ruin And Stochastic Recreate: A Case Study On The Exam Timetabling Problem

    Get PDF
    This paper presents a new class of intelligent systems, called Evolutionary Ruin and Stochastic Recreate, that can learn and adapt to the changing enviroment. It improves the original Ruin and Recreate principle’s performance by incorporating an Evolutionary Ruin step which implements evolution within a single solution. In the proposed approach, a cycle of Solution Decomposition, Evolutionary Ruin and Stochastic Recreate continues until stopping conditions are reached. The Solution Decomposition step first uses some domain knowledge to break a solution down into its components and assign a score to each. The Evolutionary Ruin step then applies two operators (namely Selection and Mutation) to destroy a certain fraction of the entire solution. After the above steps, an input solution becomes partial and thus the resulting partial solution needs to be repaired. The repair is carried out by using the Stochastic Recreate step to reintroduce the removed items in a specific way (somewhat stochastic in order to have a better chance to jump out of the local optima), and then ask the underlying improvement heuristic whether this move will be accepted. These three steps are executed in sequence until a specific stopping condition is reached. Therefore, optimisation is achieved by solution disruption, iterative improvement and a stochastic constructive repair process performed within. Encouraging experimental results on exam timetabling problems are reported
    • …
    corecore