A parallel tabu search for solving the primal buffer allocation problem in serial production systems

Costa, Alessia; Alfieri, Arianna; Matta, Andrea; Fichera, Sergio

doi:10.1016/j.cor.2015.05.013

Cited by 36 publications

(12 citation statements)

References 44 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…In this paper, a tabu search optimization algorithm has been developed based on the work of Costa et al [27]. Tabu search, which was first introduced by Glover, is a met heuristic search method that employs neighborhood search methods in the hope of finding an improved solution [28].…”

Section: End-of-inspection Intervalmentioning

confidence: 99%

Wind Power Performance Optimization Considering Redundancy and Opportunistic Maintenance

Sangroudi¹

2018

mendel

View full text Add to dashboard Cite

In This paper the redundancy and imperfect opportunistic maintenance optimization of a multi-state weighted k-out-of-n system is formulated. The objective is to determine the k-out-of-n system redundancy level and the maintenance strategy which will minimize the wind farm life cycle cost subject to an availability constraint. A new condition based opportunistic maintenance approach is developed. Different component health state thresholds are introduced for imperfect maintenance of failed subsystems and working subsystems and preventive dispatching of maintenance teams. In addition, a simulation method is developed to evaluate the performance measures of the system considering different types of subsystems, maintenance activation delays and durations, limited number of maintenance teams, and discrete inspection of the system. Also, a multi-seed tabu search heuristic algorithm is also proposed to solve the formulated problem. An application to the optimal design of a wind farm is provided to illustrate the proposed approach.

show abstract

Section: End-of-inspection Intervalmentioning

confidence: 99%

Wind Power Performance Optimization Considering Redundancy and Opportunistic Maintenance

Sangroudi¹

2018

mendel

View full text Add to dashboard Cite

show abstract

“…Because of computational time constraint, complete enumeration of all the solution space is not practical. In this paper, a Tabu search optimization algorithm has been developed based on the work of Costa et al 38 Tabu search, which was first introduced by Glover, 39 is a meta heuristic search method that employs neighborhood search algorithms in the hope of finding an improved solution. The Tabu search optimization algorithm, unlike regular single-path Tabu search, benefits from the search ability of N pop path.…”

Section: Tabu Search Algorithmmentioning

confidence: 99%

A Joint Reliability and Imperfect Opportunistic Maintenance Optimization for a Multi‐State Weighted k‐out‐of‐n System Considering Economic Dependence and Periodic Inspection

Atashgar

Abdollahzadeh

2017

Quality & Reliability Eng

View full text Add to dashboard Cite

This paper formulates a model to simultaneously optimize the redundancy and imperfect opportunistic maintenance of a multi‐state weighted k‐out‐of‐n system. Different from existing approaches that consider binary or multi‐state elements, our approach considers modular redundancy in which each module/subsystem is composed of several multi‐state components in series. The status of each component is considered to degrade with use. Therefore, a new condition‐based opportunistic maintenance approach using three different thresholds for a component health state is developed. The objective is to determine 1) the minimal‐cost of k‐out‐of‐n system structure, 2) optimal imperfect opportunistic maintenance strategy, 3) optimal maintenance capacity, and 4) optimal inspection interval subject to an availability constraint. System availability is defined as the ability to satisfy consumer demand. Based on the three‐phase approach, a simulation procedure is used to evaluate the expected multi‐state system availability and life cycle costs. Also, a multi‐seed Tabu search heuristic algorithm with a proper neighborhood generation mechanism is proposed to solve the formulated problem. An application to the optimal design of a wind farm is provided to illustrate the proposed approach. Sensitivity analysis is conducted to discuss the influence of the different parameters of the simulation model. Copyright © 2017 John Wiley & Sons, Ltd.

show abstract

“…Tabu Search (TS) was originally developed by Glover and Laguna (1999) and basically consists of a neighborhood search method that keeps track of the up-to-now search path to avoid to be trapped into local optima or to try an explorative search of the solution domain (Costa et al, 2015). The proposed TS was inspired to that of Liao and Huang (2011) but, differently from the original one, in this paper an enhanced two-level TS algorithm was devised.…”

Section: Tabu Searchmentioning

confidence: 99%

“…4 confirms that there was a statistical difference among the different metaheuristics. Since findings from the previous statistical analysis suggest PSO-GA and PSOc are the most promising algorithms, similarly being done by Costa et al (2015), a post-hoc Mann-Whitney non-parametric pairwise test (Mann and Whitney, 1947) has been carried out. Table 13 demonstrates that there was a statistically significant difference (the p-value is equal to 0.0000) between PSO c and PSO-GA.…”

Section: Table 10mentioning

confidence: 99%

“…To statistically infer about the whole set of results, MINITAB 16 commercial package has been implemented. Since the normality test has not been satisfied over the obtained RPD results, a KruskalWallis non-parametric test on the medians (Corder & Foreman, 2014;Costa et al, 2015) was assumed to be the most appropriate statistical method to compare the proposed algorithms. Table 12 represents the output of the aforementioned non-parametric test.…”

Section: Table 10mentioning

confidence: 99%

See 1 more Smart Citation

Single machine batch processing problem with release dates to minimize total completion time

Beldar¹,

Costa²

2018

10.5267/j.ijiec

View full text Add to dashboard Cite

A single machine batch processing problem with release dates to minimize the total completion time (1|rj,batch| j C  ) is investigated in this research. An original mixed integer linear programming (MILP) model is proposed to optimally solve the problem. Since the research problem at hand is shown to be NP-hard, several different meta-heuristic algorithms based on tabu search (TS) and particle swarm optimization (PSO) are used to solve the problem. To find the most performing heuristic optimization technique, a set of test cases ranging in size (small, medium, and large) are randomly generated and solved by the proposed meta-heuristic algorithms. An extended comparison analysis is carried out and the outperformance of a hybrid meta-heuristic technique properly combining PSO and genetic algorithm (PSO-GA) is statistically demonstrated.

show abstract

A parallel tabu search for solving the primal buffer allocation problem in serial production systems

Cited by 36 publications

References 44 publications

Wind Power Performance Optimization Considering Redundancy and Opportunistic Maintenance

Wind Power Performance Optimization Considering Redundancy and Opportunistic Maintenance

A Joint Reliability and Imperfect Opportunistic Maintenance Optimization for a Multi‐State Weighted k‐out‐of‐n System Considering Economic Dependence and Periodic Inspection

Single machine batch processing problem with release dates to minimize total completion time

Contact Info

Product

Resources

About