Neutrosophic Genetic Algorithm For Solving The Vehicle Routing Problem With Uncertain Travel Times

Download Neutrosophic Genetic Algorithm For Solving The Vehicle Routing Problem With Uncertain Travel Times full books in PDF, epub, and Kindle. Read online Neutrosophic Genetic Algorithm For Solving The Vehicle Routing Problem With Uncertain Travel Times ebook anywhere anytime directly on your device. Fast Download speed and no annoying ads. We cannot guarantee that every ebooks is available!

Neutrosophic Genetic Algorithm for solving the Vehicle Routing Problem with uncertain travel times

Author : Rafael Rojas-Gualdron
Publisher : Infinite Study
ISBN 13 :
Total Pages : 10 pages
Book Rating : 4./5 ( download)

DOWNLOAD NOW!

Book Synopsis Neutrosophic Genetic Algorithm for solving the Vehicle Routing Problem with uncertain travel times by : Rafael Rojas-Gualdron

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.

Neutrosophic Sets and Systems, vol. 52/2022

Author : Florentin Smarandache
Publisher : Infinite Study
ISBN 13 :
Total Pages : 420 pages
Book Rating : 4./5 ( download)

DOWNLOAD NOW!

Book Synopsis Neutrosophic Sets and Systems, vol. 52/2022 by : Florentin Smarandache

Download or read book Neutrosophic Sets and Systems, vol. 52/2022 written by Florentin Smarandache and published by Infinite Study. This book was released on 2022-11-01 with total page 420 pages. Available in PDF, EPUB and Kindle. Book excerpt: “Neutrosophic Sets and Systems” has been created for publications on advanced studies in neutrosophy, neutrosophic set, neutrosophic logic, neutrosophic probability, neutrosophic statistics that started in 1995 and their applications in any field, such as the neutrosophic structures developed in algebra, geometry, topology, etc. Neutrosophy is a new branch of philosophy that studies the origin, nature, and scope of neutralities, as well as their interactions with different ideational spectra. This theory considers every notion or idea together with its opposite or negation and with their spectrum of neutralities in between them (i.e. notions or ideas supporting neither nor ). The and ideas together are referred to as . Neutrosophy is a generalization of Hegel's dialectics (the last one is based on and only). According to this theory every idea tends to be neutralized and balanced by and ideas - as a state of equilibrium. In a classical way , , are disjoint two by two. But, since in many cases the borders between notions are vague, imprecise, Sorites, it is possible that , , (and of course) have common parts two by two, or even all three of them as well. Neutrosophic Set and Neutrosophic Logic are generalizations of the fuzzy set and respectively fuzzy logic (especially of intuitionistic fuzzy set and respectively intuitionistic fuzzy logic).

A Genetic Algorithm for the Vehicle Routing Problem with Time-dependent Travel Times

Author : Soojung Jung
Publisher :
ISBN 13 :
Total Pages : 420 pages
Book Rating : 4.:/5 (79 download)

DOWNLOAD NOW!

Book Synopsis A Genetic Algorithm for the Vehicle Routing Problem with Time-dependent Travel Times by : Soojung Jung

Download or read book A Genetic Algorithm for the Vehicle Routing Problem with Time-dependent Travel Times written by Soojung Jung and published by . This book was released on 2000 with total page 420 pages. Available in PDF, EPUB and Kindle. Book excerpt:

Vehicle Routing

Author : Paolo Toth
Publisher : SIAM
ISBN 13 : 1611973597
Total Pages : 467 pages
Book Rating : 4.6/5 (119 download)

DOWNLOAD NOW!

Book Synopsis Vehicle Routing by : Paolo Toth

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.

Optimization Methods for the Robust Vehicle Routing Problem

Author : Elyn Lizeth Solano Charris
Publisher :
ISBN 13 :
Total Pages : 0 pages
Book Rating : 4.:/5 (949 download)

DOWNLOAD NOW!

Book Synopsis Optimization Methods for the Robust Vehicle Routing Problem by : Elyn Lizeth Solano Charris

