A scatter search-based heuristic to locate capacitated transshipment points

A scatter search-based heuristic to locate capacitated transshipment points

0.00 Avg rating0 Votes
Article ID: iaor20082908
Country: United Kingdom
Volume: 34
Issue: 10
Start Page Number: 3112
End Page Number: 3125
Publication Date: Oct 2007
Journal: Computers and Operations Research
Authors: ,
Keywords: heuristics
Abstract:

We consider a fixed charge two-stage location problem in which a given number of intermediate transshipment points are to be located between the supply plants and the customer locations. Both plants and transshipment points are capacitated. Scatter search is a population-based heuristic that has been applied to several combinatorial optimization problems. We develop an efficient scatter search-based heuristic approach with hybrid improvements including local search and path-relinking routines. Computational results demonstrate the effectiveness of the heuristic even for realistic problems with larger instances and tighter capacities.

Reviews

Required fields are marked *. Your email address will not be published.