A mixed integer formulation and an efficient metaheuristic procedure for the <i>k</i>-Travelling Repairmen Problem

Nucamendi-Guillén, Samuel; Martínez-Salazar, Iris; Ángel-Bello, Francisco; Moreno-Vega, J. Marcos

doi:10.1057/jors.2015.113

Cited by 51 publications

(58 citation statements)

References 25 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…When no optimum solution is available for large instance sizes and our algorithm is the first metaheuristic for solving the problem, our best solutions can be compared to the tight lower bound of the optimal solution in [22] or initial solutions from GRASP. Certainly, the comparision between GRASP and VND is not completely fair because they depend on two different types of algorithm.…”

Section: Computational Evaluationsmentioning

confidence: 99%

“…Specifically, this dataset includes seven instances (CMT6, CMT7, ..., CMT14) and twelve instances (tai75, ..., tai150d). Moreover, one hundred and thirty instances from 60 to 80 vertices [22] are also used in our experiments. We gather and name them as dataset 2.…”

Section: Datasetsmentioning

confidence: 99%

“…We gather and name them as dataset 2. In this dataset, we can obtain the optimal solutions for the instances of MTRP in [22]. These optimal solutions are the lower bound of the optimal solutions of MTRPD.…”

Section: Datasetsmentioning

confidence: 99%

“…A generalization of the TRP is known as the Multiple Traveling Repairmen Problem (MTRP) that consists of several vehicles instead of one vehicle [17,19]. Practical applications of MTRP can be found in Routing Pizza Deliverymen, and Scheduling Machine Problem to minimize mean flow time for jobs [14,22]. In this work, we study an extension of the MTRP (Multiple Traveling Repairmen Problem with Distance Constraints -MTRPD) by involving a distance constraint that the route length (or maximum duration (MD)) of each vehicle cannot exceed a predetermined limit [20].…”

Section: Introductionmentioning

confidence: 99%

“…To the best of our knowledge, the problem has not been well studied previously, even though it is a natural and practical extension of the Traveling Repairman Problem or Multiple Traveling Repairmen Problem case [7,12,22,23,25]. Recently, Z. Lou et al [20] has introduced the MTRPD problem and proposed an exact algorithm for the problem.…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

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

Ban

2018

JCC

View full text Add to dashboard Cite

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 of all vehicles that minimizes the sum of all vertices' waiting time. To the best of our knowledge, the problem has not been studied much previously, even though it is a natural and practical extension of the Traveling Repairman Problem or Multiple Traveling Repairmen Problem case. In our work, we propose a metaheuristic algorithm which is mainly based on the principles of Greedy Randomized Adaptive Search Procedure (GRASP) and Variable Neighborhood Descent (VND) to solve the problem. The GRASP is used to build an initial solution which is good enough in a construction phase. In a cooperative way, the VND is employed to generate diverse neighborhoods in an improvement phase, therefore, it can help the search escape from local optimal. Extensive numerical experiments on 321 benchmark instances show that our algorithm can find the optimal solutions with up to 50 vertices in several instances. For larger instances, our algorithm obtains provably near-optimal solutions, even for large instances.

show abstract

Section: Computational Evaluationsmentioning

confidence: 99%

Section: Datasetsmentioning

confidence: 99%

Section: Datasetsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

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

Ban

2018

JCC

View full text Add to dashboard Cite

show abstract

The Traveling Repairman Problem App for Mobile Phones: A Case on Perishable Product Delivery

Bruni

Forte

Scarlato

et al. 2019

AIRO Springer Series

View full text Add to dashboard Cite

Multi-shift Single-Vehicle Routing Problem Under Fuzzy Uncertainty

Nucci

2020

Advances in Intelligent Systems and Computing

View full text Add to dashboard Cite

This research considers the single-vehicle routing problem (VRP) with multi-shift and fuzzy uncertainty. In such a problem, a company constantly uses one vehicle to fulfill demand over a scheduling period of several work shifts. In our case, a crew executes maintenance jobs in different sites. The working team runs during different work shifts, but recurrently returns to the depot by the end of the shift (overtime avoidance). The goal consists in minimizing the number of work shifts (makespan). We observe the impact of uncertainty in travel and maintenance processing time on the overtime avoidance constraint. We realize an Artificial Immune Heuristic to get optimal solutions considering both makespan and overtime avoidance. First, we present a Pareto-based framework to evaluate the uncertainty influence. Then, we show a numerical real case study to survey the problem. In particular, a case study scenario has been created on the basis of the environmental changes in travel and processing times observed in Italy during the Covid-19 lockdown period (started on March 9, 2020). Results present important improvements are obtained with the proposed approach.

show abstract

A mixed integer formulation and an efficient metaheuristic procedure for the k-Travelling Repairmen Problem

Cited by 51 publications

References 25 publications

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

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

The Traveling Repairman Problem App for Mobile Phones: A Case on Perishable Product Delivery

Multi-shift Single-Vehicle Routing Problem Under Fuzzy Uncertainty

Contact Info

Product

Resources

About