Solving the traveling repairman problem with profits: a novel variable neighborhood search approach
type: Item
instance of: scholarly article
title: Solving the traveling repairman problem with profits: a novel variable neighborhood search approach
zbMATH Open document ID: 1456.90138
author: Jun Pei
author: Dragan Urošević
author: Nenad Mladenović
author: Jack Brimberg
author: Xinbao Liu
published in: Information Sciences
publication date: 2021-03-18T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 7324528
zbMATH Keywords: combinatorial optimization
zbMATH Keywords: traveling repairman problem with profits
zbMATH Keywords: heuristics
zbMATH Keywords: variable neighborhood search
MaRDI profile type: Publication
full work available at URL: j.ins.2019.08.017
OpenAlex ID: W2965762698
cites work: The complexity of the travelling repairman problem
cites work: The risk-averse traveling repairman problem with profits
cites work: Profit-based latency problems on the line
cites work: Heuristics for the traveling repairman problem with profits
cites work: An improved approximation ratio for the minimum latency problem
cites work: The traveling salesman problem and its variations.
cites work: New variable neighbourhood search based 0-1 MIP heuristics
cites work: Variable neighborhood search: basics and variants
cites work: The traveling salesman problem: An overview of exact and approximate algorithms
cites work: Hybrid evolutionary search for the traveling repairman problem with profits
cites work: Variable neighborhood search
cites work: An efficient General Variable Neighborhood Search for large Travelling Salesman Problem with Time Windows
cites work: Variable neighborhood search for the travelling deliveryman problem
cites work: Multi-goal motion planning using traveling salesman problem in belief space
cites work: A hyper-heuristic based artificial bee colony algorithm for \(k\)-interconnected multi-depot multi-traveling salesman problem
cites work: Continuous Variable Neighborhood Search (C-VNS) for Solving Systems of Nonlinear Equations
cites work: Exact algorithms for the minimum latency problem
cites work: A hybrid ant colony optimization algorithm for a multi-objective vehicle routing problem with flexible time windows
DOI: 10.1016/J.INS.2019.08.017
description: scientific article; zbMATH DE number 7324528