2018
DOI: 10.15625/1813-9663/33/3/10511
|View full text |Cite
|
Sign up to set email alerts
|

A GRASP+VND Algorithm for the Multiple Traveling Repairman Problem with Distance Constraints

Abstract: Abstract. Multiple Traveling Repairmen Problem (MTRP) is a class of NP-hard combinatorial optimization problems. In this paper, an other variant of MTRP, also known as Multiple Traveling Repairmen Problem with Distance Constraint (MTRPD), is introduced. In MTRPD problem, a fleet of vehicles serves a set of customers. Each vehicle which starts from the depot is not allowed to travel any distance longer than a limit and each customer must be visited exactly once. The goal is to find the order of customer visits … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
21
0

Year Published

2019
2019
2023
2023

Publication Types

Select...
5
2

Relationship

0
7

Authors

Journals

citations
Cited by 10 publications
(21 citation statements)
references
References 18 publications
0
21
0
Order By: Relevance
“…It shows that the algorithm is capable of finding the optimal solutions for all instances in a reasonable amount of time, even for the cases of 50 vertices. That means our solutions are better than the ones in our previous work [5], which fails to find the optimal solutions for all instances with 50 vertices. Besides, in Table 4, for most instances from 60 to 80 vertices, our solutions fall into the range of 0.30% -0.32% of the lower bound of the optimal solution.…”
Section: Mtrpdmentioning
confidence: 56%
See 3 more Smart Citations
“…It shows that the algorithm is capable of finding the optimal solutions for all instances in a reasonable amount of time, even for the cases of 50 vertices. That means our solutions are better than the ones in our previous work [5], which fails to find the optimal solutions for all instances with 50 vertices. Besides, in Table 4, for most instances from 60 to 80 vertices, our solutions fall into the range of 0.30% -0.32% of the lower bound of the optimal solution.…”
Section: Mtrpdmentioning
confidence: 56%
“…Therefore, we can conclude that for the instances solved, our algorithm finds near-optimal solutions, even for the instances with 80 vertices. In comparison with GRASP+VNS [5], our results are much better than GRASP+VNS since their average solution is from 2.73% to 4.75%.…”
Section: Mtrpdmentioning
confidence: 78%
See 2 more Smart Citations
“…As shown in Table 3, our HVT algorithm is capable of finding the optimal solutions for all small instances in a reasonable amount of time (0.52 seconds on average). It is thus better than those obtained by GRASP+VNS in [5] which fails to find the optimal solutions for all instances with 50 vertices. Moreover, for most instances consisting of 60 to 80 vertices, our solutions fall into the range of 0.30% -0.32% of the lower bound.…”
Section: Comparison With Mtrpd's Algorithmsmentioning
confidence: 75%