Solving large instances of multiple traveling repairman problem with profits: A greedy hyper-heuristic approach
- 17 March 2026
- journal article
- Published by Elsevier in Computers and Electrical Engineering
- Vol. 134
Abstract
No abstract availableFunding Information
- Ministry of Environment
- Ministry of Education (2025-Glocal30-03-001)
This publication has 25 references indexed in Scilit:
- A hybrid adaptive large neighborhood search heuristic for the team orienteering problemComputers & Operations Research, 2020
- An adaptive large neighborhood search approach for multiple traveling repairman problem with profitsComputers & Operations Research, 2019
- A similarity hybrid harmony search algorithm for the Team Orienteering ProblemApplied Soft Computing, 2019
- A computational intelligence approach to improve the efficiency of repair services in the smart grid contextComputers and Electrical Engineering, 2018
- A GRASP with iterated local search for the traveling repairman problem with profitsComputers & Industrial Engineering, 2017
- An effective PSO-inspired algorithm for the team orienteering problemEuropean Journal of Operational Research, 2013
- Heuristics for the traveling repairman problem with profitsComputers & Operations Research, 2013
- An adaptive large neighborhood search heuristic for the cumulative capacitated vehicle routing problemComputers & Operations Research, 2012
- An effective memetic algorithm for the cumulative capacitated vehicle routing problemComputers & Operations Research, 2010
- A memetic algorithm for the team orienteering problem4OR, 2009