Ant colony optimization for the traveling purchaser problem

Authors:
Boris Bontoux;Dominique Feillet
Affiliations:
Laboratoire d'Informatique d'Avignon, Université d'Avignon et des Pays de Vaucluse, 339, chemin des Meinajaries, Agroparc-B.P. 1228, F-84911 Avignon Cedex 9, France;Laboratoire d'Informatique d'Avignon, Université d'Avignon et des Pays de Vaucluse, 339, chemin des Meinajaries, Agroparc-B.P. 1228, F-84911 Avignon Cedex 9, France
Venue:
Computers and Operations Research
Year:
2008

Citing 7
Cited 8

Improved solutions for the traveling purchaser problem

Computers and Operations Research
Heuristics for the traveling purchaser problem

Computers and Operations Research
Improved heuristics for the traveling purchaser problem

Computers and Operations Research
Ant Colony Optimization

Ant Colony Optimization
An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems

Networks
Traveling Salesman Problems with Profits

Transportation Science
Ant system: optimization by a colony of cooperating agents

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics

Transgenetic algorithm: a new evolutionary perspective for heuristics design

Proceedings of the 9th annual conference companion on Genetic and evolutionary computation
A Memetic Algorithm with a large neighborhood crossover operator for the Generalized Traveling Salesman Problem

Computers and Operations Research
A heuristics method based on ant colony optimisation for redundancy allocation problems

International Journal of Computer Applications in Technology
The multiple traveling purchaser problem for maximizing system's reliability with budget constraints

Expert Systems with Applications: An International Journal
Cuckoo Optimization Algorithm

Applied Soft Computing
Ant colony algorithm for traffic signal timing optimization

Advances in Engineering Software
An autonomic bio-inspired algorithm for wireless sensor network self-organization and efficient routing

Journal of Network and Computer Applications
The traveling purchaser problem, with multiple stacks and deliveries: A branch-and-cut approach

Computers and Operations Research

Quantified Score

Hi-index	0.01

Visualization

Abstract

The traveling purchaser problem (TPP) is a generalization of the traveling salesman problem where markets have to be visited to collect a set of commodities. Each market sells a number of commodities at a known price. The TPP consists in selecting a subset of markets purchasing every product, while minimizing the routing costs and the purchase costs. In this work, we address the solution of the TPP with an ant colony optimization procedure. We combine it with a local-search scheme exploring a new neighborhood structure. This procedure is evaluated on a set of benchmark instances from the literature and permits to improve most of the best-known solutions.