Using a Genetic Algorithm to Solve the Generalized Orienteering Problem
From MaRDI portal
Publication:3564360
DOI10.1007/978-0-387-77778-8_12zbMath1190.90294OpenAlexW2138200410MaRDI QIDQ3564360
No author found.
Publication date: 2 June 2010
Published in: Operations Research/Computer Science Interfaces (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-0-387-77778-8_12
Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (16)
A matheuristic approach to the orienteering problem with service time dependent profits ⋮ Efficient meta-heuristics for the multi-objective time-dependent orienteering problem ⋮ Orienteering problem: a survey of recent variants, solution approaches and applications ⋮ Solving the orienteering problem with time windows via the pulse framework ⋮ Selective generalized travelling salesman problem ⋮ An efficient evolutionary algorithm for the orienteering problem ⋮ The time-dependent orienteering problem with time windows: a fast ant colony system ⋮ The orienteering problem: a survey ⋮ Variable neighborhood search to solve the generalized orienteering problem ⋮ Hybridized evolutionary local search algorithm for the team orienteering problem with time windows ⋮ Analysis of the selective traveling salesman problem with time-dependent profits ⋮ Modeling recreational systems using optimization techniques and information technologies ⋮ Tour recommendation for groups ⋮ The effective application of a new approach to the generalized orienteering problem ⋮ A Tabu search algorithm for the probabilistic orienteering problem ⋮ A fast solution method for the time-dependent orienteering problem
This page was built for publication: Using a Genetic Algorithm to Solve the Generalized Orienteering Problem
