bio inspired algorithms vehicle routing (17 resultados)

Hardcover. Condición: Good. Connecting readers with great books since 1972! Used textbooks may not include companion materials such as access codes, etc. May have some wear or writing/highlighting. We ship orders daily and Customer Service is our top priority!

Condición: Brand New. New. US edition. Expediting shipping for all USA and Europe orders excluding PO Box. Excellent Customer Service.

Condición: New. This is a Brand-new US Edition. This Item may be shipped from US or any other country as we have multiple locations worldwide.

Brand new book. Fast ship. Please provide full street address as we are not able to ship to P O box address.

Condición: New. In.

Condición: New.

Hardcover. Condición: Like New. Like New. book.

Condición: Like New. Most items will be dispatched the same or the next working day. An apparently unread copy in perfect condition. Dust cover is intact with no nicks or tears. Spine has no signs of creasing. Pages are clean and not marred by notes or folds of any kind.

Condición: New. pp. 232.

Taschenbuch. Condición: Neu. Bio-inspired Algorithms for the Vehicle Routing Problem | Jorge Tavares (u. a.) | Taschenbuch | xvi | Englisch | 2010 | Springer Berlin | EAN 9783642098871 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.

Taschenbuch. Condición: Neu. Neuware -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.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 232 pp. Englisch.

Taschenbuch. Condición: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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.

Paperback. Condición: Like New. Like New. book.

Taschenbuch. Condición: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 232 pp. Englisch.

Condición: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Comprehensive review of the most relevant bio-inspired approaches to different Vehicle Routing Problem variantsThe vehicle routing problem (VRP) is one of the most famous combinatorial optimization problems. In simple terms, the goal is to determ.

Condición: New. Print on Demand pp. 232 57 Illus.

Condición: New. PRINT ON DEMAND pp. 232.