An evolutionary approach to the vehicle route planning in e-waste mobile collection on demand
Open Access
- 24 February 2021
- journal article
- research article
- Published by Springer Nature in Soft Computing
- Vol. 25 (8) , 6665-6680
Abstract
The article discusses the utilitarian problem of the mobile collection of waste electrical and electronic equipment. Due to its $$\mathcal {NP}$$ -hard nature, implies the application of approximate methods to discover suboptimal solutions in an acceptable time. The paper presents the proposal of a novel method of designing the Evolutionary and Memetic Algorithms, which determine favorable route plans. The recommended methods are determined using quality evaluation indicators for the techniques applied herein, subject to the limits characterizing the given company. The proposed Memetic Algorithm with Tabu Search provides much better results than the metaheuristics described in the available literature.
Keywords
This publication has 37 references indexed in Scilit:
- Innovating Collection Modes for Waste Electrical and Electronic Equipment in ChinaSustainability, 2018
- A hybrid of ant colony and firefly algorithms (HAFA) for solving vehicle routing problemsJournal of Computational Science, 2018
- Strategic planning: Design and coordination for dual-recycling channel reverse supply chain considering consumer behaviorEuropean Journal of Operational Research, 2017
- Need of an online e-waste market in IndiaInternational Journal of Environment and Waste Management, 2017
- Modified artificial bee colony for the vehicle routing problems with time windowsSpringerPlus, 2016
- An Empirical Study on the Adoption of Online Household e-waste Collection Services in China2015
- The Waste Collection Vehicle Routing Problem with Time Windows in a City Logistics ContextProcedia - Social and Behavioral Sciences, 2012
- A memetic algorithm for the team orienteering problem4OR, 2009
- An Introduction to Tabu Search2006
- A parallel hybrid genetic algorithm for the vehicle routing problem with time windowsComputers & Operations Research, 2004