Genetic algorithm for a Quay Management Problem

Research output: Contribution to journalArticle

2 Citations (Scopus)

Abstract

In this paper the Quay Management Problem (QMP) is defined as a Quadratic Assignment problem (QAP) which consists of assigning customers to loading positions and satisfying their demands. This work aims to help the decision maker to assign customer to a list of possible loading positions, select storage areas to serve the customer and to assign a number of lifting trucks to each loading position. This work means to minimise cost and residence time. A Genetic Algorithm is applied to find the best solution to the problem. The nearest neighbours exploration is used with recombination procedure and maintaining the elements with the lower cost. The best solution found is always saved. The GA has performed better in terms of computational time for the different instances tested.

Original languageEnglish
Pages (from-to)2257-2263
Number of pages7
JournalAustralian Journal of Basic and Applied Sciences
Volume5
Issue number9
Publication statusPublished - Sep 2011

Fingerprint

Genetic algorithms
Trucks
Costs

Keywords

  • Genetic Algorithm
  • Quadratic Assignment Problem
  • Quay Management Problem

ASJC Scopus subject areas

  • General

Cite this

Genetic algorithm for a Quay Management Problem. / Zirour, Mourad; Liong, Choong Yeun; Ismail, Wan Rosmanira.

In: Australian Journal of Basic and Applied Sciences, Vol. 5, No. 9, 09.2011, p. 2257-2263.

Research output: Contribution to journalArticle

@article{ba6c0e6fe5cb41df89bebe4333492f9a,
title = "Genetic algorithm for a Quay Management Problem",
abstract = "In this paper the Quay Management Problem (QMP) is defined as a Quadratic Assignment problem (QAP) which consists of assigning customers to loading positions and satisfying their demands. This work aims to help the decision maker to assign customer to a list of possible loading positions, select storage areas to serve the customer and to assign a number of lifting trucks to each loading position. This work means to minimise cost and residence time. A Genetic Algorithm is applied to find the best solution to the problem. The nearest neighbours exploration is used with recombination procedure and maintaining the elements with the lower cost. The best solution found is always saved. The GA has performed better in terms of computational time for the different instances tested.",
keywords = "Genetic Algorithm, Quadratic Assignment Problem, Quay Management Problem",
author = "Mourad Zirour and Liong, {Choong Yeun} and Ismail, {Wan Rosmanira}",
year = "2011",
month = "9",
language = "English",
volume = "5",
pages = "2257--2263",
journal = "Australian Journal of Basic and Applied Sciences",
issn = "1991-8178",
publisher = "INSInet Publications",
number = "9",

}

TY - JOUR

T1 - Genetic algorithm for a Quay Management Problem

AU - Zirour, Mourad

AU - Liong, Choong Yeun

AU - Ismail, Wan Rosmanira

PY - 2011/9

Y1 - 2011/9

N2 - In this paper the Quay Management Problem (QMP) is defined as a Quadratic Assignment problem (QAP) which consists of assigning customers to loading positions and satisfying their demands. This work aims to help the decision maker to assign customer to a list of possible loading positions, select storage areas to serve the customer and to assign a number of lifting trucks to each loading position. This work means to minimise cost and residence time. A Genetic Algorithm is applied to find the best solution to the problem. The nearest neighbours exploration is used with recombination procedure and maintaining the elements with the lower cost. The best solution found is always saved. The GA has performed better in terms of computational time for the different instances tested.

AB - In this paper the Quay Management Problem (QMP) is defined as a Quadratic Assignment problem (QAP) which consists of assigning customers to loading positions and satisfying their demands. This work aims to help the decision maker to assign customer to a list of possible loading positions, select storage areas to serve the customer and to assign a number of lifting trucks to each loading position. This work means to minimise cost and residence time. A Genetic Algorithm is applied to find the best solution to the problem. The nearest neighbours exploration is used with recombination procedure and maintaining the elements with the lower cost. The best solution found is always saved. The GA has performed better in terms of computational time for the different instances tested.

KW - Genetic Algorithm

KW - Quadratic Assignment Problem

KW - Quay Management Problem

UR - http://www.scopus.com/inward/record.url?scp=81755168978&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=81755168978&partnerID=8YFLogxK

M3 - Article

VL - 5

SP - 2257

EP - 2263

JO - Australian Journal of Basic and Applied Sciences

JF - Australian Journal of Basic and Applied Sciences

SN - 1991-8178

IS - 9

ER -