In this paper the robust capacitated international sourcing problem (RoCIS) is approached. It 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 based on tabu search memory strategies. The process consists of three stages: 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 construction of the neighborhood and the local search. Experimental evidence shows that the improved solution outperforms the best solutions reported for six of the considered instances, increases by 13.6% the number of best solutions found and reduces by 34% the deviation of the best solution found, respect to the best algorithm solution reported. © 2010 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Huacuja, H. F., González-Velarde, J. L., & Valdez, G. C. (2010). Improved tabu solution for the robust capacitated international sourcing problem (RoCIS). Studies in Computational Intelligence, 312, 333–347. https://doi.org/10.1007/978-3-642-15111-8_21
Mendeley helps you to discover research relevant for your work.