A Weighted Population Update Rule for PACO Applied to the Single Machine Total Weighted Tardiness Problem

04/17/2020
by   Daniel Abitz, et al.
0

In this paper a new population update rule for population based ant colony optimization (PACO) is proposed. PACO is a well known alternative to the standard ant colony optimization algorithm. The new update rule allows to weight different parts of the solutions. PACO with the new update rule is evaluated for the example of the single machine total weighted tardiness problem (SMTWTP). This is an NP-hard optimization problem where the aim is to schedule jobs on a single machine such that their total weighted tardiness is minimized. PACO with the new population update rule is evaluated with several benchmark instances from the OR-Library. Moreover, the impact of the weights of the jobs on the solutions in the population and on the convergence of the algorithm are analyzed experimentally. The results show that PACO with the new update rule has on average better solution quality than PACO with the standard update rule.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/27/2022

A Quantum Optimization Algorithm for Single Machine Total Weighted Tardiness Minimization

A single machine total weighted tardiness minimization (TWTM) problem in...
research
10/07/2020

New Complexity Results on Coalitional Manipulation of Borda

The Borda voting rule is a positional scoring rule for z candidates such...
research
07/26/2012

A novel Hopfield neural network approach for minimizing total weighted tardiness of jobs scheduled on identical machines

This paper explores fast, polynomial time heuristic approximate solution...
research
03/21/2019

Exploiting Promising Sub-Sequences of Jobs to solve the No-Wait Flowshop Scheduling Problem

The no-wait flowshop scheduling problem is a variant of the classical pe...
research
12/03/2021

An Analytical Update Rule for General Policy Optimization

We present an analytical policy update rule that is independent of param...
research
07/27/2023

Single machine rescheduling for new orders: properties and complexity results

Rescheduling problems arise in a variety of situations where a previousl...
research
06/21/2019

Re-Weighted ℓ_1 Algorithms within the Lagrange Duality Framework: Bringing Interpretability to Weights

We consider an important problem in signal processing, which consists in...

Please sign up or login with your details

Forgot password? Click here to reset