{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,21]],"date-time":"2026-04-21T22:44:37Z","timestamp":1776811477338,"version":"3.51.2"},"reference-count":7,"publisher":"European Society of Computational Methods in Sciences and Engineering","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["JCM"],"published-print":{"date-parts":[[2021,8,2]]},"abstract":"<jats:p>With the rapid development of the logistics industry, the demand of customer become higher and higher. The timeliness of distribution becomes one of the important factors that directly affect the profit and customer satisfaction of the enterprise. If the distribution route is planned rationally, the cost can be greatly reduced and the customer satisfaction can be improved. Aiming at the routing problem of A company\u2019s vehicle distribution link, we establish mathematical models based on theory and practice. According to the characteristics of the model, genetic algorithm is selected as the algorithm of path optimization. At the same time, we simulate the actual situation of a company, and use genetic algorithm to plan the calculus. By contrast, the genetic algorithm suitable for solving complex optimization problems, the practicability of genetic algorithm in this design is highlighted. It solves the problem of unreasonable transportation of A company, so as to get faster efficiency and lower cost.<\/jats:p>","DOI":"10.3233\/jcm-215185","type":"journal-article","created":{"date-parts":[[2021,6,15]],"date-time":"2021-06-15T14:00:23Z","timestamp":1623765623000},"page":"775-785","source":"Crossref","is-referenced-by-count":1,"title":["Enterprise distribution routing optimization with soft time windows based on genetic algorithm"],"prefix":"10.66113","volume":"21","author":[{"given":"Kaixian","family":"Gao","sequence":"first","affiliation":[{"name":"Maritime College, Guangdong Ocean University, Zhanjiang, Guangdong 524088, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guohua","family":"Yang","sequence":"additional","affiliation":[{"name":"Maritime College, Guangdong Ocean University, Zhanjiang, Guangdong 524088, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaobo","family":"Sun","sequence":"additional","affiliation":[{"name":"College of Business, Jiaxing University, Jiaxing, Zhejiang 314001, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"55691","reference":[{"issue":"2","key":"10.3233\/JCM-215185_ref2","first-page":"74","article-title":"Research on model and tabu search algorithm of one-way vehicle scheduling problem in multiple distribution centers","volume":"8","author":"Wang","year":"2008","journal-title":"Logistics Technology"},{"issue":"1","key":"10.3233\/JCM-215185_ref3","doi-asserted-by":"crossref","first-page":"167","DOI":"10.21042\/AMNS.2018.1.00013","article-title":"A new computational algorithm for the solution of second order initial value problems in ordinary differential equations","volume":"3","author":"Pandey","year":"2018","journal-title":"Applied Mathematics and Nonlinear Sciences"},{"issue":"1","key":"10.3233\/JCM-215185_ref8","first-page":"51","article-title":"Development of a solution technique for the facility location and step-fixed charge solid transportation problem","volume":"9","author":"Oyewole","year":"2020","journal-title":"Advances in Industrial Engineering and Management"},{"issue":"1","key":"10.3233\/JCM-215185_ref11","first-page":"7","article-title":"Prediction of ultimate capacities of bored pile based on routine load tests and static analysis (case study)","volume":"8","author":"Hafez","year":"2019","journal-title":"Advances in Industrial Engineering and Management"},{"issue":"2","key":"10.3233\/JCM-215185_ref12","first-page":"25","article-title":"Research on vehicle routing problem based on new genetic algorithm","volume":"4","author":"Zhang","year":"2012","journal-title":"Journal of Hubei University"},{"issue":"1","key":"10.3233\/JCM-215185_ref13","first-page":"30","article-title":"An algorithm for designing freight distribution routes with time windows","volume":"3","author":"Yang","year":"2003","journal-title":"Journal of Transportation Engineering and Information Technology"},{"issue":"1","key":"10.3233\/JCM-215185_ref14","doi-asserted-by":"crossref","first-page":"1","DOI":"10.2478\/amns.2020.1.00001","article-title":"Improvement of the fast clustering algorithm improved by k-means in the big data","volume":"5","author":"Xie","year":"2020","journal-title":"Applied Mathematics and Nonlinear Sciences"}],"container-title":["Journal of Computational Methods in Sciences and Engineering"],"original-title":[],"link":[{"URL":"https:\/\/content.iospress.com\/download?id=10.3233\/JCM-215185","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,21]],"date-time":"2026-04-21T22:06:21Z","timestamp":1776809181000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/full\/10.3233\/JCM-215185"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,8,2]]},"references-count":7,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.3233\/jcm-215185","relation":{},"ISSN":["1472-7978","1875-8983"],"issn-type":[{"value":"1472-7978","type":"print"},{"value":"1875-8983","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,8,2]]}}}