Scatter Tabu Search Research Articles

Towards green automated production line with rotary transfer and turrets: a multi-objective approach using a binary scatter tabu search procedure

This paper deals with a much less contemplated topic of carbon footprint (CFP) reduction in automated machining lines. A multi-objective problem for the simultaneous optimisation of line cost and carbon footprint while satisfying all the constraints of an automated production line with rotary transfer and turrets is presented. A framework for accounting and reduction of CFP and, hence, the energy consumption of the production line is put forward. This framework investigates the environmental impact of greenhouse gas emitted and energy consumed by the system-level processes during the machining and non-machining operations. Moreover, a binary scatter tabu search process for multi-objective optimisation (BSSPMO), a meta-heuristic based on scatter and tabu search procedure, is used for approximating the efficient frontier. To demonstrate the validation of the proposed approach, a case study is presented, and the numerical results are analysed. Though the trade-off between line cost and CFP is not a perfect Pareto, but it gives a very important conclusion about the trend of how these two critical parameters varies and the range in which it can be controlled.

Solving a bi-objective Transportation Location Routing Problem by metaheuristic algorithms

In this work we consider a Transportation Location Routing Problem (TLRP) that can be seen as an extension of the two stage Location Routing Problem, in which the first stage corresponds to a transportation problem with truck capacity. Two objectives are considered in this research, reduction of distribution cost and balance of workloads for drivers in the routing stage. Here, we present a mathematical formulation for the bi-objective TLRP and propose a new representation for the TLRP based on priorities. This representation lets us manage the problem easily and reduces the computational effort, plus, it is suitable to be used with both local search based and evolutionary approaches. In order to demonstrate its efficiency, it was implemented in two metaheuristic solution algorithms based on the Scatter Tabu Search Procedure for Non-Linear Multiobjective Optimization (SSPMO) and on the Non-dominated Sorting Genetic Algorithm II (NSGA-II) strategies. Computational experiments showed efficient results in solution quality and computing time.

Scatter tabu search for multiobjective clustering problems

We propose a hybrid heuristic procedure based on scatter search and tabu search for the problem of clustering objects to optimize multiple criteria. Our goal is to search for good approximations of the efficient frontier for this class of problems and provide a means for improving decision making in multiple application areas. Our procedure can be viewed as an extension of SSPMO (a scatter search application to nonlinear multiobjective optimization) to which we add new elements and strategies specially suited for combinatorial optimization problems. Clustering problems have been the subject of numerous studies; however, most of the work has focused on single-objective problems. Clustering using multiple criteria and/or multiple data sources has received limited attention in the operational research literature. Our scatter tabu search implementation is general and tackles several problems classes within this area of combinatorial data analysis. We conduct extensive experimentation to show that our method is capable of delivering good approximations of the efficient frontier for improved analysis and decision making.

Hybrid scatter tabu search for unconstrained global optimization

The problem of finding a global optimum of an unconstrained multimodal function has been the subject of intensive study in recent years, giving rise to valuable advances in solution methods. We examine this problem within the framework of adaptive memory programming (AMP), focusing particularly on AMP strategies that derive from an integration of Scatter Search and Tabu Search. Computational comparisons involving 16 leading methods for multimodal function optimization, performed on a testbed of 64 problems widely used to calibrate the performance of such methods, disclose that our new Scatter Tabu Search (STS) procedure is competitive with the state-of-the-art methods in terms of the average optimality gap achieved.

SSPMO: A Scatter Tabu Search Procedure for Non-Linear Multiobjective Optimization

We describe the development and testing of a metaheuristic procedure, based on the scatter-search methodology, for the problem of approximating the efficient frontier of nonlinear multiobjective optimization problems with continuous variables. Recent applications of scatter search have shown its merit as a global optimization technique for single-objective problems. However, the application of scatter search to multiobjective optimization problems has not been fully explored in the literature. We test the proposed procedure on a suite of problems that have been used extensively in multiobjective optimization. Additional tests are performed on instances that are an extension of those considered classic. The tests indicate that our adaptation of scatter search is a viable alternative for multiobjective optimization.