Abstract
This paper introduces a genetic algorithm enhanced with a trap escaping strategy derived from the dual information presented as discrete Lagrange multipliers. When the genetic algorithm is trapped into a local optima, the Discrete Lagrange Multiplier method is called for the best individual found. The information provided by the Lagrangian method is unified, in the form of recombination, with the one from the last population of the genetic algorithm. Then the genetic algorithm is restarted with this new improved configuration. The proposed algorithm is tested on the winner determination problem. Experiments are conducted using instances generated with the combinatorial auction test suite system. The results show that the method is viable.
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
Mahfoud, S.: Niching methods for genetic algorithms. University of Illinois at Urbana-Champaign (1996)
Starkweather, T., Whitley, D., Mathias, K.: Optimization using distributed genetic algorithms. In: Schwefel, H.P., Männer, R. (eds.) PPSN 1990. LNCS, vol. 496, pp. 176–185. Springer, Heidelberg (1991)
Cobb, H.G., Grefenstette, J.F.: Genetic algorithms for tracking changing environments. In: Proceedings of the 5th International Conference on Genetic Algorithms, pp. 523–530 (1993)
Fukunaga, A.S.: Restart scheduling for genetic algorithms. In: Eiben, A.E., Bäck, T., Schoenauer, M., Schwefel, H.-P. (eds.) PPSN 1998. LNCS, vol. 1498, pp. 357–366. Springer, Heidelberg (1998)
Gomes, C., Selman, B., Crato, N., Kautz, H.: Heavy-tailed phenomena in satisfiability and constraint satisfaction problems. Journal of Automated Reasoning 24(1/2), 67–100 (2000)
Raidl, G.: A Unified View on Hybrid Metaheuristics. In: Almeida, F., Blesa Aguilera, M.J., Blum, C., Moreno Vega, J.M., Pérez Pérez, M., Roli, A., Sampels, M. (eds.) HM 2006. LNCS, vol. 4030, pp. 1–12. Springer, Heidelberg (2006)
Raidl, G., Puchinger, J.: Combining (Integer) Linear Programming Techniques and Metaheuristics for Combinatorial Optimization. In: Hybrid Metaheuristics, An Emerging Approach to Optimization. SCI, vol. 114, pp. 31–62 (2008)
Pfeiffer, J., Rothlauf, F.: Analysis of Greedy Heuristics and Weight-Coded EAs for Multidimensional Knapsack Problems and Multi-Unit Combinatorial Auctions. In: Proceedings of the 9th Conference on Genetic and Evolutionary Computation, p. 1529 (2007)
Hansen, P., Brimberg, J., Mladenović, N., Urosević, D.: Primal-dual variable neighbourhood search for the simple plant location problem. INFORMS Journal on Computing 19(4), 552–564 (2007)
Raschip, M., Croitoru, C.: A New Primal-Dual Genetic Algorithm: Case Study for the Winner Determination Problem. In: Cowling, P., Merz, P. (eds.) EvoCOP 2010. LNCS, vol. 6022, pp. 252–263. Springer, Heidelberg (2010)
Leitner, M., Raidl, G.: Lagrangian Decomposition, Metaheuristics, and Hybrid Approaches for the Design of the Last Mile in Fiber Optic Networks. In: Blesa, M.J., Blum, C., Cotta, C., Fernández, A.J., Gallardo, J.E., Roli, A., Sampels, M. (eds.) HM 2008. LNCS, vol. 5296, pp. 158–174. Springer, Heidelberg (2008)
de Vries, S., Vohra, R.: Combinatorial auctions: A survey. INFORMS Journal on Computing 15(3), 284–309 (2000)
Rassenti, S.J., Smith, V.L., Bulfin, R.L.: A combinatorial auction mechanism for airport time slot allocation. Bell J. of Economics 13, 402–417 (1982)
Rothkopf, M., Pekec, A., Harstad, R.: Computationally manageable combinatorial auctions. Management Science 44(8), 1131–1147 (1998)
Wah, B.W., Chen, Y.X.: Constrained genetic algorithms and their applications in nonlinear constrained optimization. In: Evolutionary Optimization. International Series in Operations Research and Management Science, vol. 48(IV), pp. 253–275 (2003)
Sandholm, T., Suri, S., Gilpin, A., Levine, D.: CABoB: a fast optimal algorithm for combinatorial auctions. In: Proceedings of the International Joint Conferences on Artifficial Intelligence, pp. 1102–1108 (2001)
Nisan, N.: Bidding and Allocation in Combinatorial Auctions. In: Proceedings of the ACM Conference on Electronic Commerce, pp. 1–12 (2000)
Hoos, H.H., Boutilier, C.: Solving combinatorial auctions using stochastic local search. In: Proceedings of the 17th National Conference on Artifficial Intelligence, pp. 22–29 (2000)
Guo, Y., Lim, A., Rodrigues, B., Zhu, Y.: Heuristics for a bidding problem. Computers and Operations Research 33(8), 2179–2188 (2006)
Boughaci, D., Benhamou, B., Drias, H.: A memetic algorithm for the optimal winner determination problem. Soft Computing 13(8-9), 905–917 (2009)
Guo, Y., Lim, A., Rodrigues, B., Tang, J.: Using a Lagrangian Heuristic for a Combinatorial Auction Problem. In: Proceedings of the 17th IEEE International Conference on Tools with Artificial Intelligence, pp. 99–103 (2005)
Shang, Y., Wah, B.: A Discrete Lagrangian-Based Global-Search Method for Solving Satisfiability Problems. Journal of Global Optimization 12, 61–99 (1998)
Leyton-Brown, K., Pearson, M., Shoham, Y.: Towards a Universal Test Suite for Combinatorial Auction Algorithms. In: Proceedings of the ACM Conference on Electronic Commerce, pp. 66–76 (2000)
Berkelaar, M.: ”lp_solve - version 5.5”, Eindhoven University of Technology, http://sourceforge.net/projects/lpsolve/
Zurel, E., Nisan, N.: An Efficient Approximate Allocation Algorithm for Combinatorial Auctions. In: Proceedings of the ACM Conference on Electronic Commerce, pp. 125–136 (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Raschip, M., Croitoru, C. (2011). A Genetic Algorithm Hybridized with the Discrete Lagrangian Method for Trap Escaping. In: Coello, C.A.C. (eds) Learning and Intelligent Optimization. LION 2011. Lecture Notes in Computer Science, vol 6683. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-25566-3_26
Download citation
DOI: https://doi.org/10.1007/978-3-642-25566-3_26
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-25565-6
Online ISBN: 978-3-642-25566-3
eBook Packages: Computer ScienceComputer Science (R0)