Order Acceptance and Scheduling with Sequence-dependent Setup Times: a New Memetic Algorithm and Benchmark of the State of the Art

by   Lei He, et al.
National University of Defense Technology

The Order Acceptance and Scheduling (OAS) problem describes a class of real-world problems such as in smart manufacturing and satellite scheduling. This problem consists of simultaneously selecting a subset of orders to be processed as well as determining the associated schedule. A common generalization includes sequence-dependent setup times and time windows. A novel memetic algorithm for this problem, called Sparrow, comprises a hybridization of biased random key genetic algorithm (BRKGA) and adaptive large neighbourhood search (ALNS). Sparrow integrates the exploration ability of BRKGA and the exploitation ability of ALNS. On a set of standard benchmark instances, this algorithm obtains better-quality solutions with runtimes comparable to state-of-the-art algorithms. To further understand the strengths and weaknesses of these algorithms, their performance is also compared on a set of new benchmark instances with more realistic properties. We conclude that Sparrow is distinguished by its ability to solve difficult instances from the OAS literature, and that the hybrid steady-state genetic algorithm (HSSGA) performs well on large instances in terms of optimality gap, although taking more time than Sparrow.


Analysis of Optimal Recombination in Genetic Algorithm for a Scheduling Problem with Setups

In this paper, we perform an experimental study of optimal recombination...

A new hybrid genetic algorithm for protein structure prediction on the 2D triangular lattice

The flawless functioning of a protein is essentially linked to its own t...

A Case Study of Vehicle Route Optimization

In the last decades, the classical Vehicle Routing Problem (VRP), i.e., ...

A new benchmark set for Traveling salesman problem and Hamiltonian cycle problem

We present a benchmark set for Traveling salesman problem (TSP) with cha...

A Hybrid Genetic Algorithm for the min-max Multiple Traveling Salesman Problem

This paper proposes a hybrid genetic algorithm for solving the Multiple ...

Research on Limited Buffer Scheduling Problems in Flexible Flow Shops with Setup Times

In order to solve the limited buffer scheduling problems in flexible flo...

Understanding Algorithm Performance on an Oversubscribed Scheduling Application

The best performing algorithms for a particular oversubscribed schedulin...

Please sign up or login with your details

Forgot password? Click here to reset