Download or read book Optimization Methods for the Robust Vehicle Routing Problem written by Elyn Lizeth Solano Charris and published by . This book was released on 2015 with total page 0 pages. Available in PDF, EPUB and Kindle. Book excerpt: This work extends the Vehicle Routing Problem (VRP) for addressing uncertainties via robust optimization, giving the Robust VRP (RVRP). First, uncertainties are handled on travel times/costs. Then, a bi-objective version (bi-RVRP) is introduced to handle uncertainty in both, travel times and demands. For solving the RVRP and the bi-RVRP different models and methods are proposed to determine robust solutions minimizing the worst case. A Mixed Integer Linear Program (MILP), several greedy heuristics, a Genetic Algorithm (GA), a local search procedure and four local search based algorithms are proposed: a Greedy Randomized Adaptive Search Procedure (GRASP), an Iterated Local Search (ILS), a Multi-Start ILS (MS-ILS), and a MS-ILS based on Giant Tours (MS-ILS-GT) converted into feasible routes via a lexicographic splitting procedure. Concerning the bi-RVRP, the total cost of traversed arcs and the total unmet demand are minimized over all scenarios. To solve the problem, different variations of multiobjective evolutionary metaheuristics are proposed and coupled with a local search procedure: the Multiobjective Evolutionary Algorithm (MOEA) and the Non-dominated Sorting Genetic Algorithm version 2 (NSGAII). Different metrics are used to measure the efficiency, the convergence as well as the diversity of solutions for all these algorithms.

Bio-inspired Algorithms for the Vehicle Routing Problem

Author : Francisco Baptista Pereira
Publisher : Springer
ISBN 13 : 3540851526
Total Pages : 224 pages
Book Rating : 4.5/5 (48 download)

DOWNLOAD NOW!

Book Synopsis Bio-inspired Algorithms for the Vehicle Routing Problem by : Francisco Baptista Pereira

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.

Using Genetic Algorithm In Solving Capacitated Vehicle Routing Problem

Author : Mazin Abed Mohammed
Publisher : LAP Lambert Academic Publishing
ISBN 13 : 9783659749636
Total Pages : 104 pages
Book Rating : 4.7/5 (496 download)

DOWNLOAD NOW!

Book Synopsis Using Genetic Algorithm In Solving Capacitated Vehicle Routing Problem by : Mazin Abed Mohammed

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.

Solving the Vehicle Routing Problem Using a Genetic Algorithm

Author : Uri Savoray
Publisher :
ISBN 13 :
Total Pages : 56 pages
Book Rating : 4.:/5 (87 download)

DOWNLOAD NOW!

Book Synopsis Solving the Vehicle Routing Problem Using a Genetic Algorithm by : Uri Savoray

Download or read book Solving the Vehicle Routing Problem Using a Genetic Algorithm written by Uri Savoray and published by . This book was released on 1994 with total page 56 pages. Available in PDF, EPUB and Kindle. Book excerpt:

A Genetic Algorithm for the Vehicle Routing Problem with Time Windows

Author : Lin Cheng
Publisher :
ISBN 13 :
Total Pages : 54 pages
Book Rating : 4.:/5 (68 download)

DOWNLOAD NOW!

Book Synopsis A Genetic Algorithm for the Vehicle Routing Problem with Time Windows by : Lin Cheng

Download or read book A Genetic Algorithm for the Vehicle Routing Problem with Time Windows written by Lin Cheng and published by . This book was released on 2005 with total page 54 pages. Available in PDF, EPUB and Kindle. Book excerpt:

A Genetic Algorithm for the Vehicle Routing Problem with Heterogeneous Vehicles from Multiple Depots, Allowing Multiple Visits

Author : Hyunpae Lim
Publisher :
ISBN 13 :
Total Pages : 158 pages
Book Rating : 4.:/5 (166 download)

DOWNLOAD NOW!

Book Synopsis A Genetic Algorithm for the Vehicle Routing Problem with Heterogeneous Vehicles from Multiple Depots, Allowing Multiple Visits by : Hyunpae Lim

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.

Localized Genetic Algorithm for the Vehicle Routing Problem

Author : Ziauddin Ursani
Publisher : LAP Lambert Academic Publishing
ISBN 13 : 9783838368078
Total Pages : 328 pages
Book Rating : 4.3/5 (68 download)

DOWNLOAD NOW!

Book Synopsis Localized Genetic Algorithm for the Vehicle Routing Problem by : Ziauddin Ursani

