{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,3]],"date-time":"2026-03-03T20:50:13Z","timestamp":1772571013235,"version":"3.50.1"},"reference-count":51,"publisher":"MDPI AG","issue":"3","license":[{"start":{"date-parts":[[2022,3,9]],"date-time":"2022-03-09T00:00:00Z","timestamp":1646784000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/100018657","name":"FPT University","doi-asserted-by":"publisher","award":["Q\u01101097\/Q\u0110-\u0110HFPT, Q\u0110 1393\/Q\u0110-\u0110HFPT"],"award-info":[{"award-number":["Q\u01101097\/Q\u0110-\u0110HFPT, Q\u0110 1393\/Q\u0110-\u0110HFPT"]}],"id":[{"id":"10.13039\/100018657","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Entropy"],"abstract":"<jats:p>The Vehicle Routing Problem (VRP) and its variants are found in many fields, especially logistics. In this study, we introduced an adaptive method to a complex VRP. It combines multi-objective optimization and several forms of VRPs with practical requirements for an urban shipment system. The optimizer needs to consider terrain and traffic conditions. The proposed model also considers customers\u2019 expectations and shipper considerations as goals, and a common goal such as transportation cost. We offered compromise programming to approach the multi-objective problem by decomposing the original multi-objective problem into a minimized distance-based problem. We designed a hybrid version of the genetic algorithm with the local search algorithm to solve the proposed problem. We evaluated the effectiveness of the proposed algorithm with the Tabu Search algorithm and the original genetic algorithm on the tested dataset. The results show that our method is an effective decision-making tool for the multi-objective VRP and an effective solver for the new variation of VRP.<\/jats:p>","DOI":"10.3390\/e24030388","type":"journal-article","created":{"date-parts":[[2022,3,9]],"date-time":"2022-03-09T11:30:38Z","timestamp":1646825438000},"page":"388","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Metaheuristic Algorithms Based on Compromise Programming for the Multi-Objective Urban Shipment Problem"],"prefix":"10.3390","volume":"24","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4098-3147","authenticated-orcid":false,"given":"Tung Son","family":"Ngo","sequence":"first","affiliation":[{"name":"Department of Computer and Information Sciences, Universiti Teknologi PETRONAS, Seri Iskandar 32610, Malaysia"},{"name":"Information and Communication Department, FPT University, Hanoi 10000, Vietnam"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jafreezal","family":"Jaafar","sequence":"additional","affiliation":[{"name":"Department of Computer and Information Sciences, Universiti Teknologi PETRONAS, Seri Iskandar 32610, Malaysia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2654-4463","authenticated-orcid":false,"given":"Izzatdin Abdul","family":"Aziz","sequence":"additional","affiliation":[{"name":"Department of Computer and Information Sciences, Universiti Teknologi PETRONAS, Seri Iskandar 32610, Malaysia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9649-7757","authenticated-orcid":false,"given":"Muhammad Umar","family":"Aftab","sequence":"additional","affiliation":[{"name":"Department of Computer Science, National University of Computer and Emerging Sciences, Chiniot-Faisalabad Campus, Chiniot 35400, Pakistan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hoang Giang","family":"Nguyen","sequence":"additional","affiliation":[{"name":"Information and Communication Department, FPT University, Hanoi 10000, Vietnam"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3532-9434","authenticated-orcid":false,"given":"Ngoc Anh","family":"Bui","sequence":"additional","affiliation":[{"name":"Information and Communication Department, FPT University, Hanoi 10000, Vietnam"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2022,3,9]]},"reference":[{"key":"ref_1","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_2","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/s10288-020-00433-2","article-title":"Vehicle routing problems over time: A survey","volume":"18","author":"Mor","year":"2020","journal-title":"4OR"},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1007\/s40092-017-0187-9","article-title":"A novel heuristic algorithm for capacitated vehicle routing problem","volume":"13","author":"Yazgan","year":"2017","journal-title":"J. Ind. Eng. Int."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"513","DOI":"10.1016\/j.cor.2016.02.009","article-title":"An integration of Lagrangian split and VNS: The case of the capacitated vehicle routing problem","volume":"78","author":"Bouzid","year":"2017","journal-title":"Comput. Oper. Res."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1016\/j.tre.2015.12.001","article-title":"A tabu search heuristic for the heterogeneous vehicle routing problem on a multigraph","volume":"86","author":"Lai","year":"2016","journal-title":"Transp. Res. Part E Logist. Transp. Rev."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/j.asoc.2016.12.027","article-title":"A simulated annealing heuristic for the hybrid vehicle routing problem","volume":"53","author":"Yu","year":"2017","journal-title":"Appl. Soft Comput."},{"key":"ref_7","unstructured":"Gil-Lafuente, A., Merig\u00f3, J., Dass, B., and Verma, R. (2018). Multi-capacity, Multi-depot, Multi-product VRP with Heterogeneous Fleets and Demand Exceeding Depot Capacity. Applied Mathematics and Computational Intelligence, Springer. FIM 2015; Advances in Intelligent Systems and Computing."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/j.cie.2014.10.029","article-title":"A literature review on the vehicle routing problem with multiple depots","volume":"79","author":"Franco","year":"2015","journal-title":"Comput. Ind. Eng."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"101866","DOI":"10.1016\/j.tre.2020.101866","article-title":"Multi-depot multi-trip vehicle routing problem with time windows and release dates","volume":"135","author":"Zhen","year":"2020","journal-title":"Transp. Res. Part E Logist. Transp. Rev."},{"key":"ref_10","first-page":"4","article-title":"Developing an applied algorithm for multi-trip vehicle routing problem with time windows in urban waste collection: A case study","volume":"37","author":"Tirkolaee","year":"2019","journal-title":"Waste Manag. Res. J. Sustain. Circ. Econ."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1007\/s10288-016-0306-2","article-title":"Vehicle routing problems with multiple trips","volume":"14","author":"Cattaruzza","year":"2016","journal-title":"4OR"},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"1279","DOI":"10.1080\/0305215X.2019.1642880","article-title":"Multi-trip vehicle routing problem with order release time","volume":"52","author":"Li","year":"2020","journal-title":"Eng. Optim."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"042024","DOI":"10.1088\/1757-899X\/452\/4\/042024","article-title":"A Survey for Vehicle Routing Problems and Its Derivatives","volume":"452","author":"Han","year":"2018","journal-title":"IOP Conf. Ser. Mater. Sci. Eng."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1016\/j.ejor.2020.09.022","article-title":"Multi-trip time-dependent vehicle routing problem with time windows","volume":"291","author":"Pan","year":"2021","journal-title":"Eur. J. Oper. Res."},{"key":"ref_15","unstructured":"Xu, J., Hajiyev, A., Nickel, S., and Gen, M. (2017). An Improved ACO for the Multi-depot Vehicle Routing Problem with Time Windows. Proceedings of the Tenth International Conference on Management Science and Engineering Management; Advances in Intelligent Systems and Computing, Springer."},{"key":"ref_16","doi-asserted-by":"crossref","unstructured":"Zhang, W., Gajpal, Y., Appadoo, S.S., and Wei, Q. (2020). Multi-Depot Green Vehicle Routing Problem to Minimize Carbon Emissions. Sustainability, 12.","DOI":"10.3390\/su12083500"},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"113846","DOI":"10.1016\/j.eswa.2020.113846","article-title":"The multi-depot open location routing problem with a heterogeneous fixed fleet","volume":"165","author":"Padilla","year":"2021","journal-title":"Expert Syst. Appl."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"705","DOI":"10.1287\/ijoc.2017.0756","article-title":"The Vehicle Routing Problem with Release and Due Dates","volume":"29","author":"Shelbourne","year":"2017","journal-title":"INFORMS J. Comput."},{"key":"ref_19","first-page":"359","article-title":"Multi-objective optimization of production scheduling with evolutionary computation: A review","volume":"11","author":"Ojstersek","year":"2020","journal-title":"Int. J. Ind. Eng. Comput."},{"key":"ref_20","doi-asserted-by":"crossref","unstructured":"Dutta, J., Barma, P.S., Mukherjee, A., Kar, S., De, T., Pamu\u010dar, D., \u0160ukevi\u010dius, \u0160ar\u016bnas, and Garbin\u010dius, G. (2021). Multi-objective green mixed vehicle routing problem under rough environment. Transport, 1\u201313.","DOI":"10.3846\/transport.2021.14464"},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"769","DOI":"10.1016\/j.ifacol.2016.07.867","article-title":"Robust Routes for the Fuzzy Multi-objective Vehicle Routing Problem","volume":"49","author":"Bahri","year":"2016","journal-title":"IFAC-PapersOnLine"},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"1502242","DOI":"10.1080\/23311916.2018.1502242","article-title":"A review of multi-objective optimization: Methods and its applications","volume":"5","author":"Gunantara","year":"2018","journal-title":"Cogent Eng."},{"key":"ref_23","unstructured":"Okabe, T., Jin, Y., and Sendhoff, B. (2003, January 12\u201316). A critical survey of performance indices for multi-objective optimisation. Proceedings of the 2003 Congress on Evolutionary Computation, Chicago, IL, USA. CEC \u201903."},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"800","DOI":"10.1016\/j.ejor.2013.08.032","article-title":"A branch-and-cut-and-price algorithm for the cumulative capacitated vehicle routing problem","volume":"236","author":"Lysgaard","year":"2014","journal-title":"Eur. J. Oper. Res."},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"632","DOI":"10.1287\/opre.1050.0222","article-title":"Dynamic Aggregation of Set-Partitioning Constraints in Column Generation","volume":"53","author":"Elhallaoui","year":"2005","journal-title":"Oper. Res."},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1007\/s10472-011-9261-y","article-title":"Combining probabilistic algorithms, Constraint Programming and Lagrangian Relaxation to solve the Vehicle Routing Problem","volume":"62","author":"Guimarans","year":"2011","journal-title":"Ann. Math. Artif. Intell."},{"key":"ref_27","unstructured":"Coello, C.A.C., Van Veldhuizen, D.A., and Lamont, G.B. (2002). Evolutionary Algorithms for Solving Multi-Objective Problems, Springer."},{"key":"ref_28","doi-asserted-by":"crossref","unstructured":"Liu, Z., Zhou, K., Jiang, F., and Zhen, Y. (2017, January 25\u201327). Application of MTabu in VRPTW. Proceedings of the 2017 International Conference on Computer Systems, Electronics and Control (ICCSEC), Dalian, China.","DOI":"10.1109\/ICCSEC.2017.8446794"},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"012012","DOI":"10.1088\/1757-899X\/325\/1\/012012","article-title":"Vehicle Routing Problem Using Genetic Algorithm with Multi Compartment on Vegetable Distribution","volume":"325","author":"Kurnia","year":"2018","journal-title":"IOP Conf. Ser. Mater. Sci. Eng."},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"35","DOI":"10.13053\/rcs-147-2-3","article-title":"Design and Implementation of a CVRP Simulator Using Genetic Algorithms","volume":"147","author":"Cortes","year":"2018","journal-title":"Res. Comput. Sci."},{"key":"ref_31","doi-asserted-by":"crossref","first-page":"012042","DOI":"10.1088\/1757-899X\/528\/1\/012042","article-title":"Improvement Route for Distribution Solutions MDVRP (Multi Depot Vehicle Routing Problem) using Genetic Algorithm","volume":"528","author":"Fitriana","year":"2019","journal-title":"IOP Conf. Ser. Mater. Sci. Eng."},{"key":"ref_32","first-page":"1763","article-title":"Efficient implementation of the genetic algorithm to solve rich vehicle routing problems","volume":"21","author":"Rabbouch","year":"2021","journal-title":"Oper. Res."},{"key":"ref_33","doi-asserted-by":"crossref","first-page":"101236","DOI":"10.1016\/j.phycom.2020.101236","article-title":"Hybrid genetic-sweep algorithm to solve the vehicle routing problem with drones","volume":"44","author":"Euchi","year":"2021","journal-title":"Phys. Commun."},{"key":"ref_34","doi-asserted-by":"crossref","unstructured":"Mahrach, M., Miranda, G., Le\u00f3n, C., and Segredo, E. (2020). Comparison between Single and Multi-Objective Evolutionary Algorithms to Solve the Knapsack Problem and the Travelling Salesman Problem. Mathematics, 8.","DOI":"10.3390\/math8112018"},{"key":"ref_35","doi-asserted-by":"crossref","unstructured":"Mnasri, S., Nasri, N., Bossche, A.V.D., and Val, T. (2018, January 25\u201329). 3D indoor redeployment in IoT collection networks: A real prototyping using a hybrid PI-NSGA-III-VF. Proceedings of the 2018 14th International Wireless Communications & Mobile Computing Conference (IWCMC), Limassol, Cyprus.","DOI":"10.1109\/IWCMC.2018.8450372"},{"key":"ref_36","doi-asserted-by":"crossref","first-page":"663","DOI":"10.1007\/s10732-020-09445-x","article-title":"IoT networks 3D deployment using hybrid many-objective optimization algorithms","volume":"26","author":"Mnasri","year":"2020","journal-title":"J. Heuristics"},{"key":"ref_37","doi-asserted-by":"crossref","first-page":"3137","DOI":"10.1007\/s00500-017-2965-0","article-title":"A survey on handling computationally expensive multiobjective optimization problems with evolutionary algorithms","volume":"23","author":"Chugh","year":"2019","journal-title":"Soft Comput."},{"key":"ref_38","unstructured":"Ngo, S.T., Jaafar, J., Aziz, I.A., and Nguyen, G.H. (2021, January 27\u201329). Introduction to A Compromise Programming Based Method for Complex Scheduling and Planning Problems. Proceedings of the 2021 4th International Conference on Information Management & Management Science (IMMS\u201921), Chengdu, China."},{"key":"ref_39","doi-asserted-by":"crossref","unstructured":"Ringuest, J.L. (1992). Compromise Programming. Multiobjective Optimization: Behavioral and Computational Considerations, Springer.","DOI":"10.1007\/978-1-4615-3612-3"},{"key":"ref_40","unstructured":"Ngo, S.T., Jafreezal, J., Nguyen, G.H., and Bui, A.N. (2021, January 23\u201326). A Genetic Algorithm for Multi-Objective Optimization in Complex Course Timetabling. Proceedings of the 2021 10th International Conference on Software and Computer Applications, Kuala Lumpur, Malaysia."},{"key":"ref_41","doi-asserted-by":"crossref","first-page":"4","DOI":"10.3991\/ijet.v16i11.21017","article-title":"Genetic Algorithm for Solving Multi-Objective Optimization in Examination Timetabling Problem","volume":"16","author":"Ngo","year":"2021","journal-title":"Int. J. Emerg. Technol. Learn. (iJET)"},{"key":"ref_42","doi-asserted-by":"crossref","unstructured":"Son, N., Jaafar, J., Aziz, I., and Anh, B. (2021). A Compromise Programming for Multi-Objective Task Assignment Problem. Computers, 10.","DOI":"10.3390\/computers10020015"},{"key":"ref_43","doi-asserted-by":"crossref","unstructured":"Ngo, T.S., Bui, N.A., Tran, T.T., Le, P.C., Bui, D.C., Nguyen, T.D., Phan, L.D., Kieu, Q.T., Nguyen, B.S., and Tran, S.N. (2020). Some Algorithms to Solve a Bi-Objectives Problem for Team Selection. Appl. Sci., 10.","DOI":"10.3390\/app10082700"},{"key":"ref_44","doi-asserted-by":"crossref","first-page":"59093","DOI":"10.1109\/ACCESS.2021.3072222","article-title":"Meta-Heuristic Algorithms for Learning Path Recommender at MOOC","volume":"9","author":"Son","year":"2021","journal-title":"IEEE Access"},{"key":"ref_45","first-page":"3429","article-title":"A Compromise Programming to Task Assignment Problem in Software Development Project","volume":"69","author":"Son","year":"2021","journal-title":"Comput. Mater. Contin."},{"key":"ref_46","unstructured":"Ngo, S.T., Jaafar, J., Van Doan, T., Lac, D.P., and Bui, A.N. (2021, January 27\u201329). The Effectiveness of Reference Point Selection Methods for Compromise Programming in Multi-Criteria Learning Path Search Algorithm. Proceedings of the 2021 4th International Conference on Information Management & Management Science (IMMS\u201921), Chengdu, China."},{"key":"ref_47","doi-asserted-by":"crossref","first-page":"8091","DOI":"10.1007\/s11042-020-10139-6","article-title":"A review on genetic algorithm: Past, present, and future","volume":"80","author":"Katoch","year":"2021","journal-title":"Multimed. Tools Appl."},{"key":"ref_48","doi-asserted-by":"crossref","unstructured":"Neri, F., Cotta, C., and Moscato, P. (2012). Local Search. Handbook of Memetic Algorithms, Springer. Studies in Computational Intelligence.","DOI":"10.1007\/978-3-642-23247-3"},{"key":"ref_49","doi-asserted-by":"crossref","unstructured":"Burke, E.K., and Kendall, G. (2005). Tabu Search. Search Methodologies, Springer.","DOI":"10.1007\/0-387-28356-0"},{"key":"ref_50","doi-asserted-by":"crossref","unstructured":"Ishibuchi, H., Imada, R., Masuyama, N., and Nojima, Y. (2019). Comparison of Hypervolume, IGD and IGD+ from the Viewpoint of Optimal Distributions of Solutions. Evolutionary Multi-Criterion Optimization, Springer. EMO 2019; Lecture Notes in Computer Science.","DOI":"10.1007\/978-3-030-12598-1_27"},{"key":"ref_51","doi-asserted-by":"crossref","first-page":"585","DOI":"10.1007\/s11047-018-9685-y","article-title":"A tutorial on multiobjective optimization: Fundamentals and evolutionary methods","volume":"17","author":"Emmerich","year":"2018","journal-title":"Nat. Comput."}],"container-title":["Entropy"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1099-4300\/24\/3\/388\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T22:33:53Z","timestamp":1760135633000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1099-4300\/24\/3\/388"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,3,9]]},"references-count":51,"journal-issue":{"issue":"3","published-online":{"date-parts":[[2022,3]]}},"alternative-id":["e24030388"],"URL":"https:\/\/doi.org\/10.3390\/e24030388","relation":{"has-preprint":[{"id-type":"doi","id":"10.20944\/preprints202201.0130.v1","asserted-by":"object"}]},"ISSN":["1099-4300"],"issn-type":[{"value":"1099-4300","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,3,9]]}}}