Efficient GRASP+VND and GRASP+VNS metaheuristics for the traveling repairman problem

Salehipour, Amir; Sörensen, Kenneth; Goos, Peter; Bräysy, Olli

doi:10.1007/s10288-011-0153-0

Cited by 99 publications

(137 citation statements)

References 22 publications

Supporting

Mentioning

127

Contrasting

Unclassified

Order By: Relevance

“…These authors provide a mathematical model, several lower bounds and two memetic algorithms. Solutions are compared using classical CVRP instances [24], replacing the total length of the routes by the sum of arrival times, and on TRP instances [67]. The results confirm that the CCVRP and the classical CVRP can have quite different solutions on the same instance, as already observed by Campbell et al [20].…”

Section: Context and Problems Related To The Mt-ccvrpsupporting

confidence: 74%

A multistart iterated local search for the multitrip cumulative capacitated vehicle routing problem

2014

View full text Add to dashboard Cite

The multitrip cumulative capacitated vehicle routing problem (mt-CCVRP) is a non-trivial extension of the classical CVRP: the goal is to minimize the sum of arrival times at demand nodes and each vehicle may perform several trips. Applications of this NP-hard problem can be found in disaster logistics and maintenance operations. Contrary to the CVRP, the cost of a solution varies if a trip is reversed or if its rank in a multitrip is changed. Moreover, evaluating local search moves in constant time is not obvious. This article presents a mixed integer linear program (MILP), a dominance rule, and a hybrid metaheuristic: a multi-start iterated local search (MS-ILS) calling a variable neighborhood descent with O(1) move evaluations. On three sets of instances, MS-ILS obtains good solutions, not only on the mt-CCVRP, but also on the cumulative CVRP where it competes with four existing algorithms. Moreover, the metaheuristic retrieves the optimal solutions of the MILP, which can be computed for small instances using a commercial solver.

show abstract

Section: Context and Problems Related To The Mt-ccvrpsupporting

confidence: 74%

A multistart iterated local search for the multitrip cumulative capacitated vehicle routing problem

2014

View full text Add to dashboard Cite

show abstract

“…The latest contribution [19] solves instances up to 80 nodes, after formulating the TRP as a shortest path problem with side constraints on a multilevel graph where nodes represent the potential position of each customer in the tour. The only metaheuristic published is a greedy randomized adaptive search procedure with variable neighborhood descent (GRASP + VND) proposed in [18]. Tested on instances from 10 to 1000 nodes, this metaheuristic improves the nearest neighbor heuristic by 2-12%.…”

Section: Introductionmentioning

confidence: 99%

“…The TRP is defined in [18] as a "customer-centric routing problem": the objective takes the satisfaction of each customer into account, contrary to most classical vehicle routing problems which address a global cost criterion. This problem is also known in the literature as the minimum latency problem, the delivery man problem or the school-bus driver problem.…”

Section: Introductionmentioning

confidence: 99%

An effective memetic algorithm for the cumulative capacitated vehicle routing problem

Ngueveu¹,

Prins²,

Calvo³

2010

Computers & Operations Research

190

138

View full text Add to dashboard Cite

“…No other results are known. Exact algorithms and approximation algorithms for the TRP have been described in [4,12,18,21]; metaheuristics for the TRP are described in recent contributions [15] and [17]. As far as we are aware, these are the only studies that present metaheuristics for the TRP.…”

Section: Literaturementioning

confidence: 99%

Heuristics for the traveling repairman problem with profits

Dewilde

Cattrysse

Coene

et al. 2013

Computers & Operations Research

View full text Add to dashboard Cite

In the traveling repairman problem with profits, a repairman (also known as the server) visits a subset of nodes in order to collect time-dependent profits. The objective consists of maximizing the total collected revenue. We restrict our study to the case of a single server with nodes located in the Euclidean plane. We investigate properties of this problem, and we derive a mathematical model assuming that the number of visited nodes is known in advance. We describe a tabu search algorithm with multiple neighborhoods, and we test its performance by running it on instances based on TSPLIB. We conclude that the tabu search algorithm finds good-quality solutions fast, even for large instances. ACM Subject Classification I.2.8 Heuristic Methods Keywords and phrases IntroductionImagine a single server, traveling at unit speed. There are n locations given, each with a profit p i , 1 ≤ i ≤ n. At t = 0, the server starts traveling and collects revenue p i − t i at each visited location, where t i denotes the server's arrival time at location i. Not all locations need to be visited. The problem is to find a travel plan for the server that maximizes total revenue. This problem is known as the traveling repairman problem with profits (TRPP) and forms the subject of this paper. In particular, we perform a computational study of the TRPP in the Euclidean plane. MotivationThe TRPP occurs as a routing problem in relief efforts. For example, consider the following situation. In the aftermath of a disaster like an earthquake, there are a number of villages that experience an urgent need for medicine. The sooner the medicine gets to a village, the more people can be rescued. Since the cost of transport is negligible compared to the value of a human life, rescue teams are only concerned with the total number of people that can be saved. Assume that at location i there are p i people in need of the medicine, and that every instance of time, there is one of them dying. Suppose also that we have one truck available. With t i denoting the arrival time of the truck at location i, the number of people that will survive equals p i − t i . Thus, the goal of the rescue team is to maximize i (p i − t i ),

show abstract

Efficient GRASP+VND and GRASP+VNS metaheuristics for the traveling repairman problem

Cited by 99 publications

References 22 publications

A multistart iterated local search for the multitrip cumulative capacitated vehicle routing problem

A multistart iterated local search for the multitrip cumulative capacitated vehicle routing problem

An effective memetic algorithm for the cumulative capacitated vehicle routing problem

Heuristics for the traveling repairman problem with profits

Contact Info

Product

Resources

About