LTL YUK TASHISHDA MARSHRUTLASHNING GIBRID MOSLASHUVCHAN KATTA QO‘SHNILIK QIDIRUVI ALGORITMI
DOI:
https://doi.org/10.5281/zenodo.23430355Abstract
Tezisda LTL (to‘liq bo‘lmagan yuk) tashishda yuk olish marshrutlarini vaqt oynalari, og‘irlik va hajm sig‘imlarini hisobga olgan holda rejalashtirish uchun gibrid moslashuvchan katta qo‘shnilik qidiruvi (H-ALNS) algoritmi taklif etilgan. 50, 100 va 200 ta buyurtmali 15 ta misolda algoritm eng yaxshi konstruktiv usulga nisbatan maqsad funksiyasi qiymatini 18,1–24,0% ga kamaytirdi.Keywords
LTL, marshrutlash, vaqt oynalari, ikki o‘lchovli sig‘im, ALNS, gibrid algoritmReferences
Ropke, S., & Pisinger, D. (2006). An Adaptive Large Neighborhood Search Heuristic for the Pickup and Delivery Problem with Time Windows. Transportation Science, 40(4), 455–472. https://doi.org/10.1287/trsc.1050.0135
Savelsbergh, M. W. P. (1992). The Vehicle Routing Problem with Time Windows: Minimizing Route Duration. ORSA Journal on Computing, 4(2), 146–154. https://doi.org/10.1287/ijoc.4.2.146
Solomon, M. M. (1987). Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints. Operations Research, 35(2), 254–265. https://doi.org/10.1287/opre.35.2.254
Downloads
Published
2026-03-30
Issue
Section
Articles
License
Copyright (c) 2026 MUHANDISLIK VA IQTISODIYOT
This work is licensed under a Creative Commons Attribution 4.0 International License.
