A deterministic algorithm for generating optimal three- stage layouts of homogenous strip pieces

Purpose: The time required by the algorithms for general layouts to solve the large-scale two-dimensional cutting problems may become unaffordable. So this paper presents an exact algorithm to solve above problems. Design/methodology/approach: The algorithm uses the dynamic programming algorithm to generate the optimal homogenous strips, solves the knapsack problem to determine the optimal layout of the homogenous strip in the composite strip and the composite strip in the segment, and optimally selects the enumerated segments to compose the three-stage layout. Findings: The algorithm not only meets the shearing and punching process need, but also achieves good results within reasonable time. Originality/value: The algorithm is tested through 43 large-scale benchmark problems. The number of optimal solutions is 39 for this paper’s algorithm; the rate of the rest 4 problem’s solution value and the optimal solution is 99. 9%, and the average consumed time is only 2. 18seconds. This paper’s pattern is used to simplify the cutting process. Compared with the classic three-stage, the two-segment and the T-shape algorithms, the solutions of the algorithm are better than that of the above three algorithms. Experimental results show that the algorithm to solve a large-scale piece packing quickly and efficiency.Peer Reviewe

Models and heuristics for forest management with environmental restrictions

Tese de doutoramento, Estatística e Investigação Operacional (Otimização), Universidade de Lisboa, Faculdade de Ciências, 2018The main focus of this thesis was to develop mathematical models and methods in integer programming for solving harvest scheduling problems with environmental restrictions. Constraints on maximum clearcut area, minimum total habitat area, minimum total core area and inter-habitat connectivity were addressed for this purpose. The research was structured in a collection of three papers, each one describing the study of a different forest harvest scheduling problem with respect to the environmental constraints. Problems of papers 1 and 2 aim at maximizing the net present value. A bi objective problem is considered in paper 3. The objectives are the maximization of the net present value and the maximization of the inter-habitat connectivity. The tree search methods branch-and-bound and multiobjective Monte Carlo tree search were designed specifically to solve the problems. The methods could be used as heuristics, as a time limit of 2 hours was imposed. All harvest scheduling problems were based on the socalled cluster formulation. The proposed models and methods were tested with sixteen real and hypothetical instances ranging from small to large. The results obtained for branch-and-bound and Monte Carlo tree search show that these methods were able to find solutions for all instances. The results suggest that it is possible to address the environmental restrictions with small reductions of the net present value. With respect to the forestry fragmentation caused by harvestings, the results suggest that, although clearcut size constraints tend to disperse clearcuts across the forest, compromising the development of large habitats, close to each other, the proposed models, with the other environmental constraints, attempt to mitigate this effect

Blood Vessel Segmentation and shape analysis for quantification of Coronary Artery Stenosis in CT Angiography

This thesis presents an automated framework for quantitative vascular shape analysis of the coronary arteries, which constitutes an important and fundamental component of an automated image-based diagnostic system. Firstly, an automated vessel segmentation algorithm is developed to extract the coronary arteries based on the framework of active contours. Both global and local intensity statistics are utilised in the energy functional calculation, which allows for dealing with non-uniform brightness conditions, while evolving the contour towards to the desired boundaries without being trapped in local minima. To suppress kissing vessel artifacts, a slice-by-slice correction scheme, based on multiple regions competition, is proposed to identify and track the kissing vessels throughout the transaxial images of the CTA data. Based on the resulting segmentation, we then present a dedicated algorithm to estimate the geometric parameters of the extracted arteries, with focus on vessel bifurcations. In particular, the centreline and associated reference surface of the coronary arteries, in the vicinity of arterial bifurcations, are determined by registering an elliptical cross sectional tube to the desired constituent branch. The registration problem is solved by a hybrid optimisation method, combining local greedy search and dynamic programming, which ensures the global optimality of the solution and permits the incorporation of any hard constraints posed to the tube model within a natural and direct framework. In contrast with conventional volume domain methods, this technique works directly on the mesh domain, thus alleviating the need for image upsampling. The performance of the proposed framework, in terms of efficiency and accuracy, is demonstrated on both synthetic and clinical image data. Experimental results have shown that our techniques are capable of extracting the major branches of the coronary arteries and estimating the related geometric parameters (i.e., the centreline and the reference surface) with a high degree of agreement to those obtained through manual delineation. Particularly, all of the major branches of coronary arteries are successfully detected by the proposed technique, with a voxel-wise error at 0.73 voxels to the manually delineated ground truth data. Through the application of the slice-by-slice correction scheme, the false positive metric, for those coronary segments affected by kissing vessel artifacts, reduces from 294% to 22.5%. In terms of the capability of the presented framework in defining the location of centrelines across vessel bifurcations, the mean square errors (MSE) of the resulting centreline, with respect to the ground truth data, is reduced by an average of 62.3%, when compared with initial estimation obtained using a topological thinning based algorithm

