Geometrical and functional criteria as a methodological approach to implement a new cycle path in an existing Urban Road Network: A Case study in Rome

Most road accidents occur in urban areas and notably at urban intersections, where cyclists and motorcyclists are the most vulnerable. In the last few years, cycling mobility has been growing; therefore, bike infrastructures should be designed to encourage this type of mobility and reduce motorized and/or private transport. The paper presents a study to implement a new cycle path in the existing cycle and road network in Rome, Italy. The geometric design of the new path complies with Italian standards regarding the technical characteristics of bicycle paths, while the Highway Capacity Manual has been considered for the traffic analysis. In particular, a before-after approach has been adopted to examine and compare the traffic flow at more complex and congested intersections where the cycle path will pass. Trams, buses, cars, bikes and pedestrians were the traffic components considered in each analysis. The software package PTV VISSIM 8 allowed the simulations of traffic flows at traffic-light intersections; an original linear process has been proposed to model dynamic intelligent traffic controls, which are not admitted by the software used. The traffic analysis allowed the identification of the best option for each of the five examined intersections. Particularly, the maximum queue length value and the total number of passed vehicles have been considered in order to optimize the transport planning process. The results of this study highlight the importance of providing engineered solutions when a cycle path is implemented in a complex road network, in order to avoid negative impacts on the citizens and maximize the expected advantages

Bad Luck When Joining the Shortest Queue

A frequent observation in service systems with queues in parallel is that customers in other queues tend to be served faster than those in one’s own queue. This paper quantifies the probability that one’s service would have started earlier if one had joined another queue than the queue that was actually chosen, for exponential multiserver systems with queues in parallel in which customers join one of the shortest queues upon arrival and in which jockeying is not possible.Queueing;Join-the-shortest-queue;Probability of bad luck;Power-series algorithm;Overtaking customers;Dedicated customers

A Coloring Algorithm for Disambiguating Graph and Map Drawings

Drawings of non-planar graphs always result in edge crossings. When there are many edges crossing at small angles, it is often difficult to follow these edges, because of the multiple visual paths resulted from the crossings that slow down eye movements. In this paper we propose an algorithm that disambiguates the edges with automatic selection of distinctive colors. Our proposed algorithm computes a near optimal color assignment of a dual collision graph, using a novel branch-and-bound procedure applied to a space decomposition of the color gamut. We give examples demonstrating the effectiveness of this approach in clarifying drawings of real world graphs and maps

Apollo experience report: A use of network simulation techniques in the design of the Apollo lunar surface experiments package support system

A case study of data-communications network modeling and simulation is presented. The applicability of simulation techniques in early system design phases is demonstrated, and the ease with which model parameters can be changed and comprehensive statistics gathered is shown. The discussion of the model design and application also yields an insight into the design and implementation of the Apollo lunar surface experiments package ground-support system