.png){kind=icon}
.png){kind=icon}
Return
On the service time in the close-enough traveling salesman problem
.png){kind=icon}
PRE
AI
J
L
DOI：10.1016/j.ejor.2026.08.001.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
• We optimize how, where, and when to serve customers within their neighboring area. • We leverage proactive and unplanned visits due to geometric features in CETSP. • Consecutive vs intermittent and multi-task vs single-task service are considered. • Neglecting service time in route planning could increase travel time up to 15%.
Keywords:
Travelling salesman
Close-enough
Service time
Matheuristic
Journal
IF:
6
Papers:
2.2W
Citations:
6.4W
Organization
No organization information available
Cited Papers