An effective hybrid evolutionary algorithm for the clustered orienteering problem

DOI10.1016/J.EJOR.2023.08.006MaRDI QIDQ6555127zbMATH OpenFDO

Authors Qinghua Wu, Mu He, Jin-Kao Hao, Yongliang Lu

Publication date 14 June 2024

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.EJOR.2023.08.006

zbMATH Keywords

clustered orienteering problemheuristicshybrid evolutionary algorithmreinforcement learningtabu search

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites work

• A biased random-key genetic algorithm for the set orienteering problem
• A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem
• A fast and effective heuristic for the orienteering problem
• A Gentle Introduction to Memetic Algorithms
• A greedy randomized adaptive search procedure for the orienteering problem with hotel selection
• A hybrid evolutionary algorithm for the capacitated minimum spanning tree problem
• A hybrid evolutionary search for the generalized quadratic multiple knapsack problem
• A matheuristic approach to the orienteering problem with service time dependent profits
• A memetic algorithm for the orienteering problem with hotel selection
• A tabu search algorithm for the probabilistic orienteering problem
• A two-stage approach to the orienteering problem with stochastic weights
• An adaptive memory matheuristic for the set orienteering problem
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem
• Effective metaheuristic algorithms for the minimum differential dispersion problem
• Exact algorithms for the clustered vehicle routing problem
• Hashing vectors for tabu search
• scientific article; zbMATH DE number 5829047 (Why is no real title available?)
• Hybrid dynamic programming with bounding algorithm for the multi-profit orienteering problem
• Orienteering problem: a survey of recent variants, solution approaches and applications
• Reinforcement learning based tabu search for the minimum load coloring problem
• Simulation-based optimisation for stochastic maintenance routing in an offshore wind farm
• The clustered orienteering problem
• The clustered team orienteering problem
• The multi-visit team orienteering problem with precedence constraints
• The orienteering problem
• The orienteering problem with stochastic travel and service times
• The Orienteering Problem with Time Windows
• The orienteering problem: a survey
• The set orienteering problem
• The team orienteering problem
• Variable neighborhood search for the set orienteering problem and its application to other orienteering problem variants

Cited in

(2)

• Branch-price-and-cut algorithms for the team orienteering problem with interval-varying profits
• An effective multi-level memetic search with neighborhood reduction for the clustered team orienteering problem

This page was built for publication: An effective hybrid evolutionary algorithm for the clustered orienteering problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6555127)