Magnetism, FeS colloids, and Origins of Life

A number of features of living systems: reversible interactions and weak bonds underlying motor-dynamics; gel-sol transitions; cellular connected fractal organization; asymmetry in interactions and organization; quantum coherent phenomena; to name some, can have a natural accounting via $physical$ interactions, which we therefore seek to incorporate by expanding the horizons of `chemistry-only' approaches to the origins of life. It is suggested that the magnetic 'face' of the minerals from the inorganic world, recognized to have played a pivotal role in initiating Life, may throw light on some of these issues. A magnetic environment in the form of rocks in the Hadean Ocean could have enabled the accretion and therefore an ordered confinement of super-paramagnetic colloids within a structured phase. A moderate H-field can help magnetic nano-particles to not only overcome thermal fluctuations but also harness them. Such controlled dynamics brings in the possibility of accessing quantum effects, which together with frustrations in magnetic ordering and hysteresis (a natural mechanism for a primitive memory) could throw light on the birth of biological information which, as Abel argues, requires a combination of order and complexity. This scenario gains strength from observations of scale-free framboidal forms of the greigite mineral, with a magnetic basis of assembly. And greigite's metabolic potential plays a key role in the mound scenario of Russell and coworkers-an expansion of which is suggested for including magnetism.Comment: 42 pages, 5 figures, to be published in A.R. Memorial volume, Ed Krishnaswami Alladi, Springer 201

Solución del problema de empaquetamiento óptimo usando técnicas metaheurísticas de optimización simultáneas a través de procesamiento paralelo

El problema de la mochila irrestricta bidimensional no guillotinada (U2DNGSKP) del inglés unconstrained two-dimensional non-guillotine single knapsack problem, es un problema de corte que se presenta cuando el material a ser utilizado es una pieza rectangular (hoja de material) donde se deben ubicar piezas rectangulares más pequeñas de las que se conoce el tamaño y un costo (bien sea su propia área o un valor establecido). El objetivo es maximizar el beneficio asociado a cada una de las piezas cortadas, sin sobreponer las piezas y sin sobrepasar los límites de la hoja de material

Novel approaches to container loading: from heuristics to hybrid tabu search

A thesis submitted for the degree of Doctor of Philosophy of the University ofBedford shireThis work investigates new approaches to the container loading problem which address the issue of how to load three-dimensional, rectangular items (e.g. boxes) into the container in such a way that maximum utilisation is made of the container space. This problem occurs in several industry sectors where the loading approach places cargo effectively into aeroplanes, ships, trailers or trucks in order to save considerable cost. In carrying out this work, the investigation starts by developing a new heuristic approach to the two-dimensional bin packing problem, which has lower complexity than container loading in the aspects of constraints and geometry. A novel approach, including the heuristic strategies and handling method for remaining areas, is developed that can produce good results when testing with benchmark and real world data. Based on the research for two-dimensional bin packing, a novel heuristic approach is developed to deal with the container loading problem with some practical constraints. The heuristic approach to container loading also includes heuristic strategies and the handling of remaining spaces. The heuristic strategies construct effective loading arrangements where combinations of identical or different box types are loaded in blocks. The handling method for remaining spaces further improves the loading arrangements through the representation, partitioning and merging of remaining spaces. The heuristic approach obtains better volume utilisation and the highest stability compared with other published heuristic approaches. However, it does not achieve as high a volume utilisation as metaheuristic approaches, e.g. genetic algorithms and tabu search.To improve volume utilisation, a new hybrid heuristic approach to the container loading problem is further developed based on the tabu search technique which covers the encoding, evaluation criterion and configuration of neighbourhood and candidate solutions. The heuristic strategies as well as the handling method for remaining spaces developed in the heuristic approach are used in this new hybrid tabu search approach. It is shown that the hybrid approach has better volume utilisation than the published approaches under the condition that all loaded boxes with one hundred per cent support from below. In addition, the experimental results show that both the heuristic and hybrid tabu search approaches can also be applied to the multiple container loading problem