The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Traditional approaches to apply tabu search method typically require formulating an algorithmic structure for each individual problem. Based on algebraic specifications, the paper presents a unified and mechanical framework for implementing tabu search algorithms for combinatorial optimization problems. We define a generalized specification using high-order functions to describe search strategies,...
Scheduling for modern professional sports leagues has drawn considerable attention in recent years in that their practical applications involve significant revenues and generate challenging combinatorial optimization problems. The Traveling Tournament Problem is a sports scheduling problem that abstracts the important issues in creating time tables: feasibility and team travel, where the objective...
Meta-heuristics have been successfully applied to solve different types of problems. However, the contributions of meta-heuristics that deal with high dimensional problems are still very limited compared with low and middle dimensional problems. Tabu Search (TS) represents popular class of meta-heuristics. In this paper, a short term TS algorithm based on variable partitioning is proposed for solving...
In this paper we propose a tabu search heuristic embedded in adaptative memory procedure to solve the profitable arc tour problem (PATP). The PATP is a variant of the well-known vehicle routing problem in which a set of vehicle tours are constructed. The objective is to find a set of cycles in the tours of vehicle that maximize the collection of profits minus travel costs, which is in its turn subject...
Container dock handling scheduling is a combinatorial optimization problem. It has important significance to improve the dock production efficiency. This problem belongs to NP-hard problems. It is very similar to hybrid flow shop scheduling in the form. But it is more complex than HFS because of the physical properties of ship structure and handling equipment. This paper establishes a mathematical...
The Capacitated m-Ring Star Problem (CmRSP) consists of finding a set of m rings, each of them including the central depot, a subset of customers, and a set of optional nodes used to diminish the costs of the network design. The rings must be node-disjoint (except for the central depot) in order to provide node-survivability to the network. Customers that are not part of the rings must be directly...
Tabu search is a meta-heuristic approach that is found to be useful in solving combinatorial optimization problems. This paper employs the adaptive memory features of tabu search to deal with protein folding problem. A kind of optimization of the neighborhood scale is presented, where a annealing mechanism is also used to enhance the searching ability for optimum solutions of the AB off-lattice model...
This paper proposes a new method, multi-point Tabu search, for solving combinatorial optimization problems on the basis of the concept of Proximate optimality principle (POP). While the similarity measure of POP is defined using the concept of metric space on combinatorial optimization problems, some numerical simulations using several types of combinatorial optimization benchmark problems investigate...
This paper describes the Adaptive Tabu Search algorithm (A-TS), an improved tabu search algorithm for combinatorial optimization. A-TS uses a novel approach for evaluation of the moves, incorporated in a new complex evaluation function. A new decision making mechanism triggers the evaluation function providing means for avoiding possible infinite loops. The new evaluation function implements effective...
This paper proposes a new method for identifying network topology in power system state estimation. Network topology identification is important to carry out state estimation appropriately. The mathematical formulation may be expressed as a mixed integer optimization problem that has state variables in continuous number and network topology in binary number. To solve it, this paper makes use of parallel...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.