Coordinated optimization of scheduling and path planning for delivery robots in intelligent manufacturing workshops

Delivery robots (DRs) are essential components of modern automated logistics systems, particularly in manufacturing workshops where they are extensively used for material delivery tasks. Their implementation provides significant benefits, including reduced production costs and enhanced transportation efficiency. This paper addresses a critical challenge in this field: the coordinated optimization of scheduling and path planning for multiple DRs. We tackle this problem by comprehensively considering both robot energy consumption costs and task delay penalties, formulating it as a mixed-integer linear program (MILP). To solve this complex optimization problem, we employ an adaptive genetic algorithm (AGA). The effectiveness and efficiency of the proposed model and algorithm are validated through the comprehensive simulation case.

Authors

Institutions

Publication Details

Published
2024-10-11
DOI
https://doi.org/10.1145/3708597.3708601
Primary Topic
Advanced Manufacturing and Logistics Optimization
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Coordinated optimization of scheduling and path planning for delivery robots in intelligent manufacturing workshops

Xiang Huo
1 links
Advanced Manufacturing and Logistics Optimization
article

Coordinated optimization of scheduling and path planning for delivery robots in intelligent manufacturing workshops

Xiang Huo
article en

Abstract

Delivery robots (DRs) are essential components of modern automated logistics systems, particularly in manufacturing workshops where they are extensively used for material delivery tasks. Their implementation provides significant benefits, including reduced production costs and enhanced transportation efficiency. This paper addresses a critical challenge in this field: the coordinated optimization of scheduling and path planning for multiple DRs. We tackle this problem by comprehensively considering both robot energy consumption costs and task delay penalties, formulating it as a mixed-integer linear program (MILP). To solve this complex optimization problem, we employ an adaptive genetic algorithm (AGA). The effectiveness and efficiency of the proposed model and algorithm are validated through the comprehensive simulation case.

Beijing Jiaotong University (CN)
Openalex Percentile: Top 61%
Advanced Manufacturing and Logistics Optimization
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.