The effective application of a new approach to the generalized orienteering problem

DOI10.1007/s10732-009-9104-8zbMath1187.90078OpenAlexW1980328733MaRDI QIDQ972648

John Silberholz, Bruce L. Golden

Publication date: 21 May 2010

Published in: Journal of Heuristics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10732-009-9104-8

zbMATH Keywords

heuristicsgeneralized orienteering problem

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10)

Related Items

A matheuristic approach to the orienteering problem with service time dependent profits ⋮ Boosting ant colony optimization via solution prediction and machine learning ⋮ Orienteering problem: a survey of recent variants, solution approaches and applications ⋮ Selective generalized travelling salesman problem ⋮ An efficient evolutionary algorithm for the orienteering problem ⋮ Trip planning for visitors in a service system with capacity constraints ⋮ Variable neighborhood search to solve the generalized orienteering problem ⋮ Hybridized evolutionary local search algorithm for the team orienteering problem with time windows ⋮ Hybrid genetic algorithm for undirected traveling salesman problems with profits ⋮ A survey of the standard location-routing problem

Uses Software

• TSPLIB

Cites Work

• A fast and effective heuristic for the orienteering problem
• A tabu search heuristic for the undirected selective travelling salesman problem
• Using a Genetic Algorithm to Solve the Generalized Orienteering Problem
• The orienteering problem
• TSPLIB—A Traveling Salesman Problem Library
• Solving the Orienteering Problem through Branch-and-Cut

This page was built for publication: The effective application of a new approach to the generalized orienteering problem