Download or read book Investigating Heuristic and Meta heuristic Algorithms for Solving Pickup and Delivery Problems written by Manar Ibrahim Hosny and published by . This book was released on 2010 with total page 242 pages. Available in PDF, EPUB and Kindle. Book excerpt:

Download or read book Heuristic Algorithms for Solving the Pickup and Delivery Problem written by Alan Hartwell Bills and published by . This book was released on 1976 with total page 154 pages. Available in PDF, EPUB and Kindle. Book excerpt:

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 Vehicle Routing with Pickup and Delivery written by Manar Hosny and published by LAP Lambert Academic Publishing. This book was released on 2012 with total page 272 pages. Available in PDF, EPUB and Kindle. Book excerpt: Solving the Vehicle Routing Problem (VRP) and its related variants is at the heart of scientific research for optimizing logistics planning. One important variant of the VRP is the Pickup and Delivery Problem (PDP). In the PDP, it is generally required to find one or more minimum cost routes to serve a number of customers, where two types of services may be performed at a customer location, pickup or a delivery. We considered two variants of the PDP, the Pickup and Delivery Problem with Time Windows (PDPTW), and the One-commodity Pickup and Delivery Problem (1-PDP). We investigated heuristic and meta-heuristic approaches for solving the selected PDP variants. Our research focuses on handling the difficult problem constraints in a simple and effective way. Two main aspects of the solution algorithm are directed to achieve this goal, the solution representation and the neighborhood moves. In general, the findings of the research indicate the success of our approach in devising simple and robust solution mechanisms that can be integrated with vehicle routing optimization tools and used in a variety of real world applications.

Download or read book Heuristics and Exact Algorithms for Synchronized Pickup and Delivery Problems written by Imadeddine Aziez and published by . This book was released on 2023 with total page 0 pages. Available in PDF, EPUB and Kindle. Book excerpt: In today's challenging and competitive global business environment, supply chains have become more complex and sensitive due to their dependence on constantly changing customer demands. Creating value for customers does not always refer to the quality or quantity of the product, it also refers to the availability of the product on time at the requested location. Leveraging a supply chain to provide high value to customers cannot be possible without effectively organized transportation. A better delivery service increases the availability of products to fulfill the demand of customers. Therefore, business practitioners consider it a very important factor in creating value for customers. Transportation is one of the key components in the entire supply chain, it has a critical role in maintaining a robust and resilient supply chain. Moreover, an efficient transportation network helps businesses to reduce operating costs, increase service levels, and gain a clear advantage over the competition. This increases research interest focused on transportation operations management. Throughout this research, we are interested in pickup and delivery problems (PDPs) which are a generalization of the classical vehicle routing problem (VRP). In general, the PDPs involve designing minimum-cost routes for a set of vehicles to satisfy all the pickup-delivery requests. Pairing and precedence relations of pickup and delivery locations must be respected. Variants of PDPs are found by adding side constraints such as time windows, vehicle capacity, etc. This class of optimization problems has applications in several real-life contexts, such as door-to-door passenger transportation, urban courier services, maritime shipping and freight transportation. PDPs have been widely addressed in the literature. However, modern delivery networks with more and more complex operations and special characteristics make conventional methods limited and/or inefficient. Hence, developing new innovative solution methods to tackle the new challenges of the transportation industry is crucial. In this research project, we tackle real-life PDPs arising from different contexts, such as last mile delivery and healthcare services. First, we study a new rich PDP in the context of last mile delivery known as the multi-pickup and delivery problem with time windows (MPDPTW). This problem finds many real-life applications, some of them are in the context of shared economy such as UBER EAT services, where a client is allowed to order food from different restaurants; the company must then perform all pickups at different places, before delivering all meals to the client location. We designed a new branch-and-cut algorithm for the MPDPTW providing the first dual bounds for the problem and obtaining tight solutions for large instances. In this work, two new formulations for the problem are introduced, a two-index formulation and the asymmetric representatives formulation (ARF). A transformation of the MPDPTW into a PDPTW is also proposed and tested. The mathematical formulations are then compared to define the best one for the problem. The second problem tackled in this research project is a PDP-related application in the context of healthcare logistics. Transportation activities in hospitals are now becoming more complex due to the wide variety of supplies and equipment used such as disposable items which are being used more frequently. This results in the expansion of the volume of transportation in hospitals. These factors justify the need for more efficiency and productivity of transportation systems in hospitals in order to meet the service level expected by patients without increasing costs. One of the most powerful ways of achieving these goals is the automation of logistics processes by using automated guided vehicles. We study the fleet sizing and routing problem with synchronization of automated guided vehicles with dynamic demands in the context of a real-life application with an industrial partner from the healthcare industry in Quebec City, Canada. We describe the problem, introduce a mathematical formulation for it, and propose a powerful matheuristic to solve it. Computational experiments are conducted on large and small instances generated based on real-data provided by our industrial partner. The third problem studied in this project is another application, this time in the context of ready-mixed concrete (RMC) delivery. Many challenging operational problems are faced by RMC suppliers such as scheduling production operations at production plants, creating daily and weekly drivers' schedules, loading operations scheduling, and delivering concrete to construction sites. In a business environment characterized by a fierce competition, innovative solutions are needed to tackle these problems in order to achieve operational efficiency and guarantee a competitive advantage. Although optimizing concrete delivery operations is essential for concrete companies, drivers' and customers' satisfaction should not be neglected. We study the personnel scheduling problem for RMC delivery in the context of a real-life application with a concrete company in Quebec, Canada. The goal is to help RMC suppliers build cost-effective and consistent (similar starting times over the week) drivers' schedules over a large planning horizon, under tight operational and regulatory constraints. The PSP-RMC embeds a PDP which is solved to create routes for drivers. We describe the problem and propose a two-stage metaheuristic algorithm to solve it. Computational experiments are conducted on artificial instances, and on instances generated based on real-data provided by our industrial partner. This thesis is structured as follows. A literature review on the pickup and delivery problems is presented after an introductory chapter. Chapter 2 is devoted to the multi-pickup and delivery problem with time windows, and Chapter 3 presents the fleet sizing and routing problem with synchronization of automated guided vehicles with dynamic demands. Chapter 4 presents the personnel scheduling problem for ready-mixed concrete delivery. The conclusion follows and summarizes the main contributions of this thesis in the last Chapter.

