The vehicle routing problem with stochastic demands (VRPSD) is a combinatorial optimization problem. The VRPSD looks for vehicle routes to connect all customers with a depot, so that the total distance is minimized, each customer visited once by one vehicle, every route starts and ends at a depot, and the travelled distance and capacity of each vehicle are less than or equal to the given maximum value. Contrary to the classical VRP, in the VRPSD the demand in a node is known only after a vehicle arrives at the very node. This means that the vehicle routes are designed in uncertain conditions. This paper presents a heuristic and meta-heuristic approach for solving the VRPSD and discusses the real problem of municipal waste collection in the City of Niš.
This paper presents a methodology for solving the municipal waste collection problem in urban areas. The problem is treated as a distance-constrained capacitated vehicle routing problem for municipal waste collection (DCCVRP-MWC). To solve this problem, four meta-heuristic algorithms were used: Genetic algorithm (GA), Simulated annealing (SA), Particle swarm optimization (PSO) and Ant colony optimization (ACO). Vehicle guidance plays a huge role in large transportation companies, and with this test, we propose one of several algorithms for solving urban waste collection problems.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.