Polynomial time algorithms to minimize total travel time in a two-depot automated storage/retrieval system
Year of publication: |
February 2017
|
---|---|
Authors: | Gharehgozli, Amir Hossein ; Yu, Yugang ; Zhang, Xiandong ; Koster, René de |
Published in: |
Transportation science : a journal of the Institute for Operations Research and the Management Sciences. - Catonsville, MD : Transportation Science & Logistics Society of the Institute for Operations Research and the Management Sciences, ISSN 0041-1655, ZDB-ID 160958-0. - Vol. 51.2017, 1, p. 19-33
|
Subject: | automated storage and retrieval system | two depots | total travel time | traveling salesman problem | polynomial time algorithm | Transportzeit | Travel time | Theorie | Theory | Tourenplanung | Vehicle routing problem | Rundreiseproblem | Travelling salesman problem | Algorithmus | Algorithm | Lagerverwaltungssystem | Warehouse management system | Lagertechnik | Warehouse storage equipment | Mathematische Optimierung | Mathematical programming |
-
Dong, Wenquan, (2021)
-
A branch and cut algorithm for the time-dependent profitable tour problem with resource constraints
Lera-Romero, Gonzalo, (2021)
-
The impact of dwell point policy in an automated storage/retrieval system
Regattieri, A., (2013)
- More ...
-
Scheduling twin yard cranes in a container block
Gharehgozli, Amir Hossein, (2015)
-
Increasing the revenue of self-storage warehouses by optimizing order scheduling
Zhang, Xiandong, (2016)
-
An exact method for scheduling a yard crane
Gharehgozli, Amir Hossein, (2014)
- More ...