Parallel variable neighborhood search for the min–max order batching problem (Q5278230): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1111/itor.12309
+Normal rank
@@ Property / OpenAlex ID @@
+W2549531087
@@ Property / OpenAlex ID: W2549531087 / rank @@
+Normal rank
@@ Property / cites work @@
+Parallel Metaheuristics
@@ Property / cites work: Parallel Metaheuristics / rank @@
+Normal rank
@@ Property / cites work @@
+VARIABLE NEIGHBORHOOD SEARCH FOR ORDER BATCHING IN A WAREHOUSE
+Normal rank
@@ Property / cites work @@
+Feature Article—Reporting Computational Experiments with Parallel Algorithms: Issues, Measures, and Experts' Opinions
+Normal rank
@@ Property / cites work @@
+Parallel Strategies for Meta-Heuristics
@@ Property / cites work: Parallel Strategies for Meta-Heuristics / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient orderbatching methods in warehouses
@@ Property / cites work: Efficient orderbatching methods in warehouses / rank @@
+Normal rank
@@ Property / cites work @@
+Variable neighborhood search for the vertex separation problem
+Normal rank
@@ Property / cites work @@
+The parallel variable neighborhood search for the \(p\)-median problem
+Normal rank
@@ Property / cites work @@
+Algorithms for on-line order batching in an order picking warehouse
+Normal rank
@@ Property / cites work @@
+Tabu search heuristics for the order batching problem in manual order picking systems
+Normal rank
@@ Property / cites work @@
+Variable neighborhood search
@@ Property / cites work: Variable neighborhood search / rank @@
+Normal rank
@@ Property / cites work @@
+MILP formulations and an iterated local search algorithm with tabu thresholding for the order batching problem
+Normal rank
@@ Property / cites work @@
+Order-Picking in a Rectangular Warehouse: A Solvable Case of the Traveling Salesman Problem
+Normal rank
@@ Property / cites work @@
+Routing methods for warehouses with multiple cross aisles
+Normal rank
@@ Property / cites work @@
+Combining intensification and diversification strategies in VNS. An application to the vertex separation problem
+Normal rank
@@ Property / cites work @@
+Q5191184
@@ Property / cites work: Q5191184 / rank @@
+Normal rank