Volume 37, Number 3, August 1999

SPECIAL ISSUE
METAHEURISTICS FOR LOCATION AND ROUTING PROBLEMS

Editorial

H. Delmaire, J. A. Díaz, E. Fernández and M. Ortega
Reactive Grasp and TABU Search Based Heuristics for the Single Source Capacitated Plant Location Problem

H. M. Ghaziri
A Neural Heuristic for the Multisource Weber Problem

S. Hanafi, A. Freville and P. Vaca
Muicipal solid Waste Collection: an Effective Data Structure for Solving the Sectorization Problem with Local Search Methods

B. Gendron, J-Y Potvin and P. Soriano
TABU Search with Exact Neighbor Evaluation for Multicommodity Location with Balancing Requirements

J-M. Bourjolly, D. Tomiuk and G. H. M. Kapantow
Using Simulated Annealing to Minimize the Cost of Centralized Telecommunications Networks

J. Homberger and H. Gehring
Two Evolutionary Metaheuristics for the Vehicle Routing Problem with Time Windows

I-M. Chao, B. Golden and E. Wasil
A Computational Study of a New Heuristic for the Site-Dependent Vehicle Routing Problem

CONTRIBUTED PAPER

O. Ekin, P. L. Hammer, a. Kogan and P. Winter
Distance-Based Classification Methods

 


Copyright 1992-2007 University of Toronto Press Incorporated except where otherwise noted. For guidelines on use of material on this site see Legal Notice. Every effort has been made to contact copyright holders of material included in this site. If your article appears here without your permission, please let us know and we will remove it. Contact Anne Marie Corrigan.