Download or read book A Genetic Algorithm for the Vehicle Routing Problem with Heterogeneous Vehicles from Multiple Depots Allowing Multiple Visits written by Hyunpae Lim and published by . This book was released on 2008 with total page 158 pages. Available in PDF, EPUB and Kindle. Book excerpt: In the thesis, an application of a genetic algorithm (GA) is considered to solve the vehicle routing problem (VRP) which involves heterogeneous vehicles to serve known customer demands from multiple depots achieving the minimum delivery cost, where each customer must be satisfied by one or more visit(s), and each vehicle must make at most one visit to any particular customer. Vehicles can be unused. The problem involves optimizing the routes for all vehicles which are to serve a certain number of customers from multiple depots, allowing multiple visits. These conditions are generalized from the classical VRPs, which only involve one depot and one visit to each customer. The VRP is one of combinatorial optimization problems which are difficult to obtain an optimal solution through the classical optimization methods owing to the high computational complexity. The GA is a randomized global search algorithm to solve problems by imitating processes observed during natural evolution. It has been a widespread application to various combinatorial optimization problems such as traveling salesman problem, scheduling problem and VRP. The performance of GA is subject to the process parameters such as population size, crossover rate, termination condition, and mutation policy. For the generalized VRP under considerations, the influences of the process parameters in the proposed GA are examined by Taguchi method which is known as a robust design tool for optimizing the process parameters. The proposed GA is the first effort to solve the generalized VRP, which allows the multiple depots, multiple visits and heterogeneous vehicles. A real-life example problem of 35 US cities and 3 depots has been proposed to measure the performance of the proposed GA. In addition, 4 benchmark problems from the prior works only allowing one depot, one visit and homogeneous vehicles has been tested. The proposed GA outperforms the prior works by generating the equal to or the better solutions than the best known solutions. The computational results obtained from the performance comparisons show that the proposed GA is an effective and feasible method for solving the VRP with heterogeneous vehicles from multiple depots, allowing multiple visits to customers.

Download or read book Algorithms for Multiple Vehicle Routing Problems written by Jung Yun Bae and published by . This book was released on 2015 with total page pages. Available in PDF, EPUB and Kindle. Book excerpt: Surveillance and monitoring applications require a collection of heterogeneous vehicles to visit a set of targets. This dissertation considers three fundamental routing problems involving multiple vehicles that arise in these applications. The main objective of this dissertation is to develop novel approximation algorithms for these routing problems that find feasible solutions and also provide a bound on the quality of the solutions produced by the algorithms. The first routing problem considered is a multiple depot, multiple terminal, Hamiltonian Path problem. Given multiple vehicles starting at distinct depots, a set of targets and terminal locations, the objective of this problem is to find a vertex-disjoint path for each vehicle such that each target is visited once by a vehicle, the paths end at the terminals and the sum of the distances travelled by the vehicles is a minimum. A 2-approximation algorithm is presented for this routing problem when the costs are symmetric and satisfy the triangle inequality. For the case where all the vehicles start from the same depot, a 5/3-approximation algorithm is developed. The second routing problem addressed in this dissertation is a multiple depot, heterogeneous traveling salesman problem. The objective of this problem is to find a tour for each vehicle such that each of the targets is visited at least once by a vehicle and the sum of the distances travelled by the vehicles is minimized. A primal-dual algorithm with an approximation ratio of 2 is presented for this problem when the vehicles involved are ground vehicles that can move forwards and backwards with a constraint on their minimum turning radius. Finally, this dissertation addresses a multiple depot heterogeneous traveling salesman problem when the travel costs are asymmetric and satisfy the triangle inequality. An approximation algorithm and a heuristic is developed for this problem with simulation results that corroborate the performance of the proposed algorithms. All the main algorithms presented in the dissertation advance the state of art in the area of approximation algorithms for multiple vehicle routing problems. This dissertation has its value for providing approximation algorithms for the routing problems that involves multiple vehicles with additional constraints. Some algorithms have constant approximation factor, which is very useful in the application but difficult to find. In addition to the approximation algorithms, some heuristic algorithms were also proposed to improve solution qualities or computation time. The electronic version of this dissertation is accessible from http://hdl.handle.net/1969.1/152661

Download or read book Bio inspired Algorithms for the Vehicle Routing Problem written by Francisco Baptista Pereira and published by Springer. This book was released on 2008-09-10 with total page 224 pages. Available in PDF, EPUB and Kindle. Book excerpt: 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.

Download or read book Vehicle Routing written by Paolo Toth and published by SIAM. This book was released on 2014-12-05 with total page 467 pages. Available in PDF, EPUB and Kindle. Book excerpt: 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.

Download or read book Bio inspired Computing Theories and Applications written by Linqiang Pan and published by Springer Nature. This book was released on 2020-04-01 with total page 737 pages. Available in PDF, EPUB and Kindle. Book excerpt: This two-volume set (CCIS 1159 and CCIS 1160) constitutes the proceedings of the 14th International Conference on Bio-inspired Computing: Theories and Applications, BIC-TA 2019, held in Zhengzhou, China, in November 2019. The 122 full papers presented in both volumes were selected from 197 submissions. The papers in the two volumes are organized according to the topical headings: evolutionary computation and swarm intelligence; ​bioinformatics and systems biology; complex networks; DNA and molecular computing; neural networks and articial intelligence.

