var bibbase_data = {"data":"\"Loading..\"\n\n
\n\n \n\n \n\n \n \n\n \n\n \n \n\n \n\n \n
\n generated by\n \n \"bibbase.org\"\n\n \n
\n \n\n
\n\n \n\n\n
\n\n Excellent! Next you can\n create a new website with this list, or\n embed it in an existing web page by copying & pasting\n any of the following snippets.\n\n
\n JavaScript\n (easiest)\n
\n \n <script src=\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2Fkan4Kc46zkudwj3uf&jsonp=1&noBootstrap=1&jsonp=1\"></script>\n \n
\n\n PHP\n
\n \n <?php\n $contents = file_get_contents(\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2Fkan4Kc46zkudwj3uf&jsonp=1&noBootstrap=1\");\n print_r($contents);\n ?>\n \n
\n\n iFrame\n (not recommended)\n
\n \n <iframe src=\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2Fkan4Kc46zkudwj3uf&jsonp=1&noBootstrap=1\"></iframe>\n \n
\n\n

\n For more details see the documention.\n

\n
\n
\n\n
\n\n This is a preview! To use this list on your own web site\n or create a new web site from it,\n create a free account. The file will be added\n and you will be able to edit it in the File Manager.\n We will show you instructions once you've created your account.\n
\n\n
\n\n

To the site owner:

\n\n

Action required! Mendeley is changing its\n API. In order to keep using Mendeley with BibBase past April\n 14th, you need to:\n

    \n
  1. renew the authorization for BibBase on Mendeley, and
  2. \n
  3. update the BibBase URL\n in your page the same way you did when you initially set up\n this page.\n
  4. \n
\n

\n\n

\n \n \n Fix it now\n

\n
\n\n
\n\n\n
\n \n \n
\n
\n  \n 2025\n \n \n (3)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Enhancing operational efficiency in a voluntary recycling project through data-driven waste collection optimization.\n \n \n \n \n\n\n \n Petchrompo, S.; Chitniyom, R.; Peerwantanagul, N.; Laesanklang, W.; Suwanapong, J.; and Borrisuttanakul, S.\n\n\n \n\n\n\n Waste Management, 200. 2025.\n Cited by: 0; All Open Access, Hybrid Gold Open Access\n\n\n\n
\n\n\n\n \n \n \"EnhancingPaper\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{Petchrompo2025,\n\tauthor = {Petchrompo, Sanyapong and Chitniyom, Rasita and Peerwantanagul, Naplaifa and Laesanklang, Wasakorn and Suwanapong, Jirachaya and Borrisuttanakul, Shuleeporn},\n\ttitle = {Enhancing operational efficiency in a voluntary recycling project through data-driven waste collection optimization},\n\tyear = {2025},\n\tjournal = {Waste Management},\n\tvolume = {200},\n\tdoi = {10.1016/j.wasman.2025.114741},\n\turl = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-105000104478&doi=10.1016%2fj.wasman.2025.114741&partnerID=40&md5=33fe302e223156bcfd289bb972478b17},\n\ttype = {Article},\n\tpublication_stage = {Final},\n\tsource = {Scopus},\n\tnote = {Cited by: 0; All Open Access, Hybrid Gold Open Access}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Embedded Vehicle Routing Problem: A Modeling and Optimization Framework for Real-World Multi-Purpose Truck Network.\n \n \n \n \n\n\n \n Krityakierne, T.; Boonkangwan, C.; Phunnasorn, C.; and Laesanklang, W.\n\n\n \n\n\n\n IEEE Access, 13: 3768 – 3787. 2025.\n Cited by: 0; All Open Access, Gold Open Access\n\n\n\n
\n\n\n\n \n \n \"EmbeddedPaper\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{Krityakierne20253768,\n\tauthor = {Krityakierne, Tipaluck and Boonkangwan, Chanon and Phunnasorn, Chanoknun and Laesanklang, Wasakorn},\n\ttitle = {Embedded Vehicle Routing Problem: A Modeling and Optimization Framework for Real-World Multi-Purpose Truck Network},\n\tyear = {2025},\n\tjournal = {IEEE Access},\n\tvolume = {13},\n\tpages = {3768 – 3787},\n\tdoi = {10.1109/ACCESS.2024.3524395},\n\turl = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85214101125&doi=10.1109%2fACCESS.2024.3524395&partnerID=40&md5=5522c51cea89ce0461bdb3c6d94ffa67},\n\ttype = {Article},\n\tpublication_stage = {Final},\n\tsource = {Scopus},\n\tnote = {Cited by: 0; 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 A Clustering-Based Optimization of Restaurant Locations in Malaysian Cities.\n \n \n \n\n\n \n Zulkifli, F.; Abidin, R. Z.; Sayuti, M. A. M.; Zulkifli, N. Z.; Ependi, U.; and Laesanklang, W.\n\n\n \n\n\n\n 2025.\n \n\n\n\n
\n\n\n\n \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
@CONFERENCE{zulkifli2025clustering,\n  title={A Clustering-Based Optimization of Restaurant Locations in Malaysian Cities},\n  author={Zulkifli, Faiz and Abidin, Rozaimah Zainal and Sayuti, Muhamad Azhar Muhamad and Zulkifli, Nurin Zulaikha and Ependi, Usman and Laesanklang, Wasakorn},\n  journal={6th International Conference on Artificial Intelligence and Data Sciences, AiDAS 2025},\n  pages={12--17},\n  year={2025},\n  organization={Institute of Electrical and Electronics Engineers Inc.}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2024\n \n \n (3)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Delivery Zones Partitioning ConsideringWorkload Balance Using Clustering Algorithm.\n \n \n \n \n\n\n \n Wangwattanakool, J.; and Laesanklang, W.\n\n\n \n\n\n\n 2024.\n Cited by: 1\n\n\n\n
\n\n\n\n \n \n \"DeliveryPaper\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
@CONFERENCE{Wangwattanakool2024378,\n\tauthor = {Wangwattanakool, Jaruwan and Laesanklang, Wasakorn},\n\ttitle = {Delivery Zones Partitioning ConsideringWorkload Balance Using Clustering Algorithm},\n\tyear = {2024},\n\tjournal = {Proceedings of the International Conference on Simulation and Modeling Methodologies, Technologies and Applications},\n\tpages = {378 – 385},\n\tdoi = {10.5220/0012803800003758},\n\turl = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85203298509&doi=10.5220%2f0012803800003758&partnerID=40&md5=d87cd5a136b6f6e6c87ac623f02bb34a},\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 Detection of Viral Pneumonia in Radiographic Images Using Deep Learning.\n \n \n \n \n\n\n \n Laesanklang, W.; and Lohajareekul, P.\n\n\n \n\n\n\n 2024.\n Cited by: 0\n\n\n\n
\n\n\n\n \n \n \"DetectionPaper\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
@CONFERENCE{Laesanklang2024239,\n\tauthor = {Laesanklang, Wasakorn and Lohajareekul, Phonlapee},\n\ttitle = {Detection of Viral Pneumonia in Radiographic Images Using Deep Learning},\n\tyear = {2024},\n\tjournal = {2024 5th International Conference on Artificial Intelligence and Data Sciences, AiDAS 2024 - Proceedings},\n\tpages = {239 – 244},\n\tdoi = {10.1109/AiDAS63860.2024.10730357},\n\turl = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85209665804&doi=10.1109%2fAiDAS63860.2024.10730357&partnerID=40&md5=15b2420bea484b33a36395897a4ffbfa},\n\ttype = {Conference paper},\n\tpublication_stage = {Final},\n\tsource = {Scopus},\n\tnote = {Cited by: 0}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Graph convolutional network for multiple traveling salesman problem.\n \n \n \n\n\n \n Phunnasorn, C; Laesanklang, W; and Krityakierne, T\n\n\n \n\n\n\n 2024.\n \n\n\n\n
\n\n\n\n \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
@CONFERENCE{phunnasorn2024,\ntitle={Graph convolutional network for multiple traveling salesman problem},\nauthor={Phunnasorn, C and Laesanklang, W and Krityakierne, T},\njournal={The 28th annual meeting in mathematics AMM 2024},\nyear={2024}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2023\n \n \n (1)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Market Analysis with Business Intelligence System for Marketing Planning.\n \n \n \n \n\n\n \n Kongthanasuwan, T.; Sriwiboon, N.; Horbanluekit, B.; Laesanklang, W.; and Krityakierne, T.\n\n\n \n\n\n\n Information (Switzerland), 14(2). 2023.\n Cited by: 5; All Open Access, Gold Open Access\n\n\n\n
\n\n\n\n \n \n \"MarketPaper\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{Kongthanasuwan2023,\n\tauthor = {Kongthanasuwan, Treerak and Sriwiboon, Nakarin and Horbanluekit, Banpot and Laesanklang, Wasakorn and Krityakierne, Tipaluck},\n\ttitle = {Market Analysis with Business Intelligence System for Marketing Planning},\n\tyear = {2023},\n\tjournal = {Information (Switzerland)},\n\tvolume = {14},\n\tnumber = {2},\n\tdoi = {10.3390/info14020116},\n\turl = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85148683661&doi=10.3390%2finfo14020116&partnerID=40&md5=af1869f827cbaf1902e115064ea3dc8e},\n\ttype = {Article},\n\tpublication_stage = {Final},\n\tsource = {Scopus},\n\tnote = {Cited by: 5; 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 2022\n \n \n (1)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Nurse-patient relationship for multi-period home health care routing and scheduling problem.\n \n \n \n \n\n\n \n Krityakierne, T.; Limphattharachai, O.; and Laesanklang, W.\n\n\n \n\n\n\n PLoS ONE, 17(5 May). 2022.\n Cited by: 10; All Open Access, Gold Open Access, Green Open Access\n\n\n\n
\n\n\n\n \n \n \"Nurse-patientPaper\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{Krityakierne2022,\n\tauthor = {Krityakierne, Tipaluck and Limphattharachai, Onkanya and Laesanklang, Wasakorn},\n\ttitle = {Nurse-patient relationship for multi-period home health care routing and scheduling problem},\n\tyear = {2022},\n\tjournal = {PLoS ONE},\n\tvolume = {17},\n\tnumber = {5 May},\n\tdoi = {10.1371/journal.pone.0268517},\n\turl = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85130940710&doi=10.1371%2fjournal.pone.0268517&partnerID=40&md5=757bfb5a4f748dc97e2eb1936a530687},\n\ttype = {Article},\n\tpublication_stage = {Final},\n\tsource = {Scopus},\n\tnote = {Cited by: 10; All Open Access, Gold 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 2021\n \n \n (2)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n A mathematical model for course timetabling problem with faculty-course assignment constraints.\n \n \n \n \n\n\n \n Algethami, H.; and Laesanklang, W.\n\n\n \n\n\n\n IEEE Access, 9: 111666 – 111682. 2021.\n Cited by: 25; All Open Access, Gold Open Access\n\n\n\n
\n\n\n\n \n \n \"APaper\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{Algethami2021111666,\n\tauthor = {Algethami, H. and Laesanklang, W.},\n\ttitle = {A mathematical model for course timetabling problem with faculty-course assignment constraints},\n\tyear = {2021},\n\tjournal = {IEEE Access},\n\tvolume = {9},\n\tpages = {111666 – 111682},\n\tdoi = {10.1109/ACCESS.2021.3103495},\n\turl = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85112768638&doi=10.1109%2fACCESS.2021.3103495&partnerID=40&md5=8a3b882dcf71f0f4417236076f1be40d},\n\ttype = {Article},\n\tpublication_stage = {Final},\n\tsource = {Scopus},\n\tnote = {Cited by: 25; 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 Investigating Challenges of Student Centered Learning in Thai Higher Education during the COVID-19 Pandemic.\n \n \n \n \n\n\n \n Wattanakasiwich, P.; Suree, N.; Chamrat, S.; Saengsuwan, W.; Suttharangsee, W.; Panrat, T.; Ruamcharoen, J.; Trianpo, W.; Amornsamankul, S.; Laesanklang, W.; Berglund, A.; and Chantawannakul, P.\n\n\n \n\n\n\n 2021.\n Cited by: 8\n\n\n\n
\n\n\n\n \n \n \"InvestigatingPaper\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
@CONFERENCE{Wattanakasiwich2021,\n\tauthor = {Wattanakasiwich, Pornrat and Suree, Nuttee and Chamrat, Suthida and Saengsuwan, Washirasorn and Suttharangsee, Wandee and Panrat, Tanate and Ruamcharoen, Jareerat and Trianpo, Wannapon and Amornsamankul, Somkid and Laesanklang, Wasakorn and Berglund, Anders and Chantawannakul, Panuwan},\n\ttitle = {Investigating Challenges of Student Centered Learning in Thai Higher Education during the COVID-19 Pandemic},\n\tyear = {2021},\n\tjournal = {Proceedings - Frontiers in Education Conference, FIE},\n\tvolume = {2021-October},\n\tdoi = {10.1109/FIE49875.2021.9637298},\n\turl = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85123847788&doi=10.1109%2fFIE49875.2021.9637298&partnerID=40&md5=f93f9806e460d69e8410e3de322395d2},\n\ttype = {Conference paper},\n\tpublication_stage = {Final},\n\tsource = {Scopus},\n\tnote = {Cited by: 8}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2020\n \n \n (4)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n An optimization method for a multi-day distribution problem with shortage supplies.\n \n \n \n \n\n\n \n Amphaiphan, N.; and Laesanklang, W.\n\n\n \n\n\n\n 2020.\n Cited by: 1\n\n\n\n
\n\n\n\n \n \n \"AnPaper\n  \n \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
@CONFERENCE{Amphaiphan2020356,\n\tauthor = {Amphaiphan, Netiphan and Laesanklang, Wasakorn},\n\ttitle = {An optimization method for a multi-day distribution problem with shortage supplies},\n\tyear = {2020},\n\tjournal = {ICORES 2020 - Proceedings of the 9th International Conference on Operations Research and Enterprise Systems},\n\tpages = {356 – 363},\n\turl = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85082988685&partnerID=40&md5=9c7661aac243c4028da10cea24a63ae7},\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 An Optimization Method for a Multi-day Distribution Problem with Shortage Supplies.\n \n \n \n \n\n\n \n Amphaiphan, N.; and Laesanklang, W.\n\n\n \n\n\n\n 2020.\n Cited by: 0\n\n\n\n
\n\n\n\n \n \n \"AnPaper\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
@CONFERENCE{Amphaiphan2020356,\n\tauthor = {Amphaiphan, Netiphan and Laesanklang, Wasakorn},\n\ttitle = {An Optimization Method for a Multi-day Distribution Problem with Shortage Supplies},\n\tyear = {2020},\n\tjournal = {International Conference on Operations Research and Enterprise Systems},\n\tpages = {356 – 363},\n\tdoi = {10.5220/0009154703560363},\n\turl = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85172791945&doi=10.5220%2f0009154703560363&partnerID=40&md5=e1bda77d09a4f46efc2a890d8d278c91},\n\ttype = {Conference paper},\n\tpublication_stage = {Final},\n\tsource = {Scopus},\n\tnote = {Cited by: 0}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Heuristic route adjustment for balanced working time in urban logistics with driver experience and time-dependent traffic information.\n \n \n \n \n\n\n \n Krityakierne, T.; and Laesanklang, W.\n\n\n \n\n\n\n Applied Sciences (Switzerland), 10(20): 1 – 18. 2020.\n Cited by: 2; All Open Access, Gold Open Access, Green Open Access\n\n\n\n
\n\n\n\n \n \n \"HeuristicPaper\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{Krityakierne20201,\n\tauthor = {Krityakierne, Tipaluck and Laesanklang, Wasakorn},\n\ttitle = {Heuristic route adjustment for balanced working time in urban logistics with driver experience and time-dependent traffic information},\n\tyear = {2020},\n\tjournal = {Applied Sciences (Switzerland)},\n\tvolume = {10},\n\tnumber = {20},\n\tpages = {1 – 18},\n\tdoi = {10.3390/app10207156},\n\turl = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85092695441&doi=10.3390%2fapp10207156&partnerID=40&md5=170f88be5defb6cba2c440260dd37f6b},\n\ttype = {Article},\n\tpublication_stage = {Final},\n\tsource = {Scopus},\n\tnote = {Cited by: 2; All Open Access, Gold 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 A variable neighborhood search algorithm with reinforcement learning for a real-life periodic vehicle routing problem with time windows and open routes.\n \n \n \n \n\n\n \n Chen, B.; Qu, R.; Bai, R.; and Laesanklang, W.\n\n\n \n\n\n\n RAIRO - Operations Research, 54(5): 1467 – 1494. 2020.\n Cited by: 30\n\n\n\n
\n\n\n\n \n \n \"APaper\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{Chen20201467,\n\tauthor = {Chen, Binhui and Qu, Rong and Bai, Ruibin and Laesanklang, Wasakorn},\n\ttitle = {A variable neighborhood search algorithm with reinforcement learning for a real-life periodic vehicle routing problem with time windows and open routes},\n\tyear = {2020},\n\tjournal = {RAIRO - Operations Research},\n\tvolume = {54},\n\tnumber = {5},\n\tpages = {1467 – 1494},\n\tdoi = {10.1051/ro/2019080},\n\turl = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85088924010&doi=10.1051%2fro%2f2019080&partnerID=40&md5=8067f49806a6bfa8c2e3a47c75f5668a},\n\ttype = {Article},\n\tpublication_stage = {Final},\n\tsource = {Scopus},\n\tnote = {Cited by: 30}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2019\n \n \n (1)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n An Efficient Application of Goal Programming to Tackle Multiobjective Problems with Recurring Fitness Landscapes.\n \n \n \n \n\n\n \n Pinheiro, R. L.; Landa-Silva, D.; Laesanklang, W.; and Constantino, A. A.\n\n\n \n\n\n\n Communications in Computer and Information Science, 966: 134 – 152. 2019.\n Cited by: 1\n\n\n\n
\n\n\n\n \n \n \"AnPaper\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{Pinheiro2019134,\n\tauthor = {Pinheiro, Rodrigo Lankaites and Landa-Silva, Dario and Laesanklang, Wasakorn and Constantino, Ademir Aparecido},\n\ttitle = {An Efficient Application of Goal Programming to Tackle Multiobjective Problems with Recurring Fitness Landscapes},\n\tyear = {2019},\n\tjournal = {Communications in Computer and Information Science},\n\tvolume = {966},\n\tpages = {134 – 152},\n\tdoi = {10.1007/978-3-030-16035-7_8},\n\turl = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85064060850&doi=10.1007%2f978-3-030-16035-7_8&partnerID=40&md5=688ff6302d9f4140c4f732d15f21875f},\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 2018\n \n \n (3)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Using goal programming on estimated pareto fronts to solve multiobjective problems.\n \n \n \n \n\n\n \n Pinheiro, R. L.; Landa-Silva, D.; Laesanklang, W.; and Constantino, A. A.\n\n\n \n\n\n\n 2018.\n Cited by: 3; All Open Access, Green Open Access, Hybrid Gold Open Access\n\n\n\n
\n\n\n\n \n \n \"UsingPaper\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
@CONFERENCE{Pinheiro2018132,\n\tauthor = {Pinheiro, Rodrigo Lankaites and Landa-Silva, Dario and Laesanklang, Wasakorn and Constantino, Ademir Aparecido},\n\ttitle = {Using goal programming on estimated pareto fronts to solve multiobjective problems},\n\tyear = {2018},\n\tjournal = {ICORES 2018 - Proceedings of the 7th International Conference on Operations Research and Enterprise Systems},\n\tvolume = {2018-January},\n\tpages = {132 – 143},\n\tdoi = {10.5220/0006718901320143},\n\turl = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85047962591&doi=10.5220%2f0006718901320143&partnerID=40&md5=43b3e5d711f6a59377c035198f1e2a64},\n\ttype = {Conference paper},\n\tpublication_stage = {Final},\n\tsource = {Scopus},\n\tnote = {Cited by: 3; All Open Access, Green Open Access, Hybrid Gold Open Access}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n A hyper-heuristic with two guidance indicators for bi-objective mixed-shift vehicle routing problem with time windows.\n \n \n \n \n\n\n \n Chen, B.; Qu, R.; Bai, R.; and Laesanklang, W.\n\n\n \n\n\n\n Applied Intelligence, 48(12): 4937 – 4959. 2018.\n Cited by: 19; All Open Access, Hybrid Gold Open Access\n\n\n\n
\n\n\n\n \n \n \"APaper\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{Chen20184937,\n\tauthor = {Chen, Binhui and Qu, Rong and Bai, Ruibin and Laesanklang, Wasakorn},\n\ttitle = {A hyper-heuristic with two guidance indicators for bi-objective mixed-shift vehicle routing problem with time windows},\n\tyear = {2018},\n\tjournal = {Applied Intelligence},\n\tvolume = {48},\n\tnumber = {12},\n\tpages = {4937 – 4959},\n\tdoi = {10.1007/s10489-018-1250-y},\n\turl = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85051658549&doi=10.1007%2fs10489-018-1250-y&partnerID=40&md5=31e85289eab8657781f4a902ea1373e0},\n\ttype = {Article},\n\tpublication_stage = {Final},\n\tsource = {Scopus},\n\tnote = {Cited by: 19; All Open Access, Hybrid Gold Open Access}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Large neighbourhood search with adaptive guided ejection search for the pickup and delivery problem with time windows.\n \n \n \n \n\n\n \n Curtois, T.; Landa-Silva, D.; Qu, Y.; and Laesanklang, W.\n\n\n \n\n\n\n EURO Journal on Transportation and Logistics, 7(2): 151 – 192. 2018.\n Cited by: 24; All Open Access, Gold Open Access, Green Open Access\n\n\n\n
\n\n\n\n \n \n \"LargePaper\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{Curtois2018151,\n\tauthor = {Curtois, Timothy and Landa-Silva, Dario and Qu, Yi and Laesanklang, Wasakorn},\n\ttitle = {Large neighbourhood search with adaptive guided ejection search for the pickup and delivery problem with time windows},\n\tyear = {2018},\n\tjournal = {EURO Journal on Transportation and Logistics},\n\tvolume = {7},\n\tnumber = {2},\n\tpages = {151 – 192},\n\tdoi = {10.1007/s13676-017-0115-6},\n\turl = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85064289105&doi=10.1007%2fs13676-017-0115-6&partnerID=40&md5=c7bed7161544548f1de9f406e688bd7a},\n\ttype = {Article},\n\tpublication_stage = {Final},\n\tsource = {Scopus},\n\tnote = {Cited by: 24; All Open Access, Gold 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 2017\n \n \n (3)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n An investigation of heuristic decomposition to tackle workforce scheduling and routing with time-dependent activities constraints.\n \n \n \n \n\n\n \n Laesanklang, W.; Landa-Silva, D.; and Castillo-Salazar, J. A.\n\n\n \n\n\n\n Communications in Computer and Information Science, 695: 239 – 260. 2017.\n Cited by: 4\n\n\n\n
\n\n\n\n \n \n \"AnPaper\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{Laesanklang2017239,\n\tauthor = {Laesanklang, Wasakorn and Landa-Silva, Dario and Castillo-Salazar, J. Arturo},\n\ttitle = {An investigation of heuristic decomposition to tackle workforce scheduling and routing with time-dependent activities constraints},\n\tyear = {2017},\n\tjournal = {Communications in Computer and Information Science},\n\tvolume = {695},\n\tpages = {239 – 260},\n\tdoi = {10.1007/978-3-319-53982-9_14},\n\turl = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85013498401&doi=10.1007%2f978-3-319-53982-9_14&partnerID=40&md5=eb94e0348b7d1d3ce7d4fc11cf6873ff},\n\ttype = {Conference paper},\n\tpublication_stage = {Final},\n\tsource = {Scopus},\n\tnote = {Cited by: 4}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Decomposition techniques with mixed integer programming and heuristics for home healthcare planning.\n \n \n \n \n\n\n \n Laesanklang, W.; and Landa-Silva, D.\n\n\n \n\n\n\n Annals of Operations Research, 256(1): 93 – 127. 2017.\n Cited by: 17; All Open Access, Green Open Access, Hybrid Gold Open Access\n\n\n\n
\n\n\n\n \n \n \"DecompositionPaper\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{Laesanklang201793,\n\tauthor = {Laesanklang, Wasakorn and Landa-Silva, Dario},\n\ttitle = {Decomposition techniques with mixed integer programming and heuristics for home healthcare planning},\n\tyear = {2017},\n\tjournal = {Annals of Operations Research},\n\tvolume = {256},\n\tnumber = {1},\n\tpages = {93 – 127},\n\tdoi = {10.1007/s10479-016-2352-8},\n\turl = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84992213719&doi=10.1007%2fs10479-016-2352-8&partnerID=40&md5=443f345a6edb59984f7b71bc05c9ca11},\n\ttype = {Article},\n\tpublication_stage = {Final},\n\tsource = {Scopus},\n\tnote = {Cited by: 17; All Open Access, Green Open Access, Hybrid Gold Open Access}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Towards collaborative optimisation in a shared-logistics environment for pickup and delivery operations.\n \n \n \n \n\n\n \n Curtois, T.; Laesanklang, W.; Landa-Silva, D.; Mesgarpour, M.; and Qu, Y.\n\n\n \n\n\n\n 2017.\n Cited by: 2; All Open Access, Green Open Access, Hybrid Gold Open Access\n\n\n\n
\n\n\n\n \n \n \"TowardsPaper\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
@CONFERENCE{Curtois2017477,\n\tauthor = {Curtois, Timothy and Laesanklang, Wasakorn and Landa-Silva, Dario and Mesgarpour, Mohammad and Qu, Yi},\n\ttitle = {Towards collaborative optimisation in a shared-logistics environment for pickup and delivery operations},\n\tyear = {2017},\n\tjournal = {ICORES 2017 - Proceedings of the 6th International Conference on Operations Research and Enterprise Systems},\n\tvolume = {2017-January},\n\tpages = {477 – 482},\n\tdoi = {10.5220/0006291004770482},\n\turl = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85049179625&doi=10.5220%2f0006291004770482&partnerID=40&md5=5ba9d55f236da00b68acd9a197dc4111},\n\ttype = {Conference paper},\n\tpublication_stage = {Final},\n\tsource = {Scopus},\n\tnote = {Cited by: 2; All Open Access, Green Open Access, Hybrid Gold Open Access}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2016\n \n \n (1)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Mixed integer programming with decomposition for workforce scheduling and routing with time-dependent activities constraints.\n \n \n \n \n\n\n \n Laesanklang, W.; Landa-Silva, D.; and Castillo-Salazar, J. A.\n\n\n \n\n\n\n 2016.\n Cited by: 4; All Open Access, Hybrid Gold Open Access\n\n\n\n
\n\n\n\n \n \n \"MixedPaper\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
@CONFERENCE{Laesanklang2016330,\n\tauthor = {Laesanklang, Wasakorn and Landa-Silva, Dario and Castillo-Salazar, J. Arturo},\n\ttitle = {Mixed integer programming with decomposition for workforce scheduling and routing with time-dependent activities constraints},\n\tyear = {2016},\n\tjournal = {ICORES 2016 - Proceedings of the 5th International Conference on Operations Research and Enterprise Systems},\n\tpages = {330 – 339},\n\tdoi = {10.5220/0005757503300339},\n\turl = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84964903269&doi=10.5220%2f0005757503300339&partnerID=40&md5=cfa0af84e0ec324a4a3cf47530da9641},\n\ttype = {Conference paper},\n\tpublication_stage = {Final},\n\tsource = {Scopus},\n\tnote = {Cited by: 4; All Open Access, Hybrid Gold Open Access}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2015\n \n \n (2)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Mixed integer programming with decomposition to solve a workforce scheduling and routing problem.\n \n \n \n \n\n\n \n Laesanklang, W.; Landa-Silva, D.; and Castillo-Salazar, J. A.\n\n\n \n\n\n\n 2015.\n Cited by: 12; All Open Access, Green Open Access\n\n\n\n
\n\n\n\n \n \n \"MixedPaper\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
@CONFERENCE{Laesanklang2015283,\n\tauthor = {Laesanklang, Wasakorn and Landa-Silva, Dario and Castillo-Salazar, J. Arturo},\n\ttitle = {Mixed integer programming with decomposition to solve a workforce scheduling and routing problem},\n\tyear = {2015},\n\tjournal = {ICORES 2015 - 4th International Conference on Operations Research and Enterprise Systems, Proceedings},\n\tpages = {283 – 293},\n\tdoi = {10.5220/0005223602830293},\n\turl = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84945895538&doi=10.5220%2f0005223602830293&partnerID=40&md5=e52cdd9bcc194fc23d6f9daec593f86d},\n\ttype = {Conference paper},\n\tpublication_stage = {Final},\n\tsource = {Scopus},\n\tnote = {Cited by: 12; 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 Extended decomposition for mixed integer programming to solve a workforce scheduling and routing problem.\n \n \n \n \n\n\n \n Laesanklang, W.; Pinheiro, R. L.; Algethami, H.; and Landa-Silva, D.\n\n\n \n\n\n\n Communications in Computer and Information Science, 577: 191 – 211. 2015.\n Cited by: 7\n\n\n\n
\n\n\n\n \n \n \"ExtendedPaper\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{Laesanklang2015191,\n\tauthor = {Laesanklang, Wasakorn and Pinheiro, Rodrigo Lankaites and Algethami, Haneen and Landa-Silva, Dario},\n\ttitle = {Extended decomposition for mixed integer programming to solve a workforce scheduling and routing problem},\n\tyear = {2015},\n\tjournal = {Communications in Computer and Information Science},\n\tvolume = {577},\n\tpages = {191 – 211},\n\tdoi = {10.1007/978-3-319-27680-9_12},\n\turl = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84952051197&doi=10.1007%2f978-3-319-27680-9_12&partnerID=40&md5=0e37a865a546a07d331c1c1019bd3061},\n\ttype = {Conference paper},\n\tpublication_stage = {Final},\n\tsource = {Scopus},\n\tnote = {Cited by: 7}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2010\n \n \n (1)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Entropy multi-hyperplane credit scoring model.\n \n \n \n \n\n\n \n Laesanklang, W.; Sinapiromsaran, K.; and Intiyot, B.\n\n\n \n\n\n\n 2010.\n Cited by: 0\n\n\n\n
\n\n\n\n \n \n \"EntropyPaper\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
@CONFERENCE{Laesanklang201091,\n\tauthor = {Laesanklang, Wasakorn and Sinapiromsaran, Krung and Intiyot, Boonyarit},\n\ttitle = {Entropy multi-hyperplane credit scoring model},\n\tyear = {2010},\n\tjournal = {2010 International Conference on Financial Theory and Engineering, ICFTE 2010},\n\tpages = {91 – 94},\n\tdoi = {10.1109/ICFTE.2010.5499418},\n\turl = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-77955287849&doi=10.1109%2fICFTE.2010.5499418&partnerID=40&md5=967a6581896e71150120baa0c06b025b},\n\ttype = {Conference paper},\n\tpublication_stage = {Final},\n\tsource = {Scopus},\n\tnote = {Cited by: 0}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n\n\n\n
\n\n\n \n\n \n \n \n \n\n
\n"}; document.write(bibbase_data.data);