{"id":"https://openalex.org/W7163535294","doi":"https://doi.org/10.48550/arxiv.2606.04816","title":"Beyond Objective Equivalence: Constraint Injection for LLM-Based Optimization Modeling on Vehicle Routing Problems","display_name":"Beyond Objective Equivalence: Constraint Injection for LLM-Based Optimization Modeling on Vehicle Routing Problems","publication_year":2026,"publication_date":"2026-06-03","ids":{"openalex":"https://openalex.org/W7163535294","doi":"https://doi.org/10.48550/arxiv.2606.04816"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2606.04816","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.04816","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2606.04816","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5137823384","display_name":"Xizi Luo","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Luo, Xizi","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5137832391","display_name":"Changhong He","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"He, Changhong","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5137850830","display_name":"Dongdong Geng","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Geng, Dongdong","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5137915482","display_name":"Chenggong Shi","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Shi, Chenggong","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5137880577","display_name":"Yu Mei","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Mei, Yu","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.5342000126838684,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.5342000126838684,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.10999999940395355,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11714","display_name":"Multimodal Machine Learning Applications","score":0.07320000231266022,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/spurious-relationship","display_name":"Spurious relationship","score":0.7544000148773193},{"id":"https://openalex.org/keywords/executable","display_name":"Executable","score":0.6873000264167786},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.6222000122070312},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.6118999719619751},{"id":"https://openalex.org/keywords/vehicle-routing-problem","display_name":"Vehicle routing problem","score":0.597100019454956},{"id":"https://openalex.org/keywords/testbed","display_name":"Testbed","score":0.5751000046730042},{"id":"https://openalex.org/keywords/constraint-programming","display_name":"Constraint programming","score":0.5627999901771545},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.5192999839782715},{"id":"https://openalex.org/keywords/suite","display_name":"Suite","score":0.5105000138282776}],"concepts":[{"id":"https://openalex.org/C97256817","wikidata":"https://www.wikidata.org/wiki/Q1462316","display_name":"Spurious relationship","level":2,"score":0.7544000148773193},{"id":"https://openalex.org/C160145156","wikidata":"https://www.wikidata.org/wiki/Q778586","display_name":"Executable","level":2,"score":0.6873000264167786},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6769000291824341},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.6222000122070312},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6123999953269958},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.6118999719619751},{"id":"https://openalex.org/C123784306","wikidata":"https://www.wikidata.org/wiki/Q944041","display_name":"Vehicle routing problem","level":3,"score":0.597100019454956},{"id":"https://openalex.org/C31395832","wikidata":"https://www.wikidata.org/wiki/Q1318674","display_name":"Testbed","level":2,"score":0.5751000046730042},{"id":"https://openalex.org/C173404611","wikidata":"https://www.wikidata.org/wiki/Q528588","display_name":"Constraint programming","level":3,"score":0.5627999901771545},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.5192999839782715},{"id":"https://openalex.org/C79581498","wikidata":"https://www.wikidata.org/wiki/Q1367530","display_name":"Suite","level":2,"score":0.5105000138282776},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.4916999936103821},{"id":"https://openalex.org/C106131492","wikidata":"https://www.wikidata.org/wiki/Q3072260","display_name":"Filter (signal processing)","level":2,"score":0.4537999927997589},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.4171000123023987},{"id":"https://openalex.org/C93226319","wikidata":"https://www.wikidata.org/wiki/Q193137","display_name":"Differential (mechanical device)","level":2,"score":0.41600000858306885},{"id":"https://openalex.org/C74750220","wikidata":"https://www.wikidata.org/wiki/Q2662197","display_name":"Differential evolution","level":2,"score":0.39169999957084656},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.38499999046325684},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.36340001225471497},{"id":"https://openalex.org/C2780980858","wikidata":"https://www.wikidata.org/wiki/Q110022","display_name":"Dual (grammatical number)","level":2,"score":0.34389999508857727},{"id":"https://openalex.org/C176783269","wikidata":"https://www.wikidata.org/wiki/Q5164378","display_name":"Constraint logic programming","level":4,"score":0.30709999799728394},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.2953000068664551},{"id":"https://openalex.org/C55660270","wikidata":"https://www.wikidata.org/wiki/Q5164377","display_name":"Constrained optimization","level":2,"score":0.295199990272522},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2924000024795532},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.271699994802475},{"id":"https://openalex.org/C132943942","wikidata":"https://www.wikidata.org/wiki/Q2562511","display_name":"Footprint","level":2,"score":0.2624000012874603}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2606.04816","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.04816","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2606.04816","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.04816","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","score":0.5032075643539429,"id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Large":[0],"language":[1],"models":[2],"(LLMs)":[3],"increasingly":[4],"translate":[5],"natural-language":[6,118],"optimization":[7,103,154],"problems":[8,97],"into":[9,121],"executable":[10],"solver":[11],"code.":[12],"Yet":[13],"for":[14],"constraint-dense":[15,101],"operations":[16],"research":[17],"(OR)":[18],"problems,":[19],"existing":[20],"data-filtering":[21],"and":[22,34,72,91,145,177],"training":[23],"pipelines":[24],"largely":[25],"rely":[26],"on":[27,56,94,168],"objective-equivalence":[28],"signals":[29],"such":[30],"as":[31,138,146],"differential":[32,82],"testing":[33],"answer":[35],"agreement,":[36],"which":[37,64],"a":[38,86,99,139,147],"program":[39],"can":[40],"pass":[41],"while":[42],"adding":[43],"spurious":[44,70],"constraints":[45,53],"or":[46],"silently":[47],"omitting":[48],"required":[49],"ones,":[50],"whenever":[51],"those":[52],"are":[54],"non-binding":[55],"the":[57],"tested":[58],"instance.":[59],"We":[60,89,109],"propose":[61],"constraint":[62,78],"injection,":[63],"uses":[65],"feasible":[66],"probes":[67,74],"to":[68,75],"expose":[69],"over-constraint":[71],"one-constraint-violating":[73],"reveal":[76],"silent":[77],"omission.":[79],"Combined":[80],"with":[81,105,125],"testing,":[83],"it":[84,93],"forms":[85],"dual":[87],"verifier.":[88],"instantiate":[90],"evaluate":[92],"vehicle":[95],"routing":[96],"(VRPs),":[98],"representative":[100],"combinatorial":[102],"testbed":[104],"coupled":[106],"operational":[107],"constraints.":[108],"develop":[110],"VRPCoder,":[111],"an":[112,126],"8B":[113],"end-to-end":[114],"model":[115],"that":[116],"translates":[117],"VRP":[119,128,158],"scenarios":[120],"Gurobi":[122],"scripts,":[123],"together":[124],"expert-verified":[127],"benchmark":[129],"suite":[130],"covering":[131],"21":[132],"variants.":[133],"The":[134],"verifier":[135],"is":[136],"reused":[137],"rejection-sampling":[140],"filter":[141],"during":[142],"data":[143],"synthesis":[144],"per-rollout":[148],"reward":[149],"in":[150],"group":[151],"relative":[152],"policy":[153],"(GRPO).":[155],"Across":[156],"four":[157],"benchmarks,":[159,170],"VRPCoder-GRPO":[160],"reaches":[161],"93\\%":[162],"average":[163,175,183],"Pass@1,":[164],"outperforms":[165],"Gemini-3.1-Pro":[166],"Preview":[167],"three":[169],"exceeds":[171],"Claude-Sonnet-4.5":[172],"by":[173,181],"28":[174],"points,":[176],"surpasses":[178],"prior":[179],"OR-LLMs":[180],"78":[182],"points.":[184]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-06-05T00:00:00"}