Efficient metaheuristics for the mixed team orienteering problem with time windows

DOI10.3390/A9010006zbMath1461.90159OpenAlexW2225877659MaRDI QIDQ1736755

Konstantinos Mastakas, Charalampos Konstantopoulos, Nikolaos Vathis, Damianos Gavalas, Grammati E. Pantziou

Publication date: 26 March 2019

Published in: Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3390/a9010006

zbMATH Keywords

simulated annealingiterated local searchteam orienteering problemarc orienteering problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (1)

Arc routing problems: A review of the past, present, and future

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimization by Simulated Annealing
• A matheuristic for the team orienteering arc routing problem
• Approximation algorithms for the arc orienteering problem
• Local search for the undirected capacitated arc routing problem with profits
• The orienteering problem: a survey
• Iterated local search for the team orienteering problem with time windows
• The undirected capacitated arc routing problem with profits
• The one-period bus touring problem: Solved by an effective heuristic for the orienteering tour problem and improvement algorithm

This page was built for publication: Efficient metaheuristics for the mixed team orienteering problem with time windows