Citation

Papa, G and Korosec, P Metaheuristic Approach to Loading Schedule Problem. Proceedings of the 4th Multidisciplinary International Scheduling Conference: Theory and Applications (MISTA 2009), 10-12 Aug 2009, Dublin, Ireland, pages 616-627, 2009.

Paper

Abstract

The paper presents a comparison of two metaheuristic approaches in solving a constrained transportation scheduling problem (i.e., transport of goods in an emergency situations). We compared Parameter-less Evolutionary Search and Ant Stigmergy Algorithm. The transportation scheduling/allocation problem is NP-hard, and is applicable to different real-life situations with high frequency of loading and unloading operations; like in depots, warehouses and ports.

pdf

You can download the pdf of this publication from here

doi

This publication does not have a doi, so we cannot provide a link to the original source

What is a doi?: A doi (Document Object Identifier) is a unique identifier for sicientific papers (and occasionally other material). This provides direct access to the location where the original article is published using the URL http://dx.doi/org/xxxx (replacing xxx with the doi). See http://dx.doi.org/ for more information

URL

This pubication does not have a URL associated with it.

The URL is only provided if there is additional information that might be useful. For example, where the entry is a book chapter, the URL might link to the book itself.

Bibtex

@INPROCEEDINGS{2009-616-627-P, author = {G. Papa and P. Korosec},
title = {Metaheuristic Approach to Loading Schedule Problem},
booktitle = {Proceedings of the 4th Multidisciplinary International Scheduling Conference: Theory and Applications (MISTA 2009), 10-12 Aug 2009, Dublin, Ireland},
year = {2009},
editor = {J. Blazewicz and M. Drozdowski and G. Kendall and B. McCollum},
pages = {616--627},
note = {Paper},
abstract = {The paper presents a comparison of two metaheuristic approaches in solving a constrained transportation scheduling problem (i.e., transport of goods in an emergency situations). We compared Parameter-less Evolutionary Search and Ant Stigmergy Algorithm. The transportation scheduling/allocation problem is NP-hard, and is applicable to different real-life situations with high frequency of loading and unloading operations; like in depots, warehouses and ports.},
owner = {gxk},
timestamp = {2010.10.11},
webpdf = {2009-616-627-P.pdf} }