• Open Daily: 10am - 10pm
    Alley-side Pickup: 10am - 7pm

    3038 Hennepin Ave Minneapolis, MN
    612-822-4611

Open Daily: 10am - 10pm | Alley-side Pickup: 10am - 7pm
3038 Hennepin Ave Minneapolis, MN
612-822-4611
Approximate Dynamic Programming for Dynamic Vehicle Routing

Approximate Dynamic Programming for Dynamic Vehicle Routing

Hardcover

Series: Operations Research/Computer Science Interfaces, Book 61

Business GeneralManagementProbability & Statistics

ISBN10: 3319555103
ISBN13: 9783319555102
Publisher: Springer
Published: Apr 27 2017
Pages: 197
Weight: 1.08
Height: 0.56 Width: 6.14 Depth: 9.21
Language: English
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.

1 different editions

Also available

Also in

Business General