Transgenetic algorithm for the traveling purchaser problem
From MaRDI portal
Publication:1042095
DOI10.1016/j.ejor.2008.10.027zbMath1176.90495OpenAlexW1975241606MaRDI QIDQ1042095
L. B. Bagi, Elizabeth Ferreira Gouvêa Goldbarg, Marco Cesar Goldbarg
Publication date: 7 December 2009
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2008.10.027
Related Items
The bi-objective traveling purchaser problem with deliveries ⋮ The traveling purchaser problem, with multiple stacks and deliveries: a branch-and-cut approach ⋮ The traveling purchaser problem with fast service option ⋮ A GRASP/Path‐Relinking algorithm for the traveling purchaser problem ⋮ The traveling purchaser problem and its variants ⋮ An experimental analysis of evolutionary heuristics for the biobjective traveling purchaser problem ⋮ Transgenetic algorithm for the traveling purchaser problem
Cites Work
- Unnamed Item
- A heuristic approach for the travelling purchaser problem
- Transgenetic algorithm for the traveling purchaser problem
- Travelling purchaser problem
- A branch and bound algorithm for the traveling purchaser problem
- Improved solutions for the traveling purchaser problem.
- Improved heuristics for the 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
- Fast Algorithms for Geometric Traveling Salesman Problems
- An Analysis of Several Heuristics for the Traveling Salesman Problem
- Computer Solutions of the Traveling Salesman Problem
- Sequencing many jobs on a multi-purpose facility
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
- An endosymbiotic evolutionary algorithm for optimization
