A Vitual-Force Based Swarm Algorithm for Balanced Circular Bin Packing Problems

Balanced circular bin packing problems consist in positioning a given number of weighted circles in order to minimize the radius of a circular container while satisfying equilibrium constraints. These problems are NP-hard, highly constrained and dimensional. This paper describes a swarm algorithm based on a virtual-force system in order to solve balanced circular bin packing problems. In the proposed approach, a system of forces is applied to each component allowing to take into account the constraints and minimizing the objective function using the fundamental principle of dynamics. The proposed algorithm is experimented and validated on benchmarks of various balanced circular bin packing problems with up to 300 circles. The reported results allow to assess the effectiveness of the proposed approach compared to existing results from the literature.Comment: 23 pages including reference

Development and Integration of Geometric and Optimization Algorithms for Packing and Layout Design

The research work presented in this dissertation focuses on the development and application of optimization and geometric algorithms to packing and layout optimization problems. As part of this research work, a compact packing algorithm, a physically-based shape morphing algorithm, and a general purpose constrained multi-objective optimization algorithm are proposed. The compact packing algorithm is designed to pack three-dimensional free-form objects with full rotational freedom inside an arbitrary enclosure such that the packing efficiency is maximized. The proposed compact packing algorithm can handle objects with holes or cavities and its performance does not degrade significantly with the increase in the complexity of the enclosure or the objects. It outputs the location and orientation of all the objects, the packing sequence, and the packed configuration at the end of the packing operation. An improved layout algorithm that works with arbitrary enclosure geometry is also proposed. Different layout algorithms for the SAE and ISO luggage are proposed that exploit the unique characteristics of the problem under consideration. Several heuristics to improve the performance of the packing algorithm are also proposed. The proposed compact packing algorithm is benchmarked on a wide variety of synthetic and hypothetical problems and is shown to outperform other similar approaches. The physically-based shape morphing algorithm proposed in this dissertation is specifically designed for packing and layout applications, and thus it augments the compact packing algorithm. The proposed shape morphing algorithm is based on a modified mass-spring system which is used to model the morphable object. The shape morphing algorithm mimics a quasi-physical process similar to the inflation/deflation of a balloon filled with air. The morphing algorithm starts with an initial manifold geometry and morphs it to obtain a desired volume such that the obtained geometry does not interfere with the objects surrounding it. Several modifications to the original mass-spring system and to the underlying physics that governs it are proposed to significantly speed-up the shape morphing process. Since the geometry of a morphable object continuously changes during the morphing process, most collision detection algorithms that assume the colliding objects to be rigid cannot be used efficiently. And therefore, a general-purpose surface collision detection algorithm is also proposed that works with deformable objects and does not require any preprocessing. Many industrial design problems such as packing and layout optimization are computationally expensive, and a faster optimization algorithm can reduce the number of iterations (function evaluations) required to find the satisfycing solutions. A new multi-objective optimization algorithm namely Archive-based Micro Genetic Algorithm (AMGA2) is presented in this dissertation. Improved formulation for various operators used by the AMGA2 such as diversity preservation techniques, genetic variation operators, and the selection mechanism are also proposed. The AMGA2 also borrows several concepts from mathematical sciences to improve its performance and benefits from the existing literature in evolutionary optimization. A comprehensive benchmarking and comparison of AMGA2 with other state-of-the-art optimization algorithms on a wide variety of mathematical problems gleaned from literature demonstrates the superior performance of AMGA2. Thus, the research work presented in this dissertation makes contributions to the development and application of optimization and geometric algorithms

A Comprehensive Survey on Particle Swarm Optimization Algorithm and Its Applications

Particle swarm optimization (PSO) is a heuristic global optimization method, proposed originally by Kennedy and Eberhart in 1995. It is now one of the most commonly used optimization techniques. This survey presented a comprehensive investigation of PSO. On one hand, we provided advances with PSO, including its modifications (including quantum-behaved PSO, bare-bones PSO, chaotic PSO, and fuzzy PSO), population topology (as fully connected, von Neumann, ring, star, random, etc.), hybridization (with genetic algorithm, simulated annealing, Tabu search, artificial immune system, ant colony algorithm, artificial bee colony, differential evolution, harmonic search, and biogeography-based optimization), extensions (to multiobjective, constrained, discrete, and binary optimization), theoretical analysis (parameter selection and tuning, and convergence analysis), and parallel implementation (in multicore, multiprocessor, GPU, and cloud computing forms). On the other hand, we offered a survey on applications of PSO to the following eight fields: electrical and electronic engineering, automation control systems, communication theory, operations research, mechanical engineering, fuel and energy, medicine, chemistry, and biology. It is hoped that this survey would be beneficial for the researchers studying PSO algorithms

