Metaheuristic approach to transportation scheduling in emergency situations
Metaheuristic approach to transportation scheduling in emergency situations
- Neue Suche nach: Peter Korošec
- Neue Suche nach: Gregor Papa
- Neue Suche nach: Peter Korošec
- Neue Suche nach: Gregor Papa
This paper compares two metaheuristic approaches in solving a constrained transportation scheduling problem, which can be found in transporting goods in emergency situations. We compared Greedy Search, 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. To evaluate the efficiency of the presented approaches, they were tested with four tasks based on realistic data. Each task was evaluated using group and free transportation approach. The experiments proved that all tested algorithms are viable option in solving such scheduling problems, however some performing better than others on some tasks.
Dokumentinformationen
Metaheuristic approach to transportation scheduling in emergency situations
2013
Aufsatz (Zeitschrift)
Elektronische Ressource
Unbekannt
Metadata by DOAJ is licensed under CC BY-SA 1.0
Ähnliche Titel
Driving Behavior in Emergency Situations: Psychospacing Modeling Approach
| Online Contents | 2012
A Metaheuristic Approach to Aircraft Departure Scheduling at London Heathrow Airport
| Springer Verlag | 2008
Driving Behavior in Emergency Situations
| Transportation Research Record | 2012
A Metaheuristic Approach to Aircraft Departure Scheduling at London Heathrow Airport
| British Library Conference Proceedings | 2008
Driver Training for Emergency Situations
| SAE Technical Papers | 1972