Download or read book Research Anthology on Multi Industry Uses of Genetic Programming and Algorithms written by Management Association, Information Resources and published by IGI Global. This book was released on 2020-12-05 with total page 1534 pages. Available in PDF, EPUB and Kindle. Book excerpt: Genetic programming is a new and evolutionary method that has become a novel area of research within artificial intelligence known for automatically generating high-quality solutions to optimization and search problems. This automatic aspect of the algorithms and the mimicking of natural selection and genetics makes genetic programming an intelligent component of problem solving that is highly regarded for its efficiency and vast capabilities. With the ability to be modified and adapted, easily distributed, and effective in large-scale/wide variety of problems, genetic algorithms and programming can be utilized in many diverse industries. This multi-industry uses vary from finance and economics to business and management all the way to healthcare and the sciences. The use of genetic programming and algorithms goes beyond human capabilities, enhancing the business and processes of various essential industries and improving functionality along the way. The Research Anthology on Multi-Industry Uses of Genetic Programming and Algorithms covers the implementation, tools and technologies, and impact on society that genetic programming and algorithms have had throughout multiple industries. By taking a multi-industry approach, this book covers the fundamentals of genetic programming through its technological benefits and challenges along with the latest advancements and future outlooks for computer science. This book is ideal for academicians, biological engineers, computer programmers, scientists, researchers, and upper-level students seeking the latest research on genetic programming.

Download or read book The Vehicle Routing Problem written by Paolo Toth and published by . This book was released on 2002 with total page 367 pages. Available in PDF, EPUB and Kindle. Book excerpt:

Download or read book An Adaptation of Metaheuristics for the Single and the Multiple Depots Heterogeneous Fleet Vehicle Routing Problems written by Arif Imran and published by . This book was released on 2008 with total page pages. Available in PDF, EPUB and Kindle. Book excerpt:

Download or read book The Vehicle Routing Problem Latest Advances and New Challenges written by Bruce L. Golden and published by Springer Science & Business Media. This book was released on 2008-07-20 with total page 584 pages. Available in PDF, EPUB and Kindle. Book excerpt: 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.

Download or read book Using Age Layered Population Structure for the Multi Depot Vehicle Routing Problem written by Audrey Opoku-Amankwaah and published by . This book was released on 2016 with total page pages. Available in PDF, EPUB and Kindle. Book excerpt: This thesis studies the NP-hard multi-depot vehicle routing problem (MDVRP) which is an extension of the classical VRP with the exception that vehicles based at one of several depots should service every customer assigned to that depot. Finding the optimal solution to MDVRP is computationally intractable for practical sized problem sets, and various meta-heuristics including genetic algorithms have been proposed in the literature. In this work, an e fficient multi-population genetic algorithm based on age layered population structures for the MDVRP is proposed. Three inter-layer transfer strategies are proposed and multi-objective fi tness evaluation is compared with weighted sum approach. An empirical study comparing the proposed approach with existing genetic algorithms and other meta-heuristics is carried out using well known benchmark data. The performance found in terms of solution quality is very promising.

Download or read book Using Genetic Algorithm In Solving Capacitated Vehicle Routing Problem written by Mazin Abed Mohammed and published by LAP Lambert Academic Publishing. This book was released on 2015-08-12 with total page 104 pages. Available in PDF, EPUB and Kindle. Book excerpt: The problem of vehicle routing is one of the many problems that have no perfect solutions yet. Many researchers over the last few decades have established numerous researches and used many methods with different techniques to handle it. But, for all researches, finding the lowest cost is very complex. However, they have managed to come up with approximate solutions that differ in efficiencies depending on the search space. This Book attempts to find the shortest route for vehicle routing problem to help UNITEN reduce student's transportation costs. Genetic Algorithm is used to solve this problem as it is capable of solving many complex problems. The Capacitated Vehicle Routing Problem (CVRP) model is implemented for optimizing UNITEN's shuttle bus services. The algorithms have been adapted to solve the research problem, where its procedure is different than the common algorithm. The structure of the algorithm is designed so that the program does not require a large database to store the population, which speeds up the implementation of the program execution to obtain the solution.