Download or read book Metaheuristic Optimization via Memory and Evolution written by Cesar Rego and published by Springer Science & Business Media. This book was released on 2006-03-30 with total page 472 pages. Available in PDF, EPUB and Kindle. Book excerpt: Tabu Search (TS) and, more recently, Scatter Search (SS) have proved highly effective in solving a wide range of optimization problems, and have had a variety of applications in industry, science, and government. The goal of Metaheuristic Optimization via Memory and Evolution: Tabu Search and Scatter Search is to report original research on algorithms and applications of tabu search, scatter search or both, as well as variations and extensions having "adaptive memory programming" as a primary focus. Individual chapters identify useful new implementations or new ways to integrate and apply the principles of TS and SS, or that prove new theoretical results, or describe the successful application of these methods to real world problems.

Download or read book Metaheuristics for Vehicle Routing Problems written by Nacima Labadie and published by John Wiley & Sons. This book was released on 2016-02-23 with total page 193 pages. Available in PDF, EPUB and Kindle. Book excerpt: 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.

Download or read book Heuristics for Dynamic Vehicle Routing Problems with Pickups and Deliveries and Time Windows written by Penny Louise Holborn and published by . This book was released on 2013 with total page 466 pages. Available in PDF, EPUB and Kindle. Book excerpt: The work presented in this thesis concerns the problem of dynamic vehicle routing. The motivation for this is the increasing demands on transportation services to deliver fast, efficient and reliable service. Systems are now needed for dispatching transportation requests that arrive dynamically throughout the scheduling horizon. Therefore the focus of this research is the dynamic pickup and delivery problem with time windows, where requests are not completely known in advance but become available during the scheduling horizon. All requests have to be satisfied by a given fleet of vehicles and each request has a pickup and delivery location, along with a time window at which services can take place. To solve the DPDPTW, our algorithm is embedded in a rolling horizon framework, thus allowing the problem to be viewed as a series of static sub-problems. This research begins by considering the static variant of the problem. Both heuristic and metaheuristic methods are applied and an analysis is performed across a range of well-known instances. Results competitive with the state of the art are obtained. For the dynamic problem, investigations are performed to identify how requests arriving dynamically should be incorporated into the solution. Varying degrees of urgency and proportions of dynamic requests have been examined. Further investigations look at improving the solutions over time and identifying appropriate improvement heuristics. Again competitive results are achieved across a range of instances from the literature. This continually increasing area of research covers many real-life problems such as a health courier service. Here, the problem consists of the pickup and delivery of mail, specimens and equipment between hospitals, GP surgeries and health centres. Final research applies our findings to a real-life example of this problem, both for static schedules and a real-time 24/7 service.

