A simple and effective hybrid genetic search for the job sequencing and tool switching problem

10/10/2019
by   Jordana Mecler, et al.
0

The job sequencing and tool switching problem (SSP) has been extensively studied in the field of operations research, due to its practical relevance and methodological interest. Given a machine that can load a limited amount of tools simultaneously and a number of jobs that require a subset of the available tools, the SSP seeks a job sequence that minimizes the number of tool switches in the machine. To solve this problem, we propose a simple and efficient hybrid genetic search based on a generic solution representation, a tailored decoding operator, efficient local searches and diversity management techniques. To guide the search, we introduce a secondary objective designed to break ties. These techniques allow to explore structurally different solutions and escape local optima. As shown in our computational experiments on classical benchmark instances, our algorithm significantly outperforms all previous approaches while remaining simple to apprehend and easy to implement. We finally report results on a new set of larger instances to stimulate future research and comparative analyses.

READ FULL TEXT
research
07/05/2022

An almost linear time complexity algorithm for the Tool Loading Problem

As shown by Tang, Denardo [9] the job Sequencing and tool Switching Prob...
research
05/12/2022

An improved KTNS algorithm for the job sequencing and tool switching problem

We outline a new Max Pipe Construction Algorithm (MPCA) with the purpose...
research
01/12/2023

Improving Inference Performance of Machine Learning with the Divide-and-Conquer Principle

Many popular machine learning models scale poorly when deployed on CPUs....
research
10/12/2011

Solution-Guided Multi-Point Constructive Search for Job Shop Scheduling

Solution-Guided Multi-Point Constructive Search (SGMPCS) is a novel cons...
research
11/23/2020

Hybrid Genetic Search for the CVRP: Open-Source Implementation and SWAP* Neighborhood

The vehicle routing problem is one of the most studied combinatorial opt...
research
09/12/2022

Solving the Job Shop Scheduling Problem with Ant Colony Optimization

The Job Shop Schedule Problem (JSSP) refers to the ability of an agent t...

Please sign up or login with your details

Forgot password? Click here to reset