In this work we consider the generalized vehicle routing problem with stochastic demands (GVRPSD). This NP-hard problem combines the clustering aspect of the generalized vehicle routing problem with the uncertainty aspect of the vehicle routing problem with stochastic demands. We propose an integer L-shaped method based on decomposition and branch-and-cut. The subproblem of computing the restoc...

This paper addresses a Three-Dimensional Loading Capacitated Vehicle Routing Problem (3L-CVRP) which combines a three-dimensional loading problem and vehicle routing problem in distribution logistics. The problem requires the combinatorial optimization of a feasible loading solution and a successive routing of vehicles to satisfy client demands, where all vehicles must start and terminate at a ...

Vehicle routing problem with time windows (VRPTW) involves the routing of a set of vehicles with limited capacity from a central depot to a set of customers with known demands and predefined time windows. Routes for the vehicles must meet all given constraints as well as minimize the objectives of travel distance and vehicles numbers. We proposed hybrid multiobjective evolutionary algorithm (HM...

Since the Vehicle Routing Problem (VRP) was introduced by Dantzig and Ramser, it became one of the most studied problems in Combinatorial Optimization. Different solution approaches were proposed over the past decades to solve the VRP and its variants. In this thesis, we discuss about two VRP variants, resulting from the integration of VRPs with distribution problems. The first problem takes pl...

Abstract In recent years, operations research in agriculture has improved the harvested yield, reduced cost and time required for field operations, maintained economic environmental sustainability. The heuristics method, named Evolutionary neighborhood discovery algorithm (ENDA), is applied to minimize inter-field intra-field distance of routing planning machines multiple agricultural fields. p...

Logistics and supply-chain management may generate notable operational cost savings with increased reliance on shared serving of customer demands by multiple agents. However, traditional logistics planning exhibits an intrinsic limitation in modeling and implementing shared commodity delivery from multiple depots using multiple agents. In this paper, we investigate a centralized model and a heu...