Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
7498300 | Transportation Research Part D: Transport and Environment | 2018 | 22 Pages |
Abstract
The study includes the simulation of e-waste collection requests in Tokyo, Philadelphia and Warsaw to compare algorithms for various urban arrangements of streets and buildings. The results show that the best of the four algorithms, to facilitate e-waste mobile collection on demand, is simulated annealing and the worst is tabu search. The proposed model and algorithm can bring significant improvement in planning the routes of the vehicles in the e-waste collection, including a positive social impact on the new method of waste collection, especially in urban areas.
Keywords
ACOBCOMCSSVRPVRPTWWEEETSPBPPEuropean UnionEvolutionary algorithmGreedy algorithmGenetic algorithmSimulated annealingGRAParticle swarm optimizationPSOBee colony optimizationAnt Colony OptimizationWaste electrical and electronic equipmentTabu searchOptimization methodsinformation technologiesBin Packing ProblemTraveling salesman problemVehicle routing problemVehicle Routing Problem with Time Windowsartificial intelligence
Related Topics
Life Sciences
Environmental Science
Environmental Science (General)
Authors
Piotr Nowakowski, Krzysztof Szwarc, Urszula Boryczka,