Zobrazeno 1 - 3
of 3
pro vyhledávání: '"Ricardo Barboza Saboia"'
Publikováno v:
Algorithms, Vol 12, Iss 8, p 158 (2019)
In the vehicle routing problem with simultaneous pickup and delivery (VRPSPD), customers demanding both delivery and pickup operations have to be visited once by a single vehicle. In this work, we propose a fast randomized algorithm using a nearest n
Externí odkaz:
https://doaj.org/article/025eff1ecd864d77a708e99043cffcab
Publikováno v:
Algorithms, Vol 12, Iss 8, p 158 (2019)
Algorithms
Volume 12
Issue 8
Algorithms
Volume 12
Issue 8
In the vehicle routing problem with simultaneous pickup and delivery (VRPSPD), customers demanding both delivery and pickup operations have to be visited once by a single vehicle. In this work, we propose a fast randomized algorithm using a nearest n
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f0e3a3ebc492f96075754543a95bfee7
https://www.mdpi.com/1999-4893/12/8/158
https://www.mdpi.com/1999-4893/12/8/158
Autor:
Nepomuceno, Napoleão1 (AUTHOR) napoleaovn@unifor.br, Barboza Saboia, Ricardo1 (AUTHOR), Rogério Pinheiro, Plácido1 (AUTHOR)
Publikováno v:
Algorithms. Aug2019, Vol. 12 Issue 8, p158-158. 1p.