Approximate Dynamic Programming for Dynamic Vehicle Routing: 61 (Operations Research/Computer Science Interfaces Series, 61) - Image 1

£97.45

Springer Approximate Dynamic Programming for Dynamic Vehicle Routing: 61 (Operations Research/Computer Science Interfaces Series, 61)

Name: Approximate Dynamic Programming for Dynamic Vehicle Routing: 61 (Operations Research/Computer Science Interfaces Series, 61)
Brand: Springer
Price: 97.45 GBP
Availability: InStock

28548236

Managers' Guides to Computing

About as cheap as it gets. The only time it was cheaper was 9 months ago.

£97 today · all-time low £94 (Sep 2025) · usually the usual

NEW HERE?

Amazon shows you one price. We show you all of them.

Tosheroon watches Amazon prices so you don't have to. Every product on Amazon has a price history — we make it visible. Set the price you'd actually pay, and we'll email you the second it gets there. No app, no account, one email.

WHAT'S ON THIS PAGE

↓ Price chart
when this has been cheap or pricey

↓ Forecast
where the price is heading next

↓ Statistics
all-time high & low, recent range

↑ Price alert
name your number, we'll email you

Price History & Forecast

Grey patches = out of stock. Cheaper = lower on the chart. Hover for exact prices.

Last 638 days • 638 data points (No recent data available)

Historical

Generating forecast...

Price Distribution

Price distribution over 638 days • 3 price levels

Days at Price

Current Price

Price Analysis

Most common price: £99 (442 days, 69.3%)

Price range: £94 - £99

Price levels: 3 different prices over 638 days

Description

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.

Product Specifications

Brand: Springer
Model: 28548236
Format: hardcover
ASIN: 3319555103
Category: Books > Subjects > Business, Finance & Law > E-Commerce > Managers' Guides to Computing
Domain: Amazon UK
Release Date: 27 April 2017
Listed Since: 14 February 2017

Barcode

No barcode data available

Springer Approximate Dynamic Programming for Dynamic Vehicle Routing: 61 (Operations Research/Computer Science Interfaces Series, 61)

About as cheap as it gets. The only time it was cheaper was 9 months ago.

Price History & Forecast

Price Distribution

Price Analysis

Description

Product Specifications

Barcode

Similar Products You Might Like

Approximate Dynamic Programming for Dynamic Vehicle Routing: 61 (Operations Research/Computer Science Interfaces Series, 61)

Stochastic Dynamic Programming and the Control of Queueing Systems: 505 (Wiley Series in Probability and Statistics)

Modelling Empty Container Repositioning Logistics

Metaheuristics for Vehicle Routing Problems (Computer Engineering: Metaheuristics Set, 3)

Logistics Systems Analysis

The Robust Vehicle Routing Problem: A novel approach to uncertainty in a classical transportation problem with real life application

From Shortest Paths to Reinforcement Learning: A MATLAB-Based Tutorial on Dynamic Programming (EURO Advanced Tutorials on Operational Research)

The Vehicle Routing Problem: Latest Advances and New Challenges: 43 (Operations Research/Computer Science Interfaces Series, 43)

Handbook of Markov Decision Processes: Methods and Applications: 40 (International Series in Operations Research & Management Science, 40)

The Vehicle Routing Problem: Latest Advances and New Challenges: 43 (Operations Research/Computer Science Interfaces Series, 43)

Bio-inspired Algorithms for the Vehicle Routing Problem: 161 (Studies in Computational Intelligence, 161)

Sustainable Logistics and Transportation: Optimization Models and Algorithms: 129 (Springer Optimization and Its Applications, 129)

Nature Inspired Optimisation for Delivery Problems: From Theory to the Real World (Natural Computing Series)

Adaptive Dynamic Programming for Control: Algorithms and Stability (Communications and Control Engineering)

Job-Shop-Scheduling: Planung durch probabilistische lokale Suchverfahren (Information - Organisation - Produktion)

Modeling Dynamic Transportation Networks: An Intelligent Transportation System Oriented Approach

Decision Theory: An Introduction to Dynamic Programming and Sequential Decisions: 11 (Wiley Interscience Series in Systems and Optimization)

Dynamics in Logistics: Proceedings of the 4th International Conference LDIC, 2014 Bremen, Germany (Lecture Notes in Logistics)

Decision Making in Service Industries: A Practical Approach

The Supply Chain in Manufacturing, Distribution, and Transportation: Modeling, Optimization, and Applications

Stochastic Programming: 14 (Theory and Decision Library, 14)

Discrete and Fractional Programming Techniques for Location Models: 3 (Combinatorial Optimization, 3)

Air Route Networks Through Complex Networks Theory

Supply Chain Disruption Management: Using Stochastic Mixed Integer Programming: 291 (International Series in Operations Research & Management Science, 291)