Solving the traveling repairman problem with profits: a novel variable neighborhood search approach

DOI10.1016/j.ins.2019.08.017zbMath1456.90138OpenAlexW2965762698MaRDI QIDQ1999008

Dragan Urošević, Jun Pei, Jack Brimberg, Xin-Bao Liu, Nenad Mladenović

Publication date: 18 March 2021

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2019.08.017

zbMATH Keywords

heuristicscombinatorial optimizationvariable neighborhood searchtraveling repairman problem with profits

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (10)

A general variable neighborhood search algorithm for a parallel-machine scheduling problem considering machine health conditions and preventive maintenance ⋮ A logic-based Benders decomposition method for the multi-trip traveling repairman problem with drones ⋮ An effective hybrid search algorithm for the multiple traveling repairman problem with profits ⋮ Dynamic resource allocation and collaborative scheduling in R\&D and manufacturing processes of high-end equipment with budget constraint ⋮ A variable neighborhood search algorithm for an integrated physician planning and scheduling problem ⋮ Physician scheduling problem in mobile cabin hospitals of China during Covid-19 outbreak ⋮ Variable Neighborhood Programming as a Tool of Machine Learning ⋮ Revenue maximization of Internet of things provider using variable neighbourhood search ⋮ Parallel iterative solution-based Tabu search for the obnoxious \(p\)-median problem ⋮ On solving the order processing in picking workstations

Cites Work

• Heuristics for the traveling repairman problem with profits
• Exact algorithms for the minimum latency problem
• Profit-based latency problems on the line
• The traveling salesman problem: An overview of exact and approximate algorithms
• An improved approximation ratio for the minimum latency problem
• Variable neighborhood search
• Variable neighborhood search: basics and variants
• Variable neighborhood search for the travelling deliveryman problem
• A hyper-heuristic based artificial bee colony algorithm for \(k\)-interconnected multi-depot multi-traveling salesman problem
• Multi-goal motion planning using traveling salesman problem in belief space
• A hybrid ant colony optimization algorithm for a multi-objective vehicle routing problem with flexible time windows
• Hybrid evolutionary search for the traveling repairman problem with profits
• The risk-averse traveling repairman problem with profits
• The traveling salesman problem and its variations.
• The complexity of the travelling repairman problem
• Continuous Variable Neighborhood Search (C-VNS) for Solving Systems of Nonlinear Equations
• New variable neighbourhood search based 0-1 MIP heuristics
• An efficient General Variable Neighborhood Search for large Travelling Salesman Problem with Time Windows

This page was built for publication: Solving the traveling repairman problem with profits: a novel variable neighborhood search approach