Hybrid method with CS and BRKGA applied to the minimization of tool switches problem

Chaves, Antônio Augusto; Lorena, Luiz Antônio Nogueira; Senne, Edson Luiz França; Resende, Maurício G. C.

doi:10.1016/j.cor.2015.10.009

Cited by 39 publications

(56 citation statements)

References 31 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Burger et al (2015) remark that the difference in the number of tools per job and magazine size influences the performance of the solution method and that this should be further investigated. Chaves et al (2016) present a Clustering Search (CS) technique for the basic SSP that is able to identify promising regions of the search space by generating solutions with a Biased Random Key GA (BRKGA) and clustering the solutions for further intensification of the neighbourhood using the Variable Neighbourhood Search. The results of CS + BRKGA are compared to a generic iterated local search (ILS) method and a stand-alone BRKGA.…”

Section: The Uniform Sspmentioning

confidence: 99%

“…Although CS + BRKGA shows high running times compared to BRKGA, the solution quality is slightly better than ILS and BRKGA. Paiva and Carvalho (2017) present an ILS metaheuristic that outperforms the CS + BRKGA algorithm of Chaves et al (2016) for test instances of different studies. Their ILS metaheuristic is based on a new graph representation for which they develop a graph search based heuristic that analyses the relationship between tools and a local search method based on block grouping.…”

Section: The Uniform Sspmentioning

confidence: 99%

See 1 more Smart Citation

The job sequencing and tool switching problem: state-of-the-art literature review, classification, and trends

Calmels

2018

International Journal of Production Research

View full text Add to dashboard Cite

The job sequencing and tool switching problem is a combinatorial optimisation problem that appears in various industries, mainly in the manufacturing sector. Although tool switching is only part of a much larger decision-making process in manufacturing systems, it has a major impact on the overall performance of the system by affecting the total set-up time as well as the machine and tool utilisation. Over the past few decades, various approaches have been applied to tool switching problems. This study provides a comprehensive review of the literature on the job sequencing and tool switching problem. Studies are identified and compared through a structured literature review and classified according to a new framework which allows the identification of problem perspectives and solution methods. The results show that current research does not fully exploit real-world situations and studies are often limited to a single-machine and uniform tool size and set-up time. Finally, this literature review summarises the current research results and provides directions for future research.. comparatively review, in an organised fashion, the existing unclassified tool switching literature with respect to problem formulation development and applied solution methods, . develop a classification scheme that may help to identify aspects of the tool switching problem that have been insufficiently explored and show how far the existing modelling efforts have progressed towards real-world needs, . synthesise the past trends of tool switching studies, and . offer some suggestions and directions for future research.The remainder of this paper is structured as follows. Section 2 introduces the generic tool switching problem, its subproblems, and related optimisation problems. Subsequently, the research approach is described in section 3, and the classification framework is described in section 4. The literature review is presented in section 5. Section 6 outlines the research gaps and implications for future research. Section 7 concludes the paper with a short summary.

show abstract

Section: The Uniform Sspmentioning

confidence: 99%

Section: The Uniform Sspmentioning

confidence: 99%

The job sequencing and tool switching problem: state-of-the-art literature review, classification, and trends

Calmels

2018

International Journal of Production Research

View full text Add to dashboard Cite

show abstract

“…The article is presented by Luiz Usberti et al [10]. Chaves et al [11] presented the minimization of minimum required tool switches to process a set of jobs on machine center. They use local search heuristics to simplify clustering process; the new hybrid heuristic based algorithm is named Biased Random Key Genetic Algorithm (BRKGA) and the clustering search (CS).…”

Section: Literature Reviewmentioning

confidence: 99%

“…There are many commonly used neighbourhood structures, for example, insertion, two adjacent elements insertion, swap and two adjacent elements swap (see Fig. 1 a-d) [11]. Block-insertion, as the neighbourhood move used to generate the path, is easy to generate a series of moves [10].…”

Section: Neighbourhood Structuresmentioning

confidence: 99%

“…In this paper, we present a random multineighbourhood based shuffled frog-leaping algorithm with path relinking (RMN-SFLA-PR) for solving combinatorial optimization problems. The applied order of the neighbourhood structures in [11] is fixed, which is determined in advance. This paper applies random neighbourhood structures size and randomly applied order of the neighbourhood structures.…”

Section: Hybrid Sfla With Prmentioning

confidence: 99%

See 1 more Smart Citation

An Effective Use of Hybrid Metaheuristics Algorithm for Job Shop Scheduling Problem

Zhang¹,

Liu²,

Moraca³

et al. 2016

Int. j. simul. model.

View full text Add to dashboard Cite

This paper presents an effective use of hybrid metaheuristics algorithm for solving Job Shop Scheduling Problem (JSSP). Integration of three metaheuristics algorithms: Shuffled Frog Leaping Algorithm (SFLA), Intelligent Water Drops algorithm (IWD) and Path Relinking (PR) algorithm were put together to solve JSSP. First, simulation model was developed and tested on the test data of Traveller Salesman Problem (TSP). Second, the model was tested on real world production line to solve the problem of Minimum Needed Workers (MNW) at the production line. The model enables individual test of three mentioned algorithms and calculation of new proposed Random MultiNeighbourhood based Shuffled Frog Leaping Algorithm with Path Relinking (RMN-SFLA-PR). Experiments were tested on two software environments MATLAB and Simio, which gives us reliable, robust and tangible results. Results show that the new proposed RMN-SFLA-PR algorithm converged to optimum almost ten times faster than individual algorithms. The most important thing is the successful rate of all independent runs of the proposed RMN-SFLA-PR is 100 % in low-dimensional cases of the 4 benchmarks (dj38) and in JSSP to solve MNW for the real world production line.

show abstract

A Multi-objective Biased Random-Key Genetic Algorithm for Service Technician Routing and Scheduling Problem

Damm

Ronconi

2021

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Hybrid method with CS and BRKGA applied to the minimization of tool switches problem

Cited by 39 publications

References 31 publications

The job sequencing and tool switching problem: state-of-the-art literature review, classification, and trends

The job sequencing and tool switching problem: state-of-the-art literature review, classification, and trends

An Effective Use of Hybrid Metaheuristics Algorithm for Job Shop Scheduling Problem

A Multi-objective Biased Random-Key Genetic Algorithm for Service Technician Routing and Scheduling Problem

Contact Info

Product

Resources

About