Download or read book A Multicommodity Simultaneous Split Pickup and Split Delivery Vehicle Routing Problem with Demand Allocation written by Ziqiang Zhu and published by . This book was released on 2023 with total page 0 pages. Available in PDF, EPUB and Kindle. Book excerpt: Abstract: This paper introduces a new vehicle routing problem (VRP) variant, the multicommodity, simultaneous split pickup and split delivery vehicle routing problem with demand allocation (MCSVRPSPD-DA). The MCSVRPSPD-DA is motivated by a real-life urban-rural two-way distribution application, where the assignment of rural customers to pickup and delivery sites (PDS), the amount of each commodity to be picked up and delivered, and the routing of vehicles operated from a depot to serve rural customers at their designated sites and urban customers are jointly determined. The MCSVRPSPD-DA is formulated as an integer programming model, whose objective function is to minimize the total travel cost of vehicles and rural customers. As the routing and demand allocation decisions influence each other, this NP-hard problem poses substantial computational challenges. Therefore, a hybrid metaheuristic algorithm based on Tabu search and adaptive large neighborhood search (ALNS), denoted by T-ALNS, is proposed, where a special cooperation framework is introduced. An extensive experimental analysis shows the proposed T-ALNS substantially and consistently outperforms the optimization solver, Gurobi, and two existing heuristic algorithms for the small, medium, and large instances. Moreover, sensitivity analyses on vehicle loading capacity and PDS setting provide managerial insights for decision makers.

Download or read book A Guided Neighborhood Search Applied to the Split Delivery Vehicle Routing Problem written by Rafael E. Aleman and published by . This book was released on 2009 with total page 200 pages. Available in PDF, EPUB and Kindle. Book excerpt: The classic vehicle routing problem considers the distribution of goods to geographically scattered customers from a central depot using a homogeneous fleet of vehicles with finite capacity. Each customer has a known demand and can be visited by exactly one vehicle. Each vehicle services the assigned customers in such a way that all customers are fully supplied and the total service does not exceed the vehicle capacity. In the split delivery vehicle routing problem, a customer can be visited by more than one vehicle, i.e., a customer demand can be split between various vehicles. Allowing split deliveries has been proven to potentially reduce the operational costs of the fleet. This study efficiently solves the split delivery vehicle routing problem using three new approaches. In the first approach, the problem is solved in two stages. During the first stage, an initial solution is found by means of a greedy approach that can produce high quality solutions comparable to those obtained with existing sophisticated approaches. The greedy approach is based on a novel concept called the route angle control measure that helps to produce spatially thin routes and avoids crossing routes. In the second stage, this constructive approach is extended to an iterative approach using adaptive memory concepts, and then a variable neighborhood descent process is added to improve the solution obtained. A new solution diversification scheme is presented in the second approach based on concentric rings centered at the depot that partitions the original problem. The resulting sub-problems are then solved using the greedy approach with route angle control measures. Different ring settings produce varied partitions and thus different solutions to the original problem are obtained and improved via a variable neighborhood descent. The third approach is a learning procedure based on a set or population of solutions. Those solutions are used to find attractive attributes and construct new solutions within a tabu search framework. As the search progresses, the existing population evolves, better solutions are included in it whereas bad solutions are removed from it. The initial set is constructed using the greedy approach with the route angle control measure whereas new solutions are created using an adaptation of the well known savings algorithm of Clarke and Wright (1964) and improved by means of an enhanced version of the variable neighborhood descent process. The proposed approaches are tested on benchmark instances and results are compared with existing implementations.

Download or read book Split Delivery Vehicle Routing Problem written by Si Chen and published by . This book was released on 2013 with total page pages. Available in PDF, EPUB and Kindle. Book excerpt: In the split delivery vehicle routing problem (SDVRP), a customer's demand can be split among several vehicles. In this article, we review applications of the SDVRP including the routing of helicopters in the North Sea and solution methods such as integer programming and tabu search. We develop a new heuristic that combines a mixed integer program and a record-to- record travel algorithm. Our heuristic produces high-quality solutions to six benchmark problems that have 50-199 customers and generally performs much better than tabu search. On five other problems for which lower bounds exist, our heuristic obtains solutions within 5.85%, on average. Finally, we generate 21 new test problems that have 8-288 customers. A near-optimal solution can be visually estimated for each problem. We apply our heuristic to these new problems and report our computational results.

