One of the most important extensions of the capacitated vehicle routing problem (CVRP) is the vehicle routing problem with simultaneous pickup and delivery (VRPSPD) where customers require simultaneous delivery and pick-up service. In this paper, we propose an effective ant colony optimization (EACO) which includes insert, swap and 2-Opt moves for solving VRPSPD that is different with common an...

This paper proposes an effective memetic Gravitational Search Algorithm (GSA) that utilizes Solis and Wets’ (SW) algorithm as local search. GSA has good exploration ability and SW helps to improve the exploitation ability of the memetic algorithm. Furthermore, a selection strategy is proposed to select suitable individuals for local refinement that is based on subtractive clustering. Proposed m...

Response surface methodology is a common tool in optimizing processes. It mainly concerns situations when there is only one response of interest. However, many designed experiments often involve simultaneous optimization of several quality characteristics. This is called a Multiresponse Surface Optimization problem. A common approach in dealing with these problems is to apply desirability funct...

This paper models the sea port system with the objective of determining the optimal storage strategy and container-handling schedule. It presents an iterative search algorithm that integrates a container transfer model with a container location model in a cyclic fashion to determine both optimal locations and corresponding handling schedule. A genetic algorithm, a tabu search and a tabu search/...

In this paper we consider a simplified version of the stock cutting (two-dimensional bin packing) problem. We compare three meta-heuristic algorithms (genetic algorithm (GA), tabu search (TS) and simulated annealing (SA)) when applied to this problem. The results show that tabu search and simulated annealing produce good quality results. This is not the case with the genetic algorithm. The prob...

The clustering problem under the criterion of minimum sum square of errors is a non-convex and nonlinear problem, which possesses many locally optimal values, resulting that its solution often being stuck at locally optimal solution. In this paper, a hybrid genetic, tabu search and k-means algorithm, called GeneticTKM, is proposed for the clustering problem. A new mutation operator is presented...

The clustering problem under the criterion of minimum sum square of errors is a non-convex and non-linear problem, which possesses many locally optimal values, resulting that its solution often being stuck at locally optimal solution. In this paper, a hybrid genetic, tabu search and k-means algorithm, called GeneticTKM, is proposed for the clustering problem. A new mutation operator is presente...

A tandem AGV configuration connects all cells of a manufacturing area by means of non-overlapping, single-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 definitio...

In this paper, we present a Multi-Surrogates Assisted Memetic Algorithm (MSAMA) for solving optimization problems with computationally expensive fitness functions. The essential backbone of our framework is an evolutionary algorithm coupled with a local search solver that employs multi-surrogates in the spirit of Lamarckian learning. Inspired by the notion of 'blessing and curse of uncertainty'...