{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T14:04:21Z","timestamp":1768313061903,"version":"3.49.0"},"reference-count":42,"publisher":"MDPI AG","issue":"11","license":[{"start":{"date-parts":[[2018,11,19]],"date-time":"2018-11-19T00:00:00Z","timestamp":1542585600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100004663","name":"Ministry of Science and Technology, Taiwan","doi-asserted-by":"publisher","award":["105-2410-H-167-006-MY2"],"award-info":[{"award-number":["105-2410-H-167-006-MY2"]}],"id":[{"id":"10.13039\/501100004663","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Symmetry"],"abstract":"<jats:p>The vehicle routing problem (VRP) is a challenging combinatorial optimization problem. This research focuses on the problem under which a manufacturer needs to outsource materials from other suppliers and to ship the materials back to the company. Heterogeneous vehicles are available to ship the materials, and each vehicle has a limited loading capacity and a limited travelling distance. The purpose of this research is to study a multiple vehicle routing problem (MVRP) with soft time window and heterogeneous vehicles. Two models, using mixed integer programming (MIP) and genetic algorithm (GA), are developed to solve the problem. The MIP model is first constructed to minimize the total transportation cost, which includes the assignment cost, travelling cost, and the tardiness cost, for the manufacturer. The optimal solution can present multiple vehicle routing and the loading size of each vehicle in each period. The GA is next applied to solve the problem so that a near-optimal solution can be obtained when the problem is too difficult to be solved using the MIP. A case of a food manufacturing company is used to examine the practicality of the proposed MIP model and the GA model. The results show that the MIP model can obtain the optimal solution under a short computational time when the scale of the problem is small. When the problem becomes non-deterministic polynomial hard (NP-hard), the MIP model cannot find the optimal solution. On the other hand, the GA model can obtain a near-optimal solution within a reasonable amount of computational time. This paper is related to several important topics of the Symmetry journal in the areas of mathematics and computer science theory and methods. In the area of mathematics, the theories of linear and non-linear algebraic structures and information technology are adopted. In the area of computer science, theory and methods, and metaheuristics are applied.<\/jats:p>","DOI":"10.3390\/sym10110650","type":"journal-article","created":{"date-parts":[[2018,11,23]],"date-time":"2018-11-23T03:41:31Z","timestamp":1542944491000},"page":"650","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":23,"title":["An Enhanced Approach for the Multiple Vehicle Routing Problem with Heterogeneous Vehicles and a Soft Time Window"],"prefix":"10.3390","volume":"10","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6799-0860","authenticated-orcid":false,"given":"He-Yau","family":"Kang","sequence":"first","affiliation":[{"name":"Department of Industrial Engineering and Management, National Chin-Yi University of Technology, Taichung 411, Taiwan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Amy H. I.","family":"Lee","sequence":"additional","affiliation":[{"name":"Department of Technology Management, Chung Hua University, Hsinchu 300, Taiwan"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2018,11,19]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"286","DOI":"10.1016\/j.cie.2013.01.007","article-title":"A Hybrid Metaheuristic for Multi-objective Vehicle Routing Problems with Time Windows","volume":"65","author":"Ortega","year":"2013","journal-title":"Comput. Ind. Eng."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/j.cie.2015.09.002","article-title":"Site Dependent Vehicle Routing Problem with Soft Time Window: Modeling and Solution Approach","volume":"90","author":"Mirmohammadi","year":"2015","journal-title":"Comput. Ind. Eng."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"793","DOI":"10.1007\/s00170-014-6141-8","article-title":"A Mathematical Model and a Solving Procedure for Multi-depot Vehicle Routing Problem with Fuzzy Time Window and Heterogeneous Vehicle","volume":"75","author":"Adelzadeh","year":"2014","journal-title":"Int. J. Adv. Manuf. Technol."},{"key":"ref_4","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_5","doi-asserted-by":"crossref","first-page":"21610","DOI":"10.1007\/s11356-017-9740-8","article-title":"Model and Algorithm for Bi-fuel Vehicle Routing Problem to Reduce GHG Emissions","volume":"24","author":"Abdoli","year":"2017","journal-title":"Environ. Sci. Pollut. Res."},{"key":"ref_6","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_7","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":"Transp. Sci."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ejor.2012.08.015","article-title":"A Review of Dynamic Vehicle Routing Problems","volume":"225","author":"Pillac","year":"2013","journal-title":"Eur. J. Oper. Res."},{"key":"ref_9","doi-asserted-by":"crossref","unstructured":"Toth, P., and Vigo, D. (2014). Vehicle Routing: Problems, Methods, and Applications, Society for Industrial and Applied Mathematics. [2nd ed.].","DOI":"10.1137\/1.9781611973594"},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1016\/j.tre.2016.03.017","article-title":"Integrated inventory-transportation model by synchronizing delivery and production cycles","volume":"91","author":"Lee","year":"2016","journal-title":"Transp. Res. Part E Logist. Transp. Rev."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1007\/s10489-006-6926-z","article-title":"Multi-Objective Genetic Algorithms for Vehicle Routing Problem with Time Windows","volume":"24","author":"Ombuki","year":"2006","journal-title":"Appl. Intell."},{"key":"ref_12","doi-asserted-by":"crossref","unstructured":"Michalewicz, Z. (1996). Genetic Algorithm + Data Structures = Evolution Programs, Springer.","DOI":"10.1007\/978-3-662-03315-9"},{"key":"ref_13","unstructured":"Goldberg, D.E. (1989). Genetic Algorithms in Search, Optimization and Machine Learning, Addison-Wesley."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"1178","DOI":"10.1007\/s00170-004-2306-1","article-title":"Genetic Algorithm and Hopfield Neural Network for a Dynamic Lot Sizing Problem","volume":"27","author":"Megala","year":"2006","journal-title":"Int. J. Adv. Manuf. Technol."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"489","DOI":"10.1007\/s00500-014-1269-x","article-title":"Genetic algorithm with ensemble of immigrant strategies for multicast routing in Ad hoc networks","volume":"19","author":"Karthikeyan","year":"2015","journal-title":"Soft Comput."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"1415","DOI":"10.1007\/s00500-015-1595-7","article-title":"An Enhanced Model for the Integrated Production and Transportation Problem in a Multiple Vehicles Environment","volume":"20","author":"Kang","year":"2016","journal-title":"Soft Comput."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1016\/j.trb.2004.11.004","article-title":"A shortest path approach to the multiple-vehicle routing problem with split pick-ups","volume":"40","author":"Lee","year":"2006","journal-title":"Transp. Res. Part B Methodol."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1177\/1687814015618631","article-title":"Stochastic Time-dependent Vehicle Routing Problem: Mathematical Models and Ant Colony Algorithm","volume":"7","author":"Duan","year":"2015","journal-title":"Adv. Mech. Eng."},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"579","DOI":"10.1080\/00207543.2015.1057625","article-title":"A Mathematical Model for Vehicle Routing Problem under Endogenous Uncertainty","volume":"54","author":"MirHassani","year":"2016","journal-title":"Int. J. Prod. Res."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"449","DOI":"10.1080\/0305215X.2016.1188092","article-title":"A Capacitated Vehicle Routing Problem with Order Available Time in E-commerce Industry","volume":"49","author":"Liu","year":"2017","journal-title":"Eng. Optim."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"1233","DOI":"10.1111\/itor.12403","article-title":"Heuristics for Tactical Time Slot Management: A Periodic Vehicle Routing Problem View","volume":"24","author":"Hernandez","year":"2017","journal-title":"Int. Trans. Oper. Res."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"1100","DOI":"10.1080\/00207543.2016.1220685","article-title":"Modelling and Solution of a Large-scale Vehicle Routing Problem at GE Appliances and Lighting","volume":"55","author":"Khodabandeh","year":"2017","journal-title":"Int. J. Prod. Res."},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1002\/net.3230110205","article-title":"A Generalized Assignment Heuristic for Vehicle Routing","volume":"11","author":"Fisher","year":"1981","journal-title":"Networks"},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"290","DOI":"10.1016\/j.cor.2017.06.021","article-title":"A Combined Multistart Random Constructive Heuristic and Set Partitioning Based Formulation for the Vehicle Routing Problem with Time Dependent Travel Times","volume":"88","author":"Mancini","year":"2017","journal-title":"Comput. Oper. Res."},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"382","DOI":"10.1016\/j.cie.2017.09.034","article-title":"An Adaptive Hybrid Algorithm for Vehicle Routing Problems with Time Windows","volume":"113","author":"Yassen","year":"2017","journal-title":"Comput. Ind. Eng."},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1016\/j.cor.2017.06.023","article-title":"A Simulation Based Restricted Dynamic Programming Approach for the Green Time Dependent Vehicle Routing Problem","volume":"88","author":"Soysal","year":"2017","journal-title":"Comput. Oper. Res."},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"49","DOI":"10.3233\/JIFS-151050","article-title":"A robust approach to multiple vehicle location-routing problems with time windows for optimization of cross-docking under uncertainty","volume":"32","author":"Mousavi","year":"2017","journal-title":"J. Intell. Fuzzy Syst."},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1016\/j.ijpe.2013.12.028","article-title":"Two-echelon multiple-vehicle location\u2013routing problem with time windows for optimization of sustainable supply chain network of perishable food","volume":"152","author":"Govindan","year":"2014","journal-title":"Int. J. Prod. Econ."},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/j.cor.2016.03.013","article-title":"Mathematical Models for Green Vehicle Routing Problems with Pickup and Delivery: A Case of Semiconductor Supply Chain","volume":"89","author":"Madankumar","year":"2018","journal-title":"Comput. Oper. Res."},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"140","DOI":"10.1016\/j.cor.2017.08.015","article-title":"A Branch-and-cut Algorithm for the Time Window Assignment Vehicle Routing Problem","volume":"89","author":"Dalmeijer","year":"2018","journal-title":"Comput. Oper. Res."},{"key":"ref_31","doi-asserted-by":"crossref","unstructured":"Xu, H., Pu, P., and Duan, F. (2018). Dynamic Vehicle Routing Problems with Enhanced Ant Colony Optimization. Discrete Dyn. Nat. Soc.","DOI":"10.1155\/2018\/1295485"},{"key":"ref_32","doi-asserted-by":"crossref","first-page":"787","DOI":"10.1016\/S0305-0548(02)00051-5","article-title":"A Genetic Algorithm for the Vehicle Routing Problem","volume":"30","author":"Baker","year":"2003","journal-title":"Comput. Oper. Res."},{"key":"ref_33","doi-asserted-by":"crossref","first-page":"1561","DOI":"10.1016\/j.cor.2005.07.025","article-title":"A Genetic and Set Partitioning Two-phase Approach for the Vehicle Routing Problem with Time Windows","volume":"34","author":"Alvarenga","year":"2007","journal-title":"Comput. Oper. Res."},{"key":"ref_34","doi-asserted-by":"crossref","first-page":"611","DOI":"10.1287\/opre.1120.1048","article-title":"A Hybrid Genetic Algorithm for Multidepot and Periodic Vehicle Routing Problems","volume":"60","author":"Vidal","year":"2012","journal-title":"Oper. Res."},{"key":"ref_35","doi-asserted-by":"crossref","first-page":"475","DOI":"10.1016\/j.cor.2012.07.018","article-title":"A Hybrid Genetic Algorithm with Adaptive Diversity Management for a Large Class of Vehicle Routing Problems with Time-windows","volume":"40","author":"Vidal","year":"2013","journal-title":"Comput. Oper. Res."},{"key":"ref_36","doi-asserted-by":"crossref","first-page":"1450","DOI":"10.1016\/j.jclepro.2016.11.115","article-title":"A Genetic Algorithm with Exact Dynamic Programming for the Green Vehicle Routing & Scheduling Problem","volume":"167","author":"Xiao","year":"2017","journal-title":"J. Clean Prod."},{"key":"ref_37","doi-asserted-by":"crossref","first-page":"4733","DOI":"10.1016\/j.apm.2012.09.056","article-title":"An Integrated Model for Lot Sizing with Supplier Selection and Quantity Discounts","volume":"37","author":"Lee","year":"2013","journal-title":"Appl. Math. Model."},{"key":"ref_38","doi-asserted-by":"crossref","first-page":"2385","DOI":"10.1007\/s00500-013-1212-6","article-title":"Fitness Distance Analysis for Parallel Genetic Algorithm in the Test Task Scheduling Problem","volume":"18","author":"Lu","year":"2014","journal-title":"Soft Comput."},{"key":"ref_39","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/0305-0548(93)E0024-N","article-title":"Genetic Algorithm Crossover Operators for Ordering Applications","volume":"22","author":"Poon","year":"1995","journal-title":"Comput. Oper. Res."},{"key":"ref_40","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1016\/0167-6911(94)90028-0","article-title":"Best-so-far vs. Where-you-are: Implications for Optimal Finite-time Annealing","volume":"22","author":"Boese","year":"1994","journal-title":"Syst. Control. Lett."},{"key":"ref_41","unstructured":"LINGO System Inc. (2006). LINGO User\u2019s Manual, LINGO System Inc.. version 10."},{"key":"ref_42","unstructured":"The MathWorks, Inc. (2015). MATLAB User\u2019s Manual, The MathWorks, Inc.. version 8.6."}],"container-title":["Symmetry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2073-8994\/10\/11\/650\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T15:30:33Z","timestamp":1760196633000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2073-8994\/10\/11\/650"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,11,19]]},"references-count":42,"journal-issue":{"issue":"11","published-online":{"date-parts":[[2018,11]]}},"alternative-id":["sym10110650"],"URL":"https:\/\/doi.org\/10.3390\/sym10110650","relation":{},"ISSN":["2073-8994"],"issn-type":[{"value":"2073-8994","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,11,19]]}}}