Research Article
BibTex RIS Cite

METAHEURISTIC ALGORITHMS FOR SOLVING VEHICLE ROUTING PROBLEMS

Year 2017, Issue: 74, 44 - 52, 01.05.2017

Muratali Abdyldaev

Abstract

Vehicle Routing Problem is the most important problem in distribution systems and it has lots of application. Basically, exact and heuristic methods are used to solve such problems. Heuristic methods for solving the Vehicle Routing Problems are divided into two main groups; classical heuristic and meta-heuristic methods. In this paper, a metaheuristic method described and the results of this research shows that presenting the “Use and practice of metaheuristic algorithms for solving vehicle routing problems”

Keywords

vehicle routing problem exact solution methods heuristics meta heuristics

References

  • Clarke, G., Wright, J.W. Scheduling of Vehicles from a Central Depot to a Number of Delivery Points, Operations Research, 1964, c. 12, sf. 568-581.
  • Çalışkan, E., Acar, H., Akay, A.E. Odun Hammadesi Taşımacılığında Meta-Sezgisel Yöntemlerin Kullanımı. Artvin Çoruh Üniversitesi Orman Fakültesi Dergisi. – 2009. – 10 (1). – S.19-28.
  • Dantzig, G. and Ramser, J. The truck dispatching problem.Management Science. – 1959. – 6(1). – Pp.80-91.
  • Demircioğlu, M. Araç Rotalama Probleminin Sezgisel Bir Yaklaşım İle Çözümlenmesi Üzerine Bir Uygulama. Çukurova Üniversitesi, Doktora Tezi, 2009.
  • Glover, F. and Laguna, M. Tabu search. Boston: Kluwer Academic Publishers, 1997.
  • Goldenberg, D.E. Genetic Algorithms in Search Optimization, and Machine Learning’, Addison-Wesley, New York, USA, 1989. – 411p.
  • Hertz, A., Widmer, M. Guidelines for the Use of Meta-Heuristics ın Combinatorial Optimization // European Journal of Operation Research, 2004.
  • Kennedy, J. and Eberhart, R. Particle swarm optimization. Neural Networks Proceedings IEEE International Conference on, Perth, 1942-1948, 1995.
  • Kirkpatrick, S., Gellat, C.D. and Vecchi, M.P. Optimization by Simulated Annealing // Science, New Series, 1983. –Vol.220, No.4598. – Pp. 671-680.
  • Nabiyev, V.V. Yapay Zeka – Problemler Yöntemler Algoritmalar, Seçkin Yayınevi, Ankara, 2003.
  • Öztemel, Ercan. Yapay Sinir Ağları. Papatya Yayıncılık, İstanbul, 2012.
  • Söke, A., Bingül, Z. İki Boyutlu Giyotinsiz Kesme Problemlerinin Benzetilmiş Tavlama Algoritması ile Çözümlerinin İncelenmesi. Politeknik Dergisi. Cilt, 2005. – 8 s.
  • Tokaylı, M.A. Zaman Pencereli Araç Rotalama Problemi için Bir Karar Destek Sistemi, Yüksek Lisans Tezi, Gazi Üniversitesi, 2005.
  • Toth, P., Vigo, D. The Vehicle Routing Problem // Society for Industrial and Applied Mathematics, Philadelphia, 2002.
  • Yücenur, G.N., Demirel, N.Ç. A Hybrid Algorithm with Genetic Algorithm and Ant Colony Optimization for Solving Multi-Depot Vehicle Routing Problems // Journal of Engineering and Natural Sciences. – 2011. – Sigma 29. – Pp. 340-350.
  • Урдалетова, А.Б., Абдылдаев, М.М. М.Рыскулбеков атындагы Кыргыз Экономикалык Университетинин Кабарлары. – Бишкек, 2015. – 4(34). – Б. 63-67.

МЕТАЭВРИСТИЧЕСКИЕ АЛГОРИТМЫ ДЛЯ РЕШЕНИЯ ЗАДАЧИ МАРШРУТИЗАЦИИ ТРАНСПОРТА

