Journals / Yönetim Bilişim Sistemleri Dergisi / 2017 / Cilt: 3 Sayı: 2

MULTI-VEHICLE DYNAMIC ROUTING WITH TIME- WINDOWS IN PARCEL DELIVERY

KARGO İŞLEMEDE ZAMAN PENCERELİ ÇOK ARAÇLI DİNAMİK ROTALAMA

Pages
105–113
Publication Date
2017-12-20
DOI
—
🏛️Bibliographic metadata and full text access for this article are provided via DergiPark.
DergiPark Record ↗
✨

AI Summary & Key Takeaways

AI Insight
⚡ TL;DR(Too Long; Didn't Read)

The method used is divide and conquer where a dynamic routing mechanism is devised to optimize the work load within a Courier Working Zone to meet possible changes in the task list during the working period.

📌 3 Key Takeaways

🎯
Objective & Hypothesis:CEP companies perform pickup and delivery with limited warehouse usage daily.
📊
Key Findings & Data:Customers expect real time monitoring, flexible pick-up and delivery models, and CEP companies are working on technology based solutions to meet such requirements.
💡
Conclusion & Impact:The method used is divide and conquer where a dynamic routing mechanism is devised to optimize the work load within a Courier Working Zone to meet possible changes in the task list during the working period.
🔬Design:Modeling & Simulation
📍Scope:Comprehensive Sample
⚙️Variables:Toplama ve Dağıtım Problemi · Araç Rotalama Problemi · Pencereli Çok Araçlı Dinamik Rotalama.

Abstract

CEP companies perform pickup and delivery with limited warehouse usage daily. Customers expect real time monitoring, flexible pick-up and delivery models, and CEP companies are working on technology based solutions to meet such requirements. In this paper, we present a method to solve VRPTW (vehicle routing problems with time windows), which is an NP-hard problem. The method used is divide and conquer where a dynamic routing mechanism is devised to optimize the work load within a Courier Working Zone to meet possible changes in the task list during the working period.

Özet

: Kargo firmaları kısıtlı depo kullanımı ile günlük olarak toplama ve dağıtım işlemleri gerçekleştirmektedir. Müşteriler gerçek zamanlı izleme ve esnek dağıtım toplama modellerini kargo firmalarından talep etmekte ve kargo firmaları da bu taleplere teknolojiye dayanan çözümlerle cevap vermeye çalışmaktadır. Bu çalışmada böl ve fethet yöntemleri kullanılarak belli bir kurye çalışma alanında gün içi değişikliklere de cevap verebilecek dinamik bir rotalama oluşturulması ve iş yükünün en iyilenmesi hedeflenmektedir.  Tek araçlı, pencereli dağıtım ve toplama problemi kargo sektörü için önemli bir konu olarak karşımıza çıkmaktadır. Bu çalışmada bu probleme yaklaşımlar geliştirilmektedir.

🔖

Cite This Article

Ünlü, N., Uçar, E., Akkuş, G. B., Şen, B. (2017). MULTI-VEHICLE DYNAMIC ROUTING WITH TIME- WINDOWS IN PARCEL DELIVERY. Yönetim Bilişim Sistemleri Dergisi, Cilt: 3 Sayı: 2, 105–113. https://ajindex.com/articles/1578540

📄 Full Text PDF Viewer

📄

PDF görüntüleyici hazırlanıyor...

References (6)

  1. M. I. Hosny, C. L. Mumford, The single vehicle pickup and delivery problem with time windows: intelligent operators for heuristic and metaheuristic algorithms. Journal Heuristics, 16, 417–39 (2010).
  2. Lu, Q. and Dessouky, M. M. (2006). A new insertion-based construction heuristic for solving the pickup and delivery problem with time windows. European Journal of Operational Research, 175(2):672–687.
  3. Dantzig, G.B., Ramser, J.H.,1959, “The truck dispatching problem”, Management Science, 6-80.
  4. Savelsbergh M.W.P., 1985, “Local search in routing problems with time windows”, Annals of Operations Research, 4, 285-305.
  5. Solomon M.M., Desrosier J.,1988, “Survey Paper: The time constrained routing and scheduling problems”, Transportation Science, 22, 1.
  6. Dantzig, G.B., Ramser, J.H.,1959, “The truck dispatching problem”, Management Science, 6-80.