An iterated local search algorithm for the traveling purchaser problem
From MaRDI portal
Cites work
- A branch and bound algorithm for the traveling purchaser problem
- A Branch-and-Cut Algorithm for the Undirected Traveling Purchaser Problem
- A branch-price-and-cut algorithm for the capacitated multiple vehicle traveling purchaser problem with unitary demand
- A GRASP/Path‐Relinking algorithm for the traveling purchaser problem
- An ILS heuristic for the ship scheduling problem: application in the oil industry
- An iterated local search algorithm for the vehicle routing problem with backhauls
- An iterated local search heuristic for the split delivery vehicle routing problem
- Ant colony optimization for the traveling purchaser problem
- Heuristics for the traveling purchaser problem
- Metaheuristics based on decision hierarchies for the traveling purchaser problem
- Solving the asymmetric traveling purchaser problem
- The family capacitated vehicle routing problem
- The family traveling salesman problem with incompatibility constraints
- The traveling purchaser problem and its variants
- The traveling purchaser problem with fast service option
- Transgenetic algorithm for the traveling purchaser problem
- Travelling purchaser problem
Cited in
(2)
This page was built for publication: An iterated local search algorithm for the traveling purchaser problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6981412)