2D multi-objective placement algorithm for free-form components

Proceedings of the ASME International Design Engineering Technical Conferences and Computers and Information in Engineering Conference 2009, DETC2009

Volumn 5, Issue PART A, 2010, Pages 239-248

  Jacquenot, Guillaume ^a,b   Bennis, Fouad ^a   Maisonneuve, Jean Jacques ^b   Wenger, Philippe ^a  

^a ECOLE CENTRALE DE NANTES   (France)

^b SIREHNA Technocampus Océan   (France)

Author keywords

[No Author keywords available]

Indexed keywords

3-D PROBLEMS; GENERIC METHOD; GLOBAL OPTIMIZER; HYBRID ALGORITHMS; MULTI OBJECTIVE; PLACEMENT ALGORITHM; PLACEMENT PROBLEMS; SEARCH SPACES; SEPARATION ALGORITHMS; TEST CASE;

FLIGHT DYNAMICS; MULTIOBJECTIVE OPTIMIZATION;

GENETIC ALGORITHMS;

EID: 77953699262     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1115/DETC2009-87603     Document Type: Conference Paper

References (32)

1. Aladahalli, C., Cagan, J., and Shimada, K., 2007. "Objective function effect based pattern search - theoretical framework inspired by 3D component layout". Journal of Mechanical Design, 129(3), Mar., pp. 243-254. (Pubitemid 46736231)
2. Wäscher, G., Haußner, H., and Schumann, H., 2007. "An improved typology of cutting and packing problems". European Journal of Operational Research, 183, Dec., pp. 1109-1130.
3. Dyckhoff, H., 1990. "A typology of cutting and packing problems". European Journal of Operational Research, 44(2), Jan., pp. 145-159.
4. Kellerer, H., Pferschy, U., and Pisinger, D., 2004. Knapsack Problems. Springer, Berlin, Germany.
5. Carlier, J., Clautiaux, F., and Moukrim A., 2007. "New reduction procedures and lower bounds for the two-dimensional bin packing problem with fixed orientation". Computers & Operations Research, 34(8), Aug., pp. 2223-2250.
6. Egeblad, J., Nielsen, B. K., and Odgaard, A., 2007. "Fast neighborhood search for two- and three-dimensional nesting problems". European Journal of Operational Research, 127(3), Dec., pp. 1249-1266.
7. Gomes, M. A., and Oliveira, J. F., 2006. "Solving irregular strip packing problems by hybridising simulated annealing and linear programming". European Journal of Operational Research, 171(3), June, pp. 811-829.
8. Pisinger, D., 2002. "Heuristics for the container loading problem". European Journal of Operational Research, 141, pp. 382-392.
9. Drira, A., Pierreval, H., and Hajri-Gabouj, S., 2007. "Facility layout problems: A survey". Annual Reviews in Control, 31(2), pp. 255-267.
10. Egeblad, J., 2003. "Placement techniques for VLSI layout using sequence-pair legalization". Master's thesis, Department of Computer Science, University of Copenhagen, July.
11. Zhang, B., Teng, H.-F., and Shi, Y.-J., 2008. "Layout optimization of satellite module using soft computing techniques". Applied Soft Computing, 8(1), pp. 507-521.
12. Cagan, J., Shimada, K., and Yin, S., 2002. "A survey of computational approaches to three-dimensional layout problems.". Computer-Aided Design, 34(8), pp. 597-611.
13. Grignon, P. M., and Fadel, G. M., 2004. "A GA based configuration design optimization method". Journal of Mechanical Design, 126(1), Jan., pp. 6-15.
14. Aladahalli, C., Cagan, J., and Shimada, K., 2007. "Objective function effect based pattern search - an implementation for 3D component layout". Journal of Mechanical Design, 129(3), Mar., pp. 255-265. (Pubitemid 46736232)
15. Miao, Y., Fadel, G. M., and Gantovnik, V. B., 2008. "Vehicle configuration design with a packing genetic algorithm". International Journal of Heavy Vehicle Systems, 15, 12, pp. 433-448(16).
16. Tiwari, S., Fadel, G., and Fenyes, P., 2008. "A fast and efficient three dimensional compact packing algorithm for free-form objects". In Proceedings of ASME International Design Engineering & Computers and Information in Engineering Conference (ASME DETC/CIE 2008). DETC2008-50097.
17. Dong, H., Fadel, G. M., and Blouin, V. Y., 2006. "Vehicle component layout with shape morphing - an initial study". In ASME International Design Engineering Technical Conferences & Computers and Information in Engi neering Conference.
18. Tiwari, S., Fadel, G., and Gantovnik, V., 2006. "A survey of various encoding schemes and associated placement algorithms applied to packing and layout problems". In Proceedings of IDETC/CIE. ASME 2006 International Design Engineering Technical Conferences & Computers and Information in Engineering Conference.
19. Bennell, J. A., and Song, X., 2008. "A comprehensive and robust procedure for obtaining the nofit polygon using minkowski sums". Computers & Operations Research, 35(1), pp. 267-281.
20. Imamichi, T., Arahori, Y., Gim, J., Hong, S.-H., and Nagamochi, H., 2008. Removing overlaps in label layouts using multi-sphere scheme. Tech. Rep. 2008-006, Department of Applied Mathematics and Physics, Kyoto University and School of Information Technologies, University of Sydney.
21. Imamichi, T., and Nagamochi, H., 2008. "Designing algorithms with multi-sphere scheme". In ICKS '08: Proceedings of the International Conference on Informatics Education and Research for Knowledge-Circulating Society (icks 2008), IEEE Computer Society, pp. 125-130.
22. Imamichi, T., and Nagamochi, H., 2007. "A multi-sphere scheme for 2D and 3D packing problems". In SLS, pp. 207-211.
23. Imamichi, T., Yagiura, M., and Nagamochi, H., 2007. "An iterated local search algorithm based on nonlinear programming for the irregular strip packing problem". In Proceedings of the Third International Symposium on Scheduling, Tokyo, Japan, no. 9, pp. 132-137.
24. Imamichi, T., and Nagamochi, H., 2008. "Performance Analysis of a Collision Detection Algorithm of Spheres Based on Slab Partitioning". IEICE Trans Fundamentals, E91-A(9), pp. 2308-2313.
25. Agarwal, P. K., Guibas, L. J., Har-Peled, S., Rabinovitch, A., and Sharir, M., 2000. "Penetration depth of two convex polytopes in 3D". Nordic Journal of Computing, 7(3), pp. 227-240.
26. Liu, D. C., and Nocedal, J., 1989. "On the limited memory BFGS method for large scale optimization". Math. Program., 45(3), pp. 503-528.
27. Dighe, R., and Jakiela, M. J., 1996. "Solving pattern nesting problems with genetic algorithms employing task decomposition and contact detection". Evolutionary Computation, 3(3), pp. 239-266.
28. Deb, K., and Tiwari, S., 2008. "Omni-Optimizer: A generic Evolutionary Algorithm for single and multi-objective optimization". European Journal of Operational Research, 185, Mar., pp. 1062-1087.
29. Deb, K., Agrawal, S., Pratab, A., and Meyarivan, T., 2000. "A fast elitist Non-dominated Sorting Genetic Algorithm for multi-objective optimization: NSGA-II". In Proceedings of the Parallel Problem Solving from Nature VI Conference, Springer. Lecture Notes in Computer Science No. 1917, pp. 849-858.
30. Deb, K., and Agrawal, R. B., 1995. "Simulated binary crossover for continuous search space". Complex Systems, 9, pp. 115-148.
31. Hubbard, P. M., 1996. "Approximating polyhedra with spheres for time-critical collision detection". ACM Transactions on Graphics, 15(3), pp. 179-210.
32. Bradshaw, G., and O'sullivan, C., 2000. "Extracting geometric models from medieval moulding profiles for case-based reasoning.". In KES, R. J. Howlett and L. C. Jain, eds., IEEE, pp. 531-536.