{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,21]],"date-time":"2026-04-21T22:40:39Z","timestamp":1776811239577,"version":"3.51.2"},"reference-count":30,"publisher":"European Society of Computational Methods in Sciences and Engineering","issue":"4","license":[{"start":{"date-parts":[[2025,2,27]],"date-time":"2025-02-27T00:00:00Z","timestamp":1740614400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"funder":[{"name":"Project of Liaoning Provincial Department of Education","award":["LJKQZ20222468"],"award-info":[{"award-number":["LJKQZ20222468"]}]}],"content-domain":{"domain":["journals.sagepub.com"],"crossmark-restriction":true},"short-container-title":["Journal of Computational Methods in Sciences and Engineering"],"published-print":{"date-parts":[[2025,7]]},"abstract":"<jats:p>This article integrates mixed integer programming and the simulated annealing algorithm to enhance both the economic efficiency and environmental sustainability of logistics networks. A multi-objective optimization model is first developed, incorporating economic costs, carbon emissions, and social service levels to address the diverse needs of stakeholders. A solution approach combining the precision of mixed integer programming with the global search capabilities of the simulated annealing algorithm is then proposed. This hybrid approach effectively overcomes the limitations of traditional optimization methods, particularly in managing complex constraints and large-scale problems. Through practical case studies, the proposed method demonstrated superior optimization performance. The average total cost after optimization was $52,444.61, outperforming solutions derived from using either mixed integer programming or simulated annealing alone. Furthermore, the service satisfaction rate exceeded 90%, indicating the model\u2019s effectiveness in balancing multiple objectives. The findings of this study not only offer a novel theoretical framework for logistics network design but also provide valuable support for enterprises striving to achieve sustainable development in their operations. The research highlights the potential to strike a harmonious balance between economic, environmental, and social responsibilities, paving the way for more sustainable and efficient logistics practices.<\/jats:p>","DOI":"10.1177\/14727978251324148","type":"journal-article","created":{"date-parts":[[2025,2,27]],"date-time":"2025-02-27T09:00:47Z","timestamp":1740646847000},"page":"3580-3592","update-policy":"https:\/\/doi.org\/10.1177\/sage-journals-update-policy","source":"Crossref","is-referenced-by-count":1,"title":["Application of mixed integer programming and simulated annealing algorithm in sustainable logistics network design"],"prefix":"10.66113","volume":"25","author":[{"ORCID":"https:\/\/orcid.org\/0009-0006-0886-8746","authenticated-orcid":false,"given":"Nana","family":"Wang","sequence":"first","affiliation":[{"name":"School of Liberal Education, Liaoning University of International Business and Economics, Dalian, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"55691","published-online":{"date-parts":[[2025,2,27]]},"reference":[{"key":"e_1_3_3_2_2","doi-asserted-by":"publisher","DOI":"10.1504\/IJIEI.2020.105436"},{"key":"e_1_3_3_3_2","doi-asserted-by":"publisher","DOI":"10.1080\/09537325.2018.1485889"},{"key":"e_1_3_3_4_2","doi-asserted-by":"publisher","DOI":"10.1177\/0007650318755648"},{"key":"e_1_3_3_5_2","doi-asserted-by":"publisher","DOI":"10.1186\/s40991-018-0039-y"},{"key":"e_1_3_3_6_2","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.2018.0857"},{"key":"e_1_3_3_7_2","doi-asserted-by":"publisher","DOI":"10.1137\/19M1264709"},{"key":"e_1_3_3_8_2","doi-asserted-by":"publisher","DOI":"10.1137\/20M1346778"},{"key":"e_1_3_3_9_2","doi-asserted-by":"publisher","DOI":"10.1051\/ro\/2018036"},{"key":"e_1_3_3_10_2","doi-asserted-by":"publisher","DOI":"10.1109\/TITS.2019.2901505"},{"key":"e_1_3_3_11_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10462-020-09860-3"},{"key":"e_1_3_3_12_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.jfranklin.2023.01.033"},{"key":"e_1_3_3_13_2","doi-asserted-by":"publisher","DOI":"10.46632\/mc\/1\/1\/1"},{"key":"e_1_3_3_14_2","doi-asserted-by":"publisher","DOI":"10.1080\/10447318.2024.2314350"},{"key":"e_1_3_3_15_2","doi-asserted-by":"publisher","DOI":"10.14488\/BJOPM.2020.011"},{"key":"e_1_3_3_16_2","doi-asserted-by":"publisher","DOI":"10.1007\/s00180-019-00906-x"},{"key":"e_1_3_3_17_2","doi-asserted-by":"publisher","DOI":"10.1364\/OE.439635"},{"key":"e_1_3_3_18_2","doi-asserted-by":"publisher","DOI":"10.1109\/TSG.2019.2899353"},{"key":"e_1_3_3_19_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2021.06.057"},{"key":"e_1_3_3_20_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2022.09.006"},{"key":"e_1_3_3_21_2","doi-asserted-by":"publisher","DOI":"10.4018\/IJISSCM.338220"},{"key":"e_1_3_3_22_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-018-2758-6"},{"key":"e_1_3_3_23_2","doi-asserted-by":"publisher","DOI":"10.1111\/itor.12577"},{"key":"e_1_3_3_24_2","doi-asserted-by":"publisher","DOI":"10.1108\/JM2-06-2020-0150"},{"key":"e_1_3_3_25_2","doi-asserted-by":"publisher","DOI":"10.1080\/00207543.2020.1735665"},{"key":"e_1_3_3_26_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.aej.2021.04.075"},{"key":"e_1_3_3_27_2","doi-asserted-by":"publisher","DOI":"10.1080\/00207543.2017.1395490"},{"key":"e_1_3_3_28_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2020.2964301"},{"key":"e_1_3_3_29_2","doi-asserted-by":"publisher","DOI":"10.1108\/IJLM-03-2017-0059"},{"key":"e_1_3_3_30_2","doi-asserted-by":"publisher","DOI":"10.1109\/TIE.2018.2856205"},{"key":"e_1_3_3_31_2","doi-asserted-by":"publisher","DOI":"10.1038\/s41893-019-0442-8"}],"container-title":["Journal of Computational Methods in Sciences and Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.1177\/14727978251324148","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/full-xml\/10.1177\/14727978251324148","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.1177\/14727978251324148","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,21]],"date-time":"2026-04-21T22:05:52Z","timestamp":1776809152000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.1177\/14727978251324148"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,2,27]]},"references-count":30,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2025,7]]}},"alternative-id":["10.1177\/14727978251324148"],"URL":"https:\/\/doi.org\/10.1177\/14727978251324148","relation":{},"ISSN":["1472-7978","1875-8983"],"issn-type":[{"value":"1472-7978","type":"print"},{"value":"1875-8983","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,2,27]]}}}