Since crossover operator plays a vital role in genetic algorithms (GAs), several crossover operators have been proposed for the travelling salesman problem, which are then modified for the quadratic assignment problem (QAP). In this paper, we modify the sequential constructive crossover (SCX) operator for a simple GA to find heuristic solution to the QAP. Efficiency of the proposed GA using SCX...

The Single Machine Scheduling (SMS) problem is one of the most representative problems in the scheduling area. In this paper, we explore the SMS with time constraints (setup times and due-dates) and the objective function is the minimization of total tardiness. The chosen method is based on a hybrid-genetic algorithm, which belongs to the memetic algorithms class. Results are compared against g...

This report are described the versions and the synthesis results of new designs of electrically small antenna based on ant colony optimization algorithms. To study the parameters of the frame and non-loopback vibrators MMANA package was used. Geometric forms that were obtained might be used as contour lines of printed, slot antenna or as forming surface of the crystal dielectric resonator anten...

In a recent paper, Brusco, Khn and Steinley [Ann. Oper. Res. 206:611-626 (2013)] conjecture that the 2 bins special case of the one-dimensional minimax bin-packing problem with bin size constraintsmight be solvable in polynomial time. In this note, we show that this problem is NP-hard for the special caseand thatit is strongly NP-hard for the general problem. We also propose a pseudo-polynomial...

A heuristic algorithm that uses iteratively LPT and MF approaches on different job and machine sets constructed by using the current solution is developed to solve a classical multiprocessor scheduling problem with the objective of minimizing the makespan. Computational results indicate that the proposed algorithm is very competitive with respect to well-known constructive algorithms for a larg...

This paper proposes two constructive heuristics for the well-known single-level uncapacitated dynamic lot-sizing problem. The proposed heuristics, called nLPC and nLPC(i), are developed by modifying the average period cost concept from Silver and Meal’s heuristic, commonly known as Least Period Cost (LPC). An improved tie-breaking stopping rule is also proposed in this paper. The computational ...

This paper presents a genetic algorithm approach to the location of a single input and output station for each department within a facility design such that material handling costs are minimized. This problem is an NP-hard combinatorial problem. A genetic algorithm (GA) is shown to be an effective and efficient optimization method when compared to integer programming and to a greedy constructiv...

Placement problem has been proven to be NP hard. It is impractical to perform an exhaustive search to find the optimal solution for a large circuit. Thus, algorithms based on heuristic rationales are commonly employed. An ideal approach is to get an initial solution using a constructive algorithm and then uses an iterative algorithm to improve it. So, it is desirable to develop better improveme...