LTL YUK TASHISH TIZIMLARIDA DINAMIK MARSHRUTLASH ALGORITMI VA DASTURIY MAJMUASI
DOI:
https://doi.org/10.5281/zenodo.23430438Abstract
Tezisda ish kuni davomida yangi buyurtmalar kelib turadigan LTL tashish tizimlarida dinamik marshrutlash uchun hodisaga asoslangan gibrid algoritm va uni amalga oshiruvchi dasturiy majmua arxitekturasi taklif etilgan. 30 ta simulyatsiya ssenariysida gibrid yondashuv ochko‘z qo‘yishga nisbatan bosib o‘tilgan masofani qisqartirgani kuzatildi.Keywords
LTL, dinamik marshrutlash, real vaqtda optimallashtirish, ALNS, dasturiy majmuaReferences
Pillac, V., Gendreau, M., Guéret, C., & Medaglia, A. L. (2013). A Review of Dynamic Vehicle Routing Problems. European Journal of Operational Research, 225(1), 1–11. https://doi.org/10.1016/j.ejor.2012.08.015
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
Downloads
Published
2026-09-05
Issue
Section
Articles
License
Copyright (c) 2026 MUHANDISLIK VA IQTISODIYOT
This work is licensed under a Creative Commons Attribution 4.0 International License.
