Journals / Gazi Üniversitesi Mühendislik Mimarlık Fakültesi Dergisi / 2010 / Cilt: 25 - Sayı: 3

Vehicle routing problems with hard time windows and simultaneous pick up and delivery: a mathematical model

Kesin zaman pencereli - eş zamanlı dağıtım toplamalı araç rotalama problemi: matematiksel model

Pages
579–585
Publication Date
2022-10-18
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)

SolomonBenchmark Problems are revised to adapt for the problem structure and results are obtained by using GAMS.

📌 3 Key Takeaways

🎯
Objective & Hypothesis:In this study, vehicle routing problems with hard time windows and simultaneous pick up and delivery aredetermined and mathematical model is developed.
📊
Key Findings & Data:Generally the goal of vehicle routing problems isminimization of travelling distance or travelling cost.
💡
Conclusion & Impact:SolomonBenchmark Problems are revised to adapt for the problem structure and results are obtained by using GAMS.
🔬Design:Modeling & Simulation
📍Scope:Comprehensive Sample
⚙️Variables:Domain Parameters

Abstract

In this study, vehicle routing problems with hard time windows and simultaneous pick up and delivery aredetermined and mathematical model is developed. Generally the goal of vehicle routing problems isminimization of travelling distance or travelling cost. In the literature it is observed that vehicle routing problemswith time windows have also the same goals with vehicle routing problems. However, waiting time resultedfrom time windows must be considered for vehicle routing problems with time windows. In this study, objectivefunction of the mathematical model of the determined problem is chosen as waiting time minimization. SolomonBenchmark Problems are revised to adapt for the problem structure and results are obtained by using GAMS.

Özet

Bu çalışmada, kesin zaman pencereli-eşzamanlı dağıtım toplamalı araç rotalama problemi tanımlanmış vematematiksel modeli geliştirilmiştir. Genellikle araç rotalama problemlerinde amaç, katedilen mesafenin veyataşıma maliyetinin enazlanmasıdır. Literatür incelendiğinde zaman pencereli araç rotalama problemlerinde deaynı amaç fonksiyonlarının tanımlandığı görülmektedir. Oysa zaman pencereli araç rotalama problemlerindezaman penceresinden kaynaklanan beklemelerin dikkate alınması gerekmektedir. Çalışmada, tanımlanan yeniproblemin matematiksel modelinde, amaç fonksiyonu beklemelerin en küçüklenmesi olarak alınmış;Solomon’un test verileri eşzamanlı dağıtım toplama problemlerine uygun hale getirmek için düzenlenmiş veGAMS paket programı ile sonuçlar elde edilmiştir.

🔖

Cite This Article

GENCER, C., ÇETIN, S. (2022). Vehicle routing problems with hard time windows and simultaneous pick up and delivery: a mathematical model. Gazi Üniversitesi Mühendislik Mimarlık Fakültesi Dergisi, Cilt: 25 - Sayı: 3, 579–585. https://ajindex.com/articles/523806

📄 Full Text PDF Viewer

📄

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

References (15)

  1. Dantzig G.B., Ramser J.H., “The Truck Dispatching Problem”, Management Science, 6, 80-91, 1959
  2. Toth P., Vigo D., The Vehicle Routing Problem, Siam, 2002
  3. Savelsbergh M.W.P., “Local Search In Routing Problems With Time Windows”, Annals of Operations Research, 4, 285-305, 1985
  4. Solomon M.M., “Algorithms For The Vehicle Routing And Scheduling Problems With Time Window Constrains”, Operations Research, 35, 2, 254-265, 1987
  5. Solomon M.M., Desrosier J., “Survey Paper: The Time Constrained Routing and Scheduling Problems”, Transportation Science, 22, 1, 1988
  6. Pullen H., Webb M., “A Computer Application To A Transport Scheduling Problem”, Computer Journal,10:10-13,1967
  7. Knight K., Hofer J., “Vehicle Scheduling With Timed and Connected Calls: A Case Study”, Operational Research Quarterly, 19: 299-310, 1968
  8. Madsen O.B.G., Optimal Scheduling of Trucks- A routing Problem With Tight Due Times For Delivery. In H. Strobel, R. Genser, M. Etschmaier, editors, Optimization Applied to Transportation Systems, IIASA, International Institute for Applied System Analysis, Luxemburg, Austria, 126-136, 1976
  9. Bouthillier A., Crainic T.G., “A Cooperative Parallel Meta Heuristic For The Vehicle Routing Problem With Time Windows”, Computers & Operations Research, 32, 1685-1708, 2005
  10. Dondo R., Cerda J., “A Cluster –Based Optimization Approach For The Multi-Depot Heterogeneous Fleet Vehicle Routing Problem With Time Windows”, European Journal of Operation Research, 176, 1478-1507, 2007
  11. Calvete H.I., Gale C., Oliveros M., Sanchez- Valverde B., “A Goal Programming Approach To Vehicle Routing Problems With Soft Time Windows”, European Journal of Operation Research, 177, 1720-1733, 2007
  12. Savelsbergh M., Sol M., “The General Pick Up And Delivery Problem”, Transportation Science, 29, 1, 107-121, 1995
  13. Zachariadis, E.E., Tarantilis, C.D., Kiranoudis, C. T. “Hybrid Metaheuristic Algorithm For The Vehicle Routing Problem With Simultaneous Delivery And Pick-Up Service”, Expert System with Applications, 36, 1070-1081,2009 14. Min, H., “The Multiple Vehicle Routing Problem With Simultaneous Delivery and Pick-up Points”, Transportation Research, 23A, 377-386, 1989
  14. Dethloff, J., “Vehicle Routing And Reverse Logistics: The Vehicle Routing Problem With Simultaneous Delivery and Pick-Up”, OR Spectrum, 23, 79-96, 2001
  15. Montane F.A.T, Galvao RD., “A Tabu Search Algorithm For the Vehicle Routing Problem With Simultaneous Pick Up And Delivery Service”,