Research Article
Peer ReviewedAt least two reviewers
Open Access
Kapasite Kısıtlı Araç Rotalama Problemi için Melez Bir Algoritma
1Erciyes Üniversitesi
✉ Corresponding author: Bilal BABAYIGIT · bilalb@erciyes.edu.tr
Proceedings 3rd International Symposium on Innovative Approaches in Scientific Studies (Engineering and Natural Sciences)
Volume 4 Pages 508–513 Year 2019
References
- M. Özcanli, H. Serin, "Evaluation Of Soybean/Canola/Palm Biodiesel Mixture As An Alternative Diesel Fuel", Journal of Scientific & Industrıal Research, vol. 70, pp.466-470, 2011.
- G. B. Dantzig, J. M. Ramser, “The truck dispatching problem”, Management Science, vol. 6, pp. 81-91, 1959.
- G. Clarke, J. W. Wright, “Scheduling of vehicles from a central depot to a number of delivery points”, Operations Research, vol. 12, pp. 568- 581, 1964.
- Ç. Alabaş, B. Dengiz, “Yerel Arama Yöntemlerinde Yöre Yapısı: Araç Rotalama Problemine Bir Uygulama”, Yöneylem Araştırması/Endüstri Mühendisliği 24. Ulusal Kongresi, 2010, Gaziantep – Adana, p. 333 – 335.
- M. Türkay, Optimizasyon modelleri ve çözüm metodları. (Web Sayfası: http://home.ku.edu.tr/~mturkay/indr501/Optimizasyon.pdf), (Erişim tarihi: Nisan 2019).
- D. Karaboğa, Yapay Zeka Optimizasyon Algoritmaları. Atlas Yayın Dağıtım, İstanbul, 2004.
- N. L. Biggs, E. K. Llyod, R. J. Wilson, Graph Theory. Clarendon Press, Oxford, UK. 1976.
- R. Matai, S. P. Singh, M. L. Mittal, Traveling Salesman Problem: an Overview of Applications, Formulations, and Solution Approaches. pp. 1-24. In: Traveling Salesman Problem: Theory and Applications (Eds. D. Davendra), Intech Open Access Publisher, 2010.
- B. Gavish, S. C. Graves, “The travelling salesman problem and related problems”, Technical Report OR 078-78, Operations Research Center, Massachusetts Institute of Technology, Cambridge, MA, USA. 1978..
- C. Rego, "Node-ejection chains for the vehicle routing problem: Sequential and parallel algorithms", Parallel Computing, vol 27, pp. 201-222, 2001.
- P. Toth, D. Vigo, The Vehicle Routing Problem Society for Industrial and Applied Mathematics, Philadelphia, pp. 367, 2002.
- A. H. El Hassani, A. Koukam, L. Bouhafs, A hybrid ant colony system approach for the capacitated vehicle routing problem and the capacitated vehicle routing problem with time Windows. pp. 57-70. In: Vehicle Routing Problem, (Eds. T. Caric, H. Gold), INTECH Open Access Publisher, Croatia, 2008.
- V. Erol, “Araç Rotalama Problemleri için Popülasyon ve Komşuluk Tabanlı Metasezgisel Bir Algoritmanın Tasarımı ve Uygulaması”, Yıldız Teknik Üniversitesi, Sistem Mühendisliği, Yüksek Lisans Tezi, Sabancı Kütüphanesi, İstanbul,2006.
- C. Blum, A. Roli, “Metaheuristics in Combinatorial Optimization: Overview and Conceptual Comparison”, ACM Computing Surveys, vol. 35, 3, pp. 268-308, 2003.
- D. Koržinek, R. Skoczylas, System for a Stationary Robot that Draws Vector Images Based on Photographic Analysis. Polish-Japanese Academy of Information Technology, Faculty of Multi-Agent Systems and Robotics, Yüksek Lisans Tezi, Warsaw, 2005.
- V. Tereshko, “Reaction-Diffusion Model of a Honey Bee Colony’s Foraging Behaviour”, In: 6th International Conference on Parallel Problem Solving from Nature, Springer-Verlag, London, UK. 2000.
- D. Karaboga, “An idea based on honey bee swarm for numerical optimization.” Technical Report TR06, Erciyes University, Engineering Faculty, Computer Engineering Department. 2005.
- P. Augerat, J. M. Belenguer, E. Benavent, A. Corberán, D. Naddef, G. Rinaldi, Computational results with a branch and cut code for the capacitated vehicle routing problem. Research Report 949-M, Universite Joseph Fourier, Grenoble, France. 1995.
- N. Christofides, S. Eilon, An algorithm for the vehicle-dispatching problem. Operations Research Quaterly, vol.20, pp. 309-318, 1969.
- M. L. Fisher, Optimal solution of vehicle routing problems using minimum K-trees. Operations Research, vol. 42, 4, pp. 626–642, 1994.