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

iTETRIS: An Integrated Wireless and Traffic Platform for Real-Time Road Traffic Management Solutions

Wireless vehicular cooperative systems have been identified as an attractive solution to improve road traffic management, thereby contributing to the European goal of safer, cleaner, and more efficient and sustainable traffic solutions. V2V-V2I communication technologies can improve traffic management through real-time exchange of data among vehicles and with road infrastructure. It is also of great importance to investigate the adequate combination of V2V and V2I technologies to ensure the continuous and costefficient operation of traffic management solutions based on wireless vehicular cooperative solutions. However, to adequately design and optimize these communication protocols and analyze the potential of wireless vehicular cooperative systems to improve road traffic management, adequate testbeds and field operational tests need to be conducted. Despite the potential of Field Operational Tests to get the first insights into the benefits and problems faced in the development of wireless vehicular cooperative systems, there is yet the need to evaluate in the long term and large dimension the true potential benefits of wireless vehicular cooperative systems to improve traffic efficiency. To this aim, iTETRIS is devoted to the development of advanced tools coupling traffic and wireless communication simulators

Towards marginal cost pricing: A comparison of alternative pricing systems

European urban areas are marred by the problems of congestion and environmental degradation due to the prevailing levels of car use. Strong arguments have thus been put forward in support of a policy based on marginal cost pricing (European Commission 1996). Such policy measures – which would force private consumers to pay for a public service that was previously provided «for free» – are, however, notoriously unpopular with the general public and hence also with their elected representatives – the politicians. There is thus an obvious tension between economic theory, which suggests that marginal cost pricing is the welfare maximising solution to urban transport problems, and practical experience, which suggests that such pricing measures are unwanted by the affected population and hence hard to implement through democratic processes. The AFFORD Project for the European Commission has aimed to investigate this paradox and its possible solutions, through a combination of economic analysis, predictive modelling, attitudinal surveys, and an assessment of fiscal and financial measures within a number of case study cities in Europe. In this paper the methodology and results obtained for the Edinburgh case study are reported in detail. The study analyses alternative road pricing instruments and compares their performance against the theoretical first best situation. It discusses the effect of coverage, location, charging mechanism and interaction with other instruments. The paper shows that limited coverage in one mode may lead to a deviation from the user pays principle in other modes, that location is as important as charge levels and that assumptions about the use of revenues are critical in determining the effect on equity and acceptability. Finally the results show that a relatively simple smart card system can come close to providing the economic first best solution, but that this result should be viewed in the context of the model assumptions

Two routing problems with the limitation of fuel

AbstractTwo routing problems are considered. Although these two are related to each other, one is polynomially solvable and, by contrast, the other is NP-complete. First an efficient solution procedure is developed for the polynomially solvable problem. Then we establish NP-completeness of the other problem