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 r… Mehr…
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].; PDF; Business,Finance and Law > Business & management > Operational research, Springer New York<
hive.co.uk
No. 9780387777788. Versandkosten:Instock, Despatched same working day before 3pm, zzgl. Versandkosten. Details...
(*) Derzeit vergriffen bedeutet, dass dieser Titel momentan auf keiner der angeschlossenen Plattform verfügbar ist.
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 r… Mehr…
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].; PDF; Business,Finance and Law > Business & management > Operational research, Springer US<
hive.co.uk
No. 9780387777788. Versandkosten:Instock, Despatched same working day before 3pm, zzgl. Versandkosten. Details...
(*) Derzeit vergriffen bedeutet, dass dieser Titel momentan auf keiner der angeschlossenen Plattform verfügbar ist.
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 r… Mehr…
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].; PDF; Business,Finance and Law > Business & management > Operational research, Springer US<
hive.co.uk
No. 9780387777788. Versandkosten:Instock, Despatched same working day before 3pm, zzgl. Versandkosten. Details...
(*) Derzeit vergriffen bedeutet, dass dieser Titel momentan auf keiner der angeschlossenen Plattform verfügbar ist.
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 r… Mehr…
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<
Springer.com
Nr. 978-0-387-77778-8. Versandkosten:Worldwide free shipping, , DE. (EUR 0.00) Details...
(*) Derzeit vergriffen bedeutet, dass dieser Titel momentan auf keiner der angeschlossenen Plattform verfügbar ist.
Ramesh Sharda; Bruce L. Golden; S. Raghavan; Stefan Voß; Bruce Golden; Edward A. Wasil; S. Raghavan; Edward Wasil: The Vehicle Routing Problem: Latest Advances and New Challenges - Erstausgabe
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 r… Mehr…
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].; PDF; Business,Finance and Law > Business & management > Operational research, Springer New York<
No. 9780387777788. Versandkosten:Instock, Despatched same working day before 3pm, zzgl. Versandkosten.
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 r… Mehr…
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].; PDF; Business,Finance and Law > Business & management > Operational research, Springer US<
No. 9780387777788. Versandkosten:Instock, Despatched same working day before 3pm, zzgl. Versandkosten.
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 r… Mehr…
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].; PDF; Business,Finance and Law > Business & management > Operational research, Springer US<
No. 9780387777788. Versandkosten:Instock, Despatched same working day before 3pm, zzgl. Versandkosten.
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 r… Mehr…
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<
Nr. 978-0-387-77778-8. Versandkosten:Worldwide free shipping, , DE. (EUR 0.00)
Ramesh Sharda; Bruce L. Golden; S. Raghavan; Stefan Voß; Bruce Golden; Edward A. Wasil; S. Raghavan; Edward Wasil: The Vehicle Routing Problem: Latest Advances and New Challenges - Erstausgabe
1Da einige Plattformen keine Versandkonditionen übermitteln und diese vom Lieferland, dem Einkaufspreis, dem Gewicht und der Größe des Artikels, einer möglichen Mitgliedschaft der Plattform, einer direkten Lieferung durch die Plattform oder über einen Drittanbieter (Marketplace), etc. abhängig sein können, ist es möglich, dass die von eurobuch angegebenen Versandkosten nicht mit denen der anbietenden Plattform übereinstimmen.
Buch in der Datenbank seit 2008-01-05T03:38:38+01:00 (Berlin) Detailseite zuletzt geändert am 2024-03-24T20:11:30+01:00 (Berlin) ISBN/EAN: 9780387777788
ISBN - alternative Schreibweisen: 0-387-77778-4, 978-0-387-77778-8 Alternative Schreibweisen und verwandte Suchbegriffe: Autor des Buches: golden, bruce, matt fitzgerald, claude julien Titel des Buches: interfaces, the vehicle routing problem latest advances and new challenges
Daten vom Verlag:
Autor/in: Bruce L. Golden Titel: Operations Research /Computer Science Interfaces Series; The Vehicle Routing Problem: Latest Advances and New Challenges Verlag: Springer; Springer US 591 Seiten Erscheinungsjahr: 2008-07-20 New York; NY; US Sprache: Englisch 251,90 € (DE)
EA; E107; eBook; Nonbooks, PBS / Wirtschaft/Allgemeines, Lexika; Unternehmensforschung; Verstehen; SAS; algorithm; genetic algorithms; health care logistics; inventory routing; linear optimization; local search; metaheuristics; modeling; multiperiod routing; optimization; programming; routing; transportation; vehicle routing; Engineering Economics; C; Operations Research and Decision Theory; Mathematical and Computational Engineering Applications; Applications of Mathematics; Operations Research, Management Science; Industrial Management; Operations Management; Business and Management; Management: Entscheidungstheorie; Mathematik für Ingenieure; Angewandte Mathematik; Ingenieurswesen, Maschinenbau allgemein; Management und Managementtechniken; Management spezifischer Bereiche; BC
Overviews and Surveys.- Routing a Heterogeneous Fleet of Vehicles.- A Decade of Capacitated Arc Routing.- Inventory Routing.- The Period Vehicle Routing Problem and its Extensions.- The Split Delivery Vehicle Routing Problem: A Survey.- Challenges and Advances in A Priori Routing.- Metaheuristics for the Vehicle Routing Problem and Its Extensions: A Categorized Bibliography.- Parallel Solution Methods for Vehicle Routing Problems.- Recent Developments in Dynamic Vehicle Routing Systems.- New Directions in Modeling and Algorithms.- Online Vehicle Routing Problems: A Survey.- Modeling and Solving the Capacitated Vehicle Routing Problem on Trees.- Using a Genetic Algorithm to Solve the Generalized Orienteering Problem.- An Integer Linear Programming Local Search for Capacitated Vehicle Routing Problems.- Robust Branch-Cut-and-Price Algorithms for Vehicle Routing Problems.- Recent Models and Algorithms for One-to-One Pickup and Delivery Problems.- One-to-Many-to-One Single Vehicle Pickup and Delivery Problems.- Challenges and Opportunities in Attended Home Delivery.- Chvátal-Gomory Rank-1 Cuts Used in a Dantzig-Wolfe Decomposition of the Vehicle Routing Problem with Time Windows.- Vehicle Routing Problems with Inter-Tour Resource Constraints.- From Single-Objective to Multi-Objective Vehicle Routing Problems: Motivations, Case Studies, and Methods.- Practical Applications.- Vehicle Routing for Small Package Delivery and Pickup Services.- Advances in Meter Reading: Heuristic Solution of the Close Enough Traveling Salesman Problem over a Street Network.- Multiperiod Planning and Routing on a Rolling Horizon for Field Force Optimization Logistics.- Health Care Logistics, Emergency Preparedness, and Disaster Relief: New Challenges for Routing Problems with a Focus on theAustrian Situation.- Vehicle Routing Problems and Container Terminal Operations – An Update of Research.
Weitere, andere Bücher, die diesem Buch sehr ähnlich sein könnten:
