Abstract
The Spatial Packaging Problem (SPP) aims to solve a mixture of the 3D Packing Problem (3DPP) and the 3D Pipe-Routing Problem. The main feature that distinguishes the SPP from the traditional 3DPP is the interconnections that exist between its components. The SPP is more challenging because the shape and dimensions of the interconnections are unknown, and must be determined as part of the solution. In this paper, we propose a relaxation, a constraint programming model and a search heuristic to solve the SPP. We relax the SPP by using taxicab geometry and model it as a constraint satisfaction problem, then solve it by using a search heuristic based on interconnection volumes. The proposed approach has been evaluated on a challenging benchmark that reflects a range of aerospace and commercial applications varying in number of components and interconnections. The preliminary results show the effectiveness and efficiency of the proposed approach.
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
Notes
References
Beldiceanu, N., Contejean, E.: Introducing global constraints in chip. Math. Comput. Model. 20(12), 97–123 (1994)
Cagan, J., Clark, R., Dastidar, P., Szykman, S., Weisser, P.: HVAC CAD layout tools: a case study of university/industry collaboration. In: Proceedings of the ASME 1996 Design Engineering Technical Conferences and Computers in Engineering Conference (1996)
Christodoulou, S.E., Ellinas, G.: Pipe routing through ant colony optimization. J. Infrastruct. Syst. 16(2), 149–159 (2010)
Crainic, T., Perboli, G., Tadei, R.: Recent advances in multi-dimensionalpacking problems (2012). http://www.intechopen.com/books/new-technologies-trends-innovations-and-research/recent-advances-in-multi-dimensional-packing-problems
Delgado, A., Jensen, R.M., Janstrup, K., Rose, T.H., Andersen, K.H.: A constraint programming model for fast optimal stowage of container vessel bays. Eur. J. Oper. Res. 220(1), 251–261 (2012)
Drumheller, M.: Constraint-based design of optimal transport elements. In: Proceedings of the Seventh ACM Symposium on Solid Modeling and Applications, pp. 401–412. ACM (2002)
Dyckhoff, H.: A typology of cutting and packing problems. Eur. J. Oper. Res. 44(2), 145–159 (1990)
Fan, X., Lin, Y., Ji, Z.: The ant colony optimization for ship pipe route design in 3D space. In: The Sixth World Congress on Intelligent Control and Automation, WCICA 2006, vol. 1, pp. 3103–3108 (2006)
Hamedani, P.K., Hessabi, S., Sarbazi-Azad, H., Jerger, N.E.: Exploration of temperature constraints for thermal aware mapping of 3D networks on chip. In: 2012 20th Euromicro International Conference on Parallel, Distributed and Network-Based Processing (PDP), pp. 499–506. IEEE (2012)
Jia, X., Williams, R.: A packing algorithm for particles of arbitrary shapes. Powder Technol. 120(3), 175–186 (2001)
Karaboga, D., Basturk, B.: A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm. J. Glob. Optim. 39(3), 459–471 (2007)
Krause, E.F.: Taxicab Geometry: An Adventure in Non-Euclidean Geometry. Courier Corporation, London (2012)
Laporte, G.: The vehicle routing problem: an overview of exact and approximate algorithms. Eur. J. Oper. Res. 59(3), 345–358 (1992)
Lengauer, T.: Combinatorial Algorithms for Integrated Circuit Layout. Springer Science & Business Media, New York (2012)
Lodi, A., Martello, S., Monaci, M.: Two-dimensional packing problems: a survey. Eur. J. Oper. Res. 141(2), 241–252 (2002)
Park, J.H., Storch, R.L.: Pipe-routing algorithm development: case study of a ship engine room design. Expert Syst. Appl. 23(3), 299–309 (2002)
Park, V., Corson, M.: A highly adaptive distributed routing algorithm for mobile wireless networks. In: INFOCOM 1997: Proceedings of the IEEE Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution, vol. 3, pp. 1405–1413, April 1997
Perron, L.: Operations research and constraint programming at Google. In: Lee, J. (ed.) CP 2011. LNCS, vol. 6876, p. 2. Springer, Heidelberg (2011)
Ren, T., Zhu, Z.L., Dimirovski, G.M., Gao, Z.H., Sun, X.H., Yu, H.: A new pipe routing method for aero-engines based on genetic algorithm. Proc. Inst. Mech. Eng. Part G J. Aerosp. Eng. 228(3), 424–434 (2014)
Thantulage, G.I.: Ant colony optimization based simulation of 3D automatic hose/pipe routing. Ph.D. thesis, Brunel University School of Engineering and Design Ph.D. theses (2009)
Toth, P., Vigo, D.: Models, relaxations and exact approaches for the capacitated vehicle routing problem. Discrete Appl. Math. 123(1), 487–512 (2002)
Van der Velden, C., Bil, C., Yu, X., Smith, A.: An intelligent system for automatic layout routing in aerospace design. Innovations Syst. Softw. Eng. 3(2), 117–128 (2007)
Wäscher, G., Haußner, H., Schumann, H.: An improved typology of cutting and packing problems. Eur. J. Oper. Res. 183(3), 1109–1130 (2007)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this paper
Cite this paper
Sakti, A., Zeidner, L., Hadzic, T., Rock, B.S., Quartarone, G. (2016). Constraint Programming Approach for Spatial Packaging Problem. In: Quimper, CG. (eds) Integration of AI and OR Techniques in Constraint Programming. CPAIOR 2016. Lecture Notes in Computer Science(), vol 9676. Springer, Cham. https://doi.org/10.1007/978-3-319-33954-2_23
Download citation
DOI: https://doi.org/10.1007/978-3-319-33954-2_23
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-33953-5
Online ISBN: 978-3-319-33954-2
eBook Packages: Computer ScienceComputer Science (R0)