Improving the intensification and diversification balance of the tabu solution for the Robust Capacitated International Sourcing problem (RoCIS)

• Autorzy: Huacuja H. J. F. , González-Velarde J. R. , Valdez G. C.
• Języki publikacji: EN

Abstrakty

EN

This paper addresses the robust capacitated international sourcing problem (RoCIS), which consists of selecting a subset of suppliers with finite capacity, from an available set of potential suppliers internationally located. This problem was introduced by González-Velarde and Laguna in [1], where they propose a deterministic solution method based on tabu search memory strategies. The pro cess consists of three steps: build an initial solution, create a neighborhood of promising solutions and perform a local search in the neighborhood. In this work we propose improving the construction of the initial solution, the cons truction of the neighborhood, the local search, and the intensification and diversification balance. Experimental evidence shows that the improved tabu solution with diver sification outperforms the best solutions reported for six of the instances considered, increases by 18% the number of best solutions found and reduces by 44% the deviation of the best solution found, respect to the best algorithm reported.

Słowa kluczowe

EN

RoCis; heuristic approach; optimization; initial solution; tabu search; memory strategies

• Wydawca: Łukasiewicz Industrial Research Institute for Automation and Measurements PIAP
• Czasopismo: Journal of Automation Mobile Robotics and Intelligent Systems
• Rocznik: 2010
• Tom: Vol. 4, No. 4
• Strony: 64--73
• Opis fizyczny: Bibliogr. 18 poz., rys.

Twórcy

autor

Huacuja H. J. F.

autor

González-Velarde J. R.

autor

Valdez G. C.

• Instituto Tecnológico de Ciudad Madero. 1° de Mayo y Sor Juana I. de la Cruz S/N, Ciudad Madero Tamaulipas, México CP. 89440

Bibliografia

• [1] González-Velarde J.L., Laguna M., “A Benders-based heuristic for the robust capacitated international sourcing problem. IIE Transactions, vol. 36, 2004, pp. 11251133.
• [2] Jucker J.V., Carlson R.C., “The Simple Plant-Location Problem under Uncertainty. Operations Research , vol. 24, no. 6, 1976, pp. 1045-1055.
• [3] Hodder J.E., Jucker J.V., “Plant Location Modeling for the Multinational Firm”. In: Proceedings of the Academy of International Business Conference on the Asia-Pacific Dimension of International Business , Honolulu, Decem-ber 1982, pp. 248-258.
• [4] Hodder J.E., Jucker J.V., “A Simple Plant-Location Model for Quantity-Setting Firms subject to Price Uncertainty”, European Journal of Operational Research , vol. 21, 1985.
• [5] Haug P.A., “Multiple-Period, Mixed-Integer-Programming Model for Multinational Facility Location”, Journal of Management , vol. 11, no.3, 1985, pp. 83-96.
• [6] Louveaux F.V., Peters D., “A dual-based procedure for stochastic facility location”, Operations Research , vol. 40, no. 3, 1992, pp. 564-573.
• [7] Gutiérrez G.J., Kouvelis P., “A Robustness Approach to International Sourcing”, Annals of Operations Research , vol. 59, 1995, pp. 165-193.
• [8] Kouvelis P., Yu G., Robust Discrete Optimization and its Applications, Dordrecht: Kluwer Academic Publishers, 1997.
• [9] González-Velarde J.L., Martí R., “Adaptive Memory Programming for the Robust Capacitated International Sourcing Problem”, Computers and Operations Research, vol. 35, no. 3, 2008, pp. 797-806.
• [10] Glover F., Laguna M., Tabu Search , Kluwer Academic Publishers, 1997.
• [11] Mitchell J.E., Borchers B., “Solving linear ordering problems with a combined interior point/simplex cutting plane algorithm”. In: H. L. Frenk et al. , editor, High Performance Optimization , Kluwer Academic Publishers, Dordrecht, The Netherlands, 2000, pp. 349-366.
• [12] Merz P., Freisleben B., “Fitness landscapes and memetic algorithm design”. In: D. Corne, M. Dorigo, and F. Glover, editors, New Ideas in Optimization , McGraw-Hill, London, 1999, pp. 245-260.
• [13] Boese K. D., Models for Iterative Global Optimization. PhD thesis, University of California, Computer Science Department, Los Angeles, CA, USA, 1996.
• [14] Stutzle T., Hoos H.H., MAX-MIN Ant System. Future Generation Computer Systems , vol. 16(8), 2000, pp. 889-914.
• [15] AngelE., Zissimopoulos V., “On the classification of NPcomplete problems in terms of their correlation coefficient”. Discrete AppliedMathematics , no. 99, 2000, pp. 261-277.
• [16] Stadler P.F., Schnabl W., “The landscape of the travelling salesman problem”, Physics Letters A , 161, 1992, pp. 337-344.
• [17] Angel E., Zissimopoulos V., “Autocorrelation coefficient for the graph bipartitioning problem”, Theoretical Computer Science , no. 191 1998, pp. 229-243.
• [18] Weinberger E. D., “Correlated and uncorrelated fitness landscapes and how to tell the difference”, Biological Cybernetics, no. 63, 1990, pp. 325-336.