Szczegóły publikacji
Opis bibliograficzny
Local Optima Network Analysis of Multi-Attribute Vehicle Routing Problems / Sebastián Muñoz-Herrera, Karol SUCHAN // Mathematics [Dokument elektroniczny]. — Czasopismo elektroniczne ; ISSN 2227-7390. — 2022 — vol. 10 iss. 24 art. no. 4644, s. 1–21. — Wymagania systemowe: Adobe Reader. — Bibliogr. s. 20–21, Abstr. — Publikacja dostępna online od: 2022-12-08. — K. Suchan - dod. afiliacja: Universidad Diego Portales, Santiago, Chile
Autorzy (2)
- Muñoz-Herrera Sebastián
- AGHSuchan Karol
Słowa kluczowe
Dane bibliometryczne
| ID BaDAP | 144648 |
|---|---|
| Data dodania do BaDAP | 2024-03-01 |
| Tekst źródłowy | URL |
| DOI | 10.3390/math10244644 |
| Rok publikacji | 2022 |
| Typ publikacji | artykuł w czasopiśmie |
| Otwarty dostęp |  |
| Creative Commons | |
| Czasopismo/seria | Mathematics |
Abstract
Multi-Attribute Vehicle Routing Problems (MAVRP) are variants of Vehicle Routing Problems (VRP) in which, besides the original constraint on vehicle capacity present in Capacitated Vehicle Routing Problem (CVRP), other attributes that model diverse real-life system characteristics are present. Among the most common attributes studied in the literature are vehicle capacity and route duration constraints. The influence of these restrictions on the overall structure of the problem and the performance of local search algorithms used to solve it has yet to be well known. This paper aims to explain the impact of constraints present in different variants of VRP through the alterations of the structure of the underlying search space that they cause. We focus on Local Optima Network Analysis (LONA) for multiple Traveling Salesman Problem (m-TSP) and VRP with vehicle capacity (CVRP), route duration (DVRP), and both (DCVRP) constraints. We present results that indicate that measures obtained for a sample of local optima provide valuable information on the behavior of the landscape under modifications in the problem’s constraints. Additionally, we use the LONA measures to explain the difficulty of VRP instances for solving by local search algorithms.
