Datasets
Standard Dataset
Dataset of Route Optimization for Large-Scale AGV Systems with 1000 units
- Citation Author(s):
- Submitted by:
- NguyenQuang Thinh
- Last updated:
- Fri, 03/14/2025 - 12:48
- DOI:
- 10.21227/fxax-0v83
- Data Format:
- License:
- Categories:
- Keywords:
Abstract
This project aims to optimize the routing of large-scale Automated Guided Vehicles (AGVs) in a large-scale logistics warehouse in Japan using Quantum Annealing. The project will generate real-world operational problems and use them for performance evaluation. It is designed to be compatible with various solvers, including classical solvers and quantum annealing solvers.
This dataset contains multiple instances of the route optimization problem for Automated Guided Vehicles (AGVs) with 1,000 units in a large-scale logistics warehouse in Japan.
Each problem is stored in CSV format and includes the following key information:
-
Route Candidate Data
A list of available routes for each AGV, representing various routes from the starting point to the destination. This provides flexibility in route selection. -
Remaining Travel Time for Each Route
The remaining travel time associated with each route, enabling the optimization of travel time and selection of the most efficient path for each AGV. -
Priority of Each AGV
The priority assigned to each AGV, allowing for optimized route selection based on the urgency of shipments or high-priority tasks.
These data elements serve as input for the cost functions defined in the project’s research papers. Researchers can utilize these instances to propose new route optimization techniques, with the goal of developing innovative AGV control strategies for large-scale operations.
For detailed specifications of the dataset and the route control method, please refer to the explanation in the related papers.