A cut-and-solve-based algorithm for optimal lane reservation with dynamic link travel times
Year of publication: |
2014
|
---|---|
Authors: | Fang, Yunfei ; Chu, Feng ; Mammar, Saïd ; Che, Ada |
Published in: |
International journal of production research. - London : Taylor & Francis, ISSN 0020-7543, ZDB-ID 160477-6. - Vol. 52.2014, 4 (15.2.), p. 1003-1015
|
Subject: | optimal lane reservation | dynamic link travel times | mixed integer programming model | cut-and-solve method | Transportzeit | Travel time | Ganzzahlige Optimierung | Integer programming | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Algorithmus | Algorithm |
-
A branch and cut algorithm for the time-dependent profitable tour problem with resource constraints
Lera-Romero, Gonzalo, (2021)
-
The p-median problem with upgrading of transportation costs and minimum travel time allocation
Espejo, Inmaculada, (2023)
-
A stochastic dairy transportation problem considering collection and delivery phases
Huang, Kuancheng, (2019)
- More ...
-
Closed-loop inventory routing problem for perishable food with returnable transport items selection
Zhang, Yipei, (2024)
-
Zhang, Yipei, (2019)
-
Che, Ada, (2024)
- More ...