Parallel tabu search algorithm for the hybrid flow shop problem

Boejko, Wojciech; Pempera, Jarosław; Smutnicki, Czesław

doi:10.1016/j.cie.2013.04.007

Cited by 48 publications

(13 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Nowadays a tabu search algorithm (abbreviated as TS) is successfully used to solve various optimization problems due to the very good quality of delivered solutions (Glover, Laguna 1997;Nowicki, Smutnicki 1998;Bożejko et al 2013). It replicates the natural searching process to find solutions to problems posed by men.…”

Section: Solution To Computational Problem With the Use Of Tabu Searcmentioning

confidence: 99%

Management of resources in multiunit construction projects with the use of a tabu search algorithm

Podolski

2016

Journal of Civil Engineering and Management

View full text Add to dashboard Cite

To cite this article: Michał Podolski (2016): Management of resources in multiunit construction projects with the use of a tabu search algorithm, Journal of Civil Engineering and Management, Abstract. The paper presents the problem of optimal management of the resources in multiunit construction project. During the creation of the models of this kind of the project the flow-shop system is rarely used. Flow-shop system now is widely applied in modelling of industrial processes, computer systems. In the model presented in the paper flow shop system with teams of working groups is used. It allows its users to shorten the time of realization of multiunit construction projects in a significant way, because works in the project can be realized by teams of working groups of any cardinality. This is new model of multiunit construction project which has not been examined in field of scheduling of construction project yet. The presented optimization model of multiunit construction project with teams of working groups performing one type of work is NP-hard optimization problem. During the scheduling of such projects there was an artificial intelligence tool used, i.e. metaheuristic tabu search algorithm. Tabu search algorithm can provide solutions of very good quality. The paper also presents a calculation example of the above mentioned problem. The obtained in calculation example result is fully satisfactory.

show abstract

Section: Solution To Computational Problem With the Use Of Tabu Searcmentioning

confidence: 99%

Management of resources in multiunit construction projects with the use of a tabu search algorithm

Podolski

2016

Journal of Civil Engineering and Management

View full text Add to dashboard Cite

show abstract

“…This kind of parallelism could be efficient if the evaluation function is CPU time-consuming and/or IO intensive. In the literature, we can found parallel versions of the most popular trajectory based metaheuristics such as parallel SA [9], [4], parallel VNS [19], [8], parallel TS [3], [6], . .…”

Section: A Trajectory Based Techniquesmentioning

confidence: 99%

Parallel Hybrid Trajectory Based Metaheuristics for Real-World Problems

Luque

Alba

2015

2015 International Conference on Intelligent Networking and Collaborative Systems

View full text Add to dashboard Cite

Abstract-This paper proposes a novel algorithm combining path relinking with a set of cooperating trajectory based parallel algorithms to yield a new metaheuristic of enhanced search features. Algorithms based on the exploration of the neighborhood of a single solution, like simulated annealing (SA), have offered accurate results for a large number of realworld problems in the past. Because of their trajectory based nature, some advanced models such as the cooperative one are competitive in academic problems, but still show many limitations in addressing large scale instances. In addition, the field of parallel models for trajectory methods has not deeply been studied yet (at least in comparison with parallel population based models). In this work, we propose a new hybrid algorithm which improves cooperative single solution techniques by using path relinking, allowing both to reduce the global execution time and to improve the efficacy of the method. We applied here this new model using a large benchmark of instances of two real-world NP-hard problems: DNA fragment assembly and QAP problems, with competitive results.

show abstract

“…In the literature, we can found parallel versions of the most popular trajectory based metaheuristics such as parallel SA [8,4], parallel VNS [17,7], parallel TS [3,6], . .…”

Section: Trajectory Based Techniquesmentioning

confidence: 99%

Enhancing parallel cooperative trajectory based metaheuristics with path relinking

Luque

Alba

2014

Proceedings of the 2014 Annual Conference on Genetic and Evolutionary Computation

View full text Add to dashboard Cite

This paper proposes a novel algorithm combining path relinking with a set of cooperating trajectory based parallel algorithms to yield a new metaheuristic of enhanced search features. Algorithms based on the exploration of the neighborhood of a single solution, like simulated annealing (SA), have offered accurate results for a large number of real-world problems in the past. Because of their trajectory based nature, some advanced models such as the cooperative one are competitive in academic problems, but still show many limitations in addressing large scale instances. In addition, the field of parallel models for trajectory methods has not deeply been studied yet (at least in comparison with parallel population based models). In this work, we propose a new hybrid algorithm which improves cooperative single solution techniques by using path relinking, allowing both to reduce the global execution time and to improve the efficacy of the method. We test here this new model using a large benchmark of instances of two well-known NP-hard problems: MAXSAT and QAP, with competitive results.

show abstract

Parallel tabu search algorithm for the hybrid flow shop problem

Cited by 48 publications

References 13 publications

Management of resources in multiunit construction projects with the use of a tabu search algorithm

Management of resources in multiunit construction projects with the use of a tabu search algorithm

Parallel Hybrid Trajectory Based Metaheuristics for Real-World Problems

Enhancing parallel cooperative trajectory based metaheuristics with path relinking

Contact Info

Product

Resources

About