Abstract
Combinatorial optimization problems are embedded in dynamic environments, spanning many domains. As these problem environments may change repeatedly, agents that attempt to solve problems in such environments must be able to adapt to each change that occurs. We present a technique for a Tabu Search-based meta-heuristic agent that collaborates with a truth maintenance agent to maximize reuse of generated solutions that may become partially inconsistent when a change occurs in the problem space. By allowing the truth maintenance agent to perform partial plan repairs, we hope to mitigate the effect that a change has on the performance of the planning agent. Such a system is discussed in a global logistics scheduling program. The performance of our approach is analyzed with respect to a dynamic constrained vehicle routing problem. Our results show that partial plan repairs increase the stability of solutions in dynamic domains.
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
Hoffman, Padberg, Manfred.: Combinatorial and Integer Optimization. George Mason University, New York University (2005)
Simon, H.: The Sciences of the Artificial. MIT Press, Cambridge (1996)
Eracar, Y.A.: Negotiating Solutions to Multiobjective Combinatorial Optimization Problems. PhD thesis, Northeastern University (2005)
Taylor, D., Weber, B., Bojduj, B.: A tabu search framework for dynamic combinatorial optimization problems. In: Proceedings, Integrated Design and Process Technology, IDPT-2006, Society for Design and Process Science, pp. 663–668 (2006)
Glover, F., Laguna, M.: Tabu search. In: Reeves, C.R. (ed.) Modern Heuristic Techniques for Combinatorial Problems, pp. 71–140. Blackwell Scientific Publishers, Oxford, England (1993)
Glover, F., Laguna, M.: Tabu Search. Kluwer Academic Publishers, Norwell, Massachusetts (1997)
Bojduj, B., Weber, B., Taylor, D.: A framework for truth maintenance in multi-agent systems. In: Proceedings of Operations Research 2006 (to appear)
Bertel, S., Freksa, C., Vrachliotis, G.: Aspectualize and conquer in architectural design. In: Gero, J.S., Tversky, B., Knight, T. (eds.) Visual and Spatial Reasoning in Design III, Key Centre of Design Computing and Cognition; University of Sydney, pp. 255–279 (2004)
Anderson, J.: Cognitive psychology and its implications. Worth Publishers (2005)
Nibecker, J., Taylor, D., Chambers, R., Larsen, H., Cudworth, K., Warren, C., Porczak, M., Pohl, J.: Transway: Planning with the tabu search algorithm. In: InterSymp-2006, Focus Symposium on Advances in Intelligent Software Systems, Baden-Baden, Germany, August, 2006, pp. 63–86 (2006)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Bojduj, B., Taylor, D., Kurfess, F. (2007). Optimization of Dynamic Combinatorial Optimization Problems Through Truth Maintenance. In: Okuno, H.G., Ali, M. (eds) New Trends in Applied Artificial Intelligence. IEA/AIE 2007. Lecture Notes in Computer Science(), vol 4570. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73325-6_98
Download citation
DOI: https://doi.org/10.1007/978-3-540-73325-6_98
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-73322-5
Online ISBN: 978-3-540-73325-6
eBook Packages: Computer ScienceComputer Science (R0)