Year 2017, Issue: 74, 44 - 52, 01.05.2017

Muratali Abdyldaev

Abstract

Маршрутизация транспортных средств, являясь наиболее важной проблемой в системах
распределения, имеет множество областей применения. В основном для решения проблем
маршрутизации используются точные и эвристические методы. Эвристические методы, в
свою очередь, делятся на две основные группы: классические эвристические и
метаэвристические методы.
В данной работе описан метаэвристический метод и представлены результаты
исследования в рамках докторской диссертации на тему «Использование и практика
метаэвристических алгоритмов для решения задачи маршрутизации транспорта». 

Keywords

: задача маршрутизации транспорта точные методы эвристические методы метаэвристические методы

References

  • Clarke, G., Wright, J.W. Scheduling of Vehicles from a Central Depot to a Number of Delivery Points, Operations Research, 1964, c. 12, sf. 568-581.
  • Çalışkan, E., Acar, H., Akay, A.E. Odun Hammadesi Taşımacılığında Meta-Sezgisel Yöntemlerin Kullanımı. Artvin Çoruh Üniversitesi Orman Fakültesi Dergisi. – 2009. – 10 (1). – S.19-28.
  • Dantzig, G. and Ramser, J. The truck dispatching problem.Management Science. – 1959. – 6(1). – Pp.80-91.
  • Demircioğlu, M. Araç Rotalama Probleminin Sezgisel Bir Yaklaşım İle Çözümlenmesi Üzerine Bir Uygulama. Çukurova Üniversitesi, Doktora Tezi, 2009.
  • Glover, F. and Laguna, M. Tabu search. Boston: Kluwer Academic Publishers, 1997.
  • Goldenberg, D.E. Genetic Algorithms in Search Optimization, and Machine Learning’, Addison-Wesley, New York, USA, 1989. – 411p.
  • Hertz, A., Widmer, M. Guidelines for the Use of Meta-Heuristics ın Combinatorial Optimization // European Journal of Operation Research, 2004.
  • Kennedy, J. and Eberhart, R. Particle swarm optimization. Neural Networks Proceedings IEEE International Conference on, Perth, 1942-1948, 1995.
  • Kirkpatrick, S., Gellat, C.D. and Vecchi, M.P. Optimization by Simulated Annealing // Science, New Series, 1983. –Vol.220, No.4598. – Pp. 671-680.
  • Nabiyev, V.V. Yapay Zeka – Problemler Yöntemler Algoritmalar, Seçkin Yayınevi, Ankara, 2003.
  • Öztemel, Ercan. Yapay Sinir Ağları. Papatya Yayıncılık, İstanbul, 2012.
  • Söke, A., Bingül, Z. İki Boyutlu Giyotinsiz Kesme Problemlerinin Benzetilmiş Tavlama Algoritması ile Çözümlerinin İncelenmesi. Politeknik Dergisi. Cilt, 2005. – 8 s.
  • Tokaylı, M.A. Zaman Pencereli Araç Rotalama Problemi için Bir Karar Destek Sistemi, Yüksek Lisans Tezi, Gazi Üniversitesi, 2005.
  • Toth, P., Vigo, D. The Vehicle Routing Problem // Society for Industrial and Applied Mathematics, Philadelphia, 2002.
  • Yücenur, G.N., Demirel, N.Ç. A Hybrid Algorithm with Genetic Algorithm and Ant Colony Optimization for Solving Multi-Depot Vehicle Routing Problems // Journal of Engineering and Natural Sciences. – 2011. – Sigma 29. – Pp. 340-350.
  • Урдалетова, А.Б., Абдылдаев, М.М. М.Рыскулбеков атындагы Кыргыз Экономикалык Университетинин Кабарлары. – Бишкек, 2015. – 4(34). – Б. 63-67.

METAHEURISTIC ALGORITHMS FOR SOLVING VEHICLE ROUTING PROBLEMS

Year 2017, Issue: 74, 44 - 52, 01.05.2017

Muratali Abdyldaev

Abstract

