Vehicle Routing Problem Latest (20 results)

Condition: New.

Condition: New. In English.

Taschenbuch. Condition: Neu. The Vehicle Routing Problem: Latest Advances and New Challenges | Bruce L. Golden (u. a.) | Taschenbuch | Operations Research/Computer Science Interfaces Series | x | Englisch | 2010 | Springer | EAN 9781441946034 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.…

Condition: As New. Unread book in perfect condition.

Taschenbuch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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].…

Condition: New.

Condition: As New. Unread book in perfect condition.

Condition: New.

Condition: As New. Unread book in perfect condition.

Condition: New. In English.

Paperback. Condition: Brand New. 589 pages. 8.80x5.90x1.60 inches. In Stock.

Condition: Gut. Zustand: Gut | Seiten: 591 | Sprache: Englisch | Produktart: Bücher | The Vehicle Routing Problem (VRP) has been an especially active and fertile area of research. Over the past five to seven years, there have been numerous technological advances and exciting challenges that are of considerable interest to students, teachers, and researchers. The Vehicle Routing Problem: Latest Advances and New Challenges will focus on a host of significant technical advances that have evolved over the past few years for modeling and solving vehicle routing problems and variants. New approaches for solving VRPs have been developed from important methodological advances. These developments have resulted in faster solution algorithms, more accurate techniques, and an improvement in the ability to solve large-scale, complex problems. The book will systematically examine these recent developments in the VRP and provide the following in a unified and carefully developed presentation: Present novel problems that have arisen in the vehicle routing domain and highlight new challenges for the field; Present significant methodological advances or new approaches for solving existing vehicle routing problems; Summarize the most significant research results for the vehicle routing problem and its variants from 2000 to the present.&nbsp.…

Buch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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].…

Hardcover. Condition: gut. 2008. The Vehicle Routing Problem: Latest Advances and New Challenges In englischer Sprache. pages.

Condition: new. Questo è un articolo print on demand.

Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Vehicle routing problems (VRP), including the traveling salesman problem, have marked the success of operations research more than almost any other set of combinatorial optimization problems. Recent trends have moved forward towards side-constraints (or .…

Taschenbuch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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]. 604 pp. Englisch.…

Taschenbuch. Condition: Neu. This item is printed on demand - Print on Demand Titel. Neuware -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].Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 604 pp. Englisch.…

Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Vehicle routing problems (VRP), including the traveling salesman problem, have marked the success of operations research more than almost any other set of combinatorial optimization problems. Recent trends have moved forward towards side-constraints (or .…

Buch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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]. 591 pp. Englisch.…