A GRASP/Path‐Relinking algorithm for the traveling purchaser problem
From MaRDI portal
Publication:6056165
DOI10.1111/itor.12985OpenAlexW3177079419MaRDI QIDQ6056165
Camilo Gómez, Unnamed Author, Unnamed Author
Publication date: 29 September 2023
Published in: International Transactions in Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1111/itor.12985
Related Items (2)
A metaheuristic for the double traveling salesman problem with partial last‐in‐first‐out loading constraints ⋮ An enhanced GRASP approach for the index tracking problem
Cites Work
- A hybrid data mining GRASP with path-relinking
- A heuristic approach for the travelling purchaser problem
- Models for a traveling purchaser problem with additional side-constraints
- Solving the asymmetric traveling purchaser problem
- A reactive GRASP and path relinking for a combined production-distribution problem
- Transgenetic algorithm for the traveling purchaser problem
- Travelling purchaser problem
- A branch and bound algorithm for the traveling purchaser problem
- Improved heuristics for the traveling purchaser problem.
- The traveling purchaser problem and its variants
- An experimental analysis of evolutionary heuristics for the biobjective traveling purchaser problem
- Approximate algorithms for the travelling purchaser problem
- Heuristics for the traveling purchaser problem
- Dynamic tabu search strategies for the traveling purchaser problem
- Ant colony optimization for the traveling purchaser problem
- Integer Programming Formulation of Traveling Salesman Problems
- A Branch-and-Cut Algorithm for the Undirected Traveling Purchaser Problem
- Randomized heuristics for the family traveling salesperson problem
- Metaheuristics based on decision hierarchies for the traveling purchaser problem
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
- A GRASP with path‐relinking and restarts heuristic for the prize‐collecting generalized minimum spanning tree problem
- Unnamed Item
This page was built for publication: A GRASP/Path‐Relinking algorithm for the traveling purchaser problem
