\n \n \n
\n
\n \n 2020\n \n \n (2)\n \n \n
\n
\n \n \n
\n
\n\n \n \n \n \n \n \n Effects of update frequencies in a dynamic capacitated arc routing problem.\n \n \n \n \n\n\n \n Padungwech, W.; Thompson, J.; and Lewis, R.\n\n\n \n\n\n\n
Networks, 76(4): 522 – 538. 2020.\n
Cited by: 13; All Open Access, Green Open Access\n\n
\n\n
\n\n
\n\n \n \n
Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\n
@ARTICLE{Padungwech2020522,\n\tauthor = {Padungwech, Wasin and Thompson, Jonathan and Lewis, Rhyd},\n\ttitle = {Effects of update frequencies in a dynamic capacitated arc routing problem},\n\tyear = {2020},\n\tjournal = {Networks},\n\tvolume = {76},\n\tnumber = {4},\n\tpages = {522 – 538},\n\tdoi = {10.1002/net.21990},\n\turl = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85090947408&doi=10.1002%2fnet.21990&partnerID=40&md5=bc6d2264926deefb0e6de3b28eddb002},\n\ttype = {Article},\n\tpublication_stage = {Final},\n\tsource = {Scopus},\n\tnote = {Cited by: 13; All Open Access, Green Open Access}\n}\n\n\n
\n\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n \n Heuristic algorithms for surveyor standby location planning with multiple plans.\n \n \n \n \n\n\n \n Suwandechochai, R.; and Padungwech, W.\n\n\n \n\n\n\n
International Journal of Circuits, Systems and Signal Processing, 14: 1154 – 1161. 2020.\n
Cited by: 1; All Open Access, Gold Open Access\n\n
\n\n
\n\n
\n\n \n \n
Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\n
@ARTICLE{Suwandechochai20201154,\n\tauthor = {Suwandechochai, Rawee and Padungwech, Wasin},\n\ttitle = {Heuristic algorithms for surveyor standby location planning with multiple plans},\n\tyear = {2020},\n\tjournal = {International Journal of Circuits, Systems and Signal Processing},\n\tvolume = {14},\n\tpages = {1154 – 1161},\n\tdoi = {10.46300/9106.2020.14.143},\n\turl = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85099782118&doi=10.46300%2f9106.2020.14.143&partnerID=40&md5=1983501f084e0a0c8fafe393a5213461},\n\ttype = {Article},\n\tpublication_stage = {Final},\n\tsource = {Scopus},\n\tnote = {Cited by: 1; All Open Access, Gold Open Access}\n}\n\n\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n \n 2018\n \n \n (1)\n \n \n
\n
\n \n \n
\n
\n\n \n \n \n \n \n \n A Heuristic Approach for the Dynamic Frequency Assignment Problem.\n \n \n \n \n\n\n \n Alrajhi, K.; Thompson, J.; and Padungwech, W.\n\n\n \n\n\n\n
Advances in Intelligent Systems and Computing, 650: 91 – 103. 2018.\n
Cited by: 1\n\n
\n\n
\n\n
\n\n \n \n
Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\n
@ARTICLE{Alrajhi201891,\n\tauthor = {Alrajhi, Khaled and Thompson, Jonathan and Padungwech, Wasin},\n\ttitle = {A Heuristic Approach for the Dynamic Frequency Assignment Problem},\n\tyear = {2018},\n\tjournal = {Advances in Intelligent Systems and Computing},\n\tvolume = {650},\n\tpages = {91 – 103},\n\tdoi = {10.1007/978-3-319-66939-7_8},\n\turl = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85029592763&doi=10.1007%2f978-3-319-66939-7_8&partnerID=40&md5=940e84b9b6203da4889839d11332be85},\n\ttype = {Article},\n\tpublication_stage = {Final},\n\tsource = {Scopus},\n\tnote = {Cited by: 1}\n}\n\n\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n \n 2017\n \n \n (1)\n \n \n
\n
\n \n \n
\n
\n\n \n \n \n \n \n \n A dynamic tabu search approach for solving the static frequency assignment problem.\n \n \n \n \n\n\n \n Alrajhi, K.; and Padungwech, W.\n\n\n \n\n\n\n
Advances in Intelligent Systems and Computing, 513: 59 – 70. 2017.\n
Cited by: 1\n\n
\n\n
\n\n
\n\n \n \n
Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\n
@ARTICLE{Alrajhi201759,\n\tauthor = {Alrajhi, Khaled and Padungwech, Wasin},\n\ttitle = {A dynamic tabu search approach for solving the static frequency assignment problem},\n\tyear = {2017},\n\tjournal = {Advances in Intelligent Systems and Computing},\n\tvolume = {513},\n\tpages = {59 – 70},\n\tdoi = {10.1007/978-3-319-46562-3_5},\n\turl = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84988556831&doi=10.1007%2f978-3-319-46562-3_5&partnerID=40&md5=c4293fb28909fd82b4236e8411897070},\n\ttype = {Conference paper},\n\tpublication_stage = {Final},\n\tsource = {Scopus},\n\tnote = {Cited by: 1}\n}\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n \n 2016\n \n \n (2)\n \n \n
\n
\n \n \n
\n
\n\n \n \n \n \n \n \n Investigating edge-reordering procedures in a tabu search algorithm for the capacitated arc routing problem.\n \n \n \n \n\n\n \n Padungwech, W.; Thompson, J.; and Lewis, R.\n\n\n \n\n\n\n
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 9668: 62 – 74. 2016.\n
Cited by: 1\n\n
\n\n
\n\n
\n\n \n \n
Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\n
@ARTICLE{Padungwech201662,\n\tauthor = {Padungwech, Wasin and Thompson, Jonathan and Lewis, Rhyd},\n\ttitle = {Investigating edge-reordering procedures in a tabu search algorithm for the capacitated arc routing problem},\n\tyear = {2016},\n\tjournal = {Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)},\n\tvolume = {9668},\n\tpages = {62 – 74},\n\tdoi = {10.1007/978-3-319-39636-1_5},\n\turl = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84976622771&doi=10.1007%2f978-3-319-39636-1_5&partnerID=40&md5=9760920fea4113a500f74d9070cb041b},\n\ttype = {Conference paper},\n\tpublication_stage = {Final},\n\tsource = {Scopus},\n\tnote = {Cited by: 1}\n}\n\n\n
\n\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n \n Tabu search hybridized with multiple neighborhood structures for the frequency assignment problem.\n \n \n \n \n\n\n \n Alrajhi, K.; Thompson, J.; and Padungwech, W.\n\n\n \n\n\n\n
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 9668: 157 – 170. 2016.\n
Cited by: 3\n\n
\n\n
\n\n
\n\n \n \n
Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\n
@ARTICLE{Alrajhi2016157,\n\tauthor = {Alrajhi, Khaled and Thompson, Jonathan and Padungwech, Wasin},\n\ttitle = {Tabu search hybridized with multiple neighborhood structures for the frequency assignment problem},\n\tyear = {2016},\n\tjournal = {Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)},\n\tvolume = {9668},\n\tpages = {157 – 170},\n\tdoi = {10.1007/978-3-319-39636-1_12},\n\turl = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84976614559&doi=10.1007%2f978-3-319-39636-1_12&partnerID=40&md5=08ff5552e89680724a21a23c14edeae9},\n\ttype = {Conference paper},\n\tpublication_stage = {Final},\n\tsource = {Scopus},\n\tnote = {Cited by: 3}\n}\n\n\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n\n\n\n