VEHICLE ROUTING PROBLEMS WITH HARD TIME WINDOWS AND SIMULTANEOUS PICK UP AND DELIVERY: A Mathematical Model

---

Atıf İçin Kopyala

Cetin S., Gencer C.

JOURNAL OF THE FACULTY OF ENGINEERING AND ARCHITECTURE OF GAZI UNIVERSITY, cilt.25, ss.579-585, 2010 (SCI-Expanded)

• Yayın Türü: Makale / Tam Makale
• Cilt numarası: 25
• Basım Tarihi: 2010
• Dergi Adı: JOURNAL OF THE FACULTY OF ENGINEERING AND ARCHITECTURE OF GAZI UNIVERSITY
• Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus, TR DİZİN (ULAKBİM)
• Sayfa Sayıları: ss.579-585
• Gazi Üniversitesi Adresli: Evet

Özet

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