Download or read book Genetic Algorithms and Engineering Design written by Mitsuo Gen and published by John Wiley & Sons. This book was released on 1997-01-21 with total page 436 pages. Available in PDF, EPUB and Kindle. Book excerpt: The last few years have seen important advances in the use ofgenetic algorithms to address challenging optimization problems inindustrial engineering. Genetic Algorithms and Engineering Designis the only book to cover the most recent technologies and theirapplication to manufacturing, presenting a comprehensive and fullyup-to-date treatment of genetic algorithms in industrialengineering and operations research. Beginning with a tutorial on genetic algorithm fundamentals andtheir use in solving constrained and combinatorial optimizationproblems, the book applies these techniques to problems in specificareas--sequencing, scheduling and production plans, transportationand vehicle routing, facility layout, location-allocation, andmore. Each topic features a clearly written problem description,mathematical model, and summary of conventional heuristicalgorithms. All algorithms are explained in intuitive, rather thanhighly-technical, language and are reinforced with illustrativefigures and numerical examples. Written by two internationally acknowledged experts in the field,Genetic Algorithms and Engineering Design features originalmaterial on the foundation and application of genetic algorithms,and also standardizes the terms and symbols used in othersources--making this complex subject truly accessible to thebeginner as well as to the more advanced reader. Ideal for both self-study and classroom use, this self-containedreference provides indispensable state-of-the-art guidance toprofessionals and students working in industrial engineering,management science, operations research, computer science, andartificial intelligence. The only comprehensive, state-of-the-arttreatment available on the use of genetic algorithms in industrialengineering and operations research . . . Written by internationally recognized experts in the field ofgenetic algorithms and artificial intelligence, Genetic Algorithmsand Engineering Design provides total coverage of currenttechnologies and their application to manufacturing systems.Incorporating original material on the foundation and applicationof genetic algorithms, this unique resource also standardizes theterms and symbols used in other sources--making this complexsubject truly accessible to students as well as experiencedprofessionals. Designed for clarity and ease of use, thisself-contained reference: * Provides a comprehensive survey of selection strategies, penaltytechniques, and genetic operators used for constrained andcombinatorial optimization problems * Shows how to use genetic algorithms to make production schedules,solve facility/location problems, make transportation/vehiclerouting plans, enhance system reliability, and much more * Contains detailed numerical examples, plus more than 160auxiliary figures to make solution procedures transparent andunderstandable

Download or read book Neutrosophic Genetic Algorithm for solving the Vehicle Routing Problem with uncertain travel times written by Rafael Rojas-Gualdron and published by Infinite Study. This book was released on 2022-12-01 with total page 10 pages. Available in PDF, EPUB and Kindle. Book excerpt: The Vehicle Routing Problem (VRP) has been extensively studied by different researchers from all over the world in recent years. Multiple solutions have been proposed for different variations of the problem, such as Capacitive Vehicle Routing Problem (CVRP), Vehicle Routing Problem with Time Windows (VRP-TW), Vehicle Routing Problem with Pickup and Delivery (VRPPD), among others, all of them with deterministic times. In the last years, researchers have been interested in including in their different models the variations that travel times may experience when exposed to all kind of phenomena, mainly vehicle traffic. This article addresses the VRP from this perspective, proposing the design and implementation of a genetic algorithm based on neutrosophic theory for calculating the fitness function of each route, considering the variability and uncertainty present in travel times. A deterministic genetic algorithm is also implemented with the average travel times to compare it with the neutrosophic algorithm using simulation. As conclusion, a deterministic algorithm does not necessarily generate the best solution in the real world, full of uncertainty. Also, the quantification of uncertainty using neutrosophic theory can be used in route planning, opening a broad and interesting field of research for future investigations.

Download or read book A Genetic Algorithm Applied to Multiple Objective Vehicle Routing Problem written by Martin Geiger and published by . This book was released on 2001 with total page 28 pages. Available in PDF, EPUB and Kindle. Book excerpt:

Download or read book A Hybrid Genetic Algorithm for Multi depot and Periodic Vehicle Routing Problems written by and published by . This book was released on 2010 with total page 0 pages. Available in PDF, EPUB and Kindle. Book excerpt:

Download or read book Advances in Dynamic Games written by David M. Ramsey and published by Springer Nature. This book was released on 2020-11-09 with total page 351 pages. Available in PDF, EPUB and Kindle. Book excerpt: This contributed volume collects talks originally given at the 18th International Symposium on Dynamic Games and Applications, held in Grenoble, France from July 9-12, 2018. Chapters present state-of-the-art research in the field of dynamic games and are written by leading experts in this active area. Featuring a broad overview of recent advances as well as a wide range of applications, this book is organized into four sections: games of conflict, evolutionary games, economic games, and games involving common interest. Within these sections, specific topics covered include: Pursuit-evasion games Partnership formation games Replicator dynamics Load balancing congestion games Equilibrium coalition structures Advances in Dynamic Games will be of particular interest to researchers and doctoral students studying game theory.

Download or read book Smart Delivery Systems written by Jakub Nalepa and published by . This book was released on 2019-11 with total page 290 pages. Available in PDF, EPUB and Kindle. Book excerpt: Smart Delivery Systems: Solving Complex Vehicle Routing Problems examines both exact and approximate methods for delivering optimal solutions to rich vehicle routing problems, showing both the advantages and disadvantages of each approach. It shows how to apply machine learning and advanced data analysis techniques to improve routing systems, familiarizing readers with the concepts and technologies used in successfully implemented delivery systems. The book explains both the latest theoretical and practical advances in intelligent delivery and scheduling systems and presents practical applications for designing new algorithms for real-life scenarios. Emphasizes both sequential and parallel algorithms Uniquely combines methods and algorithms, real-life applications, and parallel computing Includes recommendations on how to choose between different methods for solving applications Provides learning aids, end of chapter references, bibliography, worked examples and exercises