Onur ÇopurMert YildizSimru GövenAli Övünç GüneriAlper Berke YavuzMahmut Ali GökçeCansu YurtsevenGökçe, Mahmut AliYurtseven, CansuÇopur, OnurYavuz, Alper BerkeGüneri, Ali ÖvünçYıldız, MertGöven, SimruM.N. Osman Zahid , R. Abd. Aziz , A.R. Yusoff , N. Mat Yahya , F. Abdul Aziz , M. Yazid Abu , N.M. Durakbasa , M.G. Gençyilmaz2025-10-0620209789819650583, 9783031991585, 9783031948886, 9789819667314, 9789811937156, 9783030703318, 9789811622779, 9789811969447, 9789819701056, 97898197480519789811509490978303031342521954364, 219543562195-435610.1007/978-3-030-31343-2_632-s2.0-85076215018https://www.scopus.com/inward/record.uri?eid=2-s2.0-85076215018&doi=10.1007%2F978-3-030-31343-2_63&partnerID=40&md5=8a6671af4094f16fba4f7594b3634416https://gcris.yasar.edu.tr/handle/123456789/9320https://doi.org/10.1007/978-3-030-31343-2_63Izmir based Information Technology (IT) solution provider develops supply chain management software tools for many customers from fast moving consumer goods sector (FMCG). Customers of the FMCG sector needs to be visited a certain number of times in a given period by sales representatives. The company must decide which customers must be visited in which sequence by each sales representative while obeying visit frequency and time windows requirements. These decisions have significant impact on total cost. For this reason finding an optimal route for every sales representative for each day of the planning horizon is important. This practically challenging and technically important problem can be described as periodic multiple depot traveling salesman problem with time windows (PMDTSPTW). We propose a novel mathematical model for the optimal solution of this problem. The proposed model minimizes the total distance traveled by sales representatives by deciding which sales representative will visit which customer on which day while following the time windows to collect demand data. The proposed model is applicable to any company from FMCG sector. The solution approach in this study is implemented and tested with real life including coordinates and location data of customers and sales representatives from Turkey’s largest beer distributor. The proposed model is solved using IBM ILOG CPLEX Optimization Studio version 12.8. The results show significant improvement over the current situation. To ensure efficient usage of the proposed approach a user-friendly decision support system (DSS) is constructed and implemented. © 2022 Elsevier B.V. All rights reserved.Englishinfo:eu-repo/semantics/closedAccessDecision Support System, Mathematical Programming, Periodicity, Time Windows, Travelling Salesman Problem, Artificial Intelligence, Beer, Decision Support Systems, Sales, Supply Chain Management, Traveling Salesman Problem, Fast Moving Consumer Goods, Frequency Windows, Information Technology Solutions, Periodicity, Route Optimization, Sales Representatives, Software-tools, Solution Providers, Supply Chain Management Softwares, Time Windows, Mathematical ProgrammingArtificial intelligence, Beer, Decision support systems, Sales, Supply chain management, Traveling salesman problem, Fast moving consumer goods, Frequency windows, Information technology solutions, Periodicity, Route optimization, Sales representatives, Software-tools, Solution providers, Supply chain management softwares, Time windows, Mathematical programmingPeriodicityTravelling Salesman ProblemTime WindowsMathematical ProgrammingDecision Support SystemConference Object