The University of Southampton
University of Southampton Institutional Repository
Warning ePrints Soton is experiencing an issue with some file downloads not being available. We are working hard to fix this. Please bear with us.

Multicrossover genetic algorithms for combinatorial optimisation problems

Multicrossover genetic algorithms for combinatorial optimisation problems
Multicrossover genetic algorithms for combinatorial optimisation problems
The usual strategy within a genetic algorithm (GA) is to generate a pair of offspring during crossover. We hypothesise that generating multiple offspring during the crossover can improve the performance of a GA. This thesis reports on the development and evaluation of a new strain of GA, called the MultiCrossover Genetic Algorithms (MXGAs) for solving combinatorial optimisation problems (COPs) to investigate this hypothesis, The MXGA utilises a multicrossover operator that uses a simple yet effective standard crossover strategy to generate offspring, The proposed multicrossover first generates a candidate list of temporary offspring from a pair of selected parents through repeated applications of the proposed crossover strategy. Two distinct temporary offspring are generated each time the strategy is executed. The best and a selected temporary offspring are then chosen to be the offspring for the current generation. Various techniques are also introduced into the MXGA to further enhance the solution quality. In this thesis, MXGAs are applied to three specific variants of COPs: single machine family scheduling problem, non-oriented two-dimensional rectangular single bin size bin packing problem with due dates, and symmetric travelling salesman problem with due dates. These problems are motivated by the dilemma faced by the manufacturing organisations which efficiency and customers' satisfaction. The common characteristic of the problems studied is the inclusion of the customers' due dates. Schemes for obtaining a lower bound on the maximum lateness for the problems studied are also introduced. Extensive computational experiments are carried out to assess the effectiveness of the MXGAs compared to other local search methods such as tabu search, steepest descent and a standard genetic algorithm
University of Southampton
Lee, Lai Soon
a43522b8-1d9b-4103-b95b-d326dea75a20
Lee, Lai Soon
a43522b8-1d9b-4103-b95b-d326dea75a20
Potts, Christopher
58c36fe5-3bcb-4320-a018-509844d4ccff

Lee, Lai Soon (2006) Multicrossover genetic algorithms for combinatorial optimisation problems. University of Southampton, Doctoral Thesis, 292pp.

Record type: Thesis (Doctoral)

Abstract

The usual strategy within a genetic algorithm (GA) is to generate a pair of offspring during crossover. We hypothesise that generating multiple offspring during the crossover can improve the performance of a GA. This thesis reports on the development and evaluation of a new strain of GA, called the MultiCrossover Genetic Algorithms (MXGAs) for solving combinatorial optimisation problems (COPs) to investigate this hypothesis, The MXGA utilises a multicrossover operator that uses a simple yet effective standard crossover strategy to generate offspring, The proposed multicrossover first generates a candidate list of temporary offspring from a pair of selected parents through repeated applications of the proposed crossover strategy. Two distinct temporary offspring are generated each time the strategy is executed. The best and a selected temporary offspring are then chosen to be the offspring for the current generation. Various techniques are also introduced into the MXGA to further enhance the solution quality. In this thesis, MXGAs are applied to three specific variants of COPs: single machine family scheduling problem, non-oriented two-dimensional rectangular single bin size bin packing problem with due dates, and symmetric travelling salesman problem with due dates. These problems are motivated by the dilemma faced by the manufacturing organisations which efficiency and customers' satisfaction. The common characteristic of the problems studied is the inclusion of the customers' due dates. Schemes for obtaining a lower bound on the maximum lateness for the problems studied are also introduced. Extensive computational experiments are carried out to assess the effectiveness of the MXGAs compared to other local search methods such as tabu search, steepest descent and a standard genetic algorithm

Text
Lee - Version of Record
Available under License University of Southampton Thesis Licence.
Download (4MB)

More information

Published date: 1 April 2006

Identifiers

Local EPrints ID: 438242
URI: http://eprints.soton.ac.uk/id/eprint/438242
PURE UUID: 95addbc5-7b6b-4f2d-8b8f-6eb255056f3f

Catalogue record

Date deposited: 04 Mar 2020 17:31
Last modified: 30 Mar 2020 16:31

Export record

Contributors

Author: Lai Soon Lee
Thesis advisor: Christopher Potts

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of http://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×