Fitness landscapes for the total tardiness single machine scheduling problem

Title:

Fitness landscapes for the total tardiness single machine scheduling problem

Creator:

Mendes, Alexandre S., Franca, Paulo M., and Moscato, Pablo

Identifier:

https://cdk.lib.cas.cz/client/handle/uuid:4d437670-06b8-4ce9-93e9-4f9c64a58e8c
uuid:4d437670-06b8-4ce9-93e9-4f9c64a58e8c

Subject:

genetic algorithms, memetic algorithms, fitness landscapes, machine scheduling, and combinatorial optimization

Type:

model:article and TEXT

Format:

bez média and svazek

Description:

This páper addresses several issues related to the approximate solution of the Single Machine Scheduling problém with sequence-dependent setup times using metaheuristic methods. Instances with known optimal solution are solved using a memetic algorithm and a multiple start approach. A fitness landscape analysis is also conducted on a subset of instances to understand the behavior of the two approaches during the optimization process. We also present a novel way to create instances with known optimal Solutions from the optimally solved asymmetric travelling salesman problém (ATSP) instances. Finally we argue for the test set of instances to be ušed in future works as a convenient performance benchmark.

Language:

English

Rights:

http://creativecommons.org/publicdomain/mark/1.0/
policy:public

Source:

Neural network world: international journal on neural and mass-parallel computing and information systems | 2002 Volume:12 | Number:2

Harvested from:

CDK

Metadata only:

false