The multi-depot \(k\)-traveling repairman problem
type: Item
instance of: scholarly article
title: The multi-depot \(k\)-traveling repairman problem
zbMATH Open document ID: 1505.90098
author: Sara Khodaparasti
author: Iris Martínez-Salazar
author: Samuel Nucamendi-Guillén
author: Maria Elena Bruni
published in: Optimization Letters
publication date: 2022-11-01T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 7610287
zbMATH Keywords: multi-depot \(k\)-traveling repairmen problem
zbMATH Keywords: latency
zbMATH Keywords: genetic algorithm
describes a project that uses: Gurobi
MaRDI profile type: Publication
full work available at URL: s11590-021-01845-7
OpenAlex ID: W4210624921
cites work: The traveling salesman problem with cumulative costs
cites work: The minimum latency problem
cites work: A hybrid reactive GRASP heuristic for the risk-averse \(k\)-traveling repairman problem with profits
cites work: A scatter search for the periodic capacitated arc routing problem
cites work: A tabu search heuristic for periodic and multi-depot vehicle routing problems
cites work: The k -traveling repairmen problem
cites work: The Delivery Man Problem and Cumulative Matroids
cites work: A Modeling Language for Mathematical Programming
cites work: Improved approximation algorithms for cumulative VRP with stochastic demands
cites work: Cumulative Vehicle Routing Problem: A Column Generation Approach
cites work: A heuristic for cumulative vehicle routing using column generation
cites work: Approximating the \(k\)-traveling repairman problem with repair times
cites work: A two-phase metaheuristic for the cumulative capacitated vehicle routing problem
cites work: A POPMUSIC approach for the multi-depot cumulative capacitated vehicle routing problem
cites work: Time‐dependent traveling salesman problem–the deliveryman case
cites work: Branch-and-price-and-cut for the multiple traveling repairman problem with distance constraints
cites work: A branch-and-cut-and-price algorithm for the cumulative capacitated vehicle routing problem
cites work: A new formulation for the traveling deliveryman problem
cites work: Variable neighborhood search for the travelling deliveryman problem
cites work: An effective memetic algorithm for the cumulative capacitated vehicle routing problem
cites work: Heuristic solution approaches for the cumulative capacitated vehicle routing problem
cites work: A simple and effective evolutionary algorithm for the vehicle routing problem
cites work: An adaptive large neighborhood search heuristic for the cumulative capacitated vehicle routing problem
cites work: A multistart iterated local search for the multitrip cumulative capacitated vehicle routing problem
cites work: Mathematical formulations and exact algorithm for the multitrip cumulative capacitated single-vehicle routing problem
cites work: Efficient GRASP+VND and GRASP+VNS metaheuristics for the traveling repairman problem
cites work: Ambulance routing for disaster response with patient groups
cites work: A Hybrid Genetic Algorithm for Multidepot and Periodic Vehicle Routing Problems
cites work: A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time-windows
DOI: 10.1007/S11590-021-01845-7
description: scientific article; zbMATH DE number 7610287