4,535 research outputs found
Advanced Planning Concepts in the Closed-Loop Container Network of ARN
In this paper we discuss a real-life case study in the optimization of the logistics network for the collection of containers from end-of-life vehicle dismantlers in the Netherlands.Advanced planning concepts like dynamic assignment of dismantlers to logistic service providers are analyzed by a simulation model.In this model, we periodically solve a vehicle routing problem to gain insight in the long-term performance of the system.The vehicle routing problem considered is a multi depot pickup and delivery problem with alternative delivery locations.We solve this problem with a heuristic based on route generation and set partitioning.Reverse logistics;Closed-loop supply chain mmanagement;vehicle routing;set partitioning;distribution planning
An ant colony algorithm for the mixed vehicle routing problem with backhauls
The Vehicle Routing Problem with Pickup and Delivery (VRPPD) is a variant of the Vehicle Routing Problem where the vehicles are not only required to deliver goods but also to pick up some goods from the customers. The Mixed Vehicle Routing Problem with Backhauls (MVRPB) is a special case of VRPPD where each customer has either a delivery or a pickup demand to be satisfied and the customers can be visited in any order along the route. Given a fleet of vehicles and a set of customers with known pickup or delivery demands MVRPB determines a set of vehicle routes originating and ending at a single depot and visiting all customers exactly once. The objective is to minimize the total distance traversed with the least number of vehicles. For this problem, we propose an Ant Colony Optimization algorithm with a new visibility function which attempts to capture the âdeliveryâ and âpickupâ nature of the problem. Our numerical tests to compare the performance of the proposed approach with those of the well-known benchmark problems reveal that the proposed approach provides encouraging results
On green routing and scheduling problem
The vehicle routing and scheduling problem has been studied with much
interest within the last four decades. In this paper, some of the existing
literature dealing with routing and scheduling problems with environmental
issues is reviewed, and a description is provided of the problems that have
been investigated and how they are treated using combinatorial optimization
tools
Recommended from our members
Metaheuristics for the waste collection vehicle routing problem with time windows
This thesis was submitted for the degree of Doctor of Philosophy and awarded by Brunel University.In this thesis there is a set of waste disposal facilities, a set of customers at which waste is collected and an unlimited number of homogeneous vehicles based at a single depot. Empty vehicles leave the depot and collect waste from customers, emptying themselves at the waste disposal facilities as and when necessary. Vehicles return to the depot empty. We take into consideration time windows associated with customers, disposal facilities and the depot. We also have a driver rest period. The problem is solved heuristically. A neighbour set is defined for each customer as the set of customers that are close, but with compatible time windows.
This thesis uses six different procedures to obtain initial solutions for the problem. Then, the initial solutions from these procedures are improved in terms of the distance travelled using our phase 1 and phase 2 procedures, whereas we reduce the number of vehicles used using our vehicle reduction (VR) procedure.
In a further attempt to improve the solutions three metaheuristic algorithms are presented, namely tabu search (TS), variable neighbourhood search (VNS) and variable neighbourhood tabu search (VNTS). Moreover, we present a modified disposal facility positioning (DFP), reverse order and change tracking procedures.
Using all these procedures presented in the thesis, four solution procedures are reported for the two benchmark problem sets, namely waste collection vehicle routing problems with time windows (VRPTW) and multi-depot vehicle routing problem with inter-depot routes (MDVRPI).
Our solutions for the waste collection VRPTW problems are compared with the solutions from Kim et al (2006), and our solutions for the MDVRPI problems are compared with Crevier et al (2007). Computational results for the waste collection VRPTW problems indicate that our algorithms produce better quality solutions than Kim et al (2006) in terms of both distance travelled and number of vehicles used. However for the MDVRPI problems, solutions from Crevier et al (2007) outperform our solutions.Ministry of Higher Education, Malaysi
A Column Generation Approach to the Capacitated Vehicle Routing Problem with Stochastic Demands
In this article we introduce a new exact solution approach to the Capacitated Vehicle Routing Problem with Stochastic Demands (CVRPSD). In particular, we consider the case where all customer demands are distributed independently and where each customerâs demand follows a Poisson distribution. The CVRPSD can be formulated as a Set Partitioning Problem. We show that, under the above assumptions on demands, the associated column generation subproblem can be solved using a dynamic programming scheme which is similar to that used in the case of deterministic demands. To evaluate the potential of our approach we have embedded this column generation scheme in a branch-and-price algorithm. Computational experiments on a large set of test instances show promising resultsRouting; Stochastic programming; Logistics; Branch and Bound; Dynamic programming
Attention-Based Neural Network for Solving the Green Vehicle Routing Problem in Waste Management
23.08.23: Trekkes tilbake fra visning som løsning pü at oppgaven ble ferdigstilt fra studieadministrasjonen litt for fort/IHTIThe transport sector is a major contributor to the emission of greenhouse gases and air pollution. As urbanization and population growth continue to increase, the demand for transportation services grows, emphasizing the need for sustainable practices. Therefore, incorporating sustainability into the transport sector can effectively reduce its negative impacts on the environment and optimize the utilization of resources.
This thesis aims to address this issue by proposing a novel method that integrates neural networks into the development of a green vehicle routing model. By incorporating environmental considerations, particularly fuel consumption, into the optimization process, the model seeks to generate more sustainable route solutions. The integration of machine learning techniques, specifically an attention-based neural network, demonstrates the potential of combining machine learning with operations research for effective route optimization.
While the effectiveness of the green vehicle routing problem (GVRP) has been demonstrated in providing sustainable routes, its practical applications in real-world scenarios are still limited. Therefore, this thesis proposes the implementation of the GVRP model in a real-world waste collection routing problem. The study utilizes data obtained from Remiks, a waste management company responsible for waste collection and handling in Tromsø and Karlsøy.
The findings of this study highlight the promising synergy between machine learning and operations research for further advancements and real-world applications. Specifically, the application of the GVRP approach to waste management issues has been shown to reduce emissions during the waste collection process compared to routes optimized solely for distance minimization. The attention-based neural network approach successfully generates routes that minimize fuel consumption, outperforming distance-optimized routes. These results underscore the importance of leveraging the GVRP to address environmental challenges while enhancing decision-making efficiency and effectiveness. Overall, this thesis provides insights for developing sustainable and optimized routes for real-world problems
- âŚ