Garbage is one of the environmental problems. The process transporting garbage sometimes occurs delays such as congestion and engine failure. Robust optimization model called a robust counterpart open capacitated vehicle routing problem (RCOCVRP) with time windows was formulated to get over this delays. This has limitation capacity an uncertainty waste volume travel time. RCOCVRP solved by heur...

in this article, multiple-product pvrp with pickup and delivery that is used widely in goods distribution or other service companies, especially by railways, was introduced. a mathematical formulation was provided for this problem. each product had a set of vehicles which could carry the product and pickup and delivery could simultaneously occur. to solve the problem, two meta-heuristic methods...

One of the new emerging application strategies for optimization is the hybridization of existing metaheuristics. The research combines the unique paradigms of solution space sampling of SOMA and memory retention capabilities of Scatter Search for the task of capacitated vehicle routing problem. The new hybrid heuristic is tested on the Taillard sets and obtains good results.

Abstract We provide a preprocessing method to reduce the vehicle capacity for instances of capacitated routing problem. This improves LP bound many formulations It also speeds up common algorithms which computation time depends on capacity. Our simulation experiments suggest that, perhaps surprisingly, often is very tight in sense that it cannot be reduced by much.

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...