return_heuristic {warehouseTools} | R Documentation |
This heuristic generates a return route solution for the Traveling Salesman Problem (TSP) in a warehouse by removing arcs at the top row of the warehouse and duplicating the remaining arcs to form a round trip.
return_heuristic(arcs)
arcs |
A data frame or matrix representing the arcs (edges) in the warehouse. |
The heuristic first removes the arcs corresponding to the top row of the warehouse. Then, the remaining arcs are duplicated to simulate a return trip, and I/O points are added.
A matrix of arcs after applying the return heuristic, where edges at the top row are removed and remaining arcs are duplicated to form a return route. I/O points are added at the end.
Krzysztof Dmytrów krzysztof.dmytrow@usz.edu.pl [aut] ORCID: 0000-0001-7657-6063
Andrzej Dudek andrzej.dudek@ue.wroc.pl [aut, cre] ORCID: 0000-0002-4943-8703
Dmytrów, K. (2022). Analytical and simulation determination of order picking time in a low storage warehouse for shared storage systems. Operations Research and Decisions, 32(2), 34–51. doi:10.37190/ord220203
Le-Duc, T. (2005). Design and Control of Efficient Order. Erasmus Research Institute of Management (ERIM).
Tarczyński, G. (2012). Analysis of the Impact of Storage Parameters and the Size of Orders on the Choice of the Method for Routing Order Picking. Operations Research and Decisions, 22(4), 105–120. doi:10.5277/ord120406
midpoint_heuristic
, sshape_heuristic
coordinates <- matrix(c(1, 1, 1, 2, 2, 2, 3, 3, 3, 3, 4, 4, 4, 5, 5, 5,
0, 4, 11, 0, 10, 11, 0, 1, 5, 11, 0, 4, 11, 0, 4,
11), ncol = 2, byrow = FALSE,
dimnames = list(NULL, c("x", "y")))
return_heuristic(create_arcs(coordinates))