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

£96.25

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

Name: Bio-inspired Algorithms for the Vehicle Routing Problem: 161 (Studies in Computational Intelligence, 161)
Brand: Springer
Price: 96.25 GBP
Availability: InStock

Decision Making

This is the most expensive it has ever been. Walk away.

£96 today · previous high £96 · all-time low £94

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 86 days · 86 data points (no recent data)

Historical

Generating forecast…

Price Distribution

Price distribution over 86 days • 2 price levels

Days at Price

Current Price

Price Analysis

Most common price: £95 (65 days, 75.6%)

Price range: £95 - £96

Price levels: 2 different prices over 86 days

Description

The vehicle routing problem (VRP) is one of the most famous combinatorial optimization problems. In simple terms, the goal is to determine a set of routes with overall minimum cost that can satisfy several geographical scattered - mands. A ?eet of vehicles located in one or more depots is available to ful?ll the requests. A large number of variants exist, adding di?erent constraints to the original de?nition. Some examples are related to the number of depots, the ordering for visiting the customers or to time windows specifying a desirable period to arrive to a given location. The original version of this problem was proposed by Dantzig and Ramser in 1959 [1]. In their seminal paper, the authors address the calculation of a set of optimal routes for a ?eet of gasoline delivery trucks. Since then, the VRP has attractedtheattentionofalargenumberofresearchers.Aconsiderablepartofits success is a consequence of its practical interest, as it resembles many real-world problems faced everyday by distribution and transportation companies, just to mention a few applications areas. In this context, the development of e?cient optimization techniques is crucial. They are able to provide new and enhanced solutionstologisticoperations,andmaythereforeleadtoasubstantialreduction in costs for companies. Additionally, and from a research oriented perspective, the VRP is a challenging NP-hard problem providing excellent benchmarks to access the e?ciency of new global optimization algorithms.

Product Specifications

Brand: Springer
Format: paperback
ASIN: 3642098878
Category: Books > Subjects > Business, Finance & Law > Management > Management Skills > Decision Making
Domain: Amazon UK
Release Date: 28 October 2010
Listed Since: 20 September 2010

Barcode

No barcode data available

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

This is the most expensive it has ever been. Walk away.

Price History & Forecast

Price Distribution

Price Analysis

Description

Product Specifications

Barcode

Similar Products You Might Like

Vehicle Routing: Problems, Methods, and Applications (MOS-SIAM Series on Optimization)

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

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

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

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

Integration of Information and Optimization Models for Routing in City Logistics: 177 (International Series in Operations Research & Management Science, 177)

Springer Metaheuristics for Combinatorial Optimization 1332

Arc Routing: Theory, Solutions and Applications

Arc Routing: Theory, Solutions and Applications

The Shortest Path Problem: Ninth DIMACS Implementation Challenge (DIMACS: Series in Discrete Mathematics and Theoretical Computer Science)

Extremal Optimization: Fundamentals, Algorithms, and Applications

Global Logistics Management: Volume 1 (Industrial Engineering)

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

Advances In Combinatorial Optimization: Linear Programming Formulations Of The Traveling Salesman And Other Hard Combinatorial Optimization Problems

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

Quantitative Approaches in Logistics and Supply Chain Management: Proceedings of the 8th Workshop on Logistics and Supply Chain Management, Berkeley, ... and 4th, 2013 (Lecture Notes in Logistics)

Advances in Computational Intelligence in Transport, Logistics, and Supply Chain Management: 144 (Studies in Computational Intelligence, 144)

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

Hybrid Metaheuristics: 434 (Studies in Computational Intelligence, 434)

Quantitative Methods in Transportation

Integrated Optimization in Public Transport Planning: 160 (Springer Optimization and Its Applications, 160)

Integrated Optimization in Public Transport Planning: 160 (Springer Optimization and Its Applications, 160)

Optimization in Public Transportation: Stop Location, Delay Management and Tariff Zone Design in a Public Transportation Network: 3 (Springer Optimization and Its Applications, 3)

Dynamic Programming Multi-Objective Combinatorial Optimization: 331 (Studies in Systems, Decision and Control, 331)