Zobrazeno 1 - 10
of 39
pro vyhledávání: '"Uncapacitated vehicle routing"'
Autor:
Kartal, Z., Ernst, A. T.
21st International Congress on Modelling and Simulation (MODSIM) held jointly with the 23rd National Conference of the Australian-Society-for-Operations-Research / DSTO led Defence Operations Research Symposium (DORS -- NOV 29-DEC 04, 2015 -- Gold Co
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______3106::36989cc770fab9516871604ff95d88c6
https://hdl.handle.net/11421/20833
https://hdl.handle.net/11421/20833
Autor:
Vildan Özkır, Burak Topçu
Publikováno v:
Pamukkale University Journal of Engineering Sciences, Vol 24, Iss 1, Pp 76-82 (2018)
Among network optimization problems, travelling salesman problem is widely studied one in the literature. Since the problem is computationally hard, many heuristics have been developed to obtain the optimal solution in reasonable time. This paper int
Externí odkaz:
https://doaj.org/article/7459dbca78ef45389e5d5e6b334d1dec
Autor:
Vildan Özkır, Burak Topçu
Publikováno v:
Pamukkale University Journal of Engineering Sciences, Vol 24, Iss 1, Pp 76-82 (2018)
Ağ optimizasyonu problemleri içerisinde, gezgin satıcı problemi literatürde yaygın bir şekilde çalışılan problemlerden biridir. Problemin hesaplama açısından zor olması dolayısıyla, optimal çözümü elverişli zamanda elde edebilme
Externí odkaz:
https://doaj.org/article/849626ad747c40f4897cfcf914e5e25e
Autor:
Burak Topçu, Vildan Özkır
Publikováno v:
Pamukkale University Journal of Engineering Sciences, Vol 24, Iss 1, Pp 76-82 (2018)
Among network optimization problems, travelling salesman problem is widely studied one in the literature. Since the problem is computationally hard, many heuristics have been developed to obtain the optimal solution in reasonable time. This paper int
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::527ae3d183ffd148578a5bde8a6b3b03
https://doi.org/10.5505/pajes.2017.85698
https://doi.org/10.5505/pajes.2017.85698
Autor:
Vildan Özkır, Burak Topçu
Publikováno v:
Volume: 24, Issue: 1 76-82
Pamukkale Üniversitesi Mühendislik Bilimleri Dergisi
Pamukkale University Journal of Engineering Sciences, Vol 24, Iss 1, Pp 76-82 (2018)
Pamukkale Üniversitesi Mühendislik Bilimleri Dergisi
Pamukkale University Journal of Engineering Sciences, Vol 24, Iss 1, Pp 76-82 (2018)
Ağ optimizasyonuproblemleri içerisinde, gezgin satıcı problemi literatürde yaygın bir şekildeçalışılan problemlerden biridir. Problemin hesaplama açısından zor olmasıdolayısıyla, optimal çözümü elverişli zamanda elde edebilmek i
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::740f876cc2574d98d51997f695189891
https://dergipark.org.tr/tr/pub/pajes/issue/35876/400799
https://dergipark.org.tr/tr/pub/pajes/issue/35876/400799
Autor:
López Sánchez, Aitor1,2 (AUTHOR) aitor.lopez@urjc.es, Lujak, Marin1 (AUTHOR) marin.lujak@urjc.es, Semet, Frederic2 (AUTHOR) frederic.semet@centralelille.fr, Billhardt, Holger1 (AUTHOR) holger.billhardt@urjc.es
Publikováno v:
AI Communications. 2024, Vol. 37 Issue 2, p223-245. 23p.
Autor:
Tricoire, Fabien fabien.tricoire@univie.ac.at, Bostel, Nathalie1 nathalie.bostel@univ-nantes.fr, Dejax, Pierre2 pierre.dejax@emn.fr, Guez, Pierre3 pierre.guez@veolia.com
Publikováno v:
Central European Journal of Operations Research. Jun2013, Vol. 21 Issue 2, p359-377. 19p.
One of the most studied extensions of the famous Traveling Salesperson Problem (TSP) is the {\sc Multiple TSP}: a set of $m\geq 1$ salespersons collectively traverses a set of $n$ cities by $m$ non-trivial tours, to minimize the total length of their
Externí odkaz:
http://arxiv.org/abs/2307.07180
Autor:
ÖZKIR, Vildan1 vildanozkir@gmail.com, TOPÇU, Burak1 burakt@yildiz.edu.tr
Publikováno v:
Pamukkale University Journal of Engineering Sciences. 2018, Vol. 24 Issue 1, p76-82. 7p.
Autor:
Kartal, Zühal1 zkartal@anadolu.edu.tr, Krishnamoorthy, Mohan2 Mohan.Krishnamoorthy@uq.edu, Ernst, Andreas T.3 Andreas.Ernst@monash.edu
Publikováno v:
OR Spectrum. Mar2019, Vol. 41 Issue 1, p99-145. 47p.