Abstract
In this paper the linear ordering problem with cumulative costs (LOPCC) is approached. Currently, a tabu search and a GRASP with evolutionary path-relinking have been proposed to solve it. We propose a new pseudo-parallel strategy based on cellular computing that can be applied to the design of heuristic algorithms. In this paper the proposed strategy was applied on a scatter search algorithm to show the feasibility of our approach. A series of computational experiments of the designed cellular algorithm were carried out to analyze the performance reached with the proposed approach versus its monolithic counterpart. Additionally, several parameters used were analyzed to determine their effect on the performance of the designed algorithms. We consider that the new pseudo-parallel approach used in this work can be applied to design high performance heuristic algorithms.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Benvenuto, N., Carnevale, G., Tomasin, S.: Optimum power control and ordering in sic receivers for uplink cdma systems. In: IEEE-ICC 2005 (2005)
Bertacco, L., Brunetta, L., Fischetti, M.: The linear ordering problem with cumulative costs. Eur. J. Oper. Res. 189(3), 1345–1357 (2008)
Duarte, A., Laguna, M., Marti, R.: Tabu search for the linear ordering problem with cumulative costs. Computational Optimization and Applications 48, 697–715 (2011)
Duarte, A., Marti, R., Alvarez, A., Angel Bello, F.: Metaheuristics for the linear ordering problem with cumulative costs. European Journal of Operational Research 216(2), 270–277 (2012)
Glover, F.: Heuristics for integer programming using surrogate constraints. Decis. Sci. 8, 156–166 (1977)
Laguna, M., Marti, R., Campos, V.: Intensification and diversification with elite tabu search solutions for the linear ordering problem. Computers & Operations Research 26(12), 1217–1230 (1999), doi:10.1016/s0305-0548(98)00104-x
Prais, M., Ribeiro, C.: Parameter variation in grasp procedures. Investigacion Operativa 9, 1–20 (2000)
Reinelt, G.: The linear ordering problem: Algorithms and applications. Mathematical Social Sciences 14(2), 199–200 (1985)
Resende, M., Riberio, C.: Greedy Randomized Adaptive Search Procedures: Advances, Hybridizations, and Applications. In: Handbook of Metaheurictics, vol. 146, pp. 283–319. Springer (2010)
Righini, G.: A branch-and-bound algorithm for the linear ordering problem with cumulative costs. European Journal of Operational Research 186, 965–971 (2008)
Teran-Villanueva, J., Fraire-Huacuja, H., Duarte, A., Pazos-Rangel, R., Carpio Valadez, J.M., Puga-Soberanes, H.J.: Improving Iterated Local Search Solution for the Linear Ordering Problem with Cumulative Costs (LOPCC). In: Setchi, R., Jordanov, I., Howlett, R.J., Jain, L.C. (eds.) KES 2010, Part II. LNCS, vol. 6277, Springer, Heidelberg (2010)
Teran-Villanueva, J., Pazos-Rangel, R., Martinez, J.A., Lopez-Loces, M.C., Zamarron-Escobar, D., Pineda, A.: Hybrid grasp with composite local search and path-relinking for the linear ordering problem with cumulative costs. International Journal of Combinatorial Optimization Problems and Informatics 3(1), 21–30 (2012)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Terán-Villanueva, J.D., Huacuja, H.J.F., Valadez, J.M.C., Pazos R., R.A., Soberanes, H.J.P., Flores, J.A.M. (2013). Experimental Study of a New Algorithm-Design-Framework Based on Cellular Computing. In: Castillo, O., Melin, P., Kacprzyk, J. (eds) Recent Advances on Hybrid Intelligent Systems. Studies in Computational Intelligence, vol 451. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-33021-6_39
Download citation
DOI: https://doi.org/10.1007/978-3-642-33021-6_39
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-33020-9
Online ISBN: 978-3-642-33021-6
eBook Packages: EngineeringEngineering (R0)