this article presents the application of two algorithms: heuristic big bang-big crunch (hbb-bc) and a heuristic particle swarm ant colony optimization (hpsaco) to discrete optimization of reinforced concrete planar frames subject to combinations of gravity and lateral loads based on aci 318-08 code. the objective function is the total cost of the frame which includes the cost of concrete, formw...

The vehicle routing problem with the capacity constraints was considered in this paper. It is quite difficult to achieve an optimal solution with traditional optimization methods by reason of the high computational complexity for large-scale problems. Consequently, new heuristic or metaheuristic approaches have been developed to solve this problem. In this paper, we constructed a new heuristic ...

We address a scheduling problem in the context of military aircraft maintenance where the goal is to meet the aircraft requirements for a number of missions in the presence of breakdowns. The assignment of aircraft to a mission must consider the requirements for the mission, the probability of aircraft failure, and capacity of the repair shop that maintains the aircraft. Therefore, a solution b...

this paper addresses a new version of the exible ow line prob- lem, i.e., the budget constrained one, in order to determine the required num- ber of processors at each station along with the selection of the most eco- nomical process routes for products. since a number of parameters, such as due dates, the amount of available budgets and the cost of opting particular routes, are imprecise (fuzz...

The prediction of RNA secondary structure including pseudoknots remains a challenge due to the intractable computation of the sequence conformation from nucleotide interactions under free energy models. Optimal algorithms often assume a restricted class for the predicted RNA structures and yet still require a high-degree polynomial time complexity, which is too expensive to use. Heuristic metho...

An efficient assignment and scheduling of tasks is one of the key elements in effective utilization of heterogeneous multiprocessor systems. The task scheduling problem has been proven to be NP-hard is the reason why we used meta-heuristic methods for finding a suboptimal schedule. In this paper we proposed a new approach using TRIZ (specially 40 inventive principles). The basic idea of thi...

We consider a class of knapsack problems that include setup costs for families of items. An individual item can be loaded into the knapsack only if a setup cost is incurred for the family to which it belongs. A mixed integer programming formulation for the problem is provided along with exact and heuristic solution methods. The exact algorithm uses cross decomposition. The proposed heuristic gi...