[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"branding":3,"analytics":7,"article-new-llm-method-transfers-optimization-heuristics-without-retraining":10,"sections":34},{"siteName":4,"siteTagline":5,"publisherName":4,"contactEmail":6},"The Revision","Tech news, decoded.","editor@therevision.news",{"gaMeasurementId":8,"adsenseClientId":9},"G-ZW2MV82GYR","ca-pub-8533917693782264",{"article":11},{"id":12,"slug":13,"title":14,"dek":15,"body_md":16,"tags_json":17,"published_at":18,"created_at":19,"updated_at":20,"status":21,"review_note":22,"review_notes":23,"image_url":22,"persona_id":22,"persona_name":22,"section":24,"tags":25,"sources":29,"feedback":33,"feedback_at":22,"cost_usd":33,"total_tokens":33},9940,"new-llm-method-transfers-optimization-heuristics-without-retraining","New LLM Method Transfers Optimization Heuristics Without Retraining","MECo lets AI-generated heuristics for one optimization problem solve entirely different problems, beating eight baseline methods without extra training.","A new AI framework can crank out optimization heuristics for problems it has never been trained on - and still beat tools built specifically for the job.\n\nResearchers built MECo, a system that uses large language models to generate and evolve heuristics for combinatorial optimization problems like vehicle routing and factory scheduling. Instead of tuning a heuristic to one problem at a time, MECo keeps separate populations of heuristics for each task and measures a 'transfer gap' - how well a heuristic trained on one problem performs on another - to decide which pieces are worth combining. It then picks a compact set of heuristics that covers the most ground across the original training problems, and ships that set to new problems with no further tweaking. Across 32 variants of vehicle routing and flexible job-shop scheduling, MECo beat eight existing automated heuristic design methods on cost, and held its lead even on problem types it had never encountered.\n\nThe pitch here is cost. Heuristic search for optimization problems usually means running the actual problem over and over to get feedback, which is slow and expensive to repeat for every new scenario. MECo's heuristics transfer without that extra search, and bolting the framework onto other heuristic design methods improved their results too - suggesting this is a technique other teams can borrow rather than a one-off trick.\n\nVehicle routing and job-shop scheduling are the well-worn test problems of this field, so the real test is whether this generalizes to messier, real-world logistics - and for now, that's still an open question.","[\"ai\",\"llm\",\"optimization\",\"research\"]","2026-10-05T04:00:00.000Z","2026-10-05T14:29:31.545Z","2026-10-05T14:29:37.312Z","published",null,[],"ai",[24,26,27,28],"llm","optimization","research",[30],{"name":31,"url":32},"arXiv cs.AI","https:\u002F\u002Farxiv.org\u002Fabs\u002F2610.03316",0,{"sections":35},[36,39,43,48,53,58,62,67,71,75,80,85,90,95],{"name":37,"slug":24,"count":38,"latest_published_at":18},"AI",6170,{"name":40,"slug":41,"count":42,"latest_published_at":18},"Security","security",860,{"name":44,"slug":45,"count":46,"latest_published_at":47},"Policy","policy",444,"2026-10-03T15:02:01.000Z",{"name":49,"slug":50,"count":51,"latest_published_at":52},"Deals","deals",323,"2026-10-04T13:00:00.000Z",{"name":54,"slug":55,"count":56,"latest_published_at":57},"Hardware","hardware",204,"2026-10-03T14:50:50.000Z",{"name":59,"slug":60,"count":61,"latest_published_at":18},"Science","science",177,{"name":63,"slug":64,"count":65,"latest_published_at":66},"Consumer Tech","consumer-tech",158,"2026-10-03T03:21:12.000Z",{"name":68,"slug":69,"count":70,"latest_published_at":18},"Dev Tools","dev-tools",97,{"name":72,"slug":73,"count":70,"latest_published_at":74},"Software","software","2026-10-04T10:00:00.000Z",{"name":76,"slug":77,"count":78,"latest_published_at":79},"Startups","startups",92,"2026-10-04T14:36:25.000Z",{"name":81,"slug":82,"count":83,"latest_published_at":84},"Gaming","gaming",53,"2026-10-02T02:50:39.000Z",{"name":86,"slug":87,"count":88,"latest_published_at":89},"General","general",51,"2026-10-05T02:35:01.000Z",{"name":91,"slug":92,"count":93,"latest_published_at":94},"Reviews","reviews",32,"2026-10-02T18:00:00.000Z",{"name":96,"slug":97,"count":98,"latest_published_at":99},"How-To","how-to",7,"2026-10-01T09:00:00.000Z"]