Abstract
We address an application of vehicle routing problem (VRP) in the real life, namely waste collection problem. Constraints are considered including conflicts between waste properties, time windows of the waste, and multiple landfills. A combination of flow and set partitioning formulation is suggested to model the problem in case of multi-objective optimization. To minimize the total traveling time and number of vehicles of solution, we propose using a memetic algorithm (MA) with λ-interchange mechanism. The λ-interchange operator is modified to be compatible with new sub-routes construction for the multiple landfills. In experiments, we compare the result of proposed MA method with some good results published as well as other meta-heuristic algorithms. The density of conflict matrix is also considered to understand its influence on the quality of the solution. Experimental results show that our approach can be competitive to other results in the VRP with time windows. Furthermore, the algorithm outperforms others in the VRP with time windows and conflict.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
