{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,12]],"date-time":"2026-02-12T16:53:19Z","timestamp":1770915199450,"version":"3.50.1"},"reference-count":21,"publisher":"MDPI AG","issue":"1","license":[{"start":{"date-parts":[[2020,1,9]],"date-time":"2020-01-09T00:00:00Z","timestamp":1578528000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"Science and technology innovation and science quality promotion project, Zhejiang Science and Technology Association, China","award":["CTZB-F190605LWZ-SKX5"],"award-info":[{"award-number":["CTZB-F190605LWZ-SKX5"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information"],"abstract":"<jats:p>Since the actual factors in the instant distribution service scenario are not considered enough in the existing distribution route optimization, a route optimization model of the instant distribution system based on customer time satisfaction is proposed. The actual factors in instant distribution, such as the soft time window, the pay-to-order mechanism, the time for the merchant to prepare goods before delivery, and the deliveryman\u2019s order combining, were incorporated in the model. A multi-objective optimization framework based on the total cost function and time satisfaction of the customer was established. Dual-layer chromosome coding based on the deliveryman-to-node mapping and the access order was conducted, and the nondominated sorting genetic algorithm version II (NSGA-II) was used to solve the problem. According to the numerical results, when time satisfaction of the customer was considered in the instant distribution routing problem, the customer satisfaction increased effectively and the balance between customer satisfaction and delivery cost in the means of Pareto optimization were obtained, with a minor increase in the delivery cost, while the number of deliverymen slightly increased to meet the on-time delivery needs of customers.<\/jats:p>","DOI":"10.3390\/info11010036","type":"journal-article","created":{"date-parts":[[2020,1,10]],"date-time":"2020-01-10T04:06:51Z","timestamp":1578629211000},"page":"36","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Vehicle Routing Optimization of Instant Distribution Routing Based on Customer Satisfaction"],"prefix":"10.3390","volume":"11","author":[{"given":"Yan","family":"Zhang","sequence":"first","affiliation":[{"name":"School of Economics and Management, Beijing University of Posts and Telecommunications, Beijing 100876, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chunhui","family":"Yuan","sequence":"additional","affiliation":[{"name":"School of Economics and Management, Beijing University of Posts and Telecommunications, Beijing 100876, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9079-6887","authenticated-orcid":false,"given":"Jiang","family":"Wu","sequence":"additional","affiliation":[{"name":"School of Information Science and Technology, Zhejiang Sci-Tech University, Hangzhou 310018, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2020,1,9]]},"reference":[{"key":"ref_1","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":"Manag. Sci."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1023\/A:1018940026670","article-title":"An improved ant system algorithm for the vehicle routing problem","volume":"89","author":"Bullnheimer","year":"1999","journal-title":"Ann. Oper. Res."},{"key":"ref_3","first-page":"445","article-title":"A hybrid simulated annealing for capacitated vehicle routing Problems with the independent route length","volume":"176","author":"Tavakkol","year":"2006","journal-title":"Appl. Math. Comput."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"1161","DOI":"10.1016\/j.jclepro.2019.03.185","article-title":"An improved ant colony optimization algorithm for the multi-depot green vehicle routing problem with multiple objectives","volume":"227","author":"Li","year":"2019","journal-title":"J. Clean. Prod."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1287\/trsc.2016.0705","article-title":"The Time Window Assignment Vehicle Routing Problem with Time-Dependent Travel Times","volume":"52","author":"Spliet","year":"2017","journal-title":"Trans. Sci."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"214","DOI":"10.1016\/j.cor.2012.06.008","article-title":"Vehicle routing problem with stochastic travel times including soft time windows and service costs","volume":"40","author":"Tas","year":"2013","journal-title":"Comput. Oper. Res."},{"key":"ref_7","doi-asserted-by":"crossref","unstructured":"Bouchra, B., Btissam, D., and Mohammad, C. (2018, January 4\u20135). Multiobjective Local Search Based Hybrid Algorithm for Vehicle Routing Problem with Soft Time Windows. Proceedings of the 2018 International Conference on Big Data, Cloud and Applications, Kenitra, Morocco.","DOI":"10.1007\/978-3-319-96292-4_25"},{"key":"ref_8","doi-asserted-by":"crossref","unstructured":"Chen, J., Gui, P., Ding, T., Na, S., and Zhou, Y. (2019). Optimization of Transportation Routing Problem for Fresh Food by Improved Ant Colony Algorithm Based on Tabu Search. Sustainability, 23.","DOI":"10.3390\/su11236584"},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"1024","DOI":"10.1108\/IMDS-09-2015-0389","article-title":"A customer satisfaction evaluation model for logistics services using fuzzy analytic hierarchy process","volume":"116","author":"Lan","year":"2016","journal-title":"Ind. Manag. Data. Syst."},{"key":"ref_10","unstructured":"Qianwen, F., Qingguo, W., and Xiang, H. (2017, January 5\u20137). Evaluation of O2O Takeout Distribution System Based on Fuzzy Comprehensive Evaluation Method. Proceedings of the 2017 International Conference on Innovation and Management (ICIM 2017), Swansea, UK."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1016\/j.eswa.2016.07.022","article-title":"The vehicle routing problem with hard time windows and stochastic travel and service time","volume":"64","author":"Miranda","year":"2016","journal-title":"Expert. Syst. Appl."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"140","DOI":"10.1016\/j.dam.2016.05.030","article-title":"A heuristic for cumulative vehicle routing using column generation","volume":"228","author":"Daya","year":"2017","journal-title":"Discret. Appl. Math."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1016\/j.asoc.2018.05.026","article-title":"Algorithms for the multi-objective vehicle routing problem with hard time windows and stochastic travel time and service time","volume":"70","author":"Miranda","year":"2018","journal-title":"Appl. Soft Comput."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"1248","DOI":"10.1177\/0954405415586608","article-title":"Multi-objective vehicle routing problem with time windows: Improving cu stomer satisfaction by considering gap time","volume":"231","author":"Sivaramkumar","year":"2017","journal-title":"J. Eng. Manuf."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/j.cor.2014.07.005","article-title":"A Vehicle Routing Problem with Flexible Time Windows","volume":"52","author":"Tas","year":"2014","journal-title":"Comput. Oper. Res."},{"key":"ref_16","unstructured":"Salani, M., Battarra, M., and Gambardella, L.M. (2014, January 2\u20135). Exact Algorithms for the Vehicle Routing Problem with Soft Time Windows. Proceedings of the 2014 Operations Research Proceedings, Aachen, Germany."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1002\/(SICI)1097-0037(199709)30:2<105::AID-NET5>3.0.CO;2-G","article-title":"A tabu search heuristic for periodic and multi-depot vehicle routing problems","volume":"30","author":"Cordeau","year":"2015","journal-title":"Networks"},{"key":"ref_18","unstructured":"Sabrina, O., Mohamed, S.H., Andrea, R., Marco, D., and Thomas, S. (2017, January 5\u20138). Analysis of the population-based ant Colony Optimization algorithm for the TSP and the QAP. Proceedings of the 2017 IEEE Congress on Evolutionary Computation, Donostia, San Sebastian, Spain."},{"key":"ref_19","first-page":"1626","article-title":"Solving TDVRP based on parallel-simulated annealing algorithm","volume":"21","author":"Mu","year":"2015","journal-title":"Comput. Integr. Manuf. Syst."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1109\/4235.996017","article-title":"A fast and elitist multi-objective genetic algorithm: NSGA-II","volume":"6","author":"Deb","year":"2002","journal-title":"IEEE Trans. Evol. Comput"},{"key":"ref_21","first-page":"176","article-title":"Multi-objective Vehicle Routing Problem with Hard Time Windows Based on Hybrid NSGA-II","volume":"14","author":"Wu","year":"2014","journal-title":"J. Transp. Syst. Eng. Inform. Technol."}],"container-title":["Information"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2078-2489\/11\/1\/36\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,13]],"date-time":"2025-10-13T13:42:37Z","timestamp":1760362957000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2078-2489\/11\/1\/36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,1,9]]},"references-count":21,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2020,1]]}},"alternative-id":["info11010036"],"URL":"https:\/\/doi.org\/10.3390\/info11010036","relation":{},"ISSN":["2078-2489"],"issn-type":[{"value":"2078-2489","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,1,9]]}}}