A Memetic Algorithm for the Tool Switching Problem

Author(s):  
Jhon Edgar Amaya ◽  
Carlos Cotta ◽  
Antonio J. Fernández
Author(s):  
Jhon Edgar Amaya ◽  
Carlos Cotta ◽  
Antonio J. Fernández-Leiva

AbstractThe tool switching problem (ToSP) is well known in the domain of flexible manufacturing systems. Given a reconfigurable machine, the ToSP amounts to scheduling a collection of jobs on this machine (each of them requiring a different set of tools to be completed), as well as the tools to be loaded/unloaded at each step to process these jobs, such that the total number of tool switches is minimized. Different exact and heuristic methods have been defined to deal with this problem. In this work, we focus on memetic approaches to this problem. To this end, we have considered a number of variants of three different local search techniques (hill climbing, tabu search, and simulated annealing), and embedded them in a permutational evolutionary algorithm. It is shown that the memetic algorithm endowed with steepest ascent hill climbing search yields the best results, performing synergistically better than its stand-alone constituents, and providing better results than the rest of the algorithms (including those returned by an effective ad hoc beam search heuristic defined in the literature for this problem).


2010 ◽  
Vol 36 (2) ◽  
pp. 242-248 ◽  
Author(s):  
Jie CHEN ◽  
Chen CHEN ◽  
Juan ZHANG ◽  
Bin XIN

2020 ◽  
Vol 142 ◽  
pp. 106241
Author(s):  
Bo Peng ◽  
Yuan Zhang ◽  
Zhipeng Lü ◽  
T.C.E. Cheng ◽  
Fred Glover

2021 ◽  
pp. 107473
Author(s):  
Mohammad Bagher Dowlatshahi ◽  
Marjan Kuchaki Rafsanjani ◽  
Brij B. Gupta

2021 ◽  
Vol 1748 ◽  
pp. 062045
Author(s):  
Haixia Gong ◽  
Wei Tang ◽  
Bowen Tan ◽  
Liquan Wang

2021 ◽  
Author(s):  
Rafael Martí ◽  
Anna Martínez-Gavara ◽  
Jesús Sánchez-Oro

Sign in / Sign up

Export Citation Format

Share Document