0
Your cart

Your cart is empty

Books > Business & Economics > Business & management > Management of specific areas > Production & quality control management

Buy Now

Heuristics for the vehicle routing problem with multiple deliverymen - Heuristics for the vehicle routing problem with multiple deliverymen (German, Paperback) Loot Price: R1,151
Discovery Miles 11 510
Heuristics for the vehicle routing problem with multiple deliverymen - Heuristics for the vehicle routing problem with multiple...

Heuristics for the vehicle routing problem with multiple deliverymen - Heuristics for the vehicle routing problem with multiple deliverymen (German, Paperback)

Michael Huemer

 (sign in to rate)
Loot Price R1,151 Discovery Miles 11 510 | Repayment Terms: R108 pm x 12*

Bookmark and Share

Expected to ship within 10 - 15 working days

Masterarbeit aus dem Jahr 2011 im Fachbereich BWL - Beschaffung, Produktion, Logistik, Note: Sehr gut, Karl-Franzens-Universitat Graz (Produktion und Logistik), Sprache: Deutsch, Abstract: Der Hauptbestandteil dieser Arbeit ist das Testen verschiedener lokaler Suchoperatoren fur eine Erweiterung des gutbekannten Vehicle Routing Problems. Diese erst vor kurzem eingefuhrte Erweiterung wurde notwendig um ein Routenplanungsproblem zu losen, das daraus bestand, Getranke und Tabakwaren in dichtbesiedelten Groystadten in Brasilien auszuliefern. Es wurde nun versucht herauszunden, welche der VRPTW Operatoren geeignet sind, um das Vehicle Routing Problem with Time Windows and Multiple Deliverymen (VRPTWMD) moglichst gut zu losen. Insgesamt wurden vier Operatoren implementiert, wobei Relocate und Ejection Chains auf die Routenminimierung abzielen und Cross bzw. 2-opt entsprechend die gefahrene Distanz verringern sollten. Um die Operatoren zu testen, wurden die benotigten Startlosungen mit der von Solomon entwickelten I1 Einfugeheuristik generiert. Die Erkenntnisse aus den Tests wurden schieylich dazu verwendet, eine best performance Variante zu entwickeln, welche anhand der Solomon Instanzen R101 bis R112 getestet wurde. Die Ergebnisse der Tests benden sich am Ende der Arbeit. The Vehicle Routing Problem with time windows is a well studied problem in literature. The extension to Vehicle Routing Problem with Time Windows and Multiple Deliverymen (VRPTWMD) has been proposed to solve a delivery problem of commodities, like beverages and tobacco in highly populated areas in Brazil. This rather new problem structure in the VRPTW context, is the main subject of the work. In this thesis, the aim is to nd out, which operators used for VRP are most suitable for the VRPTWMS. Relocate and Ejection Chain operators were tested for truck and deliverymen reduction, Cross and 2-opt were implemented to reduce distance. The Solomon I1 insertion heuristic was used to obtain starting solutions,

General

Imprint: Grin Verlag
Country of origin: United States
Release date: September 2013
First published: September 2013
Authors: Michael Huemer
Dimensions: 210 x 148 x 4mm (L x W x T)
Format: Paperback - Trade
Pages: 60
ISBN-13: 978-3-656-49271-9
Languages: German
Categories: Books > Business & Economics > Business & management > Management of specific areas > Production & quality control management
LSN: 3-656-49271-9
Barcode: 9783656492719

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!

Partners