SANTA FE-ENDONEZYA İÇİN ÇOK-SEFERLİ ARAÇ ROTALAMA PROBLEMİ İÇİN KURUCU BİR MAT-SEZGİSEL

Yıl 2018, Cilt: 29 Sayı: 3-4, 31 - 41, 14.02.2019

Haldun Süral Jeroen Wouter De Boer Bahar Çavdar

Öz

Bu çalışma, çok-seferli araç rotalama probleminin (VRPM) gerçek hayattaki bir uygulaması ile motive edilmiştir. VRPM her aracın sadece tek bir yolculuk yapabileceği varsayımını gevşetir. Bu problem tipi birçok uygulama için daha uygun olsa da, VRPM ile ilgili literatür Araç Rotalama Probleminin diğer çeşitleriyle karşılaştırıldığında sınırlıdır. Bu çalışmada, belirli bir küme kaplama yaklaşımına dayanan kurucu bir mat-sezgisel yöntemi geliştirilmiş ve daha kapsamlı bir VRPM varyantı için sayısal deneylerin sonuçları sunulmuştur.

Anahtar Kelimeler

Araç rotalama, mat-sezgisel

A CONSTRUCTION MATHEURISTIC FOR MULTI-TRIP VEHICLE ROUTING PROBLEM AT SANTA FE-INDONESIA

Öz

This study is motivated by a real-life application of the multi-trip vehicle routing problem (VRPM). The VRPM relaxes a strong assumption that each vehicle can perform only a single trip. Even though this problem setting is more suitable for many applications, the literature on the VRPM is limited compared to the other variants of the Vehicle Routing Problem. In this paper, we propose a construction matheuristic based on a set covering approach, and provide the results of computational experiments for a more involved variant of VRPM.

Anahtar Kelimeler

Vehicle routing, matheuristic

Kaynakça

• 1. Azi, N., Gendreau, M., Potvin J. Y. 2010. "An Exact Algorithm for a Vehicle Routing Problem with Time Windows and Multiple use of Vehicles", European Journal of Operational Research, 202 (3): 756-763.
• 2. Azi, N., Gendreau, M., Potvin J. Y. 2014. "An Adaptive Large Neighborhood Search for a Vehicle Routing Problem with Multiple Routes", Computers & Operations Research, 41: 167-173.
• 3. Brandao, J., Mercer, A. 1997. "A Tabu Search Algorithm for the Multi-Trip Vehicle Routing and Scheduling Problem", European Journal of Operational Research, 100 (1): 180-191.
• 4. Cattaruzza, D., Absi, N., Feillet, D., Vidal, T. 2014. "A Memetic Algorithm for the Multi Trip Vehicle Routing Problem", European Journal of Operational Research, 236 (3): 833-848.
• 5. Clarke, G. U., Wright, J. W. 1964. "Scheduling of Vehicles From a Central Depot to a Number of Delivery points", Operations Research, 12 (4): 568-581.
• 6. Hernandez, F., Feillet, D., Giroudeau, R., Naud, O., 2014. "A New Exact Algorithm to Solve the Multi-trip Vehicle Routing Problem with Time Windows and Limited Duration", 4OR, 12 (3): 235-259.
• 7. Mingozzi, A., Roberti, R., Toth, P. 2013. "An Exact Algorithm for the Multitrip Vehicle Routing Problem", INFORMS Journal on Computing, 25 (2): 193-207.
• 8. Olivera, A., Viera, O. 2007. "Adaptive Memory Programming for the Vehicle Routing Problem with Multiple Trips", Computers & Operations Research, 34 (1): 28-47.
• 9. Prins, C. 2004. "A Simple and Effective Evolutionary Algorithm for the Vehicle Routing Problem", Computers & Operations Research, 31 (12): 1985-2002.
• 10. Rochat, Y., Taillard, E. D. 1995. "Probabilistic Ddiversification and Intensification in Local Search for Vehicle Routing", Journal of Heuristics, 1 (1): 147-167.
• 11. Salhi, S., Petch, R. J. 2007. "A GA Based Heuristic for the Vehicle Routing Problem with Multiple Trips", Journal of Mathematical Modelling and Algorithms, 6 (4): 591-613.
• 12. Solomon, M. M. 1987. "Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints", Operations Research, 35 (2): 254-265.
• 13. Taillard, E. D., Laporte, G., Gendreau, M. 1996. "Vehicle Routing with Multiple use of Vehicles", Journal of the Operational Research Society, 47 (8): 1065-1070.
• 14. Yang, Y., Tang, L. 2010. "A Filter-and-fan Approach to the Multi-Trip Vehicle Routing Problem", In Logistics Systems and Intelligent Management, 2010 International Conference, IEEE.