Abstract
This paper presents various graphical techniques developed by us to support research of some very hard combinatorial optimization (CO) problems. Thanks to increased efficiency of algorithms and high power of modern PC, we are able to make visualization of the solution space and search trajectories, which in order, allows us to analyze and design modern approximate approaches quickly running towards good solution. We provide unique graphic representations of solution spaces and search trajectories of modern approximate algorithms dedicated for the job-shop problem, the one of the hardest problem in CO.
Chapter PDF
Similar content being viewed by others
References
Błażewicz, J., Domschke, W., Pesh, E.: The job shop scheduling problem. Conventional and new solution techniques. European Journal of Operational Research 93, 1–33 (1996)
Knuth, D.E.: The art of computer programming. Addison-Wesley Longman, Amsterdam (1997)
Van Laarhoven, P., Aarts, E., Lenstra, J.K.: Job-shop scheduling by simulated annealing. Operations Research 40, 113–125 (1992)
Nowicki, E., Smutnicki, C.: A fast tabu search algorithm for the job-shop problem. Management Science 42, 797–813 (1996)
Nowicki, E., Smutnicki, C.: Some new ideas in TS for job-shop scheduling. In: Rego, C., Alidaee, B. (eds.) Adaptive Memory and Evolution: Tabu Search and Scatter Search, Kluwer Academic Publisher, Dordrecht (2004) (print in), Technical Report 50/2001
Siedlecki, W., Siedlecka, K., Sklansky, J.: An overview of mapping techniques for exloratory pattern analysis. Pattern Recognition 25, 411–429 (1988)
Home page of E. Taillard, http://www.eivd.ch/ina/collaborateurs/etd/default.htm
Vaessens, R., Aarts, E., Lenstra, J.K.: Job shop scheduling by local search. INFORMS Journal of Computing 8, 303–317 (1996)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Nowicki, E., Smutnicki, C. (2004). 2D and 3D Representations of Solution Spaces for CO Problems. In: Bubak, M., van Albada, G.D., Sloot, P.M.A., Dongarra, J. (eds) Computational Science - ICCS 2004. ICCS 2004. Lecture Notes in Computer Science, vol 3037. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24687-9_61
Download citation
DOI: https://doi.org/10.1007/978-3-540-24687-9_61
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22115-9
Online ISBN: 978-3-540-24687-9
eBook Packages: Springer Book Archive