Vehicle Routing Problem is the most important problem in distribution systems and it has lots
of application. Basically, exact and heuristic methods are used to solve such problems. Heuristic
methods for solving the Vehicle Routing Problems are divided into two main groups; classical
heuristic and meta-heuristic methods.
In this paper, a metaheuristic method described and the results of this research shows that
presenting the “Use and practice of metaheuristic algorithms for solving vehicle routing problems”.

Keywords

vehicle routing problem exact solution methods heuristics meta heuristics

References

  • Clarke, G., Wright, J.W. Scheduling of Vehicles from a Central Depot to a Number of Delivery Points, Operations Research, 1964, c. 12, sf. 568-581.
  • Çalışkan, E., Acar, H., Akay, A.E. Odun Hammadesi Taşımacılığında Meta-Sezgisel Yöntemlerin Kullanımı. Artvin Çoruh Üniversitesi Orman Fakültesi Dergisi. – 2009. – 10 (1). – S.19-28.
  • Dantzig, G. and Ramser, J. The truck dispatching problem.Management Science. – 1959. – 6(1). – Pp.80-91.
  • Demircioğlu, M. Araç Rotalama Probleminin Sezgisel Bir Yaklaşım İle Çözümlenmesi Üzerine Bir Uygulama. Çukurova Üniversitesi, Doktora Tezi, 2009.
  • Glover, F. and Laguna, M. Tabu search. Boston: Kluwer Academic Publishers, 1997.
  • Goldenberg, D.E. Genetic Algorithms in Search Optimization, and Machine Learning’, Addison-Wesley, New York, USA, 1989. – 411p.
  • Hertz, A., Widmer, M. Guidelines for the Use of Meta-Heuristics ın Combinatorial Optimization // European Journal of Operation Research, 2004.
  • Kennedy, J. and Eberhart, R. Particle swarm optimization. Neural Networks Proceedings IEEE International Conference on, Perth, 1942-1948, 1995.
  • Kirkpatrick, S., Gellat, C.D. and Vecchi, M.P. Optimization by Simulated Annealing // Science, New Series, 1983. –Vol.220, No.4598. – Pp. 671-680.
  • Nabiyev, V.V. Yapay Zeka – Problemler Yöntemler Algoritmalar, Seçkin Yayınevi, Ankara, 2003.
  • Öztemel, Ercan. Yapay Sinir Ağları. Papatya Yayıncılık, İstanbul, 2012.
  • Söke, A., Bingül, Z. İki Boyutlu Giyotinsiz Kesme Problemlerinin Benzetilmiş Tavlama Algoritması ile Çözümlerinin İncelenmesi. Politeknik Dergisi. Cilt, 2005. – 8 s.
  • Tokaylı, M.A. Zaman Pencereli Araç Rotalama Problemi için Bir Karar Destek Sistemi, Yüksek Lisans Tezi, Gazi Üniversitesi, 2005.
  • Toth, P., Vigo, D. The Vehicle Routing Problem // Society for Industrial and Applied Mathematics, Philadelphia, 2002.
  • Yücenur, G.N., Demirel, N.Ç. A Hybrid Algorithm with Genetic Algorithm and Ant Colony Optimization for Solving Multi-Depot Vehicle Routing Problems // Journal of Engineering and Natural Sciences. – 2011. – Sigma 29. – Pp. 340-350.
  • Урдалетова, А.Б., Абдылдаев, М.М. М.Рыскулбеков атындагы Кыргыз Экономикалык Университетинин Кабарлары. – Бишкек, 2015. – 4(34). – Б. 63-67.
There are 16 citations in total.

Details

Primary Language Russian
Other ID JA47CR64ZM
Journal Section Miscellaneous
Authors

Muratali Abdyldaev

Publication Date May 1, 2017
Submission Date May 1, 2017
Published in Issue Year 2017 Issue: 74

Cite

APA Abdyldaev, M. (2017). МЕТАЭВРИСТИЧЕСКИЕ АЛГОРИТМЫ ДЛЯ РЕШЕНИЯ ЗАДАЧИ МАРШРУТИЗАЦИИ ТРАНСПОРТА. Reforma, 2(74), 44-52.