An adaptive memory matheuristic for the set orienteering problem

DOI10.1016/J.EJOR.2023.02.008MaRDI QIDQ6112827zbMATH OpenOpenAlexFDO

Authors Michael Dontas, Georgios Sideris, Eleftherios Manousakis, Emmanouil E. Zachariadis

Publication date 10 July 2023

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.02.008

zbMATH Keywords

matheuristicroutingset orienteeringtransportation

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 fast string searching algorithm
• A random-key genetic algorithm for the generalized traveling salesman problem
• Adaptive memory programming: a unified view of metaheuristics
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem
• An effective implementation of the Lin-Kernighan traveling salesman heuristic
• An infeasible space exploring matheuristic for the production routing problem
• Generalized Travelling Salesman Problem Through n Sets Of Nodes: An Integer Programming Approach
• GLNS: an effective large neighborhood search heuristic for the generalized traveling salesman problem
• Integrated distribution and loading planning via a compact metaheuristic algorithm
• Local search for the undirected capacitated arc routing problem with profits
• POPMUSIC for the travelling salesman problem
• Procedures for travelling salesman problems with additional constraints
• Randomized heuristics for the family traveling salesperson problem
• Solving the equality generalized traveling salesman problem using the Lin-Kernighan-Helsgaun algorithm
• Solving the family traveling salesman problem
• Solving the Orienteering Problem through Branch-and-Cut
• Solving the vehicle routing problem with adaptive memory programming methodology
• Some Applications of the Generalized Travelling Salesman Problem
• The clustered orienteering problem
• The orienteering problem: a survey
• The set orienteering problem
• The symmetric clustered traveling salesman problem
• Variable neighborhood search for the set orienteering problem and its application to other orienteering problem variants

Cited in

(4)

• The capacitated family traveling salesperson problem
• An effective hybrid evolutionary algorithm for the clustered orienteering problem
• The set team orienteering problem
• Branch-price-and-cut algorithms for the team orienteering problem with interval-varying profits

This page was built for publication: An adaptive memory matheuristic for the set orienteering problem

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