This paper introduces the CCSP, a unique problem in vehicle routing that allows for remote servicing of customers within a coverage area. Optimization methodologies like ILP and BRKGA are proposed and evaluated on benchmark instances, showing promising results.
The CCSP generalizes the well-known CVRP by incorporating the concept of service by covering, providing new insights into efficient vehicle routing problems. Various related problems like CSP, CTP, m-CTP, and MDCTVRP are discussed with their respective methodologies.
The proposed matheuristic for CCSP combines exact formulations with heuristic approaches to tackle large instances effectively. Computational experiments demonstrate the effectiveness of these methodologies in solving complex routing problems.
Overall, this work contributes to advancing solutions for challenging vehicle routing problems through innovative algorithms and heuristics.
To Another Language
from source content
arxiv.org
Deeper Inquiries