Artículos relacionados a Shortest Path Problems in a Stochastic and Dynamic...
Sinopsis
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.
"Sinopsis" puede pertenecer a otra edición de este libro.
Reseña del editor
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.
"Sobre este título" puede pertenecer a otra edición de este libro.
Comprar nuevo
Ver este artículo
EUR 55,22
EUR 4,02 gastos de envío desde Reino Unido a España
Destinos, gastos y plazos de envíoResultados de la búsqueda para Shortest Path Problems in a Stochastic and Dynamic...
Imagen de archivo
Shortest Path Problems in a Stochastic and Dynamic Environment
Impresión bajo demandaLibrería: PBShop.store UK, Fairford, GLOS, Reino Unido
Calificación del vendedor: 5 de 5 estrellas
PAP. Condición: New. New Book. Delivered from our UK warehouse in 4 to 14 business days. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000. Nº de ref. del artículo: L0-9781249600633
Cantidad disponible: Más de 20 disponibles
Imagen de archivo
Shortest Path Problems in a Stochastic and Dynamic Environment
Librería: Ria Christie Collections, Uxbridge, Reino Unido
Calificación del vendedor: 5 de 5 estrellas
Condición: New. In. Nº de ref. del artículo: ria9781249600633_new
Cantidad disponible: Más de 20 disponibles
Imagen de archivo
Shortest Path Problems in a Stochastic and Dynamic Environment
Impresión bajo demandaLibrería: PBShop.store US, Wood Dale, IL, Estados Unidos de America
Calificación del vendedor: 5 de 5 estrellas
PAP. Condición: New. New Book. Shipped from UK. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000. Nº de ref. del artículo: L0-9781249600633
Cantidad disponible: Más de 20 disponibles
Imagen de archivo
Shortest Path Problems in a Stochastic and Dynamic Environment
Publicado por
Biblioscholar, 2012
ISBN 10: 1249600634
ISBN 13: 9781249600633
Nuevo
Paperback / softback
Librería: THE SAINT BOOKSTORE, Southport, Reino Unido
Calificación del vendedor: 5 de 5 estrellas
Paperback / softback. Condición: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days 189. Nº de ref. del artículo: C9781249600633
Cantidad disponible: Más de 20 disponibles
Imagen de archivo
Shortest Path Problems in a Stochastic and Dynamic Environment
Publicado por
BiblioScholar 2012-10-10, 2012
ISBN 10: 1249600634
ISBN 13: 9781249600633
Nuevo
Paperback
Librería: Chiron Media, Wallingford, Reino Unido
Calificación del vendedor: 4 de 5 estrellas
Paperback. Condición: New. Nº de ref. del artículo: 6666-IUK-9781249600633
Cantidad disponible: 10 disponibles
Imagen de archivo
Shortest Path Problems in a Stochastic and Dynamic Environment
Librería: Books Puddle, New York, NY, Estados Unidos de America
Calificación del vendedor: 4 de 5 estrellas
Condición: New. pp. 162. Nº de ref. del artículo: 26393274028
Cantidad disponible: 4 disponibles
Imagen de archivo
Shortest Path Problems in a Stochastic and Dynamic Environment
Impresión bajo demandaLibrería: Majestic Books, Hounslow, Reino Unido
Calificación del vendedor: 5 de 5 estrellas
Condición: New. Print on Demand pp. 162. Nº de ref. del artículo: 386358643
Cantidad disponible: 4 disponibles
Imagen del vendedor
Shortest Path Problems in a Stochastic and Dynamic Environment
Librería: moluna, Greven, Alemania
Calificación del vendedor: 5 de 5 estrellas
Condición: 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. Nº de ref. del artículo: 6488487
Cantidad disponible: Más de 20 disponibles
Imagen de archivo
Shortest Path Problems in a Stochastic and Dynamic Environment
Librería: Biblios, Frankfurt am main, HESSE, Alemania
Calificación del vendedor: 5 de 5 estrellas
Condición: New. Nº de ref. del artículo: 18393274022
Cantidad disponible: 4 disponibles
Imagen del vendedor
Shortest Path Problems in a Stochastic and Dynamic Environment
Publicado por
Bibliolife Okt 2012, 2012
ISBN 10: 1249600634
ISBN 13: 9781249600633
Nuevo
Taschenbuch
Librería: AHA-BUCH GmbH, Einbeck, Alemania
Calificación del vendedor: 5 de 5 estrellas
Taschenbuch. Condición: 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. Nº de ref. del artículo: 9781249600633
Cantidad disponible: 2 disponibles