Heuristics For The Vehicle Routing Problem With Multiple Deliverymen
DOWNLOAD
Download Heuristics For The Vehicle Routing Problem With Multiple Deliverymen PDF/ePub or read online books in Mobi eBooks. Click Download or Read Online button to get Heuristics For The Vehicle Routing Problem With Multiple Deliverymen book now. This website allows unlimited access to, at the time of writing, more than 1.5 million titles, including hundreds of thousands of titles in various foreign languages. If the content not found or just blank you must refresh this page
Heuristics For The Vehicle Routing Problem With Multiple Deliverymen
DOWNLOAD
Author : Michael Huemer
language : de
Publisher: GRIN Verlag
Release Date : 2013-09-02
Heuristics For The Vehicle Routing Problem With Multiple Deliverymen written by Michael Huemer and has been published by GRIN Verlag this book supported file pdf, txt, epub, kindle and other format this book has been release on 2013-09-02 with Business & Economics categories.
Masterarbeit aus dem Jahr 2011 im Fachbereich BWL - Beschaffung, Produktion, Logistik, Note: Sehr gut, Karl-Franzens-Universität Graz (Produktion und Logistik), Sprache: Deutsch, Abstract: Der Hauptbestandteil dieser Arbeit ist das Testen verschiedener lokaler Suchoperatoren für eine Erweiterung des gutbekannten Vehicle Routing Problems. Diese erst vor kurzem eingeführte Erweiterung wurde notwendig um ein Routenplanungsproblem zu lösen, das daraus bestand, Getränke und Tabakwaren in dichtbesiedelten Groÿstädten 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) möglichst gut zu lösen. 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 benötigten Startlösungen mit der von Solomon entwickelten I1 Einfügeheuristik generiert. Die Erkenntnisse aus den Tests wurden schieÿlich 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, for the tests and the nal version of the algorithm proposed. To complete this work, several tests have been performed and the results of the algorithm running Solomon R101- R112 instances can be found at the end.
Metaheuristics For Vehicle Routing Problems
DOWNLOAD
Author : Nacima Labadie
language : en
Publisher: John Wiley & Sons
Release Date : 2016-02-23
Metaheuristics For Vehicle Routing Problems written by Nacima Labadie and has been published by John Wiley & Sons this book supported file pdf, txt, epub, kindle and other format this book has been release on 2016-02-23 with Computers categories.
This book is dedicated to metaheuristics as applied to vehicle routing problems. Several implementations are given as illustrative examples, along with applications to several typical vehicle routing problems. As a first step, a general presentation intends to make the reader more familiar with the related field of logistics and combinatorial optimization. This preamble is completed with a description of significant heuristic methods classically used to provide feasible solutions quickly, and local improvement moves widely used to search for enhanced solutions. The overview of these fundamentals allows appreciating the core of the work devoted to an analysis of metaheuristic methods for vehicle routing problems. Those methods are exposed according to their feature of working either on a sequence of single solutions, or on a set of solutions, or even by hybridizing metaheuristic approaches with others kind of methods.
The Evolution Of The Vehicle Routing Problem
DOWNLOAD
Author : Bruce Golden
language : en
Publisher: Springer Nature
Release Date : 2023-01-01
The Evolution Of The Vehicle Routing Problem written by Bruce Golden and has been published by Springer Nature this book supported file pdf, txt, epub, kindle and other format this book has been release on 2023-01-01 with Mathematics categories.
This book presents state-of-the-art research and practice in optimization routing, specifically the vehicle routing problem (VRP). Since its introduction in the late 1950s, the VRP has been a very significant area of research and practice in operations research. Vehicles are used to make deliveries and for pick-ups every day and everywhere. Companies such as Amazon, UPS, FedEx, and DHL use route optimization to reduce mileage, fuel use, number of trucks on the road, and carbon dioxide emissions. The authors compile and analyze 135 survey and review articles on vehicle routing topics published between 2005 and 2022 in an effort to make key observations about publication and trend history, summarize the overall contributions in the field, and identify trends in VRP research and practice. The authors have compiled published research on models, algorithms, and applications for specific areas, including: alternative and multiple objectives; arc routing and general routing; drones, last-mile delivery, and urban distribution; dynamic and stochastic routing; green routing; inventory routing; loading constraints; location-routing; multiple depots; pickup and delivery and dial-a-ride problems; rich and multi-attribute routing; routing over time; shipping; two-echelon, collaborative, and inter-terminal problems; specific variants, benchmark datasets, and software; and exact algorithms and heuristics. In addition, the book discusses how vehicle routing problems are among the most widely studied problems in combinatorial optimization due to the mathematical complexity and practical significance.
Meta Heuristics For The Vehicle Routing Problem
DOWNLOAD
Author : Juan Song
language : en
Publisher:
Release Date : 2005
Meta Heuristics For The Vehicle Routing Problem written by Juan Song and has been published by this book supported file pdf, txt, epub, kindle and other format this book has been release on 2005 with categories.
This dissertation involves the development and application of Meta-RaPS and its variation to the vehicle routing problem (VRP) and to the vehicle routing problem with time windows (VRPTW). It begins with the introduction and overview of these two problems and Meta-RaPS, focusing on the formulation of both problems. The latter part of the dissertation proposes one new construction method with several variants followed by an improvement method for VRPTW in Meta-RaPS. Finally the multi-objective characteristic of VRPTW is also discussed. The dissertation is divided into seven chapters, covering problems and heuristics background, formulation and the proposed heuristics. Chapter One gives a general introduction to the VRP and to the VRPTW, and also presents an overview of the current methods and technologies for both problems. Chapter Two explores the statements and formulations for both problems. Chapter Three gives the detailed introduction to MetaRaPS along with a description of the applications and advantages. Chapter Four lists the overview related to VRP, VRPTW, Meta-RaPS and related memory-based heuristic. Chapters Five and Six present the methodologies of the proposed algorithm for both problems. Specifically Chapter Five focuses on the algorithms for the VRP and Chapter Six emphasizes several modified algorithms for the VRPTW. The proposed algorithms are tested on a set of standard problems ( http://www.crpc.rice.edu/softlib/catalog/tsplib.html for VRP and http://elib.zib.de/pub/Packages/mp-testdata/vehicle - rout/index.html for VRPTW). Results, comparisons and discussions for both types of problems are also listed in both chapters.Chapter Seven gives the conclusions and directs the future work. The results show the advantages of the Meta-RaPS with the effective construction method and improvement method for both types of problems.
A Heuristic Algorithm For The Multi Period Vehicle Routing Problem With Simultaneous Pickup And Delivery Service
DOWNLOAD
Author : Liangyu Xu
language : en
Publisher:
Release Date : 2010
A Heuristic Algorithm For The Multi Period Vehicle Routing Problem With Simultaneous Pickup And Delivery Service written by Liangyu Xu and has been published by this book supported file pdf, txt, epub, kindle and other format this book has been release on 2010 with Heuristic algorithms categories.
Vehicle Routing
DOWNLOAD
Author : Paolo Toth
language : en
Publisher: SIAM
Release Date : 2014-12-05
Vehicle Routing written by Paolo Toth and has been published by SIAM this book supported file pdf, txt, epub, kindle and other format this book has been release on 2014-12-05 with Mathematics categories.
Vehicle routing problems, among the most studied in combinatorial optimization, arise in many practical contexts (freight distribution and collection, transportation, garbage collection, newspaper delivery, etc.). Operations researchers have made significant developments in the algorithms for their solution, and Vehicle Routing: Problems, Methods, and Applications, Second Edition reflects these advances. The text of the new edition is either completely new or significantly revised and provides extensive and complete state-of-the-art coverage of vehicle routing by those who have done most of the innovative research in the area; it emphasizes methodology related to specific classes of vehicle routing problems and, since vehicle routing is used as a benchmark for all new solution techniques, contains a complete overview of current solutions to combinatorial optimization problems. It also includes several chapters on important and emerging applications, such as disaster relief and green vehicle routing.
The Vehicle Routing Problem Latest Advances And New Challenges
DOWNLOAD
Author : Bruce L. Golden
language : en
Publisher: Springer Science & Business Media
Release Date : 2008-07-20
The Vehicle Routing Problem Latest Advances And New Challenges written by Bruce L. Golden and has been published by Springer Science & Business Media this book supported file pdf, txt, epub, kindle and other format this book has been release on 2008-07-20 with Business & Economics categories.
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.
The Single And Multiple Vehicle Pickup And Delivery Problem
DOWNLOAD
Author : Gerald R. Armstrong
language : en
Publisher:
Release Date : 1981
The Single And Multiple Vehicle Pickup And Delivery Problem written by Gerald R. Armstrong and has been published by this book supported file pdf, txt, epub, kindle and other format this book has been release on 1981 with Production scheduling categories.
The pickup and delivery problem (PUDP) represents a class of sequencing or routing problems where the key facet of the routing is that a pickup must precede the corresponding, subsequent delivery. Other considerations such as service time windows, quality of service parameters or operational constraints on either the driver or the vehicle are possible. As such, the PUDP is a constrained version of the ubiquitous travelling salesman problem (TSP), which seeks a minimum cost route that from an initial point visits each city or stop once and only once, ending at the initial stop. There are also similarities between the PUDP and the much studied vehicle routing problem (VRP), although the two problems are distinctly different because of the origin preceding destination requirement.
Constructive And Population Based Heuristics For The Vehicle Routing Problem With Multiple Trips
DOWNLOAD
Author : Russell Jefferson Petch
language : en
Publisher:
Release Date : 2001
Constructive And Population Based Heuristics For The Vehicle Routing Problem With Multiple Trips written by Russell Jefferson Petch and has been published by this book supported file pdf, txt, epub, kindle and other format this book has been release on 2001 with categories.
A Tabu Search Heuristic For The Vehicle Routing Problem With Time Windows
DOWNLOAD
Author : Jean-Yves Potvin
language : en
Publisher: Centre for Research on Transportation = Centre de recherche sur les transports
Release Date : 1993
A Tabu Search Heuristic For The Vehicle Routing Problem With Time Windows written by Jean-Yves Potvin and has been published by Centre for Research on Transportation = Centre de recherche sur les transports this book supported file pdf, txt, epub, kindle and other format this book has been release on 1993 with Production scheduling categories.
This paper describes a tabu search heuristic for the vehicle routing problem with time windows (VRPTW). The tabu search incorporates an exchange heuristic which is specifically designed for problems with time windows. Computational results on the standard set of problems of Solomon are included at the end of the paper.