An effective hybrid search algorithm for the multiple traveling repairman problem with profits
From MaRDI portal
Publication:2171586
DOI10.1016/j.ejor.2022.04.007OpenAlexW3212550642WikidataQ114184285 ScholiaQ114184285MaRDI QIDQ2171586
Jintong Ren, Jin-Kao Hao, Feng Wu, Zhang-Hua Fu
Publication date: 9 September 2022
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2111.05017
heuristicscombinatorial optimizationvariable neighborhood searcharc-based crossovermultiple traveling repairman problem with profits
Related Items (3)
Memetic search for the minmax multiple traveling salesman problem with single and multiple depots ⋮ A fast tri-individual memetic search approach for the distance-based critical node problem ⋮ A hybrid genetic algorithm for the Hamiltonian p‐median problem
Cites Work
- Heuristics for the traveling repairman problem with profits
- A two-phase metaheuristic for the cumulative capacitated vehicle routing problem
- Solving the team orienteering problem with cutting planes
- Configuration landscape analysis and backbone guided local search. I: Satisfiability and maximum satisfiability
- A memetic algorithm for the team orienteering problem
- An effective memetic algorithm for the cumulative capacitated vehicle routing problem
- The team orienteering problem
- Variable neighborhood search
- An adaptive large neighborhood search heuristic for the cumulative capacitated vehicle routing problem
- Solving the traveling repairman problem with profits: a novel variable neighborhood search approach
- Hybrid evolutionary search for the traveling repairman problem with profits
- An adaptive large neighborhood search approach for multiple traveling repairman problem with profits
- An effective PSO-inspired algorithm for the team orienteering problem
- A guided local search metaheuristic for the team orienteering problem
- An exact algorithm for team orienteering problems
- A branch-and-cut-and-price algorithm for the cumulative capacitated vehicle routing problem
- A hybrid adaptive large neighborhood search heuristic for the team orienteering problem
- The Team Orienteering Problem: Formulations and Branch-Cut and Price
- A branch‐and‐cut algorithm for the Team Orienteering Problem
- The Vehicle Routing Problem with Time Windows Part II: Genetic Search
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
This page was built for publication: An effective hybrid search algorithm for the multiple traveling repairman problem with profits
