CBPRS: A City Based Parking and Routing System

Navigational systems assist drivers in finding a route between two locations that is time optimal in theory but seldom in practice due to delaying circumstances the system is unaware of, such as traffic jams. Upon arrival at the destination the service of the system ends and the driver is forced to locate a parking place without further assistance. We propose a City Based Parking Routing System (CBPRS) that monitors and reserves parking places for CBPRS participants within a city. The CBPRS guides vehicles using an ant based distributed hierarchical routing algorithm to their reserved parking place. Through means of experiments in a simulation environment we found that reductions of travel times for participants were significant in comparison to a situation where vehicles relied on static routing information generated by the well known Dijkstra’s algorithm. Furthermore, we found that the CBPRS was able to increase city wide traffic flows and decrease the number and duration of traffic jams throughout the city once the number of participants increased.information systems;computer simulation;dynamic routing

A bibliometric review and analysis of traffic lights optimization

The significant increase in the number of vehicles in urban areas emerges the challenge of urban mobility. Researchers in this area suggest that most daily delays in urban travel times are caused by intersections, which could be reduced if the traffic lights at these intersections were more efficient. The use of simulation for real intersections can be effective in optimizing the cycle times and improving the traffic light timing to coordinate vehicles passing through intersections. From these themes emerge the research questions: How are the existing approaches (optimization techniques and simulation) to managing traffic lights smartly? What kind of data (offline and online) are used for traffic lights optimization? How beneficial is it to propose an optimization approach to the traffic system? This paper aims to answer these questions, carried out through a bibliometric literature review. In total, 93 articles were analyzed. The main findings revealed that the United States and China are the countries with the most studies published in the last ten years. Moreover, Particle Swarm Optimization is a frequently used approach, and there is a tendency for studies to perform optimization of real cases by real-time data, showing that the praxis of smart cities has resorted to smart traffic lights.This work has been supported by FCT— Fundação para a Ciência e Tecnologia within the R&D Units Project Scope: UIDB/00319/2020 and the project “Integrated and Innovative Solutions for the well-being of people in complex urban centers” within the Project Scope NORTE-01-0145-FEDER-000086

Ant-inspired Interaction Networks For Decentralized Vehicular Traffic Congestion Control

Mimicking the autonomous behaviors of animals and their adaptability to changing or foreign environments lead to the development of swarm intelligence techniques such as ant colony optimization (ACO) and particle swarm optimization (PSO) now widely used to tackle a variety of optimization problems. The aim of this dissertation is to develop an alternative swarm intelligence model geared toward decentralized congestion avoidance and to determine qualities of the model suitable for use in a transportation network. A microscopic multi-agent interaction network inspired by insect foraging behaviors, especially ants, was developed and consequently adapted to prioritize the avoidance of congestion, evaluated as perceived density of other agents in the immediate environment extrapolated from the occurrence of direct interactions between agents, while foraging for food outside the base/nest. The agents eschew pheromone trails or other forms of stigmergic communication in favor of these direct interactions whose rate is the primary motivator for the agents\u27 decision making process. The decision making process at the core of the multi-agent interaction network is consequently transferred to transportation networks utilizing vehicular ad-hoc networks (VANETs) for communication between vehicles. Direct interactions are replaced by dedicated short range communications for wireless access in vehicular environments (DSRC/WAVE) messages used for a variety of applications like left turn assist, intersection collision avoidance, or cooperative adaptive cruise control. Each vehicle correlates the traffic on the wireless network with congestion in the transportation network and consequently decides whether to reroute and, if so, what alternate route to take in a decentralized, non-deterministic manner. The algorithm has been shown to increase throughput and decrease mean travel times significantly while not requiring access to centralized infrastructure or up-to-date traffic information

On green routing and scheduling problem

The vehicle routing and scheduling problem has been studied with much interest within the last four decades. In this paper, some of the existing literature dealing with routing and scheduling problems with environmental issues is reviewed, and a description is provided of the problems that have been investigated and how they are treated using combinatorial optimization tools

CBPRS: A City Based Parking and Routing System

Navigational systems assist drivers in finding a route between two locations that is time optimal in theory but seldom in practice due to delaying circumstances the system is unaware of, such as traffic jams. Upon arrival at the destination the service of the system ends and the driver is forced to locate a parking place without further assistance. We propose a City Based Parking Routing System (CBPRS) that monitors and reserves parking places for CBPRS participants within a city. The CBPRS guides vehicles using an ant based distributed hierarchical routing algorithm to their reserved parking place. Through means of experiments in a simulation environment we found that reductions of travel times for participants were significant in comparison to a situation where vehicles relied on static routing information generated by the well known Dijkstra’s algorithm. Furthermore, we found that the CBPRS was able to increase city wide traffic flows and decrease the number and duration of traffic jams throughout the city once the number of participants increased

Comparison of Game Theoretical Strategy and Reinforcement Learning in Traffic Light Control

Many traffic models and control methods have already been utilized in the public transportation system due to the increasing traffic congestion. Thus, an intelligent traffic model is formalized and presented to control multiple traffic light simultaneously and efficiently according to the distribution of vehicles from each incoming link (i.e. sections) in this paper. Compared with constant strategy, two methods are proposed for traffic light control, i.e., game theoretical strategy and reinforcement learning methods. Game theoretical strategy is generated in a game theoretical framework where incoming links are regarded as players and the combination of the status of traffic lights can be regarded as decisions made by these players. The cost function is evaluated and the strategy is produced with Nash equilibrium for passing maximum vehicles in an intersection. The other one is Single-Agent Reinforcement Learning (SARL), specifically with the Q-learning algorithm in this case, which is usually used in such a dynamic environment to control traffic flow so the traffic problem could be improved. Generally, the intersection is regarded as the centralized agent and controlling signal status is considered as the actions of the agent. The performance of these two methods is compared after simulated and implemented in a junction