Journals / Gazi Üniversitesi Mühendislik Mimarlık Fakültesi Dergisi / 2013 / Cilt: 28 - Sayı: 2

SOLVING VEHICLE ROUTING PROBLEM WITH SIMULTANEOUS DELIVERY AND PICK-UP USING AN ALGORITHM BASED ON BACTERIAL FORAGING OPTIMIZATION

EŞZAMANLI DAĞITIMLI VE TOPLAMALI ARAÇ ROTALAMA PROBLEMLERİNİN ÇÖZÜMÜ İÇİN BAKTERİYEL BESİN ARAMA OPTİMİZASYONU TABANLI BİR ALGORİTMA

Pages
373–382
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)

BFOA obtained good solutions about 24 problems of 40 test problems.

📌 3 Key Takeaways

🎯
Objective & Hypothesis:In Vehicle Routing Problem with Simultaneous Delivery and Pick-up (VRP_SDP), each customer has both delivery and pick-up demand simultaneously.
📊
Key Findings & Data:In this study, a heuristic solution approach based on Bacterial Foraging Optimization Algorithm (BFOA) has been improved and its performance has been evaluated.
💡
Conclusion & Impact:BFOA obtained good solutions about 24 problems of 40 test problems.
🔬Design:Modeling & Simulation
📍Scope:Comprehensive Sample
⚙️Variables:Domain Parameters

Abstract

In Vehicle Routing Problem with Simultaneous Delivery and Pick-up (VRP_SDP), each customer has both delivery and pick-up demand simultaneously. VRP_SDP is very difficult combinatorial optimization problem. For this reason, in recent years, it is observed studies focused on metaheuristic methods. In this study, a heuristic solution approach based on Bacterial Foraging Optimization Algorithm (BFOA) has been improved and its performance has been evaluated. In the scope of this study VRP_SDP has been solved in order to minimize the total distanced travelled and the results have been tested with the insertion based heuristic that is known in the literature. BFOA obtained good solutions about 24 problems of 40 test problems.

Özet

Eşzamanlı Dağıtımlı ve Toplamalı Araç Rotalama Probleminde (EDT_ARP), her müşteri dağıtım talebi ile birlikte aynı zamanda toplama talebinde bulunmaktadır ve müşterilere eşzamanlı olarak hizmet verilmektedir. EDT_ARP çözümü oldukça zor kombinatoryal optimizasyon problemidir. Bu nedenle son yıllarda yapılan çalışmalarda metasezgisel metotlar üzerinde odaklanıldığı gözlemlenmiştir. Bu çalışmada oldukça yeni bir metasezgisel algoritma olan Bakteriyel Besin Arama Optimizasyonu Algoritması (BBAOA) tabanlı bir sezgisel çözüm yaklaşımı geliştirilmiş ve performansı değerlendirilmiştir. Çalışma kapsamında EDT_ARP katedilen toplam mesafe minimize edilerek çözülmüş ve sonuçlar literatürde bilinen ekleme tabanlı sezgisel bir algoritma ile karşılaştırılmıştır. Önerilen BBAOA ile göz önünde bulundurulan, toplam 40 test probleminden 24ünde karşılaştırma yapılan algoritmaya göre daha iyi sonuçlara ulaşılmıştır.

🔖

Cite This Article

HEZER, S., KARA, Y. (2022). SOLVING VEHICLE ROUTING PROBLEM WITH SIMULTANEOUS DELIVERY AND PICK-UP USING AN ALGORITHM BASED ON BACTERIAL FORAGING OPTIMIZATION. Gazi Üniversitesi Mühendislik Mimarlık Fakültesi Dergisi, Cilt: 28 - Sayı: 2, 373–382. https://ajindex.com/articles/523985

📄 Full Text PDF Viewer

📄

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

References (13)

  1. Chen, J. F., Wu, T. H., “Vehicle routing problem with simultaneous deliveries and pickups”, Journal of the Operational Research Society, Cilt 57, 579–587, 2006
  2. Toth, P., Vigo, D., The vehicle routing problem, Society for Industrial and Applied Mathematics, Philadelphia, 2002
  3. Wassan, N. A., Wassan, A. H., Nagy, G., “A reactive tabu search algorithm for the vehicle routing problem with simultaneous pickups and deliveries”, J Comb Optim., Cilt 15, 368–386, 2008
  4. Ai, J., Kachitvichyanukul, V., “A particle swarm optimization for the vehicle routing problem with simultaneous pickup and delivery”,Computers & Operations Research, Cilt 36, No 5, 1693- 1702, 2009
  5. Altıparmak, F., Dengiz, B., Kara, İ., Karaoğlan İ., “Eş zamanlı topla-dağıt araç rotalama problemi için yeni matematiksel formulasyonlar”. YA/EM 2008-Yöneylem Araştırması ve Endüstri Mühendisliği XXVIII. Ulusal Kongresi Bildiri Özetleri Kitabı, Galatasaray Üniversitesi, İstanbul, Sayfa No. 130, 30 Haziran - 2 Temmuz 2008
  6. Dethloff, J., “Vehicle routing and reverse logistics: The vehicle routing problem with simultaneous delivery and pick-up”, OR Specktrum, Cilt 23, 79–96, 2001
  7. Zachariadis, E, E., Tarantilis, C, D., Kiranoudis, C, T., “A hybrid metaheuristic algorithm for the vehicle routing problem with simultaneous delivery and pick-up service”, Expert Systems with Applications, Cilt 36, No 2, 1070–1081, 2009
  8. Min, H., “The multiple vehicle routing problem with simultaneous delivery and pick-up points”, Transportation Research, Cilt 23, No 5, 377– 386, 1989
  9. Crispim, J., Brandao, J., “Metaheuristics applied to mixed and simultaneous extensions of vehicle routingproblems with backhauls”, Journal of the Operational Research Society, Cilt 56, 1296– 1302, 2005
  10. Dell’Amico, M., Righini, G., Salani, M., “A branch-and-price approach to the vehicle routing problem with simultaneous distribution and collection”, Transportation Science, Cilt 40: 2, 235–247, 2006
  11. Montané, T, F, A., Galvão, R, D., “A tabu search algorithm for the vehicle routing problem with simultaneous pick-up and delivery service”, Computers & Operations Research, Cilt 33, No 3, 595–619, 2006
  12. Bianchessi, N., Righini, G., “Heuristic algorithms for the vehicle routing problem with simultaneous pick-up and delivery”, Computers & Operations Research, Cilt 34, No 2, 578– 594, 2007
  13. Gajpal, Y., Abad, P., “An ant colony system (ACS) for vehicle routing problem with simultaneous delivery and pickup”, Compute