Abstract
In this paper, we consider a multi-type transshipment point location problem with multicommodity flow which aims at locating transshipment points (TPs) and determining the type for each open TP. As an extension of the classical two-stage capacitated facility location problem, our problem allows flows of commodities to move among TPs and does not impose restrictions on the number of TPs traversed by flows going from plants to customers. In order to obtain high-quality feasible solutions, we propose a clustering-based scatter search in which the seed solution generation, the diversification technique and the local search are designed using the clusters generated by a data mining technique, the K-means method. The computational results show that the scatter search performs efficiently over different kinds of instances. Moreover, the solution quality is also good since the average gaps to lower bounds range between 1 and 3%.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Alumur S., Kara B. Y. (2008) Network hub location problems: The state of the art. European Journal of Operational Research 190(1): 1–21
Contreras I. A., Díaz J. A. (2008) Scatter search for the single source capacitated facility location problem. Annals of Operations Research 157: 73–89
Cornuejols G., Sridharan R., Thizy J. M. (1991) A comparison of heuristics and relaxations for the capacitated plant location problem. European Journal of Operational Research 50: 280–297
Crainic T. G., Dejax P., Delorme L. (1989) Models for multimode multicommodity location problems with interdepot balancing requirements. Annals of Operations Research 18(1): 277–302
Elhedhli S., Gzara F. (2008) Integrated design of supply chain networks with three echelons, multiple commodities and technology selection. IIE Transactions 40: 31–44
Esnaf Ş., Küçükdeniz T. (2009) A fuzzy clustering-based hybrid method for a multi-facility location problem. Journal of Intelligent Manufacturing 20: 259–265
Gendron B., Crainic T. G. (1997) A parallel branch-and-bound algorithm for multicommodity location with balancing requirements. Computers and Operations Research 24(9): 829–847
Gendron B., Potvin J. Y., Soriano P. (2003) A tabu search with slope scaling for the multicommodity capacitated location problem with balancing requirements. Annals of Operations Research 122(1–4): 193–217
Glover F. (1977) Heuristics for integer programming using surrogate constraints. Decision Science 8: 156–166
Jayaraman V., Pirkul H. (2001) Planning and coordination of production and distribution facilities for multiple commodities. European Journal of Operational Research 133: 394–408
Kamber M., Han J. (2006) Data mining: Concepts and techniques (2nd ed.). Morgan Kaufmann, Massachusetts
Keskin B. B., Üster H. (2007a) A scatter search-based heuristic to locate capacitated transshipment points. Computers and Operations Research 34(10): 3112–3125
Keskin B. B., Üster H. (2007b) Meta-heuristic approaches with memory and evolution for a multi-product production/distribution system design problem. European Journal of Operational Research 182(2): 663–682
Klose A. (1999) An LP-based heuristic for two-stage capacitated facility location problems. The journal of the Operational Research Society 50(2): 157–166
Klose A. (2000) A Lagrangean relax-and-cut approach for the two-stage capacitated facility location problem. European Journal of Operational Research 126(2): 185–198
Klose A., Drexl A. (2005) Facility location models for distribution system design. European Journal of Operational Research 162(1): 4–29
Laguna M., Martí R. (2003) Scatter search: Methodology and implementations in C. Kluwer Academic, Boston
Li J., Wang K., Xu L. (2009a) Chameleon based on clustering feature tree and its application in customer segmentation. Annals of Operations Research 168: 225–245
Li J., Chu F., Prins C. (2009b) Lower and upper bounds for a capacitated plant location problem with multicommodity flow. Computers and Operations Research 36(11): 3019–3030
Liao K., Guo D. (2008) A clustering-based approach to the capacitated facility location problem. Transactions in GIS 12(3): 323–339
Liu, Q., Xu, J. (2010). A study on facility location-allocation problem in mixed environment of randomness and fuzziness. Journal of Intelligent Manufacturing. (In press).
Martí R., Pelegrín B. (1999) Applying Lagrangian relaxation to the resolution of two-stage location problems. Annals of Operations Research 86: 179–198
Mazzola J. B., Neebe A. W. (1999) Lagrangian-relaxation-based solution procedures for a multiproduct capacitated facility location problem with choice of facility type. European Journal of Operational Research 115(2): 285–299
Pirkul H. (1996) Production, transportation, and distribution planning in a multi-commodity tri-echelon system. Transportation Science 30: 291–302
Pirkul H., Jayaraman V. (1998) A multi-commodity, multi-plant, capacitated facility location problem: Formulation and efficient heuristic solution. Computers and Operations Research 25(10): 869–878
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Li, J., Prins, C. & Chu, F. A scatter search for a multi-type transshipment point location problem with multicommodity flow. J Intell Manuf 23, 1103–1117 (2012). https://doi.org/10.1007/s10845-010-0403-6
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10845-010-0403-6