Showing papers by "Éric D. Taillard published in 2000"
TL;DR: It is found that most traditional and some recent heuristics give poor results when the number of facilities to locate is large and that Variable Neighbourhood search gives consistently best results, on average, in moderate computing time.
Abstract: The multisource Weber problem is to locate simultaneouslym facilities in the Euclidean plane to minimize the total transportation cost for satisfying the demand ofn fixed users, each supplied from its closest facility. Many heuristics have been proposed for this problem, as well as a few exact algorithms. Heuristics are needed to solve quickly large problems and to provide good initial solutions for exact algorithms. We compare various heuristics, i.e., alternative location-allocation (Cooper 1964), projection (Bongartz et al. 1994), Tabu search (Brimberg and Mladenovic 1996a),p-Median plus Weber (Hansen et al. 1996), Genetic search and several versions of Variable Neighbourhood search. Based on empirical tests that are reported, it is found that most traditional and some recent heuristics give poor results when the number of facilities to locate is large and that Variable Neighbourhood search gives consistently best results, on average, in moderate computing time.
254 citations
01 Jan 2000
TL;DR: This article introduces Ant Systems, a meta-heuristic based on an ant foraging metaphor that has been somewhat generalized by adding a “Queen” process in charge of coordinating classical “Ant” processes.
Abstract: This article introduces Ant Systems, a meta-heuristic based on an ant foraging metaphor. The presentation of Ant Systems has been somewhat generalized by adding a “Queen” process in charge of coordinating classical “Ant” processes, so that recent Ant Systems can be naturally included while remaining close to the metaphor. To illustrate how Ant Systems are practically implemented, a number of applications to the quadratic assignment problem are reviewed.
8 citations