Abstract

The study presents an algorithm for conflict-free Automated Guided Vehicle (AGV) routing minimizing travel time and total job tardiness. The problem is represented using one sub-chromosome for dispatching represented with random keys and the remaining sub-chromosomes for routing represented with priority-based encoding. The algorithm used weight mapping crossover (WMX) and Insertion Mutation (IM) for priority-based representation and parameterized uniform crossover (PUX) for random-key based representation. Conflict is detected and avoided using the route occupation time of each segment. Numerical experiment was conducted on the developed algorithm.

Keywords:

Automated Guided Vehicle (AGV), dispatching, multi-objective genetic algorithm, metaheuristics, optimization, routing,

References

Competing interests

The authors have no competing interests.

Open Access Policy

This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.

Copyright

The authors have no competing interests.