An adaptive memory matheuristic for the set orienteering problem

DOI10.1016/j.ejor.2023.02.008OpenAlexW4319868504MaRDI QIDQ6112827

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

transportationroutingmatheuristicset orienteering

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Related Items (1)

The capacitated family traveling salesperson problem

Cites Work

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

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