Multicriteria adaptive paths in stochastic, time-varying networks

Opasanon, Sathaporn; Miller-Hooks, Elise

doi:10.1016/j.ejor.2004.12.003

Cited by 47 publications

(18 citation statements)

References 40 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The choice between the solutions was performed based on decision-making algorithms. Similar work exists in Opasanon and Miller-Hooks [7]. Other routing systems include the work of Claes et al [8], where every possible route was worked out, while at every possibility the traffic density and hence the anticipated speed were predicted.…”

Section: Literature Reviewmentioning

confidence: 94%

Reaching destination on time with cooperative intelligent transportation systems

Kala

2015

J of Advced Transportation

View full text Add to dashboard Cite

SUMMARYResearch on intelligent transportation systems is so far focussed on decreasing the travel time of vehicles and avoiding congestions. However, the importance of reaching on time is different for different vehicles and depends upon the purpose of the journey. In a human-operated queue, it is generally considered courteous to give priority to people running very late. They may be running late to catch a flight or may be in an emergency for a medical check-up. There is a very small discomfort to the other people as long as the number of people in an emergency and running late is low. However, such prioritization is an invaluable help to the people running late. In this paper the same behaviour is modelled, wherein the transportation system is made biased towards the vehicles on an important task and running late. The paper presents the mechanism by which a vehicle may judge its running status, decide whether to ask for cooperation and decide how much of cooperation to ask for. The vehicle lane changes and traffic lights operating policy are made cooperative. Experimental results show that such a cooperation leads to lesser number of important vehicles reaching their destinations late.

show abstract

Section: Literature Reviewmentioning

confidence: 94%

Reaching destination on time with cooperative intelligent transportation systems

Kala

2015

J of Advced Transportation

View full text Add to dashboard Cite

show abstract

“…However, initial computational experiments showed that that was computationally inefficient. Further research could focus on its time-efficient implementation, or on alternative representative measures (Opasanon and Miller-Hooks, 2006;Pal and Bose, 2009). …”

Section: Accepted Manuscriptmentioning

confidence: 99%

A multi-criteria Police Districting Problem for the efficient and effective design of patrol sector

Camacho‐Collados

Liberatore

Angulo

2015

European Journal of Operational Research

View full text Add to dashboard Cite

“… developed an algorithm for bi‐criteria shortest path problem with time‐dependent data. Opasanon and Miller‐Hooks developed an exact algorithm to find Pareto‐optimal paths in a stochastic network where the arc attributes are time varying. Mohamed et al .…”

Section: Related Literaturementioning

confidence: 99%

Finding time‐robust fuel‐efficient paths for a call‐taxi in a stochastic city road network

Godwin

Sajeev

George

2016

J of Advced Transportation

View full text Add to dashboard Cite

Summary Intra‐city commuting is being revolutionized by call‐taxi services in many developing countries such as India. A customer requests a taxi via phone, and it arrives at the right time and at the right location for the pick‐up. This mode of intra‐city travel has become one of the most reliable and convenient modes of transportation for customers traveling for business and non‐business purposes. The increased number of vehicles on city roads and raising fuel costs has prompted a new type of transportation logistics problem of finding a fuel‐efficient and quickest path for a call‐taxi through a city road network, where the travel times are stochastic. The stochastic travel time of the road network is induced by obstacles such as the traffic signals and intersections. The delay and additional fuel consumption at each of these obstacles are calculated that are later imputed to the total travel time and fuel consumption of a path. A Monte‐Carlo simulation‐based approach is proposed to identify unique fuel‐efficient paths between two locations in a city road network where each obstacle has a delay distribution. A multi‐criteria score is then assigned to each unique path based on the probability that the path is fuel efficient, the average travel time of the path and the coefficient of variation of the travel times of the path. Copyright © 2016 John Wiley & Sons, Ltd.

show abstract

Multicriteria adaptive paths in stochastic, time-varying networks

Cited by 47 publications

References 40 publications

Reaching destination on time with cooperative intelligent transportation systems

Reaching destination on time with cooperative intelligent transportation systems

A multi-criteria Police Districting Problem for the efficient and effective design of patrol sector

Finding time‐robust fuel‐efficient paths for a call‐taxi in a stochastic city road network

Contact Info

Product

Resources

About