Download or read book The Vehicle Routing Problem with Simultaneous Pick up and Deliveries and a GRASP GA Based Solution Heuristic written by Arif Volkan Vural and published by . This book was released on 2007 with total page pages. Available in PDF, EPUB and Kindle. Book excerpt: In this thesis, the vehicle routing problem and one of its variants, the vehicle routing problem with simultaneous pick up and deliveries (VRPSPD) are studied. The traditional vehicle routing problem (VRP) consists of constructing minimum cost routes for the vehicles to follow so that the set of customers are visited only once. A lot of effort has been devoted to research on developing fast and effective solution methods for many different versions of this problem by different majors of engineering profession. Thus, a structuring effort is needed to organize and document the vast literature so far has accumulated in this field. Over its lifespan the VRP literature has become quite disjointed and disparate. Keeping track of its development has become difficult because its subject matter transcends several academic disciplines and professions that range from algorithm design to traffic management. Consequently, this dissertation begins with defining VRP's domain in its entirety, accomplishes an all-encompassing taxonomy for the VRP literature, and delineates all of VRP's facets in a parsimonious and discriminating manner. Sample articles chosen for their disparity are classified to illustrate the descriptive power and parsimony of the taxonomy. Next, a more detailed version of the original problem, the VRPSPD is examined and a more abstract taxonomy is proposed. Additionally, two other existing classification methodologies are used to distinguish all published VRPSPD papers on their respective research strategies and solution methods. By using well-organized methods this study provides a solid multidimensional identification of all VRPSPD studies' attributes thus synthesizing knowledge in the filed. Finally, a hybrid meta-heuristic solution algorithm for the VRPSPD problem is presented. To solve this NP-hard vehicle routing problem a GRASP initiated hybrid genetic algorithm is developed. The algorithm is tested on two sets of benchmark problems from the literature with respect to computational efficiency and solution quality. The effect of starting with a better initial population for the genetic algorithm is further investigated by comparing the current results with previously generated ones. The experimental results indicate that the proposed algorithm produces relatively good quality solutions and a better initial population yields a reduction in processing cycles.

Download or read book Meta Heuristic Algorithms in Supply Chain Logistics and Transportation written by Aidin Delgoshaei and published by Wiley. This book was released on 2021-08-03 with total page 500 pages. Available in PDF, EPUB and Kindle. Book excerpt: This book shows how Meta-heuristic algorithms can be developed by using MATLAB for Supply Chain and Logistics problems. The book begins with an explanation of various problems in the field of supply chain, logistics and transportation. Then, optimization methods that are frequently used for the mentioned problems are explained and some problems are solved using these methods by Lingo and GAMS. The book continues by outlining reasons for using heuristics and metaheuristics for complicated problems in supply chain and logistics. This book helps readers understand each commonly used metaheuristic method, understand its elements quickly, as well as applications of it and how to code using MATLAB. This book will help graduate students as well as researchers understand which metaheuristic method can be used for their applications. This book will also help readers have a clear vision of choosing the appropriate algorithm for their problems by considering different elements like the number of operators, the number of agents, and convergence rate of the algorithm.

Download or read book Computational Intelligence written by Jonathan Garibaldi and published by Springer Nature. This book was released on 2023-11-02 with total page 264 pages. Available in PDF, EPUB and Kindle. Book excerpt: This book includes a set of selected revised and extended versions of the best papers presented at the 13th International Joint Conference on Computational Intelligence (IJCCI 2021) – held as an online event, from October 25 to 27, 2021. We focus on three outstanding fields of Computational Intelligence through the selected panel, namely: Evolutionary Computation, Fuzzy Computation, and Neural Computation. Besides presenting the recent advances of the selected areas, the book aims to aggregate new and innovative solutions for confirmed researchers and on the other hand to provide a source of information and/or inspiration for young interested researchers or learners in the ever-expanding and current field of Computational Intelligence. It constitutes a precious provision of knowledge for individual researchers as well as represent a valuable sustenance for collective use in academic libraries (of universities and engineering schools) relating innovative techniques in various fields of applications.

