Falls Sie nur an einem bestimmten Exempar interessiert sind, können Sie aus der folgenden Liste jenes wählen, an dem Sie interessiert sind:
Nur diese Ausgabe anzeigen…
Nur diese Ausgabe anzeigen…
Nur diese Ausgabe anzeigen…
Approximate Dynamic Programming for Dynamic Vehicle Routing
13 Angebote vergleichen
Preise | 2018 | 2020 | 2021 |
---|---|---|---|
Schnitt | € 117,38 | € 108,19 | € 117,59 |
Nachfrage |
Approximate Dynamic Programming for Dynamic Vehicle Routing
ISBN: 9783319856810 bzw. 3319856812, vermutlich in Englisch, Springer Shop, Taschenbuch, neu.
This book provides a straightforward overview for every researcher interested in stochastic dynamic vehicle routing problems (SDVRPs). The book is written for both the applied researcher looking for suitable solution approaches for particular problems as well as for the theoretical researcher looking for effective and efficient methods of stochastic dynamic optimization and approximate dynamic programming (ADP). To this end, the book contains two parts. In the first part, the general methodology required for modeling and approaching SDVRPs is presented. It presents adapted and new, general anticipatory methods of ADP tailored to the needs of dynamic vehicle routing. Since stochastic dynamic optimization is often complex and may not always be intuitive on first glance, the author accompanies the ADP-methodology with illustrative examples from the field of SDVRPs. The second part of this book then depicts the application of the theory to a specific SDVRP. The process starts from the real-world application. The author describes a SDVRP with stochastic customer requests often addressed in the literature, and then shows in detail how this problem can be modeled as a Markov decision process and presents several anticipatory solution approaches based on ADP. In an extensive computational study, he shows the advantages of the presented approaches compared to conventional heuristics. To allow deep insights in the functionality of ADP, he presents a comprehensive analysis of the ADP approaches. Soft cover.
Approximate Dynamic Programming for Dynamic Vehicle Routing
ISBN: 9783319555102 bzw. 3319555103, in Deutsch, Springer Shop, gebundenes Buch, neu.
This book provides a straightforward overview for every researcher interested in stochastic dynamic vehicle routing problems (SDVRPs). The book is written for both the applied researcher looking for suitable solution approaches for particular problems as well as for the theoretical researcher looking for effective and efficient methods of stochastic dynamic optimization and approximate dynamic programming (ADP). To this end, the book contains two parts. In the first part, the general methodology required for modeling and approaching SDVRPs is presented. It presents adapted and new, general anticipatory methods of ADP tailored to the needs of dynamic vehicle routing. Since stochastic dynamic optimization is often complex and may not always be intuitive on first glance, the author accompanies the ADP-methodology with illustrative examples from the field of SDVRPs. The second part of this book then depicts the application of the theory to a specific SDVRP. The process starts from the real-world application. The author describes a SDVRP with stochastic customer requests often addressed in the literature, and then shows in detail how this problem can be modeled as a Markov decision process and presents several anticipatory solution approaches based on ADP. In an extensive computational study, he shows the advantages of the presented approaches compared to conventional heuristics. To allow deep insights in the functionality of ADP, he presents a comprehensive analysis of the ADP approaches. Hard cover.
Approximate Dynamic Programming for Dynamic Vehicle Routing
ISBN: 9783319555102 bzw. 3319555103, in Deutsch, neu.
This book provides a straightforward overview for every researcher interested in stochastic dynamic vehicle routing problems (SDVRPs). The book is written for both the applied researcher looking for suitable solution approaches for particular problems as well as for the theoretical researcher looking for effective and efficient methods of stochastic dynamic optimization and approximate dynamic programming (ADP). To this end, the book contains two parts. In the first part, the general methodology required for modeling and approaching SDVRPs is presented. It presents adapted and new, general anticipatory methods of ADP tailored to the needs of dynamic vehicle routing. Since stochastic dynamic optimization is often complex and may not always be intuitive on first glance, the author accompanies the ADP-methodology with illustrative examples from the field of SDVRPs. The second part of this book then depicts the application of the theory to a specific SDVRP. The process starts from the real-world application. The author describes a SDVRP with stochastic customer requests often addressed in the literature, and then shows in detail how this problem can be modeled as a Markov decision process and presents several anticipatory solution approaches based on ADP. In an extensive computational study, he shows the advantages of the presented approaches compared to conventional heuristics. To allow deep insights in the functionality of ADP, he presents a comprehensive analysis of the ADP approaches.
Approximate Dynamic Programming for Dynamic Vehicle Routing
ISBN: 9783319555102 bzw. 3319555103, in Englisch, Springer International Publishing AG, neu.
This book provides a straightforward overview for every researcher interested in stochastic dynamic vehicle routing problems (SDVRPs). The book is written for both the applied researcher looking for suitable solution approaches for particular problems as well as for the theoretical researcher looking for effective and efficient methods of stochastic dynamic optimization and approximate dynamic programming (ADP). To this end, the book contains two parts. In the first part, the general methodology required for modeling and approaching SDVRPs is presented. Itpresents adapted and new, general anticipatory methods of ADP tailored to the needs of dynamic vehicle routing. Since stochastic dynamic optimization is often complex and may not always be intuitive on first glance, the author accompanies the theoretical SDO-methodology with illustrative examples from the field of SDVRPs. The second part of this book then depicts the application of the theory to a specific SDVRP. The process starts from the real-world application. The author describes a SDVRP with stochastic customer requests often addressed in the literature, and then shows in detail how this problem can be modeled as a Markov decision process and presents several anticipatory solution approaches based on ADP. In an extensive computational study, he shows the advantages of the presented approaches compared to conventional heuristics. To allow deep insights in the functionality of ADP, he presents a comprehensive analysis of the ADP approaches.
Approximate Dynamic Programming For Dynamic Vehicle Routing
ISBN: 9783319555102 bzw. 3319555103, in Deutsch, Springer-Verlag/Sci-Tech/Trade, neu.
Marlin Wolf Ulmer, Books, Business and Finance, Industries and Professions, Total Quality Management, Approximate Dynamic Programming For Dynamic Vehicle Routing, This book provides a straightforward overview for every researcher interested in stochastic dynamic vehicle routing problems (SDVRPs). The book is written for both the applied researcher looking for suitable solution approaches for particular problems as well as for the theoretical researcher looking for effective and efficient methods of stochastic dynamic optimization and approximate dynamic programming (ADP). To this end, the book contains two parts. In the first part, the general methodology required for modeling and approaching SDVRPs is presented. It presents adapted and new, general anticipatory methods of ADP tailored to the needs of dynamic vehicle routing. Since stochastic dynamic optimization is often complex and may not always be intuitive on first glance, the author accompanies the ADP-methodology with illustrative examples from the field of SDVRPs.The second part of this book then depicts the application of the theory to a specific SDVRP. The process starts from the real-world application. The author describes a SDVRP with stochastic customer requests often addressed in the literature, and then shows in detail how this problem can be modeled as a Markov decision process and presents several anticipatory solution approaches based on ADP. In an extensive computational study, he shows the advantages of the presented approaches compared to conventional heuristics. To allow deep insights in the functionality of ADP, he presents a comprehensive analysis of the ADP approaches.
Approximate Dynamic Programming for Dynamic Vehicle Routing (2017)
ISBN: 3319856812 bzw. 9783319856810, vermutlich in Englisch, Springer International Publishing, Taschenbuch, neu, Nachdruck.
Approximate Dynamic Programming for Dynamic Vehicle Routing (2017)
ISBN: 3319555103 bzw. 9783319555102, vermutlich in Englisch, Springer International Publishing, gebundenes Buch, neu.
Approximate Dynamic Programming for Dynamic Vehicle Routing (2017)
ISBN: 3319856812 bzw. 9783319856810, in Deutsch, Taschenbuch, neu, Nachdruck.
Approximate Dynamic Programming for Dynamic Vehicle Routing (2017)
ISBN: 3319555103 bzw. 9783319555102, in Deutsch, neu.
Approximate Dynamic Programming for Dynamic Vehicle Routing (2018)
ISBN: 9783319856810 bzw. 3319856812, vermutlich in Englisch, Taschenbuch, neu, Nachdruck.
Die Beschreibung dieses Angebotes ist von geringer Qualität oder in einer Fremdsprache. Trotzdem anzeigen