Abstract
We present an approach that integrates a description logic based knowledge representation system into the optimization process. A description logic defines concepts, roles (properties) and object instances for relational data, which enables one to reason about complex objects and their relations. We outline a relational knapsack problem, which utilizes the knowledge base during optimization. Furthermore, we present a genetic algorithm to outline an approximate algorithm for a heuristic solution.
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
Franz Baader, Diego Calvanese, Deborah L. McGuinness, Daniele Nardi, and Peter F. Patel-Schneider, editors. The Description Logic Handbook: Theory, Implementation and Applications. Cambridge University Press, 2nd edition, 2008.
P. C. Chu and J. E. Beasley. A Genetic Algorithm for the Multidimensional Knapsack Problem. J. Heuristics, 4(1): 63–86, 1998.
José E. Gallardo, Carlos Cotta and Antonio J. Fernández. Solving the multidimensional knapsack problem using an evolutionary algorithm hybridized with branch and bound. In José Mira and José R. Álvarez, editors, IWINAC (2), volume 3562 of Lecture Notes in Computer Science, pages 21–30. Springer, 2005.
Raymond R. Hill and Chaitr Hiremath. Improving genetic algorithm convergence using problem structure and domain knowledge in multidimensional knapsack problems. International Journal of Operational Research, 1(1–2): 145–159, 2005.
Ian Horrocks, Peter F. Patel-Schneider, Harold Boley, Said Tabet, Benjamin Grosof, and Mike Dean. SWRL: A Semantic Web Rule Language Combining OWL and RuleML, May 2004.
Hans Kellerer, Ulrich Pferschy, and David Pisinger. Knapsack Problems. Springer Berlin Heidelberg, 2 2004.
Brian McBride. Jena: A Semantic Web Toolkit. IEEE Internet Computing, 6(6): 55–59, 2002.
Boris Motik, Ulrike Sattler, and Rudi Studer. Query Answering for OWL-DL with rules. J. Web Sem., 3(1): 41–60, 2005.
David Pisinger. The quadratic knapsack problem – a survey. Discrete Applied Mathematics, 155(5): 623–648, 2007.
Tugba Saraç and Aydin Sipahioglu. A genetic algorithm for the quadratic multiple knapsack problem. In Francesco Mele, Giuliana Ramella, Silvia Santillo, and Francesco Ventriglia, editors, BVAI, volume 4729 of Lecture Notes in Computer Science, pages 490–498. Springer, 2007.
Nigel Shadbolt, Tim Berners-Lee, and Wendy Hall. The Semantic Web Revisited. IEEE Intelligent Systems, 21(3): 96–101, 2006.
Evren Sirin, Bijan Parsia, Bernardo Cuenca Grau, Aditya Kalyanpur, and Yarden Katz. Pellet: A practical OWL-DL reasoner. J. Web Sem., 5(2): 51–53, 2007.
W3C. Resource Description Framework (RDF): Concepts and Abstract Syntax, Februrary 2004.
W3C. OWL 2 Web Ontology Language, October 2009.
Du Wei and Li Shuzhuo. An Artificial Intelligence Algorithm for Multi-dimensional Knapsack Problem Based on Small World Phenomenon. 2009 WRI World Congress on Computer Science and Information Engineering, pages 665–669, March 2009.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fischer, T., Ruhland, J. (2011). A Genetic Algorithm for Optimization of a Relational Knapsack Problem with Respect to a Description Logic Knowledge Base. In: Hu, B., Morasch, K., Pickl, S., Siegle, M. (eds) Operations Research Proceedings 2010. Operations Research Proceedings. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-20009-0_32
Download citation
DOI: https://doi.org/10.1007/978-3-642-20009-0_32
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-20008-3
Online ISBN: 978-3-642-20009-0
eBook Packages: Business and EconomicsBusiness and Management (R0)