Download or read book Nonlinear Optimization of Vehicle Safety Structures written by Jesper Christensen and published by Butterworth-Heinemann. This book was released on 2015-12-07 with total page 488 pages. Available in PDF, EPUB and Kindle. Book excerpt: Nonlinear Optimization of Vehicle Safety Structures: Modeling of Structures Subjected to Large Deformations provides a cutting-edge overview of the latest optimization methods for vehicle structural design. The book focuses on large deformation structural optimization algorithms and applications, covering the basic principles of modern day topology optimization and comparing the benefits and flaws of different algorithms in use. The complications of non-linear optimization are highlighted, along with the shortcomings of recently proposed algorithms. Using industry relevant case studies, users will how optimization software can be used to address challenging vehicle safety structure problems and how to explore the limitations of the approaches given. The authors draw on research work with the likes of MIRA, Jaguar Land Rover and Tata Motors European Technology Centre as part of multi-million pound European funded research projects, emphasizing the industry applications of recent advances. The book is intended for crash engineers, restraints system engineers and vehicle dynamics engineers, as well as other mechanical, automotive and aerospace engineers, researchers and students with a structural focus. - Focuses on non-linear, large deformation structural optimization problems relating to vehicle safety - Discusses the limitations of different algorithms in use and offers guidance on best practice approaches through the use of relevant case studies - Author's present research from the cutting-edge of the industry, including research from leading European automotive companies and organizations - Uses industry relevant case studies, allowing users to understand how optimization software can be used to address challenging vehicle safety structure problems and how to explore the limitations of the approaches given

Download or read book Metaheuristics written by El-Ghazali Talbi and published by John Wiley & Sons. This book was released on 2009-05-27 with total page 625 pages. Available in PDF, EPUB and Kindle. Book excerpt: A unified view of metaheuristics This book provides a complete background on metaheuristics and shows readers how to design and implement efficient algorithms to solve complex optimization problems across a diverse range of applications, from networking and bioinformatics to engineering design, routing, and scheduling. It presents the main design questions for all families of metaheuristics and clearly illustrates how to implement the algorithms under a software framework to reuse both the design and code. Throughout the book, the key search components of metaheuristics are considered as a toolbox for: Designing efficient metaheuristics (e.g. local search, tabu search, simulated annealing, evolutionary algorithms, particle swarm optimization, scatter search, ant colonies, bee colonies, artificial immune systems) for optimization problems Designing efficient metaheuristics for multi-objective optimization problems Designing hybrid, parallel, and distributed metaheuristics Implementing metaheuristics on sequential and parallel machines Using many case studies and treating design and implementation independently, this book gives readers the skills necessary to solve large-scale optimization problems quickly and efficiently. It is a valuable reference for practicing engineers and researchers from diverse areas dealing with optimization or machine learning; and graduate students in computer science, operations research, control, engineering, business and management, and applied mathematics.

Download or read book Metaheuristics in Water Geotechnical and Transport Engineering written by Xin-She Yang and published by Newnes. This book was released on 2012-09 with total page 503 pages. Available in PDF, EPUB and Kindle. Book excerpt: Due to an ever-decreasing supply in raw materials and stringent constraints on conventional energy sources, demand for lightweight, efficient and low cost structures has become crucially important in modern engineering design. This requires engineers to search for optimal and robust design options to address design problems that are often large in scale and highly nonlinear, making finding solutions challenging. In the past two decades, metaheuristic algorithms have shown promising power, efficiency and versatility in solving these difficult optimization problems. This book examines the latest developments of metaheuristics and their applications in water, geotechnical and transport engineering offering practical case studies as examples to demonstrate real world applications. Topics cover a range of areas within engineering, including reviews of optimization algorithms, artificial intelligence, cuckoo search, genetic programming, neural networks, multivariate adaptive regression, swarm intelligence, genetic algorithms, ant colony optimization, evolutionary multiobjective optimization with diverse applications in engineering such as behavior of materials, geotechnical design, flood control, water distribution and signal networks. This book can serve as a supplementary text for design courses and computation in engineering as well as a reference for researchers and engineers in metaheursitics, optimization in civil engineering and computational intelligence. Provides detailed descriptions of all major metaheuristic algorithms with a focus on practical implementation Develops new hybrid and advanced methods suitable for civil engineering problems at all levels Appropriate for researchers and advanced students to help to develop their work

Download or read book Meta heuristic Solution Methods for Rich Vehicle Routing Problems written by Khanh Phuong Nguyen and published by . This book was released on 2014 with total page pages. Available in PDF, EPUB and Kindle. Book excerpt:

Download or read book Hybrid Metaheuristics written by Maria J. Blesa and published by Springer. This book was released on 2016-06-01 with total page 235 pages. Available in PDF, EPUB and Kindle. Book excerpt: This book constitutes the refereed proceedings of the 10th International Workshop on Hybrid Metaheuristics, HM 2016, held in Plymouth, UK, in June 2016. The 15 revised full papers presented were carefully reviewed and selected from 43 submissions. The selected papers are of interest for all the researchers working on integrating metaheuristics with other areas for solving both optimization and constraint satisfaction problems. They represent as well a sample of current research demonstrating how metaheuristics can be integrated with integer linear programming and other operational research techniques for tackling difficult and relevant problems.

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.