Download or read book Localized Genetic Algorithm for the Vehicle Routing Problem written by Ziauddin Ursani and published by LAP Lambert Academic Publishing. This book was released on 2010-05 with total page 328 pages. Available in PDF, EPUB and Kindle. Book excerpt: This thesis identifies some problems, the genetic algorithm (GA) is facing in the area of vehicle routing and proposes various methods to address those problems. Those problems arise from the unavailability of suitable chromosomal representation and evaluation schemes of GA for the Vehicle Routing Problem (VRP). The representation and evaluation schemes already in use have problems of high computational cost, illegal chromosomes (chromosomes not representing a legal tour) and wrong fitness assignment (fitness not truly representing chromosome genetic makeup). These problems are addressed by several proposed new schemes, namely the Self Imposed Constraints Evaluation scheme, the Contour and Reverse Contour Evaluation schemes and the Order Skipping Evaluation scheme, which are specifically tailored for various objectives, problems and situations. Apart from this, a methodology, which has previously being used in other meta-heuristics, is incorporated into GA i.e., the independent application of GA on various sub-localities of the problem. We call this GA, a Localized Genetic Algorithm (LGA). LGA is an iterative procedure between optimization and controlled de-optimization. The procedure of controlled de-optimization is also novel. It brings the solution into a new search space while controlling its cost effectively. LGA is introduced with various search techniques, i.e. intensive, extensive and selective, the use of which depends on the problem size and the availability of computational resources. Furthermore, search reduction techniques (Fitness Approximation Methods) are also introduced into the LGA, which has enabled the LGA to be applied to large scale problems. Due to the implementation of those proposals, LGA is the first GA-driven approach to be applied to very large scale CVRP problems of up to 1200 customers, i.e. datasets presented by Feiyue in 2005 and large scale VRPTW problems of up to 1000 customers, datasets presented by Gehring and Homberger in 1999. Lastly, a standard unit for computational comparison, i.e., Bellman's Evaluation Units BEUs, is also introduced to facilitate computational comparisons for future researchers. LGA has shown promising results on CVRP and VRPTW problems. It is flexible and also has the potential to be extended to not only other vehicle routing problems, but also to other ordering problems.

A Genetic Algorithm for the Vehicle Routing Problem

Author : Vickie Dawn Wester
Publisher :
ISBN 13 :
Total Pages : 184 pages
Book Rating : 4.:/5 (34 download)

DOWNLOAD NOW!

Book Synopsis A Genetic Algorithm for the Vehicle Routing Problem by : Vickie Dawn Wester

Download or read book A Genetic Algorithm for the Vehicle Routing Problem written by Vickie Dawn Wester and published by . This book was released on 1993 with total page 184 pages. Available in PDF, EPUB and Kindle. Book excerpt:

Compact formulations for the robust vehicle routing problem with time windows under demand and travel time uncertainty

Author : Rafael Campos
Publisher :
ISBN 13 :
Total Pages : 0 pages
Book Rating : 4.:/5 (135 download)

DOWNLOAD NOW!

Book Synopsis Compact formulations for the robust vehicle routing problem with time windows under demand and travel time uncertainty by : Rafael Campos

Download or read book Compact formulations for the robust vehicle routing problem with time windows under demand and travel time uncertainty written by Rafael Campos and published by . This book was released on 2022 with total page 0 pages. Available in PDF, EPUB and Kindle. Book excerpt: We provide new compact formulations for the robust vehicle routing problem with time windows (RVRPTW) under cardinality- and knapsack-constrained demand and travel time uncertainty. Particularly, we propose the first compact model that addresses the RVRPTW under travel time uncertainty considering the knapsack uncertainty set. Our models use different types of constraints to control time propagation based on the well-known Miller-Tucker-Zemlin and single commodity flow constraints. The latter has not been explored even for the deterministic variant of the problem, so we first state them explicitly. We also design tailored branch-and-cut algorithms based on the proposed formulations, which rely on a dynamic programming algorithm to verify if a solution is robust feasible with respect to demand and time, and use specific as well as standard separation methods found in the literature.

Solving Vehicle Routing Problem Using Hybrid of Genetic Algorithm and Ant Colony Optimization

