Design and analysis of kinetic energy recovery system for automobiles: a case study for commuters in Edinburgh.

Transport and its energetic and environmental impacts affect our daily lives. The transport sector is the backbone of the United Kingdom’s economy with 2.3 million people being employed in this sector. With a high dependency on transport for passengers and freight and with the knowledge that oil reserves are rapidly decreasing a solution has to be identified for conserving fuel. Passenger vehicles account for 61% of the transport fuel consumed in the U.K. and should be seen as a key area to tackle. Despite the introduction and development of electric powered cars, the widespread infrastructure that is required is not in place and has attributed to their slow uptake, as well as the fact that the electric car’s performance is not yet comparable with the conventional internal combustion engine. The benefits of the introduction of kinetic energy recovery systems to be used in conjunction with internal combustion engines and designed such that the system could easily be fitted into future passenger vehicles are examined. In this article, a review of automobile kinetic energy recovery system is presented. It has been argued that the ultracapacitor technology offers a sustainable solution. An optimum design for the urban driving cycle experienced in the city of Edinburgh has been introduced. The potential for fuel savings is also presented

Time-dependent Hyperstar algorithm for robust vehicle navigation in time-dependent stochastic road networks.

The vehicle navigation problem studied in Bell (2009) is revisited and a time-dependent reverse Hyperstar algorithm is presented. This minimises the expected time of arrival at the destination, and all intermediate nodes, where expectation is based on a pessimistic (or risk-averse) view of unknown link delays. This may also be regarded as a hyperpath version of the Chabini and Lan (2002) algorithm, which itself is a time-dependent A* algorithm. Links are assigned undelayed travel times and maximum delays, both of which are potentially functions of the time of arrival at the respective link. The driver seeks probabilities for link use that minimise his/her maximum exposure to delay on the approach to each node, leading to the determination of the pessimistic expected time of arrival. Since the context considered is vehicle navigation where the driver is not making repeated trips, the probability of link use may be interpreted as a measure of link attractiveness, so a link with a zero probability of use is unattractive while a link with a probability of use equal to one will have no attractive alternatives. A solution algorithm is presented and proven to solve the problem provided the node potentials are feasible and a FIFO condition applies for undelayed link travel times. The paper concludes with a numerical example.