This study proposes an end-to-end mathematical framework to automatically transform warehouse layout images into optimization-ready route matrices. The objective is to convert visual spatial information into a discrete, graph-based representation suitable for combinatorial route optimization. The problem is formulated as a mapping from continuous image space to a structured grid representation, integrating image segmentation, graph construction, and Traveling Salesman Problem (TSP)-based routing. Synthetic warehouse layouts were generated to create labeled training data, and a U-Net convolutional neural network was trained to perform multi-class segmentation of warehouse elements. The predicted grid representation was then converted into a graph structure, where feasible cells define vertices and adjacency defines edges. Shortest path distances were computed using Breadth-First Search, and the resulting distance matrix was used to solve a TSP instance. The segmentation model achieved approximately 98% training accuracy and 95–97% validation accuracy. The generated route matrices enabled successful construction of feasible and optimal round-trip routes in all tested scenarios. The proposed framework demonstrates that warehouse layouts can be automatically transformed into discrete mathematical representations suitable for logistics optimization, reducing manual preprocessing and enabling scalable integration into digital logistics systems.
Building similarity graph...
Analyzing shared references across papers
Loading...
Francuz et al. (Sat,) studied this question.
www.synapsesocial.com/papers/69ada8a1bc08abd80d5bbbab — DOI: https://doi.org/10.3390/math14050910
Ádám Francuz
Tamás Bányai
Building similarity graph...
Analyzing shared references across papers
Loading...