Solving large 0–1 multidimensional knapsack problems by a new simplified binary artificial fish swarm algorithm

The artificial fish swarm algorithm has recently been emerged in continuous global optimization. It uses points of a population in space to identify the position of fish in the school. Many real-world optimization problems are described by 0-1 multidimensional knapsack problems that are NP-hard. In the last decades several exact as well as heuristic methods have been proposed for solving these problems. In this paper, a new simpli ed binary version of the artificial fish swarm algorithm is presented, where a point/ fish is represented by a binary string of 0/1 bits. Trial points are created by using crossover and mutation in the different fi sh behavior that are randomly selected by using two user de ned probability values. In order to make the points feasible the presented algorithm uses a random heuristic drop item procedure followed by an add item procedure aiming to increase the profit throughout the adding of more items in the knapsack. A cyclic reinitialization of 50% of the population, and a simple local search that allows the progress of a small percentage of points towards optimality and after that refines the best point in the population greatly improve the quality of the solutions. The presented method is tested on a set of benchmark instances and a comparison with other methods available in literature is shown. The comparison shows that the proposed method can be an alternative method for solving these problems.

Combining non-dominance, objective-order and spread metric to extend firefly algorithm to multi-objective optimization

In this paper, we propose an extension of the firefly algorithm (FA) to multi-objective optimization. FA is a swarm intelligence optimization algorithm inspired by the flashing behavior of fireflies at night that is capable of computing global solutions to continuous optimization problems. Our proposal relies on a fitness assignment scheme that gives lower fitness values to the positions of fireflies that correspond to non-dominated points with smaller aggregation of objective function distances to the minimum values. Furthermore, FA randomness is based on the spread metric to reduce the gaps between consecutive non-dominated solutions. The obtained results from the preliminary computational experiments show that our proposal gives a dense and well distributed approximated Pareto front with a large number of points.

An evolutionary multi-objective optimization system for earthworks

Earthworks involve the levelling or shaping of a target area through the moving or processing of the ground surface. Most construction projects require earthworks, which are heavily dependent on mechanical equipment (e.g., excavators, trucks and compactors). Often, earthworks are the most costly and time-consuming component of infrastructure constructions (e.g., road, railway and airports) and current pressure for higher productivity and safety highlights the need to optimize earthworks, which is a nontrivial task. Most previous attempts at tackling this problem focus on single-objective optimization of partial processes or aspects of earthworks, overlooking the advantages of a multi-objective and global optimization. This work describes a novel optimization system based on an evolutionary multi-objective approach, capable of globally optimizing several objectives simultaneously and dynamically. The proposed system views an earthwork construction as a production line, where the goal is to optimize resources under two crucial criteria (costs and duration) and focus the evolutionary search (non-dominated sorting genetic algorithm-II) on compaction allocation, using linear programming to distribute the remaining equipment (e.g., excavators). Several experiments were held using real-world data from a Portuguese construction site, showing that the proposed system is quite competitive when compared with current manual earthwork equipment allocation.

Combining data mining and evolutionary computation for multi-criteria optimization of earthworks

Earthworks tasks aim at levelling the ground surface at a target construction area and precede any kind of structural construction (e.g., road and railway construction). It is comprised of sequential tasks, such as excavation, transportation, spreading and compaction, and it is strongly based on heavy mechanical equipment and repetitive processes. Under this context, it is essential to optimize the usage of all available resources under two key criteria: the costs and duration of earthwork projects. In this paper, we present an integrated system that uses two artificial intelligence based techniques: data mining and evolutionary multi-objective optimization. The former is used to build data-driven models capable of providing realistic estimates of resource productivity, while the latter is used to optimize resource allocation considering the two main earthwork objectives (duration and cost). Experiments held using real-world data, from a construction site, have shown that the proposed system is competitive when compared with current manual earthwork design.

Modern optimization in earthwork construction

Earthworks tasks are often regarded in transportation projects as some of the most demanding processes. In fact, sequential tasks such as excavation, transportation, spreading and compaction are strongly based on heavy mechanical equipment and repetitive processes, thus becoming as economically demanding as they are time-consuming. Moreover, actual construction requirements originate higher demands for productivity and safety in earthwork constructions. Given the percentual weight of costs and duration of earthworks in infrastructure construction, the optimal usage of every resource in these tasks is paramount. Considering the characteristics of an earthwork construction, it can be looked at as a production line based on resources (mechanical equipment) and dependency relations between sequential tasks, hence being susceptible to optimization. Up to the present, the steady development of Information Technology areas, such as databases, artificial intelligence and operations research, has resulted in the emergence of several technologies with potential application bearing that purpose in mind. Among these, modern optimization methods (also known as metaheuristics), such as evolutionary computation, have the potential to find high quality optimal solutions with a reasonable use of computational resources. In this context, this work describes an optimization algorithm for earthworks equipment allocation based on a modern optimization approach, which takes advantage of the concept that an earthwork construction can be regarded as a production line.

Earthwork optimization system for sustainable highway construction

In highway construction, earthworks refer to the tasks of excavation, transportation, spreading and compaction of geomaterial (e.g. soil, rockfill and soil-rockfill mixture). Whereas relying heavily on machinery and repetitive processes, these tasks are highly susceptible to optimization. In this context Artificial Intelligent techniques, such as Data Mining and modern optimization can be applied for earthworks. A survey of these applications shows that they focus on the optimization of specific objectives and/or construction phases being possible to identify the capabilities and limitations of the analyzed techniques. Thus, according to the pinpointed drawbacks of these techniques, this paper describes a novel intelligent earthwork optimization system, capable of integrating DM, modern optimization and GIS technologies in order to optimize the earthwork processes throughout all phases of design and construction work. This integration system allows significant savings in time, cost and gas emissions contributing for a more sustainable construction.

