BibTex RIS Cite

ÇOK KULLANIMLI VE ZAMAN PENCERELİ ARAÇ ROTALAMA PROBLEMİ İÇİN BİR MATEMATİKSEL MODEL

Year 2012, Volume: 27 Issue: 3, 0 - , 19.02.2013

Abstract

Bu çalışmada klasik Araç Rotalama Problemi‟nin (ARP) genelleştirilmiş bir hali olan Çok Kullanımlı ve Zaman Pencereli Araç Rotalama Problemi (ÇK_ZP_ARP) dikkate alınmıştır. ÇK_ZP_ARP‟de klasik ARP‟den farklı olarak araçların birden fazla rotada kullanılmasına izin verilmektedir. ÇK_ZP_ARP ile genellikle raf ömrünün kısa olduğu ürünlerin dağıtımının yapıldığı ya da dağıtım süresinin kısa olduğu sistemlerde karşılaşılmaktadır. Pratikte sıklıkla karşılaşılan bir problem olmasına rağmen, ÇK_ZP_ARP ile ilgili literatürde çok az sayıda çalışma bulunmaktadır. Bu çalışmada, ÇK_ZP_ARP için bir karma tamsayılı doğrusal programlama modeli önerilmiştir. Önerilen matematiksel model, literatürden türetilen değişik boyutlarda test problemleri üzerinde en iyi çözüme ulaşma zamanı açışından karşılaştırılmış ve sonuçları sunulmuştur.

References

  • Toth, P., Vigo, D., The Vehicle Routing Problem, SIAM (Society for Industrial and Applied Mathematics), Philadelphia, 2002.
  • Azi, N., Gendreau, M., Potvin, J-Y., “An exact algorithm for a vehicle routing problem with time windows and multiple use of vehicles”, European Journal of Operational Research, 202, 756-763, 2010.
  • Salhi, S., The integration of routing into the location-allocation and vehicle composition problems, Ph.D. Thesis, University of Lancaster, 198–208, 1987.
  • Fleischmann, B., “The vehicle routing problem with multiple use of vehicles”, Working paper, Fachbereich Wirschaftswissenschaften, Universitat Hamburg, 1990.
  • Brandão, J.C.S., Mercer, A., “The multi-trip vehicle routing problem”, Journal of the Operational Research Society, 49, 799–805, 1998.
  • Olivera, A., Viera, O., “Adaptive memory programming for the vehicle routing problem with
  • multiple trips”, Computers & Operations Research, 34, 28–47, 2007.
  • Petch, R.J., Salhi, S., “A GA based heuristic for the vehicle routing problem with multiple trips.” Journal of Mathematical Modelling and Algorithms, 6, 591–613, 2007.
  • Petch, R.J., Salhi, S., “A multi-phase constructive heuristic for the vehicle routing problem with multiple trips”, Discrete Applied Mathematics, 133, 69–92, 2004.
  • Taillard, É.D., Laporte, G., Gendreau, M., “Vehicle routing with multiple use of vehicles”, Journal of the Operational Research Society, 47, 1065–1070, 1996.
  • Brandão, J.C.S., Mercer, A., “A Tabu search algorithm for the multi-trip vehicle routing and scheduling problem” European Journal of Operational Research, 100, 180–191, 1997.
  • Azi, N., Gendreau, M., Potvin, J.-Y., “An exact algorithm for a single vehicle routing problem with time windows and multiple routes”, European Journal of Operational Research, 178, 755–766, 2007.
  • Miller, C. E., Tucker, A. W., Zemlin, R. A., “Integer programming formulations and traveling salesman problems”, Journal of the ACM, 7, 326-329, 1960.
  • Kulkarni, R. V., Bhave, P. R., “Integer programming formulations of vehicle routing problems”, European Journal of Operational Research, 20, 58-67, 1985.
  • Desrochers, M., Laporte, G., “Improvements and extensions to the Miller–Tucker–Zemlin subtour elimination constraints”, Operations Research Letters, 10, 27-36, 1991.
  • Kara, İ., Laporte, G., Bektas, T., “A note on the lifted Miller–Tucker–Zemlin subtour elimination constraints for the capacitated vehicle routing problem”, European Journal of Operational Research, 158, 793-795, 2004.
  • Kara, İ., “Two indexed polynomial size formulations for vehicle routing problems”, Technical Report, Ankara-Türkiye, 2008.
  • Solomon, M.M., “Algorithms for the vehicle routing and scheduling problems with time window constraints”. Operations Research, 35, 254–265, 1987.
Year 2012, Volume: 27 Issue: 3, 0 - , 19.02.2013

Abstract

