A discrete cross aisle design model for order-picking warehouses (Q1713732): Difference between revisions

@@ Property / DOI @@
-.1016/j.ejor.2018.11.037
@@ Property / DOI: 10.1016/j.ejor.2018.11.037 / rank @@
-Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.ejor.2018.11.037
+Normal rank
@@ Property / OpenAlex ID @@
+W2900675740
@@ Property / OpenAlex ID: W2900675740 / rank @@
+Normal rank
@@ Property / cites work @@
+The traveling salesman problem on a graph and some related integer polyhedra
+Normal rank
@@ Property / cites work @@
+Design and control of warehouse order picking: a literature review
+Normal rank
@@ Property / cites work @@
+Effects of initial memory and identical harmony in global optimization using harmony search algorithm
+Normal rank
@@ Property / cites work @@
+The Traveling-Salesman Problem and Minimum Spanning Trees
+Normal rank
@@ Property / cites work @@
+Mittlere Wegzeiten beim eindimensionalen Kommissionieren
+Normal rank
@@ Property / cites work @@
+Q3158093
@@ Property / cites work: Q3158093 / rank @@
+Normal rank
@@ Property / cites work @@
+A new meta-heuristic algorithm for continuous engineering optimization: harmony search theory and practice
+Normal rank
@@ Property / cites work @@
+An Algorithm for the Traveling Salesman Problem
@@ Property / cites work: An Algorithm for the Traveling Salesman Problem / rank @@
+Normal rank
@@ Property / cites work @@
+A constructive aisle design model for unit-load warehouses with multiple pickup and deposit points
+Normal rank
@@ Property / cites work @@
+Optimizing fishbone aisles for dual‐command operations in a warehouse
+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 order pickers in a warehouse with a middle aisle
+Normal rank
@@ Property / cites work @@
+Routing methods for warehouses with multiple cross aisles
+Normal rank
@@ Property / cites work @@
+A new mathematical programming formulation for the single-picker routing problem
+Normal rank
@@ Property / cites work @@
+Using a TSP heuristic for routing order pickers in warehouses
+Normal rank
@@ Property / cites work @@
+A branch and bound algorithm for the symmetric traveling salesman problem based on the 1-tree relaxation
+Normal rank
@@ Property / Wikidata QID @@
+Q128889673
@@ Property / Wikidata QID: Q128889673 / rank @@
+Normal rank
@@ Property / DOI @@
+.1016/J.EJOR.2018.11.037
@@ Property / DOI: 10.1016/J.EJOR.2018.11.037 / rank @@
+Normal rank