An Interactive Memetic Algorithm for Production and Manufacturing Problems Modelled as a Multi-Objective Travelling Salesman Problem

Loading...
Thumbnail Image

Date

2012

Authors

Samanlıoğlu, Funda
Ferrell, William G.
Kurz, M. E.

Journal Title

Journal ISSN

Volume Title

Publisher

Taylor & Francis Ltd

Open Access Color

OpenAIRE Downloads

OpenAIRE Views

Research Projects

Organizational Units

Journal Issue

Abstract

In this paper a preference-based interactive memetic random-key genetic algorithm (PIMRKGA) is developed and used to find (weakly) Pareto optimal solutions to manufacturing and production problems that can be modelled as a symmetric multi-objective travelling salesman problem. Since there are a large number of solutions to these kinds of problems to reduce the computational effort and to provide more desirable and meaningful solutions to the decision maker this research focuses on using interactive input from the user to explore the most desirable parts of the efficient frontier instead of trying to reproduce the entire frontier. Here users define their preferences by selecting among five classes of objective functions and by specifying weighting coefficients bounds and optional upper bounds on indifference tradeoffs. This structure is married with the memetic algorithm - a random-key genetic algorithm hybridised by local search. The resulting methodology is an iterative process that continues until the decision maker is satisfied with the solution. The paper concludes with case studies utilising different scenarios to illustrate possible manufacturing and production related implementations of the methodology.

Description

Keywords

Multi-criterion decision making, Genetic algorithms, Pareto optimisation, Metaheuristics, Interactive computing, Travelling salesman problems

Turkish CoHE Thesis Center URL

Fields of Science

Citation

3

WoS Q

Q1

Scopus Q

Q1

Source

Volume

50

Issue

20

Start Page

5671

End Page

5682