Automated network resilience optimization using computational intelligence methods

This paper presents an automated optimization framework able to provide network administrators with resilient routing configurations for link-state protocols, such as OSPF or IS-IS. In order to deal with the formulated NP-hard optimization problems, the devised framework is underpinned by the use of computational in- telligence optimization engines, such as Multi-objective Evolutionary Algorithms (MOEAs). With the objective of demonstrating the framework capabilities, two il- lustrative Traffic Engineering methods are described, allowing to attain routing con- figurations robust to changes in the traffic demands and maintaining the network stable even in the presence of link failure events. The presented illustrative results clearly corroborate the usefulness of the proposed automated framework along with the devised optimization methods.

Design and optimization of an extrusion die for the production of wood–plastic composite profiles

In this work, the optimization of an extrusion die designed for the production of a wood–plastic composite (WPC) decking profile is investigated. The optimization was performed with the help of numerical tools, more precisely, by solving the continuity and momentum conservation equations that govern such flow, and aiming to balance properly the flow distribution at the extrusion die flow channel outlet. To capture the rheological behavior of the material, we used a Bird-Carreau model with parameters obtained from a fit to the (shear viscosity versus shearrate) experimental data, collected from rheological tests. To yield a balanced output flow, several numerical runs were performed by adjusting the flow restriction at different regions of the flow-channel parallel zone crosssection. The simulations were compared with the experimental results and an excellent qualitative agreement was obtained, allowing, in this way, to attain a good balancing of the output flow and emphasizing the advantages of using numerical tools to aid the design of profile extrusion dies.

Understanding the dispersion of fillers in polymer matrices

Understanding the mixing process of complex composite materials is fundamental in several industrial processes. For instance, the dispersion of fillers in polymer melt matrices is commonly employed to manufacture polymer composites, using a twin-screw extruder. The effectiveness of the filler dispersion depends not only on the complex flow patterns generated, but also on the polymer melt rheological behavior. Therefore, the availability of a numerical tool able to predict mixing, taking into account both fluid and particles phases would be very useful to increase the process insight, and thus provide useful guidelines for its optimization. In this work, a new Eulerian-Lagrangian numerical solver is developed OpenFOAM® computational library, and used to better understand the mechanisms determining the dispersion of fillers in polymer matrices. Particular attention will be given to the effect of the rheological model used to represent the fluid behavior, on the level of dispersion obtained. For the Eulerian phase the averaged volume fraction governing equations (conservation of mass and linear momentum) are used to describe the fluid behavior. In the case of the Lagrangian phase, Newton’s second law of motion is used to compute the particles trajectories and velocity. To study the effect of fluid behavior on the filler dispersion, several systems are modeled considering different fluid types (generalized Newtonian or viscoelastic) and particles volume fraction and size. The results obtained are used to correlate the fluid and particle characteristics on the effectiveness of mixing and morphology obtained.

In silico constraint-based strain optimization methods: the quest for optimal cell factories

Shifting from chemical to biotechnological processes is one of the cornerstones of 21st century industry. The production of a great range of chemicals via biotechnological means is a key challenge on the way toward a bio-based economy. However, this shift is occurring at a pace slower than initially expected. The development of efficient cell factories that allow for competitive production yields is of paramount importance for this leap to happen. Constraint-based models of metabolism, together with in silico strain design algorithms, promise to reveal insights into the best genetic design strategies, a step further toward achieving that goal. In this work, a thorough analysis of the main in silico constraint-based strain design strategies and algorithms is presented, their application in real-world case studies is analyzed, and a path for the future is discussed.

Cost-effective energy and carbon emission optimization in building renovation – A case-study in a low income neighbourhood

Construction sector is one of the major responsible for energy consumption and carbon emissions and renovation of existing buildings plays an important role in the actions to mitigate climate changes. Present work is based on the methodology developed in IEA Annex 56, allowing identifying cost optimal and cost effective renovation scenarios improving the energy performance. The analysed case study is a residential neighbourhood of the municipality of Gaia in Portugal. The analysis compares a reference renovation scenario (without improving the energy performance of the building) with a series of alternative renovation scenarios, including the one that is being implemented.

IEA EBC Annex56 vision for cost effective energy and carbon emissions optimization in building renovation

Building sector has become an important target for carbon emissions reduction, energy consumption and resources depletion. Due to low rates of replacement of the existing buildings, their low energy performances are a major concern. Most of the current regulations are focused on new buildings and do not account with the several technical, functional and economic constraints that have to be faced in the renovation of existing buildings. Thus, a new methodology is proposed to be used in the decision making process for energy related building renovation, allowing finding a cost-effective balance between energy consumption, carbon emissions and overall added value.

Measurement of charged-particle spectra in Pb+Pb collisions at √sNN = 2.76TeV with the ATLAS detector at the LHC

Charged-particle spectra obtained in 0.15nb−1 of Pb+Pb interactions at sNN−−−√=2.76TeV and 4.2pb−1 of pp interactions at s√=2.76TeV with the ATLAS detector at the LHC are presented in a wide transverse momentum (0.5

Search for a Heavy Neutral Particle Decaying to eμ, eτ, or μτ in pp Collisions at s√=8 TeV with the ATLAS Detector

This Letter presents a search for a heavy neutral particle decaying into an opposite-sign different-flavor dilepton pair, e±μ∓, e±τ∓, or μ±τ∓ using 20.3 fb−1 of pp collision data at s√=8 TeV collected by the ATLAS detector at the LHC. The numbers of observed candidate events are compatible with the Standard Model expectations. Limits are set on the cross section of new phenomena in two scenarios: the production of ν~τ in R-parity-violating supersymmetric models and the production of a lepton-flavor-violating Z′ vector boson.