Optimal Routing for Solid Waste Collection in Cities by using Real Genetic Algorithm

摘要: The routing is one of the main components solid waste management in cities where collection takes 85% system cost. objective this research paper to find best route for collecting taking Irbid City Jordan as an example problem. problem a node or traveling salesman (TSP). This work has developed methodology based on real genetic algorithm effective solving TSP. GA comprises real-value coding with specific behavior each code it (whether binary, integer, name), rank selection, and efficient uniform operators. results indicated, comparison other applied optimization methods (linear, dynamic, Monte Carlo heuristic search methods), that produces significantly lowest distance (least cost tour) solution. It concluded approach robust, represents method easily dynamic complex well-known TSP field large cities.