Transferring route plan over time
| dc.contributor.author | Kocer B. | |
| dc.contributor.author | Arslan A. | |
| dc.date.accessioned | 2020-03-26T18:22:24Z | |
| dc.date.available | 2020-03-26T18:22:24Z | |
| dc.date.issued | 2011 | |
| dc.department | Selçuk Üniversitesi | en_US |
| dc.description.abstract | Travelling salesman problem (TSP) is a combinational optimization problem and solution approaches have been applied many real world problems. Pure TSP assumes the cities to visit are fixed in time and thus solutions are created to find shortest path according to these point. But some of the points are canceled to visit in time. If the problem is not time crucial it is not important to determine new routing plan but if the points are changing rapidly and time is necessary do decide a new route plan a new approach should be applied in such cases. We developed a route plan transfer method based on transfer learning and we achieved high performance against determining a new model from scratch in every change. | en_US |
| dc.identifier.endpage | 171 | en_US |
| dc.identifier.issn | 2010376X | en_US |
| dc.identifier.scopusquality | N/A | en_US |
| dc.identifier.startpage | 168 | en_US |
| dc.identifier.uri | https://hdl.handle.net/20.500.12395/27317 | |
| dc.identifier.volume | 78 | en_US |
| dc.indekslendigikaynak | Scopus | en_US |
| dc.language.iso | en | en_US |
| dc.relation.ispartof | World Academy of Science, Engineering and Technology | en_US |
| dc.relation.publicationcategory | Makale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanı | en_US |
| dc.rights | info:eu-repo/semantics/closedAccess | en_US |
| dc.selcuk | 20240510_oaig | en_US |
| dc.subject | Genetic algorithms | en_US |
| dc.subject | Transfer learning | en_US |
| dc.subject | Travelling salesman problem | en_US |
| dc.title | Transferring route plan over time | en_US |
| dc.type | Article | en_US |
