Adaptive Large Neighborhood Search for Scheduling of Mobile Robots

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14330%2F19%3A00109329" target="_blank" >RIV/00216224:14330/19:00109329 - isvavai.cz</a>

Výsledek na webu

<a href="https://dl.acm.org/citation.cfm?doid=3321707.3321764" target="_blank" >https://dl.acm.org/citation.cfm?doid=3321707.3321764</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1145/3321707.3321764" target="_blank" >10.1145/3321707.3321764</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Adaptive Large Neighborhood Search for Scheduling of Mobile Robots

Popis výsledku v původním jazyce

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.

Název v anglickém jazyce

Adaptive Large Neighborhood Search for Scheduling of Mobile Robots

Popis výsledku anglicky

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.

Druh

D - Stať ve sborníku

CEP obor

—

OECD FORD obor

10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Projekt

—

Návaznosti

I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Rok uplatnění

2019

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název statě ve sborníku

The Genetic and Evolutionary Computation Conference (GECCO)

ISBN

9781450361118

ISSN

—

e-ISSN

—

Počet stran výsledku

9

Strana od-do

224-232

Název nakladatele

ACM

Místo vydání

New York, NY, USA

Místo konání akce

New York, NY, USA

Datum konání akce

1. 1. 2019

Typ akce podle státní příslušnosti

WRD - Celosvětová akce

Kód UT WoS článku

000523218400029