{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,2]],"date-time":"2026-05-02T06:48:37Z","timestamp":1777704517792,"version":"3.51.4"},"reference-count":28,"publisher":"SAGE Publications","issue":"5","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IFS"],"published-print":{"date-parts":[[2021,4,22]]},"abstract":"<jats:p>This study designs a new variant of the capacitated vehicle routing problem (CVRP) under a fuzzy environment. In CVRP, several vehicles start their journey from a central depot to provide services to different cities and finally return to the depot. This paper introduces an additional time beyond the service time at each city to fulfill the pre-ordered demands. The need for this excess service time is to provide the services to new customers who are not enlisted at the start of the process. It is a market enhancement step. The proposed model\u2019s main objective is to find the maximum time-dependent profit by using the optimum number of vehicles in an appropriate route and spending optimum excess service time in each city. The model considers travel time and travel cost as fuzzy numbers. An expected value model (EVM) is formulated using the credibility approach on fuzzy variables. A hybrid meta-heuristic method combining a genetic algorithm (GA) and bacteria foraging optimization algorithm (BFOA) is designed to solve the proposed model. The proposed model is explained with the help of some numerical examples. Sensitivity analyses based on different independent parameters of the algorithms are also conducted.<\/jats:p>","DOI":"10.3233\/jifs-192134","type":"journal-article","created":{"date-parts":[[2021,3,19]],"date-time":"2021-03-19T13:24:18Z","timestamp":1616160258000},"page":"8709-8725","source":"Crossref","is-referenced-by-count":10,"title":["A hybrid GA-BFO algorithm for the profit-maximizing capacitated vehicle routing problem under uncertain paradigm"],"prefix":"10.1177","volume":"40","author":[{"given":"Partha Sarathi","family":"Barma","sequence":"first","affiliation":[{"name":"Department of Computer Science and Engineering, NSHM Knowledge Campus, Durgapur, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joydeep","family":"Dutta","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Engineering, NSHM Knowledge Campus, Durgapur, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anupam","family":"Mukherjee","sequence":"additional","affiliation":[{"name":"Department of Mathematics, National Institute of Technology Durgapur, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Samarjit","family":"Kar","sequence":"additional","affiliation":[{"name":"Department of Mathematics, National Institute of Technology Durgapur, India"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"179","reference":[{"key":"10.3233\/JIFS-192134_ref1","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1016\/j.cor.2013.11.014","article-title":"A knowledge-based evolutionary algorithm for the multi-objective vehicle routing problem with time windows","volume":"45","author":"Chiang","year":"2014","journal-title":"Computers & Operations Research"},{"issue":"3","key":"10.3233\/JIFS-192134_ref2","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1016\/0377-2217(92)90192-C","article-title":"The Vehicle Routing Problem: An Overview of Exact and Approximate Algorithms","volume":"59","author":"Laporte","year":"1992","journal-title":"European Journal of Operational Research"},{"key":"10.3233\/JIFS-192134_ref3","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1007\/BF02098286","article-title":"Dynamic vehicle routing: status and prospects","volume":"61","author":"Psaraftis","year":"1995","journal-title":"Annals of Operations Research"},{"key":"10.3233\/JIFS-192134_ref5","doi-asserted-by":"crossref","first-page":"5522","DOI":"10.1016\/S0377-2217(03)00238-8","article-title":"A tabu search heuristic algorithm for open vehicle routing problem","volume":"157","author":"Brandao","year":"2004","journal-title":"European Journal of Operational Research"},{"key":"10.3233\/JIFS-192134_ref6","first-page":"125","article-title":"A hybrid search method for the vehicle routing problem with time windows","volume":"180","author":"Oliveira","year":"2008","journal-title":"Annals of Operations Research"},{"issue":"5","key":"10.3233\/JIFS-192134_ref7","doi-asserted-by":"crossref","first-page":"683","DOI":"10.1016\/j.fss.2008.09.016","article-title":"Vehicle routing problem with fuzzy time windows","volume":"160","author":"Tang","year":"2009","journal-title":"Fuzzy Sets and Systems"},{"issue":"4","key":"10.3233\/JIFS-192134_ref8","doi-asserted-by":"crossref","first-page":"408","DOI":"10.1287\/trsc.1090.0301","article-title":"Fifty Years of Vehicle Routing","volume":"43","author":"Laporte","year":"2009","journal-title":"Transportation Science"},{"issue":"3","key":"10.3233\/JIFS-192134_ref9","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/0305-0548(95)O0026-P","article-title":"A tabu search heuristic for the multi-depot vehicle routing problem","volume":"23","author":"Renaud","year":"1996","journal-title":"Journal of Computers & Operations Research"},{"issue":"4","key":"10.3233\/JIFS-192134_ref10","doi-asserted-by":"crossref","first-page":"1118","DOI":"10.1016\/j.eswa.2013.07.107","article-title":"Survey of green vehicle routing problem: past and future trends","volume":"41","author":"Lin","year":"2013","journal-title":"Expert Systems with Applications"},{"key":"10.3233\/JIFS-192134_ref11","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/j.trd.2014.05.015","article-title":"Design and development of a hybrid artificial bee colony algorithm for the environmental vehicle routing problem","volume":"31","author":"Zhang","year":"2014","journal-title":"Transportation Research Part D: Transport and Environment"},{"issue":"3","key":"10.3233\/JIFS-192134_ref12","doi-asserted-by":"publisher","first-page":"704","DOI":"10.1016\/j.ejor.2015.04.009","article-title":"An ant colony system for responsive dynamic vehicle routing","volume":"245","author":"Schyns","year":"2015","journal-title":"European Journal of Operational Research"},{"key":"10.3233\/JIFS-192134_ref13","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1016\/j.trc.2015.01.010","article-title":"A dynamic closed-loop vehicle routing problem with uncertainty and incompatible goods","volume":"55","author":"Hu","year":"2015","journal-title":"Transportation Research Part C: Emerging Technologies"},{"key":"10.3233\/JIFS-192134_ref14","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1016\/j.asoc.2016.05.011","article-title":"A label based ant colony algorithm for heterogeneous vehicle routing with mixed backhaul","volume":"47","author":"Wu","year":"2016","journal-title":"Applied Soft Computing"},{"issue":"2","key":"10.3233\/JIFS-192134_ref15","doi-asserted-by":"publisher","first-page":"478","DOI":"10.1016\/j.ejor.2015.11.034","article-title":"Vehicle routing to minimize time-dependent emissions in urban areas","volume":"251","author":"Ehmke","year":"2016","journal-title":"European Journal of Operational Research"},{"key":"10.3233\/JIFS-192134_ref16","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1016\/j.ins.2017.02.011","article-title":"Multi-depot vehicle routing problem for hazardous materials transportation: A fuzzy bilevel programming","volume":"399","author":"Du","year":"2017","journal-title":"Information Sciences"},{"key":"10.3233\/JIFS-192134_ref17","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1016\/j.trb.2016.10.013","article-title":"Time-dependent vehicle routing problem with path flexibility","volume":"95","author":"Huang","year":"2017","journal-title":"Transportation Research Part B: Methodological"},{"key":"10.3233\/JIFS-192134_ref18","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/j.trb.2017.02.004","article-title":"The electric vehicle routing problem with nonlinear charging function","volume":"103","author":"Montoya","year":"2017","journal-title":"Transportation Research Part B: Methodological"},{"key":"10.3233\/JIFS-192134_ref19","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/j.cie.2017.05.004","article-title":"A multiple colonies artificial bee colony algorithm for a capacitated vehicle routing problem and re-routing strategies under time-dependent traffic congestion","volume":"109","author":"Ng","year":"2017","journal-title":"Computers & Industrial Engineering"},{"key":"10.3233\/JIFS-192134_ref20","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/j.tre.2018.03.004","article-title":"The time window assignment vehicle routing problem with product dependent deliveries","volume":"116","author":"Neves-Moreira","year":"2018","journal-title":"Transportation Research Part E: Logistics and Transportation Review"},{"key":"10.3233\/JIFS-192134_ref21","doi-asserted-by":"publisher","first-page":"896","DOI":"10.1016\/j.jclepro.2018.08.075","article-title":"Heterogeneous fixed fleet vehicle routing problem based on fuel and carbon emission","volume":"201","author":"Li","year":"2018","journal-title":"Journal of Cleaner Production"},{"issue":"3","key":"10.3233\/JIFS-192134_ref22","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1016\/S0165-0114(02)00098-2","article-title":"Nearest interval approximation of a fuzzy number","volume":"130","author":"Grzegorzewski","year":"2002","journal-title":"Fuzzy Sets and Systems"},{"key":"10.3233\/JIFS-192134_ref23","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1109\/TFUZZ.2002.800692","article-title":"Expected value of fuzzy variable and fuzzy expected value models","volume":"10","author":"Liu","year":"2002","journal-title":"IEEE Transactions on Fuzzy Systems"},{"issue":"8","key":"10.3233\/JIFS-192134_ref24","doi-asserted-by":"crossref","first-page":"1668","DOI":"10.1080\/00207721.2012.748944","article-title":"Multi-objective solid transportation problems with budget constraint in uncertain environment","volume":"45","author":"Kundu","journal-title":"International Journal of Systems Science"},{"key":"10.3233\/JIFS-192134_ref25","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1287\/mnsc.6.1.80","article-title":"The truck dispatching problem","volume":"6","author":"Dantzig","year":"1959","journal-title":"Management Science"},{"key":"10.3233\/JIFS-192134_ref26","doi-asserted-by":"crossref","first-page":"624","DOI":"10.1016\/j.cie.2011.11.028","article-title":"Credibility-based fuzzy mathematical programming model for green logistics design under uncertainty","volume":"62","author":"Pishvaee","year":"2012","journal-title":"Comput Ind Eng"},{"issue":"1","key":"10.3233\/JIFS-192134_ref28","first-page":"47","article-title":"Variant of partially mapped crossover for the Travelling Salesman problems","volume":"3","author":"Deep","year":"2012","journal-title":"International Journal of Combinatorial Optimization Problems and Informatics"},{"issue":"4","key":"10.3233\/JIFS-192134_ref29","doi-asserted-by":"crossref","first-page":"656","DOI":"10.1109\/21.286385","article-title":"Adaptive probabilities of crossover and mutation in genetic algorithms","volume":"24","author":"Srinivas","year":"1994","journal-title":"IEEE Transactions on Systems Man and Cybernetics"},{"key":"10.3233\/JIFS-192134_ref31","first-page":"76","article-title":"Improved BFO with adaptive chemotaxis step for global optimization","volume":"2011","author":"Niu","year":"2011","journal-title":"International Conference on Computational Intelligence and Security (CIS)"}],"container-title":["Journal of Intelligent &amp; Fuzzy Systems"],"original-title":[],"link":[{"URL":"https:\/\/content.iospress.com\/download?id=10.3233\/JIFS-192134","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T09:41:23Z","timestamp":1777455683000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/full\/10.3233\/JIFS-192134"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,4,22]]},"references-count":28,"journal-issue":{"issue":"5"},"URL":"https:\/\/doi.org\/10.3233\/jifs-192134","relation":{},"ISSN":["1064-1246","1875-8967"],"issn-type":[{"value":"1064-1246","type":"print"},{"value":"1875-8967","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,4,22]]}}}