Szczegóły publikacji
Opis bibliograficzny
Savings based algorithm for a Rich Vehicle Routing Problem with time windows / Jerzy DUDA, Beata BASIURA, Robert BASIURA // W: Proceedings of the 37th International Business Information Management Association Conference (IBIMA) [Dokument elektroniczny] : 30-31 May 2021, Cordoba, Spain : Innovation Management and Information Technology Impact on Global Economy in the Era of Pandemic / ed. Khalid S. Soliman. — Wersja do Windows. — Dane tekstowe. — [Norristown] : International Business Information Management Association (IBIMA), cop. 2021. — (Proceedings of the... International Business Information Management Association Conference ; ISSN 2767-9640). — e-ISBN: 978-0-9998551-6-4. — S. 5472–5480. — Wymagania systemowe: Adobe Reader. — Tryb dostępu: https://u.pcloud.link/publink/show?code=kZnoamXZkmWu5WL4oKu11... [2021-06-24]. — Bibliogr. s. 5478–5480, Abstr.
Autorzy (3)
Słowa kluczowe
Dane bibliometryczne
| ID BaDAP | 134895 |
|---|---|
| Data dodania do BaDAP | 2022-01-15 |
| Rok publikacji | 2021 |
| Typ publikacji | materiały konferencyjne (aut.) |
| Otwarty dostęp |  |
| Konferencja | International Business Information Management 2021 |
| Czasopismo/seria | Proceedings of the... International Business Information Management Association Conference |
Abstract
The article presents the Rich Vehicle Routing Problem (VRP) that reflects a real problem for one of the food retailers network in Poland. To solve this problem a very fast algorithm was proposed basing on the savings heuristic and graph approach. The proposed algorithm was tested using four real world cases and occurred to be very efficient, giving better results than a simple SA algorithm. However, its main advantage is that it gives the solution immediately even for the largest problem with 270 stores and 43 vehicles. Thus it can be used, e.g., for a quick replanning in dynamic VRP in which the routing plan should be adjusted to the current situation on the road, or at delivery points.
