Skip to main content

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

Abstract

The traveling repairman problem is a customer-centric routing problem, in which the total waiting time of the customers is minimized, rather than the total travel time of a vehicle. To date, research on this problem has focused on exact algorithms and approximation methods. This paper presents the first metaheuristic approach for the traveling repairman problem.

References

  • Afrati F, Cosmadakis S, Papadimitriou CH, Papageorgiou G, Papakostantinou N (1986) The complexity of the traveling repairman problem. Theor Inform Appl 20: 79–87

    Google Scholar 

  • Bianco L, Mingozzi A, Ricciardelli S (1993) The travelling salesman problem with cumulative costs. Networks 23(2): 81–91

    Article  Google Scholar 

  • Blum A, Chalasani P, Coppersmith D, Pulleyblank B, Raghavan P, Sudan M (1994) The minimum latency problem. In: Proceedings of the twenty-sixth annual symposium on theory of computing (STOC), pp 163–171

  • Bräysy O, Gendreau M (2005) Vehicle routing problem with time windows, part II: metaheuristics. Transport Sci 39: 119–139

    Article  Google Scholar 

  • Chaudhuri K, Godfrey B, Rao S, Talwar K (2003) Paths, trees, and minimum latency tours. In: Proceedings of 44th symposium on foundations of computer science (FOCS), pp 36–45

  • Christofides N (1976) Worst-case analysis of a new heuristic for the travelling salesman problem. Technical Report 388, Graduate School of Industrial Administration, Carnegie-Mellon University, Pittsburgh, PA

  • Cordone R, Wolfler Calvo R (2001) A heuristic for the vehicle routing problem with time windows. J Heuristics 7: 107–129

    Article  Google Scholar 

  • Crispim J, Brandao J (2001) Reactive tabu search and variable neighborhood descent applied to the vehicle routing problem with backhauls. In: MIC 2001—Proceedings of the metaheuristics international conference, Porto, pp 631–636

  • Feo TA, Resende MGC (1989) A probabilistic heuristic for a computationally difficult set covering problem. Oper Res Lett 8: 67–71

    Article  Google Scholar 

  • Feo TA, Resende MGC (1995) Greedy randomized adaptive search procedures. J Global Optim 6: 109–133

    Article  Google Scholar 

  • Fischetti M, Laporte G, Martello S (1993) The delivery man problem and cumulative matroids. Oper Res 41(6): 1055–1064

    Article  Google Scholar 

  • García A, Jodrá P, Tejel J (2002) A note on the traveling repairman problem. Networks 40(1): 27–31

    Article  Google Scholar 

  • Hansen P, Mladenović N (1999) An introduction to variable neighborhood search. In: Voss S, Martello S, Osman I, Roucairol C (eds) Metaheuristics: advances and trends in local search paradigms for optimization. Kluwer, Boston, pp 433–458

    Google Scholar 

  • Hansen P, Mladenović N (2001a) Industrial applications of the variable neighbourhood search metaheuristic. In: Decisions and control in management science. Kluwer, Boston, pp 261–274

  • Hansen P, Mladenović N (2001b) Variable neighbourhood search: principles and applications. Eur J Oper Res 130: 449–467

    Article  Google Scholar 

  • Kontoravdis GA, Bard JF (1995) A GRASP for the vehicle routing problem with time windows. INFORMS J Comput 7: 10–23

    Article  Google Scholar 

  • Mladenović N, Hansen P (1997) Variable neighbourhood search. Comput Oper Res 24: 1097–1100

    Article  Google Scholar 

  • Méndez-Díaz I, Zabala P, Lucena A (2008) A new formulation for the traveling deliveryman problem. Discrete Appl Math 156(17): 3223–3237

    Article  Google Scholar 

  • Ngeuveu SU, Prins C, Wolfler Calvo R (2010) An effective memetic algorithm for the cumulative capacitated vehicle routing problem. Comput OR 37(11): 1877–1885

    Article  Google Scholar 

  • Ribeiro CC, Vianna DS (2003) A GRASP/VND heuristic for the phylogeny problem using a new neighborhood structure. Technical report, Department of Computer Science, Catholic U. of Rio de Janeiro, Rio de Janeiro, Brazil

  • Sarubbi J, Luna H (2007) A new flow formulation for the minimum latency problem. In: International network optimization conference (INOC), Spa, Belgium

  • Simchi-Levi D, Berman O (1991) Minimizing the total flow time of n jobs on a network. IIE Trans 23(3): 236–244

    Article  Google Scholar 

  • Wu BY (2000) Polynomial time algorithms for some minimum latency problems. Inform Process Lett 75: 225–229

    Article  Google Scholar 

  • Wu BY, Huang Z-N, Zhan F-J (2004) Exact algorithms for the minimum latency problem. Inform Process Lett 92: 303–309

    Article  Google Scholar 

Download references

Open Access

This article is distributed under the terms of the Creative Commons Attribution Noncommercial License which permits any noncommercial use, distribution, and reproduction in any medium, provided the original author(s) and source are credited.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Kenneth Sörensen.

Rights and permissions

Open Access This is an open access article distributed under the terms of the Creative Commons Attribution Noncommercial License (https://creativecommons.org/licenses/by-nc/2.0), which permits any noncommercial use, distribution, and reproduction in any medium, provided the original author(s) and source are credited.

Reprints and Permissions

About this article

Cite this article

Salehipour, A., Sörensen, K., Goos, P. et al. Efficient GRASP+VND and GRASP+VNS metaheuristics for the traveling repairman problem. 4OR-Q J Oper Res 9, 189–209 (2011). https://doi.org/10.1007/s10288-011-0153-0

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10288-011-0153-0

Keywords

  • Traveling repairman problem
  • Minimum latency problem
  • Variable neighborhood descent
  • Variable neighborhood search
  • GRASP

MSC classification (2000)

  • 90C27
  • 90C59