A Hyper-Heuristic Method for the Traveling Repairman Problem with Profits
- 2 March 2023
- book chapter
- Published by Springer Nature
- p. 501-514
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- A Multi-start Iterated Local Search Algorithm with Variable Degree of Perturbation for the Covering Salesman Problem2018
- A GRASP with iterated local search for the traveling repairman problem with profitsComputers & Industrial Engineering, 2017
- Two metaheuristic approaches for the multiple traveling salesperson problemApplied Soft Computing, 2015
- Hyper-heuristics: a survey of the state of the artJournal of the Operational Research Society, 2013
- Heuristics for the traveling repairman problem with profitsComputers & Operations Research, 2013
- The orienteering problem: A surveyEuropean Journal of Operational Research, 2011
- Hyper-Heuristics: An Emerging Direction in Modern Search Technology2006
- Traveling Salesman Problems with ProfitsTransportation Science, 2005
- A Hyperheuristic Approach to Scheduling a Sales Summit2001
- An improved approximation ratio for the minimum latency problemMathematical Programming, 1998