References

  • Toth, P., Vigo, D., The Vehicle Routing Problem, SIAM (Society for Industrial and Applied Mathematics), Philadelphia, 2002.
  • Azi, N., Gendreau, M., Potvin, J-Y., “An exact algorithm for a vehicle routing problem with time windows and multiple use of vehicles”, European Journal of Operational Research, 202, 756-763, 2010.
  • Salhi, S., The integration of routing into the location-allocation and vehicle composition problems, Ph.D. Thesis, University of Lancaster, 198–208, 1987.
  • Fleischmann, B., “The vehicle routing problem with multiple use of vehicles”, Working paper, Fachbereich Wirschaftswissenschaften, Universitat Hamburg, 1990.
  • Brandão, J.C.S., Mercer, A., “The multi-trip vehicle routing problem”, Journal of the Operational Research Society, 49, 799–805, 1998.
  • Olivera, A., Viera, O., “Adaptive memory programming for the vehicle routing problem with
  • multiple trips”, Computers & Operations Research, 34, 28–47, 2007.
  • Petch, R.J., Salhi, S., “A GA based heuristic for the vehicle routing problem with multiple trips.” Journal of Mathematical Modelling and Algorithms, 6, 591–613, 2007.
  • Petch, R.J., Salhi, S., “A multi-phase constructive heuristic for the vehicle routing problem with multiple trips”, Discrete Applied Mathematics, 133, 69–92, 2004.
  • Taillard, É.D., Laporte, G., Gendreau, M., “Vehicle routing with multiple use of vehicles”, Journal of the Operational Research Society, 47, 1065–1070, 1996.
  • Brandão, J.C.S., Mercer, A., “A Tabu search algorithm for the multi-trip vehicle routing and scheduling problem” European Journal of Operational Research, 100, 180–191, 1997.
  • Azi, N., Gendreau, M., Potvin, J.-Y., “An exact algorithm for a single vehicle routing problem with time windows and multiple routes”, European Journal of Operational Research, 178, 755–766, 2007.
  • Miller, C. E., Tucker, A. W., Zemlin, R. A., “Integer programming formulations and traveling salesman problems”, Journal of the ACM, 7, 326-329, 1960.
  • Kulkarni, R. V., Bhave, P. R., “Integer programming formulations of vehicle routing problems”, European Journal of Operational Research, 20, 58-67, 1985.
  • Desrochers, M., Laporte, G., “Improvements and extensions to the Miller–Tucker–Zemlin subtour elimination constraints”, Operations Research Letters, 10, 27-36, 1991.
  • Kara, İ., Laporte, G., Bektas, T., “A note on the lifted Miller–Tucker–Zemlin subtour elimination constraints for the capacitated vehicle routing problem”, European Journal of Operational Research, 158, 793-795, 2004.
  • Kara, İ., “Two indexed polynomial size formulations for vehicle routing problems”, Technical Report, Ankara-Türkiye, 2008.
  • Solomon, M.M., “Algorithms for the vehicle routing and scheduling problems with time window constraints”. Operations Research, 35, 254–265, 1987.
There are 18 citations in total.

Details

Primary Language Turkish
Journal Section Makaleler
Authors

Çağrı Koç This is me

İsmail Karaoğlan This is me

Publication Date February 19, 2013
Submission Date February 19, 2013
Published in Issue Year 2012 Volume: 27 Issue: 3

Cite

APA Koç, Ç., & Karaoğlan, İ. (2013). ÇOK KULLANIMLI VE ZAMAN PENCERELİ ARAÇ ROTALAMA PROBLEMİ İÇİN BİR MATEMATİKSEL MODEL. Gazi Üniversitesi Mühendislik Mimarlık Fakültesi Dergisi, 27(3).
AMA Koç Ç, Karaoğlan İ. ÇOK KULLANIMLI VE ZAMAN PENCERELİ ARAÇ ROTALAMA PROBLEMİ İÇİN BİR MATEMATİKSEL MODEL. GUMMFD. March 2013;27(3).
Chicago Koç, Çağrı, and İsmail Karaoğlan. “ÇOK KULLANIMLI VE ZAMAN PENCERELİ ARAÇ ROTALAMA PROBLEMİ İÇİN BİR MATEMATİKSEL MODEL”. Gazi Üniversitesi Mühendislik Mimarlık Fakültesi Dergisi 27, no. 3 (March 2013).
EndNote Koç Ç, Karaoğlan İ (March 1, 2013) ÇOK KULLANIMLI VE ZAMAN PENCERELİ ARAÇ ROTALAMA PROBLEMİ İÇİN BİR MATEMATİKSEL MODEL. Gazi Üniversitesi Mühendislik Mimarlık Fakültesi Dergisi 27 3
IEEE Ç. Koç and İ. Karaoğlan, “ÇOK KULLANIMLI VE ZAMAN PENCERELİ ARAÇ ROTALAMA PROBLEMİ İÇİN BİR MATEMATİKSEL MODEL”, GUMMFD, vol. 27, no. 3, 2013.
ISNAD Koç, Çağrı - Karaoğlan, İsmail. “ÇOK KULLANIMLI VE ZAMAN PENCERELİ ARAÇ ROTALAMA PROBLEMİ İÇİN BİR MATEMATİKSEL MODEL”. Gazi Üniversitesi Mühendislik Mimarlık Fakültesi Dergisi 27/3 (March 2013).
JAMA Koç Ç, Karaoğlan İ. ÇOK KULLANIMLI VE ZAMAN PENCERELİ ARAÇ ROTALAMA PROBLEMİ İÇİN BİR MATEMATİKSEL MODEL. GUMMFD. 2013;27.
MLA Koç, Çağrı and İsmail Karaoğlan. “ÇOK KULLANIMLI VE ZAMAN PENCERELİ ARAÇ ROTALAMA PROBLEMİ İÇİN BİR MATEMATİKSEL MODEL”. Gazi Üniversitesi Mühendislik Mimarlık Fakültesi Dergisi, vol. 27, no. 3, 2013.
Vancouver Koç Ç, Karaoğlan İ. ÇOK KULLANIMLI VE ZAMAN PENCERELİ ARAÇ ROTALAMA PROBLEMİ İÇİN BİR MATEMATİKSEL MODEL. GUMMFD. 2013;27(3).