In this research process, the aim is to determine shortest route for transporting waste with or minimum total distance. case, what must be considered transportation of waste, regarding distance between location source landfills. The problem routes can made in a mathematical method. method used Capacitated Vehicle Routing Problem (CVRP) solving using CVRP method, minimized optimized Particle Swa...

Cuckoo search is a nature-inspired metaheuristic algorithm, based on the brood parasitism of some cuckoo species, along with Lévy flights random walks. In this paper, a modified version is proposed, where the new solutions generated from the exploration and exploitation phases are combined, evaluated and ranked together, rather than separately in the original algorithm, in addition to imposing ...

Abstract: The Open Vehicle Routing Problem (OVRP) is one of the most important extensions of the vehicle routing problem (VRP) that has many applications in industrial and service. In the VRP, a set of customers with a specified demand of goods are given and a depot where a fleet of identical capacitated vehicles is located. We are also given the ‘‘traveling costs’’ between the depot and all th...

The Capacitated Vehicle Routing Problem with Balanced Routes and Time Windows (CVRPBRTW) aims at optimizing the total distance cost, the number of vehicles used, and the route balancing subject to time windows and other constraints. Due to the multiple and often conflicting objectives, the proposed problem is formulated and tackled in a MultiObjective Optimization manner using a Hybrid Multi-Ob...

Electric vehicle routing problems (E-VRPs) deal with a fleet of electric vehicles (EVs) to serve set customers while minimizing an operational criterion, for example, cost or time. The feasibility the routes is constrained by autonomy EVs, which may be recharged along route. Much E-VRP research neglects capacity charging stations (CSs) and thus implicitly assumes that unlimited number EVs can s...

The multiple vehicle routing problem with time windows (VRPTW) is a hard and extensively studied combinatorial optimization problem. This paper considers a dynamic VRPTW with stochastic customers, where the goal is to maximize the number of serviced customers. It presents a multiple scenario approach (MSA) that continuously generates routing plans for scenarios including known and future reques...