Many engineering optimization problems involve a special kind of discrete variable that can be represented by a number, but this representation has no significance. Such variables arise when a decision involves some situation like a choice from an unordered list of categories. This has two implications: The standard approach of solving problems with continuous relaxations of discrete variables ...

For multi-objective optimization in the QoS routing, this paper combines the artificial fish swarm algorithm and ant colony algorithm and tabu search algorithm, proposes a new improved algorithm, and delves into the application of solving the QoS routing. One main work in this paper is to put forward a mixed algorithm integrating artificial fish swarm and ant colony. Firstly, we randomly genera...

Economic load dispatch (ELD) is an important optimization task in power system. It is the process of allocating generation among the committed units such that the constraints imposed are satisfied and the energy requirements are minimized. There are three criteria in solving the economic load dispatch problem. They are minimizing the total generator operating cost, total emission cost and sched...

We provide an improved algorithm called “a neighborhood expansion tabu search algorithm based on genetic factors” (NETS) to solve traveling salesman problem. The algorithm keeps the traditional tabu algorithm’s neighborhood, ensure the algorithm’s strong climbing ability and go to the local optimization. At the same time, introduce the genetic algorithm’s genetic factor (crossover factor and va...

In this paper, we study the job shop scheduling problem with the objective of minimizing the total weighted tardiness. We propose a hybrid shifting bottleneck tabu search (SB-TS) algorithm by replacing the reoptimization step in the shifting bottleneck (SB) algorithm by a tabu search (TS). In terms of the shifting bottleneck heuristic, the proposed tabu search optimizes the total weighted tardi...

Using a simple multiprocessor scheduling problem as a vehicle, we explore the behavior of tabu search algorithms using different tabu, local search and list management strategies. We found that random blocking of the tail of the tabu list always improved performance; but that the use of frequency-based penalties to discourage frequently selected moves did not. Hash coding without conflict resol...

The two-machine group-scheduling problem for minimizing the total completion time with carryover sequence dependency is addressed in this paper. These problems are typically encountered in electronics manufacturing. A procedure called Minsetup is developed to determine the lower bound for the total completion time, and a search algorithm based on tabu search is proposed to solve the problem. Un...

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

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