{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,21]],"date-time":"2026-09-21T16:09:41Z","timestamp":1790006981973,"version":"4.0.1"},"reference-count":0,"publisher":"MIT Press","content-domain":{"domain":["direct.mit.edu"],"crossmark-restriction":true},"short-container-title":[],"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>This paper focuses on the cold chain logistics and proposes a multi-objective Vehicle Routing Problem (VRP) model that seeks to minimize the total cost of cold chain logistics and maximize the fairness of employees\u2019 workloads. This model first incorporates carbon emissions into the cost structure, and also discretely calculates vehicle departure times by introducing time-dependent factors. Specifically, an algorithm named NSGA-ALNS is developed to solve the proposed model. Different from the well-known genetic algorithmic frameworks that include the selection, crossover, and mutation steps, the proposed algorithm utilizes the population evolution strategy of NSGA-II for global search, employs Adaptive Large Neighborhood Search (ALNS) as a local search operator for route refinement, and further introduces a population diversity strategy to reduce duplicated individuals. Empirically, comparing and analyzing the Pareto frontiers of NSGA-ALNS, NSGA-II, and MOALNS on the Solomon dataset and Gehring &amp; Homberger\u2019s instances, we clearly demonstrate that NSGAALNS improves the convergence and the extent of the solution set.<\/jats:p>","DOI":"10.1162\/evco.a.407","type":"journal-article","created":{"date-parts":[[2026,9,21]],"date-time":"2026-09-21T15:53:42Z","timestamp":1790006022000},"page":"1-21","update-policy":"https:\/\/doi.org\/10.1162\/mitpressjournals.corrections.policy","source":"Crossref","is-referenced-by-count":0,"title":["A Hybrid Evolutionary Algorithm for Time-Dependent Green Vehicle Routing Problem with Time Windows and Route Balancing in Cold Chain"],"prefix":"10.1162","author":[{"given":"Jianhao","family":"Xu","sequence":"first","affiliation":[{"name":"School of Computer Science and Technology, Soochow University, Suzhou 215006, China jianhaoxu2025@163.com"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zhuang","family":"Yang","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, Soochow University, Suzhou 215006, China Zhuangyng@163.com"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yang","family":"Wang","sequence":"additional","affiliation":[{"name":"College of Information Engineering, Taizhou University, Taizhou, 225300, China wy23912@gmail.com"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"281","published-online":{"date-parts":[[2026,9,18]]},"container-title":["Evolutionary Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/direct.mit.edu\/evco\/article-pdf\/doi\/10.1162\/EVCO.a.407\/2629115\/evco.a.407.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/direct.mit.edu\/evco\/article-pdf\/doi\/10.1162\/EVCO.a.407\/2629115\/evco.a.407.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,9,21]],"date-time":"2026-09-21T15:53:42Z","timestamp":1790006022000},"score":1,"resource":{"primary":{"URL":"https:\/\/direct.mit.edu\/evco\/article\/doi\/10.1162\/EVCO.a.407\/139050\/A-Hybrid-Evolutionary-Algorithm-for-Time-Dependent"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,9,18]]},"references-count":0,"URL":"https:\/\/doi.org\/10.1162\/evco.a.407","relation":{},"ISSN":["1530-9304"],"issn-type":[{"value":"1530-9304","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,9,18]]}}}