{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,24]],"date-time":"2026-06-24T21:46:30Z","timestamp":1782337590399,"version":"3.54.5"},"reference-count":57,"publisher":"Emerald","issue":"1","license":[{"start":{"date-parts":[[2022,5,13]],"date-time":"2022-05-13T00:00:00Z","timestamp":1652400000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.emerald.com\/insight\/site-policies"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IJICC"],"published-print":{"date-parts":[[2023,3,7]]},"abstract":"<jats:sec><jats:title content-type=\"abstract-subheading\">Purpose<\/jats:title><jats:p>Drugs are strategic products with essential functions in human health. An optimum design of the pharmaceutical supply chain is critical to avoid economic damage and adverse effects on human health. The vehicle-routing problem, focused on finding the lowest-cost routes with available vehicles and constraints, such as time constraints and road length, is an important aspect of this. In this paper, the vehicle routing problem (VRP) for a pharmaceutical company in Turkey is discussed.<\/jats:p><\/jats:sec><jats:sec><jats:title content-type=\"abstract-subheading\">Design\/methodology\/approach<\/jats:title><jats:p>A mixed-integer programming (MIP) model based on the vehicle routing problem with time windows (VRPTW) is presented, aiming to minimize the total route cost with certain constraints. As the model provides an optimum solution for small problem sizes with the GUROBI\u00ae solver, for large problem sizes, metaheuristic methods that simulate annealing and adaptive large neighborhood search algorithms are proposed. A real dataset was used to analyze the effectiveness of the metaheuristic algorithms. The proposed simulated annealing (SA) and adaptive large neighborhood search (ALNS) were evaluated and compared against GUROBI\u00ae and each other through a set of real problem instances.<\/jats:p><\/jats:sec><jats:sec><jats:title content-type=\"abstract-subheading\">Findings<\/jats:title><jats:p>The model is solved optimally for a small-sized dataset with exact algorithms; for solving a larger dataset, however, metaheuristic algorithms require significantly lesser time. For the problem addressed in this study, while the metaheuristic algorithms obtained the optimum solution in less than one minute, the solution in the GUROBI\u00ae solver was limited to one hour and three hours, and no solution could be obtained in this time interval.<\/jats:p><\/jats:sec><jats:sec><jats:title content-type=\"abstract-subheading\">Originality\/value<\/jats:title><jats:p>The VRPTW problem presented in this paper is a real-life problem. The vehicle fleet owned by the factory cannot be transported between certain suppliers, which complicates the solution of the problem.<\/jats:p><\/jats:sec>","DOI":"10.1108\/ijicc-01-2022-0021","type":"journal-article","created":{"date-parts":[[2022,5,13]],"date-time":"2022-05-13T10:36:55Z","timestamp":1652438215000},"page":"121-138","source":"Crossref","is-referenced-by-count":14,"title":["Solving vehicle routing problem with time windows using metaheuristic approaches"],"prefix":"10.1108","volume":"16","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7410-2638","authenticated-orcid":false,"given":"Zeynep","family":"Ayd\u0131nalp","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Do\u011fan","family":"\u00d6zgen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"140","published-online":{"date-parts":[[2022,5,13]]},"reference":[{"key":"key2023030713412717700_ref001","first-page":"1","article-title":"A hybrid adaptive large neighbourhood search algorithm for the capacitated location routing problem","volume":"168","year":"2021","journal-title":"Expert Systems with Applications"},{"key":"key2023030713412717700_ref002","first-page":"334","article-title":"A robust optimisation approach for the milk run problem with time windows with inventory uncertainty: an auto industry supply chain case study","volume":"11","year":"2010","journal-title":"International Journal of Rapid Manufacturing"},{"key":"key2023030713412717700_ref003","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/j.omega.2017.05.002","article-title":"Multi-depot multi-compartment vehicle routing problem, solved by a hybrid adaptive large neighborhood search","volume":"76","year":"2018","journal-title":"Omega"},{"key":"key2023030713412717700_ref004","doi-asserted-by":"crossref","first-page":"2021","DOI":"10.1007\/s12351-019-00495-z","article-title":"Metaheuristic approaches to a vehicle scheduling problem in sugar beet transportation","volume":"21","year":"2021","journal-title":"Operational Research"},{"key":"key2023030713412717700_ref005","doi-asserted-by":"crossref","first-page":"725","DOI":"10.1007\/s40747-020-00234-4","article-title":"Solving fuzzy multi-objective shortest path problem based on data envelopment analysis approach","volume":"7","year":"2021","journal-title":"Complex Intelligent Systems"},{"key":"key2023030713412717700_ref006","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2022.108005","article-title":"A hybrid adaptive large neighborhood search and tabu search algorithm for the electric vehicle relocation problem","volume":"167","year":"2022","journal-title":"Computers and Industrial Engineering"},{"issue":"1","key":"key2023030713412717700_ref007","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1016\/j.ejor.2018.07.030","article-title":"Consistent vehicle routing problem with service level agreements: a case study in the pharmaceutical distribution sector","volume":"273","year":"2019","journal-title":"European Journal of Operational Research"},{"issue":"5","key":"key2023030713412717700_ref008","doi-asserted-by":"crossref","first-page":"3403","DOI":"10.1016\/j.aej.2021.08.058","article-title":"A novel ant colony algorithm for solving shortest path problems with fuzzy arc weights","volume":"61","year":"2022","journal-title":"Alexandria Engineering Journal"},{"key":"key2023030713412717700_ref009","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/BF00940812","article-title":"A thermodynamical approach to the traveling salesman problem: an efficient simulation algorithm","volume":"45","year":"1985","journal-title":"Journal of Optimization Theory and Applications"},{"key":"key2023030713412717700_ref010","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1016\/j.dam.2013.07.016","article-title":"Combined location and routing problems for drug distribution","volume":"165","year":"2014","journal-title":"Discrete Applied Mathematics"},{"issue":"3","key":"key2023030713412717700_ref011","first-page":"346","article-title":"An adaptive large neighborhood search heuristic for the pollution-routing problem","volume":"223","year":"2012","journal-title":"European Journal of Operational Research"},{"key":"key2023030713412717700_ref012","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1080\/21681015.2019.1585391","article-title":"An effective computational attempt for solving fully fuzzy linear programming using MOLP problem","year":"2019","journal-title":"Journal of Industrial and Production Engineering"},{"issue":"6","key":"key2023030713412717700_ref013","doi-asserted-by":"crossref","first-page":"1154","DOI":"10.1080\/18756891.2016.1256576","article-title":"An efficient computational approach for solving type-2 intuitionistic fuzzy numbers based Transportation Problems","volume":"9","year":"2016","journal-title":"International Journal of Computational Intelligence Systems"},{"issue":"3","key":"key2023030713412717700_ref014","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1142\/S0218488510006532","article-title":"Bounded linear programs with trapezoidal fuzzy nymbers","volume":"18","year":"2010","journal-title":"International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems"},{"issue":"2","key":"key2023030713412717700_ref015","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1504\/IJADS.2015.069610","article-title":"Particle swarm optimization algorithm for solving shortest path problems with mixed fuzzy arc weights","volume":"8","year":"2015","journal-title":"International Journal of Applied Decision\u00a0Sciences"},{"key":"key2023030713412717700_ref016","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1016\/j.measurement.2016.06.050","article-title":"A novel artificial bee colony algorithm for shortest path problems with fuzzy arc weights","volume":"93","year":"2016","journal-title":"Measurement"},{"key":"key2023030713412717700_ref017","doi-asserted-by":"crossref","first-page":"1527","DOI":"10.1007\/s40747-021-00278-0","article-title":"Modified artificial bee colony algorithm for solving mixed interval-valued fuzzy shortest path problem","volume":"7","year":"2021","journal-title":"Complex Intelligent Systems"},{"key":"key2023030713412717700_ref018","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1007\/s00500-021-06389-7","article-title":"Analytics under uncertainty: a novel method for solving linear programming problems with trapezoidal fuzzy variables","volume":"26","year":"2022","journal-title":"Soft Computing"},{"key":"key2023030713412717700_ref019","doi-asserted-by":"crossref","first-page":"1602","DOI":"10.1111\/itor.13044","article-title":"Bi-objective green vehicle routing problem","volume":"29","year":"2022","journal-title":"International Transactions in Operational Research"},{"key":"key2023030713412717700_ref020","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1007\/s11067-009-9099-6","article-title":"Modelization of time-dependent urban freight problems by using a multiple number of distribution centers","volume":"12","year":"2012","journal-title":"Networks and Spatial Economics"},{"key":"key2023030713412717700_ref021","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/j.matcom.2020.07.022","article-title":"A robust simulation-optimization approach for pre-disaster multi-period location\u2013allocation\u2013inventory planning","volume":"179","year":"2021","journal-title":"Mathematics and Computers in Simulation"},{"key":"key2023030713412717700_ref022","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1016\/j.cor.2016.01.018","article-title":"An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows and scheduled lines","volume":"72","year":"2016","journal-title":"Computers and Operational Research"},{"key":"key2023030713412717700_ref023","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2021.107389","article-title":"A set of efficient heuristics and meta-heuristics to solve a multi-objective pharmaceutical supply chain network","volume":"158","year":"2021","journal-title":"Computers and Industrial Engineering"},{"issue":"5","key":"key2023030713412717700_ref024","doi-asserted-by":"crossref","first-page":"648","DOI":"10.1016\/j.tre.2011.02.002","article-title":"The period vehicle routing problem: new heuristics and real-world variants","volume":"47","year":"2011","journal-title":"Transportation Research Part E: Logistics and Transportation Review"},{"issue":"12","key":"key2023030713412717700_ref025","doi-asserted-by":"crossref","first-page":"3215","DOI":"10.1016\/j.cor.2012.04.007","article-title":"An adaptive large neighborhood search heuristic for two-echelon vehicle routing problems arising in city logistics","volume":"39","year":"2012","journal-title":"Computers and Operations Research"},{"key":"key2023030713412717700_ref026","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10479-020-03900-5","article-title":"A robust optimization model for sustainable pharmaceutical distribution network design: a case study","year":"2021","journal-title":"Annals of Operations Research"},{"key":"key2023030713412717700_ref027","doi-asserted-by":"crossref","first-page":"757","DOI":"10.1007\/s11067-020-09500-x","article-title":"A blood bank network design problem with integrated facility location, inventory and routing decisions","volume":"20","year":"2020","journal-title":"Network and Spatial Economics"},{"key":"key2023030713412717700_ref028","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1126\/science.220.4598.671","article-title":"Optimization by simulated annealing","volume":"220","year":"1983","journal-title":"Science"},{"key":"key2023030713412717700_ref029","doi-asserted-by":"crossref","first-page":"162","DOI":"10.1016\/j.tre.2019.07.012","article-title":"Rich vehicle routing with auxiliary depots and anticipated deliveries: an application to pharmaceutical distribution","volume":"129","year":"2019","journal-title":"Transportation Research Part E: Logistics and Transportation Review"},{"key":"key2023030713412717700_ref030","first-page":"833","article-title":"A heuristic for vehicle fleet mix problem using tabu search and set partitioning","volume":"59","year":"2007","journal-title":"Journal of the Operational Research Society"},{"key":"key2023030713412717700_ref031","doi-asserted-by":"crossref","first-page":"250","DOI":"10.1016\/j.cor.2018.08.002","article-title":"An adaptive large neighborhood search heuristic for the vehicle routing problem with time windows and synchronized visits","volume":"101","year":"2019","journal-title":"Computers and Operations Research"},{"key":"key2023030713412717700_ref032","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1007\/s10100-006-0167-4","article-title":"Dynamic VRP in pharmaceutical distribution- a case study","volume":"14","year":"2006","journal-title":"Central European Journal of Operations Research"},{"key":"key2023030713412717700_ref033","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1016\/j.trc.2015.06.016","article-title":"A real-life multi depot multi period vehicle routing problem with a heterogeneous fleet: formulation and adaptive large neighborhood search based matheuristic","volume":"70","year":"2016","journal-title":"Transportation Research Part C"},{"key":"key2023030713412717700_ref034","doi-asserted-by":"crossref","first-page":"55","DOI":"10.5267\/j.ijiec.2010.01.005","article-title":"A particle swarm approach to solve vehicle routing problem with uncertain demand: a drug distribution case study","volume":"1","year":"2010","journal-title":"International Journal of Industrial Engineering Computations"},{"key":"key2023030713412717700_ref035","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/j.compchemeng.2015.06.008","article-title":"A robust possibilistic programming approach for pharmaceuticalsupply chain network design","volume":"82","year":"2015","journal-title":"Computers and Chemical Engineering"},{"issue":"3","key":"key2023030713412717700_ref036","first-page":"259","article-title":"Revised simplex method and its application for solving fuzzy linear programming problem","volume":"6","year":"2010","journal-title":"European Journal of Industrial Engineering"},{"issue":"2","key":"key2023030713412717700_ref037","doi-asserted-by":"crossref","first-page":"22","DOI":"10.4018\/joris.2011040102","article-title":"Sensitivity analysis on linear programming problems with trapezoidal fuzzy variables","volume":"2","year":"2011","journal-title":"International Journal of Operations Research and Information Systems"},{"issue":"1","key":"key2023030713412717700_ref038","doi-asserted-by":"crossref","first-page":"457","DOI":"10.32604\/iasc.2022.024264","article-title":"Sustainable waste collection vehicle routing problem for COVID-19","volume":"33","year":"2022","journal-title":"Intelligent Automation and Soft Computing"},{"key":"key2023030713412717700_ref039","doi-asserted-by":"publisher","DOI":"10.5829\/ije.2022.35.02b.12","article-title":"A neutrosophic fuzzy programming method to solve a multi-depot vehicle routing model under uncertainty during the covid-19 pandemic","year":"2021","journal-title":"International Journal of Engineering"},{"issue":"3","key":"key2023030713412717700_ref040","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1016\/0969-6016(94)90032-9","article-title":"Capacitated clustering problems by hybrid simulated annealing and tabu search","volume":"1","year":"1994","journal-title":"International Transactions in Operational Research"},{"issue":"1","key":"key2023030713412717700_ref041","doi-asserted-by":"crossref","first-page":"41","DOI":"10.30656\/jsmi.v4i1.2215","article-title":"Simulated annealing algorithm for solving the capacitated vehicle routing problem: a case study of pharmaceutical distribution","volume":"4","year":"2020","journal-title":"Jurnal Sistem dan Manajemen Industri"},{"key":"key2023030713412717700_ref042","doi-asserted-by":"crossref","first-page":"2403","DOI":"10.1016\/j.cor.2005.09.012","article-title":"A general heuristic for vehicle routing problems","volume":"34","year":"2007","journal-title":"Computers and Operations Research"},{"key":"key2023030713412717700_ref043","doi-asserted-by":"crossref","first-page":"5865","DOI":"10.1007\/s00500-018-3250-6","article-title":"Cargo theft weighted vehicle routing problem: modeling and application to the pharmaceutical distribution sector","volume":"23","year":"2019","journal-title":"Soft Computing"},{"issue":"4","key":"key2023030713412717700_ref044","first-page":"455","article-title":"An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows","volume":"40","year":"2005","journal-title":"Transportation Science"},{"key":"key2023030713412717700_ref045","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1016\/j.trc.2019.02.018","article-title":"An adaptive large neighborhood search metaheuristic for the vehicle routing problem with drones","volume":"102","year":"2019","journal-title":"Transportation Research Part C: Emerging Technologies"},{"issue":"Part B","key":"key2023030713412717700_ref046","first-page":"315","article-title":"The multi-depot vehicle routing problem with heterogeneous vehicle fleet: formulation and a variable neighborhood search implementation","volume":"52","year":"2014","journal-title":"Computers and Operations Research"},{"key":"key2023030713412717700_ref047","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s12063-020-00157-w","article-title":"Operations\/supply chain management in a new world context","volume":"13","year":"2020","journal-title":"Operations Management Research"},{"issue":"2","key":"key2023030713412717700_ref048","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1287\/opre.35.2.254","article-title":"Algorithms for the vehicle routing and scheduling problems with time window constraints","volume":"35","year":"1987","journal-title":"Operations Research"},{"key":"key2023030713412717700_ref049","doi-asserted-by":"crossref","first-page":"659","DOI":"10.1111\/coin.12258","article-title":"Elite artificial bees' colony algorithm to solve robot's fuzzy constrained routing problem","volume":"36","year":"2020","journal-title":"Computational Intelligence"},{"key":"key2023030713412717700_ref050","doi-asserted-by":"crossref","first-page":"1189","DOI":"10.1016\/S1570-7946(05)80040-9","article-title":"Global supply chain network optimisationoptimization for pharmaceuticals","volume":"20","year":"2005","journal-title":"Computer Aided Chemical Engineering"},{"key":"key2023030713412717700_ref051","volume-title":"Metaheuristics: From Design to Implementation","year":"2009"},{"issue":"3","key":"key2023030713412717700_ref052","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1016\/S0954-1810(01)00005-X","article-title":"Heuristic methods for vehicle routing problem with time windows","volume":"15","year":"2001","journal-title":"Artificial Intelligence in Engineering"},{"issue":"7","key":"key2023030713412717700_ref053","doi-asserted-by":"crossref","first-page":"1419","DOI":"10.1016\/j.cor.2011.08.013","article-title":"Development of a fuel consumption optimization model for the capacitated vehicle routing problem","volume":"39","year":"2012","journal-title":"Computers and Operations Research"},{"issue":"2","key":"key2023030713412717700_ref054","doi-asserted-by":"crossref","first-page":"288","DOI":"10.1016\/j.cie.2009.10.007","article-title":"A simulated annealing heuristic for the capacitated location routing problem","volume":"58","year":"2010","journal-title":"Computers and Industrial Engineering"},{"key":"key2023030713412717700_ref055","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/978-981-13-0451-4_10","article-title":"A simulated annealing heuristic for the heterogeneous fleet pollution routing problem","year":"2018","journal-title":"Environmental Sustainability in Asian Logistics and Supply Chains"},{"key":"key2023030713412717700_ref056","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1007\/s10479-020-03677-7","article-title":"A chance constrained fuzzy goal programming approach for perishable pharmaceutical supply chain network design","volume":"295","year":"2020","journal-title":"Annals of Operations Research"},{"key":"key2023030713412717700_ref057","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1016\/j.tre.2018.06.005","article-title":"Design and analysis of a satellite network with direct delivery in the pharmaceutical industry","volume":"116","year":"2018","journal-title":"Transportation Research Part E: Logistics and Transportation Review"}],"container-title":["International Journal of Intelligent Computing and Cybernetics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.emerald.com\/insight\/content\/doi\/10.1108\/IJICC-01-2022-0021\/full\/xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.emerald.com\/insight\/content\/doi\/10.1108\/IJICC-01-2022-0021\/full\/html","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,24]],"date-time":"2025-07-24T22:54:02Z","timestamp":1753397642000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.emerald.com\/ijicc\/article\/16\/1\/121-138\/121733"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,5,13]]},"references-count":57,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2022,5,13]]},"published-print":{"date-parts":[[2023,3,7]]}},"alternative-id":["10.1108\/IJICC-01-2022-0021"],"URL":"https:\/\/doi.org\/10.1108\/ijicc-01-2022-0021","relation":{},"ISSN":["1756-378X"],"issn-type":[{"value":"1756-378X","type":"print"}],"subject":[],"published":{"date-parts":[[2022,5,13]]}}}