Clustered vehicle routing problem for waste collection with smart operational management approaches
From MaRDI portal
Publication:6659116
DOI10.1111/itor.13282MaRDI QIDQ6659116
Arindam Roy, Apurba Manna, Jungmin Kim, Ilkyeong Moon
Publication date: 8 January 2025
Published in: International Transactions in Operational Research (Search for Journal in Brave)
Cites Work
- Algorithm AS 136: A K-Means Clustering Algorithm
- The selective vehicle routing problem in a collaborative environment
- A fast two-level variable neighborhood search for the clustered vehicle routing problem
- The shared customer collaboration vehicle routing problem
- Large multiple neighborhood search for the clustered vehicle-routing problem
- New mathematical models of the generalized vehicle routing problem and extensions
- A hybrid metaheuristic for smart waste collection problems with workload concerns
- The vehicle routing problem
- TSPLIB—A Traveling Salesman Problem Library
- A multiobjective GRASP–VND algorithm to solve the waste collection problem
- Exact Algorithms for the Clustered Vehicle Routing Problem
- A variable neighborhood descent algorithm for a real waste collection problem with mobile depots
- Tabu search with strategic oscillation for improving collection assignment plans of waste electric and electronic equipment
- Wastewater treatment technology selection using a hybrid multicriteria decision‐making method
This page was built for publication: Clustered vehicle routing problem for waste collection with smart operational management approaches