A Methodology to Evaluate the Optimization Potential of Co-ordinated Vehicular Route Choices
نویسندگان
چکیده
A car navigation system’s job is to plan a good route from an origin to a destination. There are many different options how this can be accomplished. Path choices can be calculated based on static road map representations, or they can take into account dynamic information like, e. g., known road blocks or the current traffic situation. More recently, the idea has gained ground that navigation systems could even cooperate in order to co-ordinate route choices so as to proactively avoid the formation of traffic jams. While several heuristics for algorithms to improve the vehicles’ route choices have been proposed, little is known about the potential benefit of such optimizations. How much can we gain if dynamic information exchange and/or co-ordination between vehicles are used? Answering this question requires to obtain information on the travel times realized by “best possible”, globally co-ordinated route choices—and therefore the solution of a highly complex optimization problem. Here, we propose a method to accomplish this. We use genetic algorithm optimization to jointly evolve the route choices of all cars in a street network iteratively towards an optimal solution, where the quality of each intermediate optimization step is assessed using a road traffic simulation.
منابع مشابه
A New Routing Algorithm for Vehicular Ad-hoc Networks based on Glowworm Swarm Optimization Algorithm
Vehicular ad hoc networks (VANETs) are a particular type of Mobile ad hoc networks (MANET) in which the vehicles are considered as nodes. Due to rapid topology changing and frequent disconnection makes it difficult to design an efficient routing protocol for routing data among vehicles. In this paper, a new routing protocol based on glowworm swarm optimization algorithm is provided. Using the g...
متن کاملA generalized form of the Hermite-Hadamard-Fejer type inequalities involving fractional integral for co-ordinated convex functions
Recently, a general class of the Hermit--Hadamard-Fejer inequality on convex functions is studied in [H. Budak, March 2019, 74:29, textit{Results in Mathematics}]. In this paper, we establish a generalization of Hermit--Hadamard--Fejer inequality for fractional integral based on co-ordinated convex functions.Our results generalize and improve several inequalities obtained in earlier studies.
متن کاملDesign, Optimization Process and Efficient Analysis for Preparation of Copolymer-Coated Superparamagnetic Nanoparticles
Magnetic nanoparticles (MNPs) are very important systems with potential use in drug delivery systems, ferrofluids, and effluent treatment. In many situations, such as in biomedical applications, it is necessary to cover inorganic magnetic particles with an organic material, such as polymers. A superparamagnetic nanocomposite Fe3O4/poly(maleic anhydride-co-acrylic acid) P(MAH-co-AA) with a core/...
متن کاملEffects of Preferred Routes and Destinations on the Performance of Vehicular Network
Vehicular Ad-Hoc Networks (VANET), in which vehicles constitute the mobile nodes in the network, have attracted increasing interest in both academia and industry. However, due to the prohibitive cost of deploying and implementing such a system in the real world, most of the related research relies on simulations for evaluation purposes. A key component for VANET simulations is a realistic vehic...
متن کاملTRANSPORT ROUTE PLANNING MODELS BASED ON FUZZY APPROACH
Transport route planning is one of the most important and frequent activities in supply chain management. The design of information systems for route planning in real contexts faces two relevant challenges: the complexity of the planning and the lack of complete and precise information. The purpose of this paper is to nd methods for the development of transport route planning in uncertainty dec...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013