A tandem AGV configuration connects all cells of a manufacturing area by means of non-overlapping, sin-gle-vehicle closed loops. Each loop has at least one additional P/D station, provided as an interface between adjacent loops. This study describes the development of three tabu search algorithms for the design of tandem AGV systems. The first algorithm was developed based on the basic definiti...

A combinatorial auction is an auction where the bidders have the choice to bid on bundles of items. The WDP in combinatorial auctions is the problem of finding winning bids that maximize the auctioneer’s revenue under the constraint that each item can be allocated to at most one bidder. The WDP is known as an NP-hard problem with practical applications like electronic commerce, production manag...

This paper presents a highly effective memetic algorithm for the maximum diversity problem based on tabu search. The tabu search component uses a successive filter candidate list strategy and the solution combination component employs a combination operator based on identifying strongly determined and consistent variables. Computational experiments on three sets of 40 popular benchmark instance...

in this paper a non linear integrated fuzzy multi-objective production planning model with the labor learning and machines deterioration effects is presented. the objective function consists of two quantitative objectives namely increase profits and reduces the cost of system failure and a qualitative objective namely increases the satisfaction rate of the customers. different weights for objec...

In this work we propose two memetic algorithms based on a Nondominated Sorting Genetic Algorithm II (NSGA-II) scheme for solving a bi-objective Transportation Location Routing Problem (TLRP). The TLRP we are dealing with, can be seen as an extension of the two stage Location Routing Problem, with a transportation problem with truck capacity as first stage. Two objectives are considered: minimiz...

We present in this paper a new multiobjective memetic algorithm scheme called MEMOX. In current multiobjective memetic algorithms, the parents used for recombination are randomly selected. We improve this approach by using a dynamic hypergrid which allows to select a parent located in a region of minimal density. The second parent selected is a solution close, in the objective space, to the fir...

Optimization is the art of obtaining optimum result under given circumstances. In design, construction and maintenance of any engineering system, Engineers have to take many technological and managerial decisions at several stages. The ultimate goal of all such decisions is to either maximize the desired benefit or to minimize the effort or the cost required. This paper shows a memetic algorith...

A combinatorial optimization problem, namely kMinimum Spanning Tree Problem, is to find a subtree with exactly k edges in an undirected graph G , such that the sum of edges’ weights is minimal. where graph G is made up of a set of vertices and weight attached edges. Since this problem is NP-hard, heuristic and metaheuristic methods are widely adopted for solving large instances. In this paper, ...

Abstract— Memetic Algorithm has been proven to be successful to find the nearest optimum solution to hard combinatorial optimization problems. In this paper, Memetic algorithm is designed for One-dimension Multi-Objective Bin Packing Problem. Memetic Algorithm is a combination of power of Genetic algorithm with the powerful local search technique to focus on the population of local optima. In t...