Back to search

Institutional Repository of Vilnius University

Didelės apimties VRPPD uždavinių optimizavimas: metaeuristinių algoritmų lyginamoji analizė /

Abstract

dc:description

This work presents an empirical comparison of two metaheuristic algorithms — parallel Simulated Annealing (p-SA) and a Coevolutionary Algorithm (CEA) — applied to a specific large-scale Vehicle Routing Problem with Pickup and Delivery (VRPPD) variant. Experiments are conducted across six large-scale size classes: 10×10, 10×20, 20×50, 30×100, 50×200, and 100×500 (trucks × orders; total size N = m + n ranges from 20 to 600), with 20 randomly generated instances per class. On a small-scale parity-testing bank the solvers’ correctness is verified against the global optimum produced independently by three exact solvers (brute force BF, MILP, OR-Tools CP-SAT); on the large-scale classes solution quality is measured as the relative percentage deviation (RPD) from the best feasible solution across all solvers. Hyperparameter tuning results for both algorithms and a statistical comparative analysis are reported.

Degree

thesis:*
Grantor dc:publisher
Institutional Repository of Vilnius University
Year dc:date
2026

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Šukelovič, Aleksandras,

Rights

dc:rights
Statement dc:rights
  • info:eu-repo/semantics/openAccess
Language dc:language
lit

Identifiers

dc:identifier.*

Chain of custody

source
Harvested from
Vilnius University
Base URL
epublications.vu.lt/oai
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
related terms
citation

Šukelovič, Aleksandras,. Didelės apimties VRPPD uždavinių optimizavimas: metaeuristinių algoritmų lyginamoji analizė /. Institutional Repository of Vilnius University, 2026. https://repository.vu.lt/VU:ELABAETD308338136&prefLang=en_US