Self Assembly Problems of Anisotropic Particles in Soft Matter.

Anisotropic building blocks assembled from colloidal particles are attractive building blocks for self-assembled materials because their complex interactions can be exploited to drive self-assembly. In this dissertation we address the self-assembly of anisotropic particles from multiple novel computational and mathematical angles. First, we accelerate algorithms for modeling systems of anisotropic particles via massively parallel GPUs. We provide a scheme for generating statistically robust pseudo-random numbers that enables GPU acceleration of Brownian and dissipative particle dynamics. We also show how rigid body integration can be accelerated on a GPU. Integrating these two algorithms into a GPU-accelerated molecular dynamics code (HOOMD-blue), make a single GPU the ideal computing environment for modeling the self-assembly of anisotropic nanoparticles. Second, we introduce a new mathematical optimization problem, filling, a hybrid of the familiar shape packing and covering problem, which can be used to model shaped particles. We study the rich mathematical structures of the solution space and provide computational methods for finding optimal solutions for polygons and convex polyhedra. We present a sequence of isosymmetric optimal filling solutions for the Platonic solids. We then consider the filling of a hyper-cone in dimensions two to eight and show the solution remains scale-invariant but dependent on dimension. Third, we study the impact of size variation, polydispersity, on the self-assembly of an anisotropic particle, the polymer-tethered nanosphere, into ordered phases. We show that the local nanoparticle packing motif, icosahedral or crystalline, determines the impact of polydispersity on energy of the system and phase transitions. We show how extensions of the Voronoi tessellation can be calculated and applied to characterize such micro-segregated phases. By applying a Voronoi tessellation, we show that properties of the individual domains can be studied as a function of system properties such as temperature and concentration. Last, we consider the thermodynamically driven self-assembly of terminal clusters of particles. We predict that clusters related to spherical codes, a mathematical sequence of points, can be synthesized via self-assembly. These anisotropic clusters can be tuned to different anisotropies via the ratio of sphere diameters and temperature. The method suggests a rich new way for assembling anisotropic building blocks.Ph.D.Applied Physics and Scientific ComputingUniversity of Michigan, Horace H. Rackham School of Graduate Studieshttp://deepblue.lib.umich.edu/bitstream/2027.42/91576/1/phillicl_1.pd

Numerical modelling of additive manufacturing process for stainless steel tension testing samples

Nowadays additive manufacturing (AM) technologies including 3D printing grow rapidly and they are expected to replace conventional subtractive manufacturing technologies to some extents. During a selective laser melting (SLM) process as one of popular AM technologies for metals, large amount of heats is required to melt metal powders, and this leads to distortions and/or shrinkages of additively manufactured parts. It is useful to predict the 3D printed parts to control unwanted distortions and shrinkages before their 3D printing. This study develops a two-phase numerical modelling and simulation process of AM process for 17-4PH stainless steel and it considers the importance of post-processing and the need for calibration to achieve a high-quality printing at the end. By using this proposed AM modelling and simulation process, optimal process parameters, material properties, and topology can be obtained to ensure a part 3D printed successfully

Proceedings of the 2018 Canadian Society for Mechanical Engineering (CSME) International Congress

Published proceedings of the 2018 Canadian Society for Mechanical Engineering (CSME) International Congress, hosted by York University, 27-30 May 2018

Tracing back the source of contamination

From the time a contaminant is detected in an observation well, the question of where and when the contaminant was introduced in the aquifer needs an answer. Many techniques have been proposed to answer this question, but virtually all of them assume that the aquifer and its dynamics are perfectly known. This work discusses a new approach for the simultaneous identification of the contaminant source location and the spatial variability of hydraulic conductivity in an aquifer which has been validated on synthetic and laboratory experiments and which is in the process of being validated on a real aquifer

Development of an Application-Oriented Approach for Two- Phase Modelling in Hydraulic Engineering

Paralleltitel: Entwicklung eines anwendungsorientierten Ansatzes für die Modellierung von Zweiphasenströmungen im Wasserba