Items related to Shortest Path Problems in a Stochastic and Dynamic...
Synopsis
In this research, we consider stochastic and dynamic transportation network problems. Particularly, we develop a variety of algorithms to solve the expected shortest path problem in addition to techniques for computing the total travel time distribution along a path in the network. First, we develop an algorithm for solving an independent expected shortest path problem. Next, we incorporate the inherent dependencies along successive links in two distinct ways to find the expected shortest path. Since the dependent expected shortest path problem cannot be solved with traditional deterministic approaches, we develop a heuristic based on the K-shortest path algorithm for this dependent stochastic network problem. Additionally, transient and asymptotic versions of the problem are considered. An algorithm to compute a parametric total travel time distribution for the shortest path is presented along with stochastically shortest path measures. The work extends the current literature on such problems by considering interactions on adjacent links.
"synopsis" may belong to another edition of this title.
Search results for Shortest Path Problems in a Stochastic and Dynamic...
Stock Image
Shortest Path Problems in a Stochastic and Dynamic Environment
Seller: Chiron Media, Wallingford, United Kingdom
Seller rating 4 out of 5 stars
PF. Condition: New. Seller Inventory # 6666-IUK-9781249600633
Quantity: 10 available
Stock Image
Shortest Path Problems in a Stochastic and Dynamic Environment
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Seller rating 5 out of 5 stars
Condition: New. In. Seller Inventory # ria9781249600633_new
Quantity: Over 20 available
Stock Image
Shortest Path Problems in a Stochastic and Dynamic Environment
Print on DemandSeller: PBShop.store UK, Fairford, GLOS, United Kingdom
Seller rating 5 out of 5 stars
PAP. Condition: New. New Book. Delivered from our UK warehouse in 4 to 14 business days. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000. Seller Inventory # L0-9781249600633
Quantity: Over 20 available
Stock Image
Shortest Path Problems in a Stochastic and Dynamic Environment
Print on DemandSeller: PBShop.store US, Wood Dale, IL, U.S.A.
Seller rating 5 out of 5 stars
PAP. Condition: New. New Book. Shipped from UK. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000. Seller Inventory # L0-9781249600633
Quantity: Over 20 available
Stock Image
Shortest Path Problems in a Stochastic and Dynamic Environment
Published by
Biblioscholar, 2012
ISBN 10: 1249600634
ISBN 13: 9781249600633
New
Paperback / softback
Seller: THE SAINT BOOKSTORE, Southport, United Kingdom
Seller rating 5 out of 5 stars
Paperback / softback. Condition: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days 189. Seller Inventory # C9781249600633
Quantity: Over 20 available
Stock Image
Shortest Path Problems in a Stochastic and Dynamic Environment
Print on DemandSeller: Majestic Books, Hounslow, United Kingdom
Seller rating 5 out of 5 stars
Condition: New. Print on Demand pp. 162. Seller Inventory # 386358643
Quantity: 4 available
Stock Image
Shortest Path Problems in a Stochastic and Dynamic Environment
Seller: Books Puddle, New York, NY, U.S.A.
Seller rating 4 out of 5 stars
Condition: New. pp. 162. Seller Inventory # 26393274028
Quantity: 4 available
Stock Image
Shortest Path Problems in a Stochastic and Dynamic Environment
Print on DemandSeller: Biblios, Frankfurt am main, HESSE, Germany
Seller rating 5 out of 5 stars
Condition: New. PRINT ON DEMAND pp. 162. Seller Inventory # 18393274022
Quantity: 4 available
Seller Image
Shortest Path Problems in a Stochastic and Dynamic Environment
Seller: moluna, Greven, Germany
Seller rating 5 out of 5 stars
Condition: New. KlappentextrnrnIn this research, we consider stochastic and dynamic transportation network problems. Particularly, we develop a variety of algorithms to solve the expected shortest path problem in addition to techniques for computing the total t. Seller Inventory # 6488487
Quantity: Over 20 available
Seller Image
Shortest Path Problems in a Stochastic and Dynamic Environment
Seller: AHA-BUCH GmbH, Einbeck, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. Neuware - In this research, we consider stochastic and dynamic transportation network problems. Particularly, we develop a variety of algorithms to solve the expected shortest path problem in addition to techniques for computing the total travel time distribution along a path in the network. First, we develop an algorithm for solving an independent expected shortest path problem. Next, we incorporate the inherent dependencies along successive links in two distinct ways to find the expected shortest path. Since the dependent expected shortest path problem cannot be solved with traditional deterministic approaches, we develop a heuristic based on the K-shortest path algorithm for this dependent stochastic network problem. Additionally, transient and asymptotic versions of the problem are considered. An algorithm to compute a parametric total travel time distribution for the shortest path is presented along with stochastically shortest path measures. The work extends the current literature on such problems by considering interactions on adjacent links. Seller Inventory # 9781249600633
Quantity: 2 available