Cargando…
A capacitated multi pickup online food delivery problem with time windows: a branch-and-cut algorithm
Online food delivery companies, nowadays, allow a customer to place an order for a combination of dishes from one or more restaurants. To meet a customer’s demand, the company then arranges for the pickups from different restaurants, perhaps located distantly, before delivering them to the customer....
| Autores principales: | , |
|---|---|
| Formato: | Online Artículo Texto |
| Lenguaje: | English |
| Publicado: |
Springer US
2021
|
| Materias: | |
| Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC8192046/ https://www.ncbi.nlm.nih.gov/pubmed/34131357 http://dx.doi.org/10.1007/s10479-021-04145-6 |