Applying genetic algorithms to convoy scheduling

4Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

We present the results of our work on applying genetic algorithms combined with a discrete event simulation to the problem of convoy scheduling. We show that this approach can automatically remove conflicts from a convoy schedule thereby providing to the human operator the ability to search for better solutions after an initial conflict free schedule is obtained. We demonstrate that it is feasible to find a conflict free schedule for realistic problems in a few minutes on a common workstation or laptop. The system is currently being integrated into a larger Transportation Information System that regulates highway movement for the military. © 2006 International Federation for Information Processing.

Cite

CITATION STYLE

APA

Robinson, E. M., & Leiss, E. L. (2006). Applying genetic algorithms to convoy scheduling. IFIP International Federation for Information Processing, 217, 315–323. https://doi.org/10.1007/978-0-387-34747-9_33

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free