Feature selection is of great importance in Quantitative Structure-Activity Relationship (QSAR) analysis. This problem has been solved using some meta-heuristic algorithms such as: GA, PSO, ACO, SA and so on. In this work two novel hybrid meta-heuristic algorithms i.e. Sequential GA and LA (SGALA) and Mixed GA and LA (MGALA), which are based on Genetic algorithm and learning automata for QSAR f...

This paper considers the single machine scheduling problem with independent family (group) setup times where jobs in each family are processed together. A sequence independent setup is required to process a job from a different family. The objective is to minimize total tardiness. A mixed integer programming model capable of solving small sized problems is described. Several heuristic algorithm...

In this paper we consider the problem of scheduling aircraft (plane) landings at an airport. This problem is one of deciding a landing time for each plane such that each plane lands within a predetermined time window and separation criteria between the landing of a plane, and the landing of all successive planes, are respected. We present a mixed-integer zero-one formulation of the problem for ...

We consider a very simple algorithm to solve large scale 0-1 integer linear programs and a simple heuristic to encourage convergence to an integer solution which have been very successful in commercial applications. We find it useful to revisit its main ideas and establish its relation to several known algorithms, including the generalized iterative scaling algorithm. We discuss ways to relate ...

This paper is concerned with an optimization problem associated with a rebalancing schedule of a large scale fund subject to nonconvex transaction cost. We will formulate this problem as a 0-1 mixed integer programming problem under linear constraints using absolute deviation as the measure of risk. This problem can be solved by an integer programming software if the size of the universe is sma...

We present an optimization model for the yard allocation process in an automotive transshipment terminal. The cars arrive and depart by ships in large batches and the yard planners have to dynamically assign incoming cars to parking rows. The integer linear programming model has been implemented in a commercial solver (CPLEX). We will present at the conference the model, the CPLEX computational...

This study revisits a fuzzy rough economic order quantity (EOQ) model for deteriorating items considering quantity discount and prepayment. Since the proposedmodel is amixed integer nonlinear programming type, it is solved using Meta heuristic algorithms. Based on three different case examples, we have shown that our results using the Bees Colony Optimization (BCO) algorithm performs better tha...

pumps are among the early instruments invented by humans to be taken advantage of in the use of water utilities. design and operation problem of pumping stations is a type of mixed integer non linear programming, in which gradient based optimization methods are not efficient for solving complex problems of this type. in this regard, such evolutionary optimization algorithms as genetic algorithm...

CODEQ is a new, population-based meta-heuristic algorithm that is a hybrid of concepts from chaotic search, opposition-based learning, differential evolution and quantum mechanics. CODEQ has successfully been used to solve different types of problems (e.g. constrained, integer-programming, engineering) with excellent results. In this paper, CODEQ is used to train feed-forward neural networks. T...