Download or read book A Study on the Split Delivery Vehicle Routing Problem written by Kai Liu and published by . This book was released on 2005 with total page pages. Available in PDF, EPUB and Kindle. Book excerpt: This dissertation examines the Split Delivery Vehicle Routing Problem (SDVRP), a relaxed version of classical capacitated vehicle routing problem (CVRP) in which the demand of any client can be split among the vehicles that visit it. We study both scenarios of the SDVRP in this dissertation. For the SDVRP with a fixed number of the vehicles, we provide a Two-Stage algorithm. This approach is a cutting-plane based exact method called Two-Stage algorithm in which the SDVRP is decomposed into two stages of clustering and routing. At the first stage, an assignment problem is solved to obtain some clusters that cover all demand points and get the lower bound for the whole problem; at the second stage, the minimal travel distance of each cluster is calculated as a traditional Traveling Salesman Problem (TSP), and the upper bound is obtained. Adding the information obtained from the second stage as new cuts into the first stage, we solve the first one again. This procedure stops when there are no new cuts to be created from the second stage. Several valid inequalities have been developed for the first stage to increase the computational speed. A valid inequality is developed to completely solve the problem caused by the index of vehicles. Another strong valid inequality is created to provide a valid distance lower bound for each set of demand points. This algorithm can significantly outperform other exact approaches for the SDVRP in the literature. If the number of the vehicles in the SDVRP is a variable, we present a column generation based branch and price algorithm. First, a restricted master problem (RMP) is presented, which is composed of a finite set of feasible routes. Solving the linear relaxation of the RMP, values of dual variables are thus obtained and passed to the sub-problem, the pricing problem, to generate a new column to enter the base of the RMP and solve the new RMP again. This procedure repeats until the objective function value of the pricing problem is greater than or equal to zero (for minimum problem). In order to get the integer feasible (optimal) solution, a branch and bound algorithm is then performed. Since after branching, it is not guaranteed that the possible favorable column will appear in the master problem. Therefore, the column generation is performed again in each node after branching. The computational results indicate this approach is promising in solving the SDVRP in which the number of the vehicles is not fixed.

Download or read book A Multi objective Vehicle Routing Problem with Simultaneous Pickup and Delivery and Ecological Considerations written by Kingshuk Jubaer Islam and published by . This book was released on 2020 with total page pages. Available in PDF, EPUB and Kindle. Book excerpt:

Download or read book A Tabu Search Heuristic for the Split Delivery Vehicle Routing Problem with Production and Demand Calendars written by and published by . This book was released on 2008 with total page 22 pages. Available in PDF, EPUB and Kindle. Book excerpt:

Download or read book Solving the Split Delivery Vehicle Routing Problem written by Joseph Hubert Wilck and published by . This book was released on 2009 with total page 105 pages. Available in PDF, EPUB and Kindle. Book excerpt:

Download or read book The Pickup and Delivery Problem with Split Loads written by Maciek A. Nowak and published by . This book was released on 2005 with total page pages. Available in PDF, EPUB and Kindle. Book excerpt: This dissertation focuses on improvements in vehicle routing that can be gained by allowing multiple vehicles to service a common load. We explore how costs can be reduced through the elimination of the constraint that a load must be serviced by only one vehicle. Specifically, we look at the problem of routing vehicles to service loads that have distinct origins and destinations, with no constraint on the amount of a load that a vehicle may service. We call this the Pickup and Delivery Problem with Split Loads (PDPSL). We model this problem as a dynamic program and introduce structural results that can help practitioners implement the use of split loads, including the definition of an upper bound on the benefit of split loads. This bound indicates that the routing cost can be reduced by at most one half when split loads are allowed. Furthermore, the most benefit occurs when load sizes are just above one half of vehicle capacity. We develop a heuristic for the solution of large scale problems, and apply this heuristic to randomly generated data sets. Various load sizes are tested, with the experimental results supporting the finding that most benefit with split loads occurs for load sizes just above one half vehicle capacity. Also, the average benefit of split loads is found to range from 6 to 7% for most data sets. The heuristic was also tested on a real world example from the trucking industry. These tests reveal the benefit of both using split loads and allowing fleet sharing. The benefit for split loads is not as significant as with the random data, and the various business rules added for this case are tested to find those that have the most impact. It is found that an additional cost for every stop the vehicle makes strictly limits the potential for benefit from split loads. Finally, we present a simplified version of the PDPSL in which all origins are visited prior to any destination on a route, generalizing structural results from the Split Delivery Vehicle Routing Problem for this problem.

