Constrained transportation scheduling
G. Papa, P. Korošec
Third International Conference on Bioinspired Optimization Methods and their Applications BIOMA 2008
Ljubljana, Slovenia, 13-14 October, 2008
This paper presents a comparison of two metaheuristic approaches in solving a constrained transportation scheduling problem. We compared Parameter-less Evolutionary Search and Ant Stigmergy Algorithm in solving the schedule optimization problem. The transportation scheduling 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