Informace o publikaci
Adaptive Large Neighborhood Search for Scheduling of Mobile Robots
| Autoři | |
|---|---|
| Rok publikování | 2019 |
| Druh | Článek ve sborníku |
| Konference | The Genetic and Evolutionary Computation Conference (GECCO) |
| Fakulta / Pracoviště MU | |
| Citace | |
| www | DOI |
| Doi | http://dx.doi.org/10.1145/3321707.3321764 |
| Klíčová slova | Scheduling; Mobile robots; Adaptive Large Neighborhood Search; Flexible Manufacturing Systems |
| Popis | Our work addresses the scheduling of mobile robots for transportation and processing of operations on machines in a flexible manufacturing system. Both mobile robots and automated guided vehicles (AGVs) can transport components among machines in the working space. Nevertheless, the difference is that mobile robots considered in this work can process specific value-added operations, which is not possible for AGVs. This new feature increases complexity as well as computational demands. To summarize, we need to compute a sequence of operations on machines, the robot assignments for transportation, and the robot assignments for processing. The main contribution is the proposal of an adaptive large neighborhood search algorithm with the sets of exploration and exploitation heuristics to solve the problem considering makespan minimization. Experimental evaluation is presented on the existing benchmarks. The quality of our solutions is compared to a heuristic based on genetic algorithm and mixed- integer programming proposed recently. The comparison shows that our approach can achieve comparable results in real time which is in order of magnitude faster than the earlier heuristic. |