Operational control of multi-load vehicles in an automated guided vehicle system
Proceedings of the 15th annual conference on Computers and industrial engineering
A Tabu Search Algorithm for a Routing and Container Loading Problem
Transportation Science
The stack loading and unloading problem
Discrete Applied Mathematics
The pickup and delivery traveling salesman problem with first-in-first-out loading
Computers and Operations Research
Modeling and optimal control of automated trolleys
SMC'09 Proceedings of the 2009 IEEE international conference on Systems, Man and Cybernetics
Multiple pickup and delivery TSP with LIFO and distance constraints: a VNS approach
IEA/AIE'11 Proceedings of the 24th international conference on Industrial engineering and other applications of applied intelligent systems conference on Modern approaches in applied intelligence - Volume Part II
A network flow based heuristic approach for optimising AGV movements
Journal of Intelligent Manufacturing
A hybrid approach for the vehicle routing problem with three-dimensional loading constraints
Computers and Operations Research
| Hi-index | 0.01 |
When simple automated guided vehicles (AGVs) having no random access load transfer mechanism are used for carrying multiple loads between workstations, the loads cannot be handled independently. This paper considers the case when loads are placed in flat pallets and each new picked up pallet is loaded on the top of batch of pallets already carried by the AGV. To avoid use of excessive space and time needed to reorder pallets in the batch, the loading-unloading procedures should be performed in accordance with last-in-first-out (LIFO) rule. In this paper we formulate the condition of existence of AGV routes in which, it visits each workstation only once and meets LIFO constraint. We also suggest an algorithm for finding the shortest one among such routes. Examples are provided to illustrate the performance of the algorithm.