{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,7]],"date-time":"2025-11-07T09:47:57Z","timestamp":1762508877086,"version":"build-2065373602"},"reference-count":95,"publisher":"MDPI AG","issue":"10","license":[{"start":{"date-parts":[[2022,10,16]],"date-time":"2022-10-16T00:00:00Z","timestamp":1665878400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithms"],"abstract":"<jats:p>The assignment problem is a problem that takes many forms in optimization and graph theory, and by changing some of the constraints or interpreting them differently and adding other constraints, it can be converted to routing, distribution, and scheduling problems. Showing such correlations is one of the aims of this paper. For some of the derived problems having exponential time complexity, the question arises of their solvability for larger instances. Instead of the traditional approach based on the use of approximate or stochastic heuristic methods, we focus here on the direct use of mixed integer programming models in the GAMS environment, which is now capable of solving instances much larger than in the past and does not require complex parameter settings or statistical evaluation of the results as in the case of stochastic heuristics because the computational core of software tools, nested in GAMS, is deterministic in nature. The source codes presented may be an aid because this tool is not yet as well known as the MATLAB Optimisation Toolbox. Benchmarks of the permutation flow shop scheduling problem with the informally derived MIP model and the traveling salesman problem are used to present the limits of the software\u2019s applicability.<\/jats:p>","DOI":"10.3390\/a15100377","type":"journal-article","created":{"date-parts":[[2022,10,16]],"date-time":"2022-10-16T21:10:10Z","timestamp":1665954610000},"page":"377","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["The Assignment Problem and Its Relation to Logistics Problems"],"prefix":"10.3390","volume":"15","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5378-9303","authenticated-orcid":false,"given":"Milos","family":"Seda","sequence":"first","affiliation":[{"name":"Institute of Automation and Computer Science, Faculty of Mechanical Engineering, Brno University of Technology, Technicka 2896\/2, 623 00 Brno, Czech Republic"}]}],"member":"1968","published-online":{"date-parts":[[2022,10,16]]},"reference":[{"key":"ref_1","unstructured":"Gass, S.I. (2010). Linear Programming. Methods and Applications, Courier Corporation. Dover Books on Computer Science."},{"key":"ref_2","doi-asserted-by":"crossref","unstructured":"Du, D.Z., and Pardalos, P.M. (1999). Handbook of Combinatorial Optimization. Volume A, Kluwer Academic Publishers.","DOI":"10.1007\/978-1-4757-3023-4"},{"key":"ref_3","doi-asserted-by":"crossref","unstructured":"Du, D.Z., and Pardalos, P.M. (2005). Handbook of Combinatorial Optimization. Volume B, Springer.","DOI":"10.1007\/b102533"},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1002\/nav.3800020109","article-title":"The Hungarian Method for the Assignment Problem","volume":"2","author":"Kuhn","year":"1955","journal-title":"Nav. Res. Logist."},{"key":"ref_5","doi-asserted-by":"crossref","unstructured":"Burkard, R., Dell\u2019Amico, M., and Martello, S. (2009). Assignment Problems, Society for Industrial and Applied Mathematics.","DOI":"10.1137\/1.9780898717754"},{"key":"ref_6","doi-asserted-by":"crossref","unstructured":"Diestel, R. (2005). Graph Theory, Springer.","DOI":"10.4171\/owr\/2005\/03"},{"key":"ref_7","doi-asserted-by":"crossref","unstructured":"Burkard, R.E., Cela, E., Pardalos, P.M., and Pitsoulis, L.S. (1998). The Quadratic Assignment Problem, Graz University of Technology. Report.","DOI":"10.1007\/978-1-4613-0303-9_27"},{"key":"ref_8","doi-asserted-by":"crossref","unstructured":"Gutin, G., and Punnen, A.P. (2007). The Traveling Salesman Problem and Its Variations, Springer.","DOI":"10.1007\/b101971"},{"key":"ref_9","unstructured":"Nalepa, J. (2020). Smart Delivery Systems. Solving Complex Vehicle Routing Problems, Elsevier."},{"key":"ref_10","unstructured":"Ganesh, K., Malaijaran, R.A., Mohapatra, S., and Punniyamoorthy, M. (2015). Resource Allocation Problems in Supply Chains, Emerald Group Publishing Limited."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1016\/j.ejor.2008.12.003","article-title":"A Robust Optimization Approach to Wine Grape Harvesting Scheduling","volume":"200","author":"Bohle","year":"2010","journal-title":"Eur. J. Oper. Res."},{"key":"ref_12","doi-asserted-by":"crossref","unstructured":"Church, R.L., and Murray, A. (2018). Location Covering Models, Springer.","DOI":"10.1007\/978-3-319-99846-6"},{"key":"ref_13","doi-asserted-by":"crossref","unstructured":"Seda, P., Seda, M., and Hosek, J. (2020). On Mathematical Modelling of Automated Coverage Optimization in Wireless 5G and beyond Deployments. Appl. Sci., 10.","DOI":"10.3390\/app10248853"},{"key":"ref_14","unstructured":"B\u0142a\u017cewicz, J., Ecker, K.H., Schmidt, G., and W\u0229glarz, J. (2013). Scheduling Computer and Manufacturing Processes, Springer."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"841","DOI":"10.1016\/j.ejor.2019.07.055","article-title":"A Combinatorial Analysis of the Permutation and Non-Permutation Flow Shop Scheduling Problems","volume":"289","author":"Rossit","year":"2021","journal-title":"Eur. J. Oper. Res."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"100607","DOI":"10.1016\/j.swevo.2019.100607","article-title":"A Novel Design of Differential Evolution for Solving Discrete Traveling Salesman Problems","volume":"52","author":"Ali","year":"2020","journal-title":"Swarm Evol. Comput."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"727","DOI":"10.1016\/j.future.2018.12.065","article-title":"A Novel Genetic Algorithm for Large Scale Colored Balanced Traveling Salesman Problem","volume":"95","author":"Dong","year":"2019","journal-title":"Future Gener. Comput. Syst."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"105831","DOI":"10.1016\/j.cor.2022.105831","article-title":"A Genetic Algorithm for the Close-Enough Traveling Salesman Problem with Application to Solar Panels Diagnostic Reconnaissance","volume":"145","author":"Placido","year":"2022","journal-title":"Comput. Oper. Res."},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"109339","DOI":"10.1016\/j.asoc.2022.109339","article-title":"A Genetic Algorithm with Jumping Gene and Heuristic Operators for Traveling Salesman Problem","volume":"127","author":"Zhang","year":"2022","journal-title":"Appl. Soft Comput."},{"key":"ref_20","doi-asserted-by":"crossref","unstructured":"Mahrach, M., Miranda, G., Le\u00f3n, C., and Segredo, E. (2020). Comparison between Single and Multi-Objective Evolutionary Algorithms to Solve the Knapsack Problem and the Travelling Salesman Problem. Mathematics, 8.","DOI":"10.3390\/math8112018"},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"108332","DOI":"10.1016\/j.knosys.2022.108332","article-title":"Knowledge-Guided Two-Stage Memetic Search for the Pickup and Delivery Traveling Salesman Problem with FIFO Loading","volume":"242","author":"Zhu","year":"2022","journal-title":"Knowl.-Based Syst."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1016\/j.procs.2021.12.144","article-title":"An Integrated Integer Programming Model with a Simulated Annealing Heuristic for the Carrier Vehicle Traveling Salesman Problem","volume":"197","author":"Larasati","year":"2022","journal-title":"Procedia Comput. Sci."},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"681","DOI":"10.1016\/j.procs.2022.01.084","article-title":"The Neural Network Methods for Solving Traveling Salesman Problem","volume":"199","author":"Shi","year":"2022","journal-title":"Procedia Comput. Sci."},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"108746","DOI":"10.1016\/j.asoc.2022.108746","article-title":"A Double-Adaptive General Variable Neighborhood Search Algorithm for the Solution of the Traveling Salesman Problem","volume":"121","author":"Karakostas","year":"2022","journal-title":"Appl. Soft Comput."},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"100029","DOI":"10.1016\/j.ejco.2022.100029","article-title":"New Neighborhoods and an Iterated Local Search Algorithm for the Generalized Traveling Salesman Problem","volume":"10","author":"Schmidt","year":"2022","journal-title":"EURO J. Comput. Optim."},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"107199","DOI":"10.1016\/j.knosys.2021.107199","article-title":"Development of Deer Hunting Linked Earthworm Optimization Algorithm for Solving Large Scale Traveling Salesman Problem","volume":"227","author":"Kanna","year":"2021","journal-title":"Knowl.-Based Syst."},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"105887","DOI":"10.1016\/j.asoc.2019.105887","article-title":"Discrete Spider Monkey Optimization for Travelling Salesman Problem","volume":"86","author":"Akhand","year":"2020","journal-title":"Appl. Soft Comput."},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"115353","DOI":"10.1016\/j.eswa.2021.115353","article-title":"Solving Traveling Salesman Problem Using Hybridization of Rider Optimization and Spotted Hyena Optimization Algorithm","volume":"183","author":"Krishna","year":"2021","journal-title":"Expert Syst. Appl."},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"107298","DOI":"10.1016\/j.asoc.2021.107298","article-title":"Discrete Grey Wolf Optimizer for Symmetric Travelling Salesman Problem","volume":"105","author":"Panwar","year":"2021","journal-title":"Appl. Soft Comput."},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"109290","DOI":"10.1016\/j.knosys.2022.109290","article-title":"A Discrete Variant of Cuckoo Search Algorithm to Solve the Travelling Salesman Problem and Path Planning for Autonomous Trolley inside Warehouse","volume":"252","author":"Reda","year":"2022","journal-title":"Knowl.-Based Syst."},{"key":"ref_31","doi-asserted-by":"crossref","first-page":"108157","DOI":"10.1016\/j.cie.2022.108157","article-title":"A Discrete Cuckoo Search Algorithm for Traveling Salesman Problem and Its Application in Cutting Path Optimization","volume":"169","author":"Zhang","year":"2022","journal-title":"Comput. Ind. Eng."},{"key":"ref_32","doi-asserted-by":"crossref","first-page":"108469","DOI":"10.1016\/j.asoc.2022.108469","article-title":"Discrete Sparrow Search Algorithm for Symmetric Traveling Salesman Problem","volume":"118","author":"Zhang","year":"2022","journal-title":"Appl. Soft Comput."},{"key":"ref_33","doi-asserted-by":"crossref","first-page":"107085","DOI":"10.1016\/j.asoc.2021.107085","article-title":"A Discrete Shuffled Frog-Leaping Algorithm Based on Heuristic Information for Traveling Salesman Problem","volume":"102","author":"Huang","year":"2021","journal-title":"Appl. Soft Comput."},{"key":"ref_34","doi-asserted-by":"crossref","first-page":"101056","DOI":"10.1016\/j.swevo.2022.101056","article-title":"Adaptive Ant Colony Optimization with Node Clustering Applied to the Travelling Salesman Problem","volume":"70","author":"Stodola","year":"2022","journal-title":"Swarm Evol. Comput."},{"key":"ref_35","doi-asserted-by":"crossref","first-page":"100017","DOI":"10.1016\/j.ejco.2021.100017","article-title":"The Solution of Some 100-City Travelling Salesman Problems","volume":"9","author":"Land","year":"2021","journal-title":"EURO J. Comput. Optim."},{"key":"ref_36","doi-asserted-by":"crossref","first-page":"102493","DOI":"10.1016\/j.omega.2021.102493","article-title":"Algorithms Based on Branch and Bound for the Flying Sidekick Traveling Salesman Problem","volume":"104","author":"Montemanni","year":"2021","journal-title":"Omega"},{"key":"ref_37","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/j.ejor.2021.07.051","article-title":"Valid Inequalities and Branch-and-Cut Algorithm for the Pickup and Delivery Traveling Salesman Problem with Multiple Stacks","volume":"300","author":"Pereira","year":"2022","journal-title":"Eur. J. Oper. Res."},{"key":"ref_38","doi-asserted-by":"crossref","first-page":"849","DOI":"10.1016\/j.ejor.2020.04.024","article-title":"A Branch-and-Cut Algorithm for the Generalized Traveling Salesman Problem with Time Windows","volume":"286","author":"Yuan","year":"2020","journal-title":"Eur. J. Oper. Res."},{"key":"ref_39","doi-asserted-by":"crossref","first-page":"107956","DOI":"10.1016\/j.cie.2022.107956","article-title":"Discrete Differential Evolution Metaheuristics for Permutation Flow Shop Scheduling Problems","volume":"166","author":"Morais","year":"2022","journal-title":"Comput. Ind. Eng."},{"key":"ref_40","doi-asserted-by":"crossref","first-page":"118068","DOI":"10.1016\/j.eswa.2022.118068","article-title":"Adaptive Genetic Algorithm for Two-Stage Hybrid Flow-Shop Scheduling with Sequence-Independent Setup Time and No-Interruption Requirement","volume":"208","author":"Qiao","year":"2022","journal-title":"Expert Syst. Appl."},{"key":"ref_41","doi-asserted-by":"crossref","first-page":"108236","DOI":"10.1016\/j.cie.2022.108236","article-title":"An Improved Multi-Objective Evolutionary Algorithm Based on Decomposition for Solving Re-Entrant Hybrid Flow Shop Scheduling Problem with Batch Processing Machines","volume":"169","author":"Wu","year":"2022","journal-title":"Comput. Ind. Eng."},{"key":"ref_42","doi-asserted-by":"crossref","first-page":"100807","DOI":"10.1016\/j.swevo.2020.100807","article-title":"A Genetic Programming Hyper-Heuristic for the Distributed Assembly Permutation Flow-Shop Scheduling Problem with Sequence Dependent Setup Times","volume":"60","author":"Song","year":"2021","journal-title":"Swarm Evol. Comput."},{"key":"ref_43","doi-asserted-by":"crossref","first-page":"108126","DOI":"10.1016\/j.cie.2022.108126","article-title":"A Cooperative Memetic Algorithm with Feedback for the Energy-Aware Distributed Flow-Shops with Flexible Assembly Scheduling","volume":"168","author":"Wang","year":"2022","journal-title":"Comput. Ind. Eng."},{"key":"ref_44","doi-asserted-by":"crossref","first-page":"706","DOI":"10.1016\/j.procs.2020.09.043","article-title":"Tabu-Search Optimization Approach for No-Wait Hybrid Flow-Shop Scheduling with Dedicated Machines","volume":"176","author":"Harbaoui","year":"2020","journal-title":"Procedia Comput. Sci."},{"key":"ref_45","doi-asserted-by":"crossref","first-page":"101127","DOI":"10.1016\/j.swevo.2022.101127","article-title":"Island Neighboring Heuristics Harmony Search Algorithm for Flow Shop Scheduling with Blocking","volume":"74","author":"Doush","year":"2022","journal-title":"Swarm Evol. Comput."},{"key":"ref_46","doi-asserted-by":"crossref","first-page":"107843","DOI":"10.1016\/j.cie.2021.107843","article-title":"Automatic Generation of Iterated Greedy Algorithms for the Non-Permutation Flow Shop Scheduling Problem with Total Completion Time Minimization","volume":"163","author":"Brum","year":"2022","journal-title":"Comput. Ind. Eng."},{"key":"ref_47","doi-asserted-by":"crossref","first-page":"108366","DOI":"10.1016\/j.cie.2022.108366","article-title":"An Iterated Greedy Algorithm for Distributed Blocking Flow Shop with Setup Times and Maintenance Operations to Minimize Makespan","volume":"171","author":"Miyata","year":"2022","journal-title":"Comput. Ind. Eng."},{"key":"ref_48","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1016\/j.jclepro.2019.03.155","article-title":"Multi-Objective Iterated Local Search Algorithm for Comprehensive Energy-Aware Hybrid Flow Shop Scheduling","volume":"224","author":"Schulz","year":"2019","journal-title":"J. Clean. Prod."},{"key":"ref_49","doi-asserted-by":"crossref","first-page":"109138","DOI":"10.1016\/j.asoc.2022.109138","article-title":"Multi-Local Search-Based General Variable Neighborhood Search for Distributed Flow Shop Scheduling in Heterogeneous Multi-Factories","volume":"125","author":"Shao","year":"2022","journal-title":"Appl. Soft Comput."},{"key":"ref_50","doi-asserted-by":"crossref","first-page":"108255","DOI":"10.1016\/j.cie.2022.108255","article-title":"Hybrid Metaheuristics for the Integrated and Detailed Scheduling of Production and Delivery Operations in No-Wait Flow Shop Systems","volume":"170","author":"Pereira","year":"2022","journal-title":"Comput. Ind. Eng."},{"key":"ref_51","doi-asserted-by":"crossref","unstructured":"Umam, M., Mustafid, M., and Suryono, S. (2022). A Hybrid Genetic Algorithm and Tabu Search for Minimizing Makespan in Flow Shop Scheduling Problem. J. King Saud Univ. Comput. Inf. Sci., in press.","DOI":"10.1016\/j.jksuci.2021.08.025"},{"key":"ref_52","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/j.ejor.2021.08.007","article-title":"Permutation Flow Shop Scheduling with Multiple Lines and Demand Plans Using Reinforcement Learning","volume":"299","author":"Brammer","year":"2022","journal-title":"Eur. J. Oper. Res."},{"key":"ref_53","doi-asserted-by":"crossref","unstructured":"Pang, X., Xue, H., Tseng, M.L., Lim, M., and Liu, K. (2020). Hybrid Flow Shop Scheduling Problems Using Improved Fireworks Algorithm for Permutation. Appl. Sci., 10.","DOI":"10.3390\/app10031174"},{"key":"ref_54","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1016\/j.asoc.2018.08.002","article-title":"A New Hybrid Ant Colony Optimization Algorithm for Solving the No-Wait Flow Shop Scheduling Problems","volume":"72","author":"Engin","year":"2018","journal-title":"Appl. Soft Comput."},{"key":"ref_55","doi-asserted-by":"crossref","unstructured":"G\u00fcm\u00fcs\u00e7\u00fc, A., Kaya, S., Tenekeci, M., Kara\u00e7izmeli, I., and Aydilek, I. (2022). The Impact of Local Search Strategies on Chaotic Hybrid Firefly Particle Swarm Optimization Algorithm in Flow-Shop Scheduling. J. King Saud Univ. Comput. Inf. Sci., in press.","DOI":"10.1016\/j.jksuci.2021.07.017"},{"key":"ref_56","doi-asserted-by":"crossref","first-page":"107834","DOI":"10.1016\/j.asoc.2021.107834","article-title":"Migrating Birds Optimization with a Diversified Mechanism for Blocking Flow Shops to Minimize Idle and Blocking Time","volume":"114","author":"Deng","year":"2022","journal-title":"Appl. Soft Comput."},{"key":"ref_57","doi-asserted-by":"crossref","first-page":"102081","DOI":"10.1016\/j.rcim.2020.102081","article-title":"A Discrete Whale Swarm Algorithm for Hybrid Flow-Shop Scheduling Problem with Limited Buffers","volume":"68","author":"Zhang","year":"2021","journal-title":"Robot. Comput.-Integr. Manuf."},{"key":"ref_58","doi-asserted-by":"crossref","first-page":"105595","DOI":"10.1016\/j.cor.2021.105595","article-title":"Exact Solution of the Two-Machine Flow Shop Problem with Three Operations","volume":"138","author":"Croce","year":"2022","journal-title":"Comput. Oper. Res."},{"key":"ref_59","doi-asserted-by":"crossref","first-page":"10578","DOI":"10.1016\/j.cor.2022.105788","article-title":"Exact Method to Optimize the Total Electricity Cost in Two-Machine Permutation Flow Shop Scheduling Problem under Time-of-Use Tariff","volume":"144","author":"Ho","year":"2022","journal-title":"Comput. Oper. Res."},{"key":"ref_60","doi-asserted-by":"crossref","first-page":"1162","DOI":"10.1016\/j.ifacol.2021.08.207","article-title":"A Linear Programming Approach for Hybrid Flexible Flow Shop with Sequence-Dependent Setup Times to Minimise Total Tardiness","volume":"54-1","author":"Oujana","year":"2021","journal-title":"IFAC PapersOnLine"},{"key":"ref_61","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.cor.2019.04.017","article-title":"Branch-and-Bound Algorithms for Minimizing Total Eearliness and Tardiness in a Two-Machine Permutation Flow Shop with Unforced Idle Allowed","volume":"109","author":"Schaller","year":"2019","journal-title":"Comput. Oper. Res."},{"key":"ref_62","doi-asserted-by":"crossref","unstructured":"Liu, M., Li, Y., Huo, Q., Li, A., Zhu, M., Qu, N., Chen, L., and Xia, M. (2020). A Two-Way Parallel Slime Mold Algorithm by Flow and Distance for the Travelling Salesman Problem. Appl. Sci., 10.","DOI":"10.3390\/app10186180"},{"key":"ref_63","doi-asserted-by":"crossref","unstructured":"Golden, B., Raghavan, S., and Wasil, E. (2008). The Vehicle Routing Problem: Latest Advances and New Challenges, Springer.","DOI":"10.1007\/978-0-387-77778-8"},{"key":"ref_64","doi-asserted-by":"crossref","unstructured":"Toth, P., and Vigo, D. (2002). The Vehicle Routing Problem, Society for Industrial and Applied Mathematics.","DOI":"10.1137\/1.9780898718515"},{"key":"ref_65","doi-asserted-by":"crossref","unstructured":"Soto-Mendoza, V., Garc\u00eda-Calvillo, I., Ruiz-y Ruiz, E., and P\u00e9rez-Terrazas, J. (2020). Comparison between Single and Multi-Objective Evolutionary Algorithms to Solve the Knapsack Problem and the Travelling Salesman Problem. Algorithms, 13.","DOI":"10.3390\/a13040096"},{"key":"ref_66","doi-asserted-by":"crossref","unstructured":"Ochelska-Mierzejewska, J., Poniszewska-Mara\u0144da, A., and Mara\u0144da, W. (2021). Selected Genetic Algorithms for Vehicle Routing Problem Solving. Electronics, 10.","DOI":"10.3390\/electronics10243147"},{"key":"ref_67","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/0167-6377(91)90083-2","article-title":"Improvements and Extensions to the Miller-Tucker-Zemlin Subtour Elimination Constraints","volume":"10","author":"Desrochers","year":"1991","journal-title":"Oper. Res. Lett."},{"key":"ref_68","unstructured":"Stroh, M.B. (2006). A Practical Guide to Transportation and Logistics, Logistics Network."},{"key":"ref_69","unstructured":"Garey, M.R., and Johnson, D.S. (1997). Computers and Intractability: A Guide to the Theory of NP-Completeness, W.H. Freeman and Company. [19th ed.]."},{"key":"ref_70","doi-asserted-by":"crossref","unstructured":"Ausiello, G., Crescenzi, P., Gambosi, G., Kann, V., Marchetti-Spaccamela, A., and Protasi, M. (1999). Complexity and Approximation: Combinatorial Optimization Problems and their Approximability Properties, Springer.","DOI":"10.1007\/978-3-642-58412-1"},{"key":"ref_71","unstructured":"Reeves, C.R. (1993). Modern Heuristic Techniques for Combinatorial Problems, Blackwell Scientific Publications."},{"key":"ref_72","doi-asserted-by":"crossref","unstructured":"Michalewicz, Z., and Fogel, D.B. (2004). How to Solve It: Modern Heuristics, Springer.","DOI":"10.1007\/978-3-662-07807-5"},{"key":"ref_73","doi-asserted-by":"crossref","unstructured":"Onwubolu, G., and Davendra, D. (2009). Differential Evolution. A Handbook for Global Permutation-Based Combinatorial Optimization, Springer.","DOI":"10.1007\/978-3-540-92151-6"},{"key":"ref_74","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1109\/4235.585893","article-title":"No Free Lunch Theorems for Optimization","volume":"1","author":"Wolpert","year":"1997","journal-title":"IEEE Trans. Evol. Comput."},{"key":"ref_75","doi-asserted-by":"crossref","first-page":"721","DOI":"10.1109\/TEVC.2005.856205","article-title":"Coevolutionary Free Lunches","volume":"9","author":"Wolpert","year":"2005","journal-title":"IEEE Trans. Evol. Comput."},{"key":"ref_76","unstructured":"Brooke, A., Kendrick, D., and Meeraus, A. (1992). GAMS Release 2.25. A User\u2019s Guide, The Scientific Press. Boyd & Fraser Publishing Company."},{"key":"ref_77","unstructured":"Rosenthal, R.E. (2016). GAMS\u2014A User\u2019s Guide, GAMS Development Corporation."},{"key":"ref_78","unstructured":"GAMS (2022, September 06). Solver Manuals. Report, GAMS Development Corporation., Available online: https:\/\/www.gams.com\/latest\/docs\/S_MAIN.html."},{"key":"ref_79","doi-asserted-by":"crossref","first-page":"9395","DOI":"10.1109\/ACCESS.2019.2891424","article-title":"The Minimization of Public Facilities With Enhanced Genetic Algorithms Using War Elimination","volume":"7","author":"Seda","year":"2019","journal-title":"IEEE Access"},{"key":"ref_80","unstructured":"Beasley, J.E. (2022, September 06). OR-Library. Report, Brunel University London. Available online: http:\/\/people.brunel.ac.uk\/~mastjjb\/jeb\/info.html."},{"key":"ref_81","doi-asserted-by":"crossref","first-page":"1069","DOI":"10.1057\/jors.1990.166","article-title":"OR-Library: Distributing Test Problems by Electronic Mail","volume":"41","author":"Beasley","year":"1990","journal-title":"J. Oper. Res. Soc."},{"key":"ref_82","unstructured":"Michalewicz, Z. (1998). Genetic Algorithms + Data Structures = Evolution Programs, Springer."},{"key":"ref_83","unstructured":"Reinelt, G. (2013). MP-TESTDATA\u2014The TSPLIB Symmetric Traveling Salesman Problem Instances, Heidelberg University. Available online: http:\/\/elib.zib.de\/pub\/mp-testdata\/tsp\/tsplib\/tsp."},{"key":"ref_84","doi-asserted-by":"crossref","first-page":"107488","DOI":"10.1016\/j.cie.2021.107488","article-title":"Heuristics for the Canadian Traveler Problem with Neutralizations","volume":"159","author":"Alkaya","year":"2019","journal-title":"Comput. Ind. Eng."},{"key":"ref_85","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1016\/j.tcs.2014.02.026","article-title":"The Covering Canadian Traveller Problem","volume":"530","author":"Liao","year":"2014","journal-title":"Theor. Comput. Sci."},{"key":"ref_86","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1145\/116873.116880","article-title":"Voronoi Diagrams. A Survey of a Fundamental Geometric Data Structure","volume":"23","author":"Aurenhammer","year":"1991","journal-title":"ACM Comput. Surv."},{"key":"ref_87","doi-asserted-by":"crossref","unstructured":"de Berg, M., Cheong, O., van Kreveld, M., and Overmars, M. (2008). Computational Geometry: Algorithms and Applications, Springer.","DOI":"10.1007\/978-3-540-77974-2"},{"key":"ref_88","doi-asserted-by":"crossref","first-page":"129544","DOI":"10.1016\/j.jclepro.2021.129544","article-title":"Green Supply Chain Quantitative Models for Sustainable Inventory Management: A Review","volume":"328","author":"Becerra","year":"2021","journal-title":"J. Clean. Prod."},{"key":"ref_89","first-page":"200078","article-title":"Multiobjective Reverse Logistics Model for Inventory Management with Eenvironmental Impacts: An Application in Industry","volume":"14","author":"Forkan","year":"2022","journal-title":"Intell. Syst. Appl."},{"key":"ref_90","doi-asserted-by":"crossref","first-page":"102226","DOI":"10.1016\/j.rcim.2021.102226","article-title":"Decision Support System for Adaptive Sourcing and Inventory Management in Small- and Medium-Sized Enterprises","volume":"73","author":"Teerasoponpong","year":"2022","journal-title":"Robot. Comput.-Integr. Manuf."},{"key":"ref_91","doi-asserted-by":"crossref","first-page":"102671","DOI":"10.1016\/j.tre.2022.102671","article-title":"Data-Driven Robust Dual-Sourcing Inventory Management under Purchase Price and Demand Uncertainties","volume":"160","author":"Xiong","year":"2022","journal-title":"Transp. Res. Part E"},{"key":"ref_92","doi-asserted-by":"crossref","first-page":"108635","DOI":"10.1016\/j.cie.2022.108635","article-title":"A Sustainable Managerial Decision-Making Problem for a Substitutable Product in a Dual-Channel under Carbon Tax Policy","volume":"172","author":"Sarkar","year":"2022","journal-title":"Comput. Ind. Eng."},{"key":"ref_93","doi-asserted-by":"crossref","first-page":"2318","DOI":"10.1007\/s40815-022-01276-1","article-title":"Application of the Artificial Neural Network with Multithreading within an Inventory Model under Uncertainty and Inflation","volume":"24","author":"Sarkar","year":"2022","journal-title":"Int. J. Fuzzy Syst."},{"key":"ref_94","doi-asserted-by":"crossref","first-page":"3153","DOI":"10.1051\/ro\/2021128","article-title":"Economic and Environmental Assessment of an Unreliable Supply Chain Management","volume":"55","author":"Guchhait","year":"2021","journal-title":"RAIRO Oper. Res."},{"key":"ref_95","doi-asserted-by":"crossref","first-page":"257","DOI":"10.37394\/23205.2022.21.31","article-title":"Steiner Tree Problem in Graphs and Mixed Integer Linear Programming-Based Approach in GAMS","volume":"21","author":"Seda","year":"2022","journal-title":"WSEAS Trans. Comput."}],"container-title":["Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1999-4893\/15\/10\/377\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T00:55:11Z","timestamp":1760144111000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1999-4893\/15\/10\/377"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,10,16]]},"references-count":95,"journal-issue":{"issue":"10","published-online":{"date-parts":[[2022,10]]}},"alternative-id":["a15100377"],"URL":"https:\/\/doi.org\/10.3390\/a15100377","relation":{},"ISSN":["1999-4893"],"issn-type":[{"type":"electronic","value":"1999-4893"}],"subject":[],"published":{"date-parts":[[2022,10,16]]}}}