Author : Puunithaaraj Gopal
Publisher :
ISBN 13 :
Total Pages : 62 pages
Book Rating : 4.:/5 (96 download)

DOWNLOAD NOW!

Book Synopsis Solving Vehicle Routing Problem Using Hybrid of Genetic Algorithm and Ant Colony Optimization by : Puunithaaraj Gopal

Download or read book Solving Vehicle Routing Problem Using Hybrid of Genetic Algorithm and Ant Colony Optimization written by Puunithaaraj Gopal and published by . This book was released on 2013 with total page 62 pages. Available in PDF, EPUB and Kindle. Book excerpt:

The Vehicle Routing Problem: Latest Advances and New Challenges

Author : Bruce L. Golden
Publisher : Springer
ISBN 13 : 9781441946034
Total Pages : 0 pages
Book Rating : 4.9/5 (46 download)

DOWNLOAD NOW!

Book Synopsis The Vehicle Routing Problem: Latest Advances and New Challenges by : Bruce L. Golden

Download or read book The Vehicle Routing Problem: Latest Advances and New Challenges written by Bruce L. Golden and published by Springer. This book was released on 2010-11-25 with total page 0 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.

2020 21st International Arab Conference on Information Technology (ACIT)

Author : IEEE Staff
Publisher :
ISBN 13 : 9781728188560
Total Pages : pages
Book Rating : 4.1/5 (885 download)

DOWNLOAD NOW!

Book Synopsis 2020 21st International Arab Conference on Information Technology (ACIT) by : IEEE Staff

Download or read book 2020 21st International Arab Conference on Information Technology (ACIT) written by IEEE Staff and published by . This book was released on 2020-11-28 with total page pages. Available in PDF, EPUB and Kindle. Book excerpt: The International Arab Conference on Information Technology (ACIT 2020) is a forum for scientists, engineers, and practitioners to present their latest research, results, ideas, developments, and applications in all areas of information technology ACIT 2020 will include presentations to contributed papers and state of the art lectures by invited keynote speakers Tutorials on current issues and special sessions on new trends related to information technology and software industry could be organized This conference is considered as the official scientific conference for the Colleges of Computer and Information Society, stemming from the Association of Arab Universities

Logistics 4.0

Author : Turan Paksoy
Publisher : CRC Press
ISBN 13 : 1000245101
Total Pages : 369 pages
Book Rating : 4.0/5 (2 download)

DOWNLOAD NOW!

Book Synopsis Logistics 4.0 by : Turan Paksoy

Download or read book Logistics 4.0 written by Turan Paksoy and published by CRC Press. This book was released on 2020-12-17 with total page 369 pages. Available in PDF, EPUB and Kindle. Book excerpt: Industrial revolutions have impacted both, manufacturing and service. From the steam engine to digital automated production, the industrial revolutions have conduced significant changes in operations and supply chain management (SCM) processes. Swift changes in manufacturing and service systems have led to phenomenal improvements in productivity. The fast-paced environment brings new challenges and opportunities for the companies that are associated with the adaptation to the new concepts such as Internet of Things (IoT) and Cyber Physical Systems, artificial intelligence (AI), robotics, cyber security, data analytics, block chain and cloud technology. These emerging technologies facilitated and expedited the birth of Logistics 4.0. Industrial Revolution 4.0 initiatives in SCM has attracted stakeholders’ attentions due to it is ability to empower using a set of technologies together that helps to execute more efficient production and distribution systems. This initiative has been called Logistics 4.0 of the fourth Industrial Revolution in SCM due to its high potential. Connecting entities, machines, physical items and enterprise resources to each other by using sensors, devices and the internet along the supply chains are the main attributes of Logistics 4.0. IoT enables customers to make more suitable and valuable decisions due to the data-driven structure of the Industry 4.0 paradigm. Besides that, the system’s ability of gathering and analyzing information about the environment at any given time and adapting itself to the rapid changes add significant value to the SCM processes. In this peer-reviewed book, experts from all over the world, in the field present a conceptual framework for Logistics 4.0 and provide examples for usage of Industry 4.0 tools in SCM. This book is a work that will be beneficial for both practitioners and students and academicians, as it covers the theoretical framework, on the one hand, and includes examples of practice and real world.