Download or read book The Vehicle Routing Problem with Simultaneous Pickup and Delivery and Handling Costs written by Richard P. Hornstra and published by . This book was released on 2018 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 A Tabu Search Heuristic for the Split Delivery Vehicle Routing Problem with Production and Demand Calendars written by Marie-Claude Bolduc and published by . This book was released on 2008-01-01 with total page 23 pages. Available in PDF, EPUB and Kindle. Book excerpt: The purpose of this article is to propose a tabu search heuristic for the split delivery Vehicle Routing Problem with Production and Demand Calendars (VRPPDC). This new problem consists of determining which customers will be served by a common carrier, as well as the delivery routes for those served by the private fleet, in order to minimize the overall transportation and inventory costs. We first model this problem and then propose a simple decomposition procedure that can be used to provide a starting solution. Next, we introduce a new tabu search heuristic and we describe two new neighbor reduction strategies. Finally, we present the results of our extensive computational tests. According to these tests, our reduction strategies are efficient not only at reducing computing time but also at improving the overall solution quality. Key words: vehicle routing, distribution calendar, production calendar, inventory, internal fleet, common carrier, split delivery, tabu.

Download or read book The Split Delivery Vehicle Routing Problem with Three dimensional Loading Constraints written by Andreas Bortfeldt and published by . This book was released on 2018 with total page pages. Available in PDF, EPUB and Kindle. Book excerpt:

Download or read book A Study on the Split Delivery Vehicle Routing Problem written by and published by . This book was released on 2005 with total page pages. Available in PDF, EPUB and Kindle. Book excerpt: This dissertation examines the Split Delivery Vehicle Routing Problem (SDVRP), a relaxed version of classical capacitated vehicle routing problem (CVRP) in which the demand of any client can be split among the vehicles that visit it. We study both scenarios of the SDVRP in this dissertation. For the SDVRP with a fixed number of the vehicles, we provide a Two-Stage algorithm. This approach is a cutting-plane based exact method called Two-Stage algorithm in which the SDVRP is decomposed into two stages of clustering and routing. At the first stage, an assignment problem is solved to obtain some clusters that cover all demand points and get the lower bound for the whole problem; at the second stage, the minimal travel distance of each cluster is calculated as a traditional Traveling Salesman Problem (TSP), and the upper bound is obtained. Adding the information obtained from the second stage as new cuts into the first stage, we solve the first one again. This procedure stops when there are no new cuts to be created from the second stage. Several valid inequalities have been developed for the first stage to increase the computational speed. A valid inequality is developed to completely solve the problem caused by the index of vehicles. Another strong valid inequality is created to provide a valid distance lower bound for each set of demand points. This algorithm can significantly outperform other exact approaches for the SDVRP in the literature. If the number of the vehicles in the SDVRP is a variable, we present a column generation based branch and price algorithm. First, a restricted master problem (RMP) is presented, which is composed of a finite set of feasible routes. Solving the linear relaxation of the RMP, values of dual variables are thus obtained and passed to the sub-problem, the pricing problem, to generate a new column to enter the base of the RMP and solve the new RMP again. This procedure repeats until the objective function value of the pricing problem i.

Download or read book Hybridisation of Heuristics and Exact Method for the Split Delivery Vehicle Routing Problem written by Nurul Huda Mohamed and published by . This book was released on 2012 with total page 216 pages. Available in PDF, EPUB and Kindle. Book excerpt:

Download or read book The Split Delivery Vehicle Routing Problem written by Kasper Berg Lethan and published by . This book was released on 2008 with total page 69 pages. Available in PDF, EPUB and Kindle. Book excerpt:

Download or read book An Exact Algorithm for the Petrol Station Replenishment Problem written by Fabien Cornillier and published by Québec : Faculté des sciences de l'administration, Université Laval. This book was released on 2005 with total page 24 pages. Available in PDF, EPUB and Kindle. Book excerpt: In the Petrol Station Replenishment Problem (PSRP) the aim is to jointly determine an allocation of petroleum products to tank truck compartments and to design delivery routes to stations. This article describes an exact algorithm for the PSRP. This algorithm was extensively tested on randomly generated data and on a reallife case arising in Eastern Quebec.

Download or read book Hybridisation of Heuristics and Exact Methods for the Split Delivery Vehicle Routing Problem written by Nurum Huda binti Mohamed and published by . This book was released on 2012 with total page pages. Available in PDF, EPUB and Kindle. Book excerpt: