Maritime management is a crucial concern for movable bridge safety. Irregular management of water vehicles near movable bridges may lead to collision among ships and bridge infrastructures, causing massive losses of life and property. The paper presents a theoretical framework and simulation of an intelligent water vehicle management system for movable bridges corresponding to vehicle traffic responses. The water regime around the bridge is considered in virtually separated domains to estimate the desired safety actions based on the position of the approaching ships. An emergency clash avoidance control system is represented to prevent ship-infrastructure collision and ensure transportation safety. In addition, a simulation platform is developed specifically adaptable for movable bridge maritime and dynamic traffic management. The proposed theory is experimented using the simulation platform for different ship speeds and bridge-vehicle traffic volumes. Based on analyzing the velocity profile of approaching ships at different incidents, the bridge is found incapable of evacuating vehicles and unable to open promptly in case of speeding ships and high traffic density of vehicles on the bridge. Computational results show that the emergency control system is effective in reducing ship speed and prevent certain collisions. Lastly, the transportation policy for the newly proposed maritime management system is validated by real-world implementation in movable bridges across the world.

City bikes and bike-sharing systems (BSSs) are one solution to the last mile problem. BSSs guarantee equity by presenting affordable alternative transportation means for low-income households. These systems feature a multitude of bike stations scattered around a city. Numerous stations mean users can borrow a bike from one location and return it there or to a different location. However, this may create an unbalanced system, where some stations have excess bikes and others have limited bikes. In this paper, we propose a solution to balance BSS stations to satisfy the expected demand. Moreover, this paper represents a direct extension of the deferred acceptance algorithm-based heuristic previously proposed by the authors. We develop an algorithm that provides a delivery truck with a near-optimal route (i.e., finding the shortest Hamiltonian cycle) as an NP-hard problem. Results provide good solution quality and computational time performance, making the algorithm a viable candidate for real-time use by BSS operators. Our suggested approach is best suited for low-Q problems. Moreover, the mean running times for the largest instance are 143.6, 130.32, and 51.85 s for Q = 30, 20, and 10, respectively, which makes the proposed algorithm a real-time rebalancing algorithm.