Ant colony optimization for the traveling purchaser problem
From MaRDI portal
Publication:2384913
DOI10.1016/j.cor.2006.03.023zbMath1141.90036OpenAlexW2064935422MaRDI QIDQ2384913
Boris Bontoux, Dominique Feillet
Publication date: 10 October 2007
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2006.03.023
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Methods of reduced gradient type (90C52)
Related Items (16)
The bi-objective traveling purchaser problem with deliveries ⋮ The traveling purchaser problem, with multiple stacks and deliveries: a branch-and-cut approach ⋮ Intersection multi-objective optimization on signal setting and lane assignment ⋮ Imperialist competitive algorithm with dynamic parameter adaptation using fuzzy logic applied to the optimization of mathematical functions ⋮ The traveling purchaser problem with fast service option ⋮ A GRASP/Path‐Relinking algorithm for the traveling purchaser problem ⋮ The traveling purchaser problem with stochastic prices: exact and approximate algorithms ⋮ Ant colony algorithm for traffic signal timing optimization ⋮ Coordinating Particle Swarm Optimization, Ant Colony Optimization and K-Opt Algorithm for Traveling Salesman Problem ⋮ Colonial competitive algorithm ⋮ Integrated optimal scheduling of repair crew and relief vehicle after disaster ⋮ The traveling purchaser problem and its variants ⋮ An experimental analysis of evolutionary heuristics for the biobjective traveling purchaser problem ⋮ A memetic algorithm with a large neighborhood crossover operator for the generalized traveling salesman problem ⋮ Models for a traveling purchaser problem with additional side-constraints ⋮ Transgenetic algorithm for the traveling purchaser problem
Cites Work
- Unnamed Item
- Unnamed Item
- A heuristic approach for the travelling purchaser problem
- Travelling purchaser problem
- A branch and bound algorithm for the traveling purchaser problem
- An efficient composite heuristic for the symmetric generalized traveling salesman 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
- A Branch-and-Cut Algorithm for the Undirected Traveling Purchaser Problem
- Ants can colour graphs
- An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems
- Computer Solutions of the Traveling Salesman Problem
This page was built for publication: Ant colony optimization for the traveling purchaser problem
