The migratory beekeeping routing problem : model and an exact algorithm
Year of publication: |
2021
|
---|---|
Authors: | Ma, Zujun ; Yang, Fei ; Dai, Ying ; Shen, Zuo-Jun |
Published in: |
INFORMS journal on computing : JOC. - Catonsville, MD : INFORMS, ISSN 1091-9856, ZDB-ID 1316077-1. - Vol. 33.2021, 1, p. 319-335
|
Subject: | migratory beekeeping | vehicle routing | production decision | timing decision | Dantzig–Wolfe decomposition | labeling algorithm | Tourenplanung | Vehicle routing problem | Algorithmus | Algorithm | Theorie | Theory |
-
Effective handling of dynamic time windows and its application to solving the dial-a-ride problem
Gschwind, Timo, (2015)
-
Frvcpy : an open-source solver for the fixed route vehicle charging problem
Kullman, Nicholas D., (2021)
-
Variable fixing for two-arc sequences in branch-price-and-cut algorithms on path-based models
Desaulniers, Guy, (2020)
- More ...
-
Jiang, Jie, (2024)
-
A cooperative rich vehicle routing problem in the last-mile logistics industry in rural areas
Yang, Fei, (2020)
-
Zhang, Ruijuan, (2024)
- More ...