نتایج جستجو برای: stochastic travel times

تعداد نتایج: 502915  

Journal: :CoRR 2014
Yinlam Chow Marco Pavone Brian M. Sadler Stefano Carpin

In this paper we consider a stochastic deployment problem, where a robotic swarm is tasked with the objective of positioning at least one robot at each of a set of pre-assigned targets while meeting a temporal deadline. Travel times and failure rates are stochastic but related, inasmuch as failure rates increase with speed. To maximize chances of success while meeting the deadline, a control st...

2004
LAWRENCE V. SNYDER

Plants, distribution centers, and other facilities generally function for years or decades, during which time the environment in which they operate may change substantially. Costs, demands, travel times, and other inputs to classical facility location models may be highly uncertain. This has made the development of models for facility location under uncertainty a high priority for researchers i...

2015
Cong Bai Zhong-Ren Peng Qing-Chang Lu Jian Sun

Accurate and real-time travel time information for buses can help passengers better plan their trips and minimize waiting times. A dynamic travel time prediction model for buses addressing the cases on road with multiple bus routes is proposed in this paper, based on support vector machines (SVMs) and Kalman filtering-based algorithm. In the proposed model, the well-trained SVM model predicts t...

2005
Truls Flatberg Geir Hasle Oddvar Kloster Eivind J. Nilssen Atle Riise

Vehicle routing is a complex optimization problem with numerous variants related to various forms of transport planning. Particularly in an operational planning situation, the dynamic and stochastic aspects of the problems are important. The research project Dynamic Optimization in Transportation (DOiT) addresses vehicle routing in such a dynamic setting. In this survey, we give an overview of ...

Journal: :Transportation Research Part B: Methodological 2005

Journal: :Transportation Research Part A: Policy and Practice 2014

Journal: :Geophysical Journal International 1968

Journal: :Transportation Science 2021

Vehicle routing algorithms usually reformulate the road network into a complete graph in which each arc represents shortest path between two locations. Studies on time-dependent followed this model and therefore defined speed functions graph. We argue that is often inadequate, particular for problems involving services edges of network. To fill gap, we formally define capacitated problem (TDCAR...

2001
Cara Lauder Chris Skelly Lars Brabyn

Modelling access to services, using cost path analysis and distance decay models, can be improved if travel time rather than just distance is taken into account. If just straight line distance is used then traffic congestion in urban areas and rough bendy rural roads are not considered in the analysis and the results are subsequently distorted. An accurate road network layer that shows travel s...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید