The job shop scheduling problem (JSSP) is well known as one of the most difficult combinatorial optimization problems. This paper presents a hybrid genetic algorithm for the JSSP with the objective of minimizing makespan. The efficiency of the genetic algorithm is enhanced by integrating it with a local search method. The chromosome representation of the problem is based on operations. Schedule...

the one-dimensional cutting stock problem, has so many applications in lots of industrial processes and during the past few years has attracted so many researchers’ attention all over the world. in this paper a meta-heuristic method based on aco is presented to solve this problem. in this algorithm, based on designed probabilistic laws, artificial ants do select various cuts and then select the...

The G3-PCX genetic algorithm is compared with hybrid meta-heuristic approaches for solving the forward kinematics problem of the 6-6 general parallel manipulator. The G3-PCX shows improvements in terms of accuracy, response time and reliability. Several experiments confirm solving the given problem in less than 1 second. It also reports all the 16 unique real solutions which are verified by an ...

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...

A hybrid genetic algorithm for multiway graph partitioning is proposed. The algorithm includes an e cient local optimization heuristic. Starting at an initial solution, the heuristic iteratively improves the solution using cyclic movements of vertices. The suggested heuristic performed well in itself and as a local optimization engine in the hybrid genetic algorithm. Combined with the framework...

Software test-case generation is the process of identifying a set of test cases. It is necessary to generate the test sequence that satisfies the testing criteria. For solving this kind of difficult problem there were a lot of research works, which have been done in the past. The length of the test sequence plays an important role in software testing. The length of test sequence decides whether...