Andere Kunden interessierten sich auch für
![The Vehicle Routing Problem: Latest Advances and New Challenges]( "The Vehicle Routing Problem: Latest Advances and New Challenges")
The Vehicle Routing Problem: Latest Advances and New Challenges403,99 €![Metaheuristics]( "Metaheuristics")
Metaheuristics81,99 €![Perspectives in Operations Research]( "Perspectives in Operations Research")
Perspectives in Operations Research110,99 €![Operational Tools in the Management of Financial Risks]( "Operational Tools in the Management of Financial Risks")
Operational Tools in the Management of Financial Risks110,99 €![Advances in Computational and Stochastic Optimization, Logic Programming, and Heuristic Search]( "Advances in Computational and Stochastic Optimization, Logic Programming, and Heuristic Search")
Advances in Computational and Stochastic Optimization, Logic Programming, and Heuristic Search116,99 €![Advances in Computational and Stochastic Optimization, Logic Programming, and Heuristic Search]( "Advances in Computational and Stochastic Optimization, Logic Programming, and Heuristic Search")
Advances in Computational and Stochastic Optimization, Logic Programming, and Heuristic Search110,99 €![Operational Tools in the Management of Financial Risks]( "Operational Tools in the Management of Financial Risks")
Operational Tools in the Management of Financial Risks116,99 €
In a unified and carefully developed presentation, this book systematically examines recent developments in VRP. The book focuses on a portfolio of significant technical advances that have evolved over the past few years for modeling and solving vehicle routing problems and VRP variations. Reflecting the most recent scholarship, this book is written by one of the top research scholars in Vehicle Routing and is one of the most important books in VRP to be published in recent times.
Theoretical research and practical applications in the ?eld of vehicle routing started in 1959 with the truck dispatching problem posed by Dantzig and Ramser [1]: ?nd the ". . . optimum routing of a ?eet of gasoline delivery trucks between a bulk terminal and a large number of service stations supplied by the terminal. " Using a method based on a linear programming formulation, their hand calculations produced a near-optimal solution with four routes to aproblemwithtwelve service stations. The authorsproclaimed:"Nopractical applications of the method have been made as yet. " In the nearly 50 years since the Dantzig and Ramser paper appeared, work in the ?eld has exploded dramatically. Today, a Google Scholar search of the words vehicle routing problem (VRP) yields more than 21,700 entries. The June 2006 issue of OR/MS Today provided a survey of 17 vendors of commercial routing software whose packages are currently capable of solving average-size problems with 1,000 stops, 50 routes, and two-hour hard-time windows in two to ten minutes [2]. In practice, vehicle routing may be the single biggest success story in operations research. For example, each day 103,500 drivers at UPS follow computer-generated routes. The drivers visit 7. 9 million customers and handle an average of 15. 6 million packages [3].
Theoretical research and practical applications in the ?eld of vehicle routing started in 1959 with the truck dispatching problem posed by Dantzig and Ramser [1]: ?nd the ". . . optimum routing of a ?eet of gasoline delivery trucks between a bulk terminal and a large number of service stations supplied by the terminal. " Using a method based on a linear programming formulation, their hand calculations produced a near-optimal solution with four routes to aproblemwithtwelve service stations. The authorsproclaimed:"Nopractical applications of the method have been made as yet. " In the nearly 50 years since the Dantzig and Ramser paper appeared, work in the ?eld has exploded dramatically. Today, a Google Scholar search of the words vehicle routing problem (VRP) yields more than 21,700 entries. The June 2006 issue of OR/MS Today provided a survey of 17 vendors of commercial routing software whose packages are currently capable of solving average-size problems with 1,000 stops, 50 routes, and two-hour hard-time windows in two to ten minutes [2]. In practice, vehicle routing may be the single biggest success story in operations research. For example, each day 103,500 drivers at UPS follow computer-generated routes. The drivers visit 7. 9 million customers and handle an average of 15. 6 million packages [3].
From the reviews: "The routing of vehicles with limited capacities for carrying goods or people is one of the major problems in transport logistics. ... The book is clearly structured and mostly well written. I can recommend it to any reader who wants to deepen his or her understanding of vehicle routing problems. ... the book is not only suited for experts in the area of vehicle routing but also for interested practitioners (especially the application-oriented chapters); and students." (T Hanne, Journal of the Operational Research Society, Vol. 60 (11), 2009)