In this paper, the effects of container size on the porosity of random loose packing of mono size particles have been investigated using an Event Dynamics (ED) based model. Simultaneous effects of square container walls on particles packing and their order are also investigated. Our simulation results indicate higher container size will increase the total packing factor and high density regions...

Abstract The minimal convex hulls of disks problem is to find such arrangements circular in the plane that minimize length hull boundary. mixed-integer non-linear programming model, named [17], works only for small moderate-sized problems. Here we propose a polylithic framework big instances by combining following algorithms and models: (i) A fast disk-packing algorithm based on Voronoi diagram...

The structure of aggregates formed due to DNA interaction with dipalmitoylphosphatidylcholine (DPPC) in presence of Ca and Zn is examined using smallangle synchrotron X-ray diffraction (SAXD) and small-angle neutron scattering (SANS). SAXD detected two structures: L condensed lamellar phase and L lamellar phase with DNA strands intercalated between the adjacent lipid bilayers, without regular p...

The two dimensional orthogonal rectangular strip packing problem is a common NPhard optimisation problem whereby a set of rectangular shapes must be placed on a fixed width stock sheet with infinite length in such a way that wastage is minimised and material utilisation is maximised. The bidirectional best-fit heuristic is a deterministic approach which has previously been shown to outperform e...

This paper introduces a new tabu search algorithm for a strip packing problem. It integrates several key features: A consistentneighborhood, a fitness function including problem knowledge, and a di-versification based on the history of the search. The neighborhood only considers valid, sometimes partial, packings. The fitness function incor-porates measures related to the empty spac...

A fast and new heuristic recursive algorithm to find a minimum height for two-dimensional strip rectangular packing problem is presented. This algorithm is mainly based on heuristic strategies and a recursive structure, and its average running time is T (n)= (n3). The computational results on a class of benchmark problems have shown that this algorithm not only finds shorter height than the kno...

The knapsack container loading problem is the problem of loading a subset of rectangular boxes into a rectangular container of fixed dimensions such that the volume of the packed boxes is maximized. A new heuristic based on the wall-building approach is proposed, which decomposes the problem into a number of layers which again are split into a number of strips. The packing of a strip may be for...

This special issue presents 5 articles that cover the methods and applications of meta-heuristics and other related models, which highlight innovation and recent development for challenging problems in industry and science. The issue begins with an article by Bouhmala and Granmo, “Stochastic Learning for SATEncoded Graph Coloring Problems”. The article presents a new algorithm based on the rand...