|
| Author (s) | Focus | Approach / Outcome |
|
| Agha, 2006 | Optimal routing of municipal solid waste collection vehicles | Optimizes routing system using mixed integer-programming model which achieved 23.47% reduced distance thus saving around US$1,140.00 per month |
|
| Aringhieri et al., 2004 | An asymmetric vehicle routing problem arising in the collection and disposal of special waste | Provides a graph model based on an asymmetric vehicle routing formulation and discusses heuristic algorithms for collection and disposal of bulky recyclable waste which saves travel time and number of vehicles' use |
|
| Awad and Aboul-Ela, 2001 | Development of a simplified procedure for routing solid waste collection | Solves Chinese postman problem and traveling salesman problem using Monte Carlo simulation, heuristic algorithm and modified heuristic algorithm to suggest suitable routing system |
|
| Clark and Gillean, 1975 | Analysis of solid waste management operations | Describes the application of simulation model to the complex problems of solid waste management system which reduced annual budget of $14.8 million in 1970 to $8.8 million in 1972 and work force from 1640 to 850 |
|
| Cordeau et al., 2007 | Vehicle routing | Presents a comprehensive overview of the available exact and heuristic algorithms for the VRP (vehicle routing problem), most of which have been adapted to solve other variants |
|
| Das and Bhattacharyya, 2015 | Optimization of municipal solid waste collection routes | Proposes an optimal collection and transportation scheme that focuses on the problem of minimizing the length of each collection and transportation route through heuristic solution using a mixed integer program |
|
| Dell’Amico et al., 2006 | Branch-and-price approach to the vehicle routing problem with simultaneous distribution and collection | Introduces for the first time branch-and-price algorithms for the exact solution of the vehicle routing problem with simultaneous delivery and collection without any additional constraint |
|
| Ghiani et al., 2005 | Waste collection: solution of real-life arc routing problem | Uses real-life arc routing problem to accomplish a reduction of about 8% in total cost |
|
| Gyamfi, 2012 | Sequential ordering of truck routes for efficient garbage collection | Reveals outstanding performance of the ant colony optimization algorithm in terms of efficiency: reduction of total cost by 35% |
|
| Han and Cueto, 2015 | Review on waste collection vehicle routing problem | Analyzes the major contribution about waste collection vehicle routing problem in literature |
|
| Johansson, 2006 | Effect of dynamic scheduling and routing in solid waste management system | Uses analytical modeling and discrete-event simulation to evaluate different scheduling and routing policies utilizing real-time data |
|
| Naninja, 2013 | Optimizing transportation cost of solid waste | Reduces number of trips of vehicles to minimize cost through formulation of integer linear programming problem and solving using linear programming software |
|
| Otoo, 2012 | Capacitated arc routing problem: collection of solid waste | Uses paired shortest path and partitioned collection points based on capacity of vehicles and ant colony optimization to find minimum tour and improved total distance by 40% |
|
| Poser and Awad, 2006 | Optimal routing for solid waste collection | It uses node routing or travel salesman problem to develop a methodology based on real genetic algorithm and results indicate that genetic algorithm produces significantly the lowest distance (least cost tour) solution |
|
| Reinhardt, 2011 | Routing and scheduling problems | Uses dynamic programming for multi constrained shortest paths, branch-and-cut for linear shipping, simulated annealing for transporting assisted passengers in airports, branch-cut-and-price for vehicle routing with time windows and edges set costs |
|
| Ronen et al., 1983 | Improvement of a solid waste collection system | It uses heuristic model for analysis and modification of waste collection routes and implementation of proposed routes saves one out of six collection teams and reduces total distance travelled by 18.7% |
|
| Sonesson, 2000 | Modeling of waste collection to calculate fuel consumption and time | Uses common statistics to model and predict real outcome relatively well: between 5 and 14% deviation for energy consumption and between 10 and 24% deviation for time consumption |
|
| Toro et al., 2016 | Review on the vehicle routing problem in green transportation context | Proposes interaction between variants of classical routing problems and environmental effects of its operations, known in literature as Green-VRP |
|
