In this research, a single batch processing machine scheduling problem with minimization of total earliness and tardiness as the objective function is investigated.We first formulate the problem as a mixed integer linear programming model. Since the research problem is shown to be NP-hard, an improved memetic algorithmis proposed to efficiently solve the problem. To further enhance the memetic ...

For machining workshops that use automated guided vehicles (AGVs) for material handling and management, workstation layout AGV path are coupling factors affecting the cost (MHC). The multi-row is a typical pattern in many workshops, currently, there lack of studies on problem (MRLP) while taking into account path. This study established bi-objective optimization methodology integrating to minim...

This paper presents a real-coded memetic algorithm that applies a crossover hill-climbing to solutions produced by the genetic operators. On the one hand, the memetic algorithm provides global search (reliability) by means of the promotion of high levels of population diversity. On the other, the crossover hill-climbing exploits the self-adaptive capacity of real-parameter crossover operators w...

A formal, representation-independent form of a memetic algorithm— a genetic algorithm incorporating local search—is introduced. A generalised form ofN -point crossover is defined together with representation-independent patching and hill-climbing operators. The resulting formal algorithm is then constructed and tested empirically on the travelling sales-rep problem. Whereas the genetic algorith...

Abstract The number of automatic guided vehicles (AGVs) and the sequence workpieces transported from warehouse affect final processing completion time system. Therefore, this paper researches optimal configuration AGVs transport in workshop. Firstly, an optimization model is built with minimizing time. Secondly, Plant Simulation used to determine AGVs. Thirdly, linear uniform crossover, inversi...

The free clustered travelling salesman problem (FCTSP) is an extension of the classical travelling salesman problem where the set of vertices is partitioned into clusters, and the task is to find a minimum cost Hamiltonian tour such that the vertices in any cluster are visited contiguously. This paper proposes the use of a memetic algorithm (MA) that combines the global search ability of Geneti...

Routing in networks is the major issue, because the packets may be sent through different topologies. This issue is addressed with the help of the metaheuristic algorithm. In the proposed work the Genetic Algorithm (GA) is integrated with Tabu Search to schedule the packets effectively in computer networks. The initial path is generated by Genetic Algorithm and then it is optimized by Tabu Sear...

Given an undirected graph G, the Minimum Sum Coloring Problem (MSCP) is to find a legal assignment of colors (represented by natural numbers) to each vertex of G such that the total sum of the colors assigned to the vertices is minimized. This paper presents a memetic algorithm for MSCP based on a tabu search procedure with two neighborhoods and a multi-parent crossover operator. Experiments on...