An efficient evolutionary algorithm for the orienteering problem
type: Item
instance of: scholarly article
title: An efficient evolutionary algorithm for the orienteering problem
zbMATH Open document ID: 1391.90521
author: Gorka Kobeaga
author: María Merino
author: José A. Lozano
published in: Computers \& Operations Research
publication date: 2018-07-11T00:00:00Z
full work available at URL: http://hdl.handle.net/20.500.11824/730
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90B06
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 6901528
zbMATH Keywords: orienteering problem
zbMATH Keywords: travelling salesperson problem
zbMATH Keywords: evolutionary algorithm
zbMATH Keywords: combinatorial optimization
describes a project that uses: TSPLIB
describes a project that uses: Concorde
MaRDI profile type: Publication
OpenAlex ID: W2750785333
cites work: A branch-and-cut algorithm for the orienteering arc routing problem
cites work: The prize collecting traveling salesman problem
cites work: A memetic algorithm for the team orienteering problem
cites work: A fast and effective heuristic for the orienteering problem
cites work: Solving the Orienteering Problem through Branch-and-Cut
cites work: A tabu search heuristic for the undirected selective travelling salesman problem
cites work: The orienteering problem
cites work: Orienteering problem: a survey of recent variants, solution approaches and applications
cites work: Q4038710
cites work: A Memetic-GRASP Algorithm for the Solution of the Orienteering Problem
cites work: Evolution-inspired local improvement algorithm solving orienteering problem
cites work: TSPLIB—A Traveling Salesman Problem Library
cites work: The effective application of a new approach to the generalized orienteering problem
cites work: A TABU search heuristic for the team orienteering problem
cites work: Heuristics for the multi-period orienteering problem with multiple time windows
cites work: The orienteering problem: a survey
cites work: Iterated local search for the team orienteering problem with time windows
cites work: Using artificial neural networks to solve the orienteering problem
cites work: Using a Genetic Algorithm to Solve the Generalized Orienteering Problem
DOI: 10.1016/J.COR.2017.09.003
description: scientific article; zbMATH DE number 6901528