Metaheuristic Approach to Loading Schedule Problem
Authors
G. Papa, P. Korošec
Publication
of the 4th Multidisciplinary International Conference on Scheduling: Theory and Applications MISTA 2009
Dublin, Ireland, 10-12 August, 2009
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.
BIBTEX copied to Clipboard