Abstract
Cooperative strategies and reactive search are very promising techniques for solving hard optimization problems, since they reduce human intervention required to set up a method when the resolution of an unknown instance is needed. However, as far as we know, a hybrid between both techniques has not yet been proposed in the literature. In this work, we show how reactive search principles can be incorporated into a simple rule-driven centralised cooperative strategy. The proposed method has been tested on the Uncapacitated Single Allocation p-Hub Median Problem, obtaining promising results.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bouthillier, A.L., Crainic, T.G.: A cooperative parallel meta-heuristic for the vehicle routing problem with time windows. Computers & Operations Research 32(7), 1685–1708 (2005)
Battiti, R., Brunato, M., Mascia, F.: Reactive Search and Intelligent Optimization. Operations Research/Computer Science Interfaces, vol. 45. Springer, New York (2008)
Pelta, D., Sancho-Royo, A., Cruz, C., Verdegay, J.L.: Using memory and fuzzy rules in a co-operative multi-thread strategy for optimization. Information Sciences 176(13), 1849–1868 (2006)
Dorigo, M., Stützle, T.: Ant Colony Optimization. The MIT Press/Bradford Books, Cambridge (2004)
Kennedy, J., Eberhart, R.C.: Swarm intelligence. Morgan Kaufmann Publishers Inc., San Francisco (2001)
Burke, E., Kendall, G., Newall, J., Hart, E., Ross, P., Schulenburg, S.: Hyper-Heuristics: An Emerging Direction in Modern Search Technology. In: Handbook of Metaheuristics, pp. 457–474 (2003)
Battiti, R., Tecchiolli, G.: The reactive tabu search. ORSA Journal on Computing 6(2), 126–140 (1994)
Cruz, C., Pelta, D.: Soft computing and cooperative strategies for optimization. Applied Soft Computing 9(1), 30–38 (2009)
Ferber, J.: Multi-Agent Systems: An Introduction to Distributed Artificial Intelligence. Addison-Wesley Longman Publishing Co., Inc., Boston (1999)
Battiti, R., Mascia, F.: Reactive local search for maximum clique: A new implementation. Technical Report DIT-07-018, Department of Information and Communication Technology, University of Trento (May 2007)
Campbell, J., Ernst, A., Krishnamoorthy, M.: Hub location problems. In: Facility Location: Applications and Theory, pp. 373–406. Springer, Heidelberg (2002)
O’Kelly, M., Morton, E.: A quadratic integer program for the location of interacting hub facilities. European Journal of Operational Research 32(3), 393–404 (1987)
Beasley, J.: Obtaining test problems via internet. Journal of Global Optimization 8(4), 429–433 (1996)
Kratica, J., Stanimirović, Z., Dušcan Tovšić, V.F.: Two genetic algorithms for solving the uncapacitated single allocation p-hub median problem. European Journal of Operational Research 182(1), 15–28 (2007)
Henderson, D., Jacobson, S., Johnson, A.: The Theory and Practice of Simulated Annealing. In: Handbook of Metaheuristics. International Series in Operations Research & Management Science, vol. 57, pp. 287–320. Kluwer, Norwell (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Masegosa, A.D., Mascia, F., Pelta, D., Brunato, M. (2009). Cooperative Strategies and Reactive Search: A Hybrid Model Proposal. In: Stützle, T. (eds) Learning and Intelligent Optimization. LION 2009. Lecture Notes in Computer Science, vol 5851. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-11169-3_15
Download citation
DOI: https://doi.org/10.1007/978-3-642-11169-3_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-11168-6
Online ISBN: 978-3-642-11169-3
eBook Packages: Computer ScienceComputer Science (R0)