Dataset Viewer
Auto-converted to Parquet Duplicate
id
stringlengths
28
50
domain
stringclasses
3 values
language
stringclasses
3 values
messages
listlengths
1
3
ir
stringlengths
9
948
decision_kind
stringclasses
3 values
gold_decision
unknown
stratum
stringclasses
34 values
episode_id
stringclasses
98 values
v3/base:routing:97b83bb848e1ab05
routing
en
[ { "role": "user", "content": "Plan today’s runs to keep the total vehicle fixed cost as low as possible." } ]
MINIMIZE( SUM(x0 in routes: fixed_cost(x0)) )
execute
{ "constraints": [], "data_binding": { "overrides": [], "selections": [] }, "kind": "execute", "objectives": { "method": "weighted_sum", "terms": [ { "objective_ref": "objective:fixed_cost", "weight": "1/1" } ] }, "parameters": [] }
v3/base
null
v3/base:routing:0b743efeed62de1b
routing
ko
[ { "role": "user", "content": "오늘 배송은 차량 고정비용 총액이 가장 적게 들도록 짜 주세요." } ]
MINIMIZE( SUM(x0 in routes: fixed_cost(x0)) )
execute
{ "constraints": [], "data_binding": { "overrides": [], "selections": [] }, "kind": "execute", "objectives": { "method": "weighted_sum", "terms": [ { "objective_ref": "objective:fixed_cost", "weight": "1/1" } ] }, "parameters": [] }
v3/base
null
v3/base:routing:ccb5bda100740a6e
routing
ko
[ { "role": "user", "content": "오늘 모든 배송 라운드에서 차량 고정비용 합계를 최소로 맞춰 주세요." } ]
MINIMIZE( SUM(x0 in routes: fixed_cost(x0)) )
execute
{ "constraints": [], "data_binding": { "overrides": [], "selections": [] }, "kind": "execute", "objectives": { "method": "weighted_sum", "terms": [ { "objective_ref": "objective:fixed_cost", "weight": "1/1" } ] }, "parameters": [] }
v3/base
null
v3/base:routing:574412c2eef4451d
routing
ko
[ { "role": "user", "content": "오늘 운행 계획은 전체 차량 고정 운영비를 최소화해 주세요." } ]
MINIMIZE( SUM(x0 in routes: fixed_cost(x0)) )
execute
{ "constraints": [], "data_binding": { "overrides": [], "selections": [] }, "kind": "execute", "objectives": { "method": "weighted_sum", "terms": [ { "objective_ref": "objective:fixed_cost", "weight": "1/1" } ] }, "parameters": [] }
v3/base
null
v3/base:routing:e5f507204ab5ab79
routing
ko
[ { "role": "user", "content": "오늘 전체 배차 라운드 기준으로, 모든 경로의 연료비 합계가 최소가 되도록 동선을 짜주세요. 차량별 연비 차이도 반영해서 전체 주유 비용을 줄이는 방향으로요." } ]
MINIMIZE( SUM(x0 in routes: fuel_cost(x0)) )
execute
{ "constraints": [], "data_binding": { "overrides": [], "selections": [] }, "kind": "execute", "objectives": { "method": "weighted_sum", "terms": [ { "objective_ref": "objective:fuel_cost", "weight": "1/1" } ] }, "parameters": [] }
v3/base
null
v3/base:routing:62d533481f397476
routing
ko
[ { "role": "user", "content": "이번 배송 계획은 전체 노선의 연료비 총합을 최대한 낮추는 걸 목표로 잡아주세요." } ]
MINIMIZE( SUM(x0 in routes: fuel_cost(x0)) )
execute
{ "constraints": [], "data_binding": { "overrides": [], "selections": [] }, "kind": "execute", "objectives": { "method": "weighted_sum", "terms": [ { "objective_ref": "objective:fuel_cost", "weight": "1/1" } ] }, "parameters": [] }
v3/base
null
v3/base:routing:5e972e4e78fccad0
routing
mixed
[ { "role": "user", "content": "전체 route들의 total fuel cost를 minimize하는 방향으로 objective를 잡으면 될 것 같아요. 다른 조건 없이 그냥 연료비 합만 최소화하는 거죠." } ]
MINIMIZE( SUM(x0 in routes: fuel_cost(x0)) )
execute
{ "constraints": [], "data_binding": { "overrides": [], "selections": [] }, "kind": "execute", "objectives": { "method": "weighted_sum", "terms": [ { "objective_ref": "objective:fuel_cost", "weight": "1/1" } ] }, "parameters": [] }
v3/base
null
v3/base:routing:713d37d93a318da2
routing
ko
[ { "role": "user", "content": "이번 최적화의 목표 함수는 모든 경로의 연료비 합계를 최소화하는 걸로 설정하면 됩니다. 다른 가중치나 페널티 없이 순수하게 연료비 총합만 줄이는 거예요." } ]
MINIMIZE( SUM(x0 in routes: fuel_cost(x0)) )
execute
{ "constraints": [], "data_binding": { "overrides": [], "selections": [] }, "kind": "execute", "objectives": { "method": "weighted_sum", "terms": [ { "objective_ref": "objective:fuel_cost", "weight": "1/1" } ] }, "parameters": [] }
v3/base
null
v3/base:routing:5e1e2d86543497cd
routing
ko
[ { "role": "user", "content": "전체 노선 다 합쳐서 시작부터 끝까지 걸리는 시간을 최대한 줄이고 싶고요, 대신 각 노선의 왕복마다 실린 짐은 무게든 부피든 그 차량 적재 한도를 절대 넘으면 안 됩니다." } ]
MINIMIZE( SUM(x0 in routes: duration(x0)) ) [HARD] EACH(x1 in keys(load)): EACH(x2 in routes): EACH(x3 in rounds(x2)): MAX(x4 in positions(x3): load[x1](x4)) <= capacity[x1](x2)
execute
{ "constraints": [ { "arguments": [ { "slot_ref": "slot:capacity.exp_factor", "value": { "type": "decimal", "value": "1" } } ], "constraint_ref": "constraint:capacity", "scope": null, "strength": { "kind": ...
v3/base
null
v3/base:routing:3f44f56d3764eb3f
routing
ko
[ { "role": "user", "content": "모든 경로의 총 소요 시간을 최소화해야 합니다. 단, 모든 차량은 각 왕복 구간에서 어떤 적재 항목이든 항상 차량의 용량 한도 이내로 유지되어야 합니다." } ]
MINIMIZE( SUM(x0 in routes: duration(x0)) ) EACH(x1 in keys(load)): EACH(x2 in routes): EACH(x3 in rounds(x2)): MAX(x4 in positions(x3): load[x1](x4)) <= capacity[x1](x2)
execute
{ "constraints": [ { "arguments": [ { "slot_ref": "slot:capacity.exp_factor", "value": { "type": "decimal", "value": "1" } } ], "constraint_ref": "constraint:capacity", "scope": null, "strength": { "kind": ...
v3/base
null
v3/base:routing:2cf650addfa86c18
routing
ko
[ { "role": "user", "content": "오늘 전체 배차 시간, 그러니까 출발해서 다 끝날 때까지 걸리는 시간 합을 최소로 맞춰주세요. 그리고 각 라운드마다, 짐 실을 때 중량이든 부피든 그 차의 용량 넘기는 건 절대 안 됩니다." } ]
MINIMIZE( SUM(x0 in routes: duration(x0)) ) [HARD] EACH(x1 in keys(load)): EACH(x2 in routes): EACH(x3 in rounds(x2)): MAX(x4 in positions(x3): load[x1](x4)) <= capacity[x1](x2)
execute
{ "constraints": [ { "arguments": [ { "slot_ref": "slot:capacity.exp_factor", "value": { "type": "decimal", "value": "1" } } ], "constraint_ref": "constraint:capacity", "scope": null, "strength": { "kind": ...
v3/base
null
v3/base:routing:da1254a20b131c76
routing
mixed
[ { "role": "user", "content": "전체 routes의 total duration 합을 최소화해주세요. 단, 모든 route의 매 round trip마다 각 cargo dimension(중량/부피 등)의 최대 적재량은 항상 해당 vehicle의 capacity 이하여야 합니다." } ]
MINIMIZE( SUM(x0 in routes: duration(x0)) ) EACH(x1 in keys(load)): EACH(x2 in routes): EACH(x3 in rounds(x2)): MAX(x4 in positions(x3): load[x1](x4)) <= capacity[x1](x2)
execute
{ "constraints": [ { "arguments": [ { "slot_ref": "slot:capacity.exp_factor", "value": { "type": "decimal", "value": "1" } } ], "constraint_ref": "constraint:capacity", "scope": null, "strength": { "kind": ...
v3/base
null
v3/base:routing:f7217df05a6118ec
routing
ko
[ { "role": "user", "content": "오늘 배차는 전체 이동거리가 가장 짧게 나오도록 짜고, 가능하면 모든 경로의 배송 건수는 15건 이하로 맞춰 주세요." } ]
MINIMIZE( SUM(x0 in routes: travel_distance(x0)) ) [SOFT] EACH(x1 in routes): delivery_count(x1) <= 15
execute
{ "constraints": [ { "arguments": [ { "slot_ref": "slot:delivery_length.exp_factor", "value": { "type": "decimal", "value": "2" } }, { "slot_ref": "slot:delivery_length.max_size", "value": { "type":...
v3/base
null
v3/base:routing:7974eb646bc0c6e8
routing
ko
[ { "role": "user", "content": "총 이동거리를 최소화해 주세요. 가능하면 각 경로의 배송 건수는 15건 이하가 되도록 해주세요." } ]
MINIMIZE( SUM(x0 in routes: travel_distance(x0)) ) [SOFT] EACH(x1 in routes): delivery_count(x1) <= 15
execute
{ "constraints": [ { "arguments": [ { "slot_ref": "slot:delivery_length.exp_factor", "value": { "type": "decimal", "value": "2" } }, { "slot_ref": "slot:delivery_length.max_size", "value": { "type":...
v3/base
null
v3/base:routing:a1e8af24892e4057
routing
ko
[ { "role": "user", "content": "전체 운행거리를 줄이는 쪽으로 배차해 주시고, 되도록 어느 경로든 배송은 15건을 넘기지 않게 해주세요." } ]
MINIMIZE( SUM(x0 in routes: travel_distance(x0)) ) [SOFT] EACH(x1 in routes): delivery_count(x1) <= 15
execute
{ "constraints": [ { "arguments": [ { "slot_ref": "slot:delivery_length.exp_factor", "value": { "type": "decimal", "value": "2" } }, { "slot_ref": "slot:delivery_length.max_size", "value": { "type":...
v3/base
null
v3/base:routing:d54293012617ec31
routing
ko
[ { "role": "user", "content": "오늘 배송은 총 이동거리를 최소로 하고, 가능하면 각 운행 경로에 배송 15건 이하로 배정해 주세요." } ]
MINIMIZE( SUM(x0 in routes: travel_distance(x0)) ) [SOFT] EACH(x1 in routes): delivery_count(x1) <= 15
execute
{ "constraints": [ { "arguments": [ { "slot_ref": "slot:delivery_length.exp_factor", "value": { "type": "decimal", "value": "2" } }, { "slot_ref": "slot:delivery_length.max_size", "value": { "type":...
v3/base
null
v3/base:routing:8195e9481cd26370
routing
en
[ { "role": "user", "content": "Keep the vehicle fixed costs as low as possible across all runs. If possible, keep every route’s enclosing-circle radius within 5 km." } ]
MINIMIZE( SUM(x0 in routes: fixed_cost(x0)) ) [SOFT] EACH(x1 in routes): sec_radius(x1) <= 5 km
execute
{ "constraints": [ { "arguments": [ { "slot_ref": "slot:enclosing_circle_radius.exp_factor", "value": { "type": "decimal", "value": "2" } }, { "slot_ref": "slot:enclosing_circle_radius.max_radius", "value": { ...
v3/base
null
v3/base:routing:d3b11b3a1a2780ff
routing
ko
[ { "role": "user", "content": "오늘 모든 배송 경로의 차량 고정비용을 최소로 잡아 주세요. 가능하면 각 경로의 외접원 반경은 5 km 이내로 해 주세요." } ]
MINIMIZE( SUM(x0 in routes: fixed_cost(x0)) ) [SOFT] EACH(x1 in routes): sec_radius(x1) <= 5 km
execute
{ "constraints": [ { "arguments": [ { "slot_ref": "slot:enclosing_circle_radius.exp_factor", "value": { "type": "decimal", "value": "2" } }, { "slot_ref": "slot:enclosing_circle_radius.max_radius", "value": { ...
v3/base
null
v3/base:routing:0ba6577d8e9cb82c
routing
mixed
[ { "role": "user", "content": "Minimize total vehicle fixed operating cost across all routes. 가능하면 모든 경로의 enclosing circle radius는 5 km 이하로 유지해 주세요." } ]
MINIMIZE( SUM(x0 in routes: fixed_cost(x0)) ) [SOFT] EACH(x1 in routes): sec_radius(x1) <= 5 km
execute
{ "constraints": [ { "arguments": [ { "slot_ref": "slot:enclosing_circle_radius.exp_factor", "value": { "type": "decimal", "value": "2" } }, { "slot_ref": "slot:enclosing_circle_radius.max_radius", "value": { ...
v3/base
null
v3/base:routing:1ee20d376f5edfa7
routing
ko
[ { "role": "user", "content": "전체 경로의 차량 고정 운영비를 최소화하는 것이 목적입니다. 외접원 반경은 모든 경로에서 가능하면 5 km 이하로 유지하는 소프트 조건으로 두세요." } ]
MINIMIZE( SUM(x0 in routes: fixed_cost(x0)) ) [SOFT] EACH(x1 in routes): sec_radius(x1) <= 5 km
execute
{ "constraints": [ { "arguments": [ { "slot_ref": "slot:enclosing_circle_radius.exp_factor", "value": { "type": "decimal", "value": "2" } }, { "slot_ref": "slot:enclosing_circle_radius.max_radius", "value": { ...
v3/base
null
v3/base:routing:a44c44da8f0bb5e0
routing
ko
[ { "role": "user", "content": "전체 노선의 연료비 합계를 최소화해 주세요. 가능하면 각 노선의 모든 회전에서 정류소들을 감싸는 최소 원의 반경은 3 km 이하로 맞춰 주세요." } ]
MINIMIZE( SUM(x0 in routes: fuel_cost(x0)) ) [SOFT] EACH(x1 in routes): EACH(x2 in rounds(x1)): sec_radius(x2) <= 3 km
execute
{ "constraints": [ { "arguments": [ { "slot_ref": "slot:round_enclosing_circle_radius.exp_factor", "value": { "type": "decimal", "value": "2" } }, { "slot_ref": "slot:round_enclosing_circle_radius.max_radius", ...
v3/base
null
v3/base:routing:f7f37f2986a54f6e
routing
ko
[ { "role": "user", "content": "오늘 모든 운행의 연료비를 가장 적게 잡아 주세요. 가능하면 각 노선의 매 회전은 정류소 기준 회전 반경이 3 km를 넘지 않게 해 주세요." } ]
MINIMIZE( SUM(x0 in routes: fuel_cost(x0)) ) [SOFT] EACH(x1 in routes): EACH(x2 in rounds(x1)): sec_radius(x2) <= 3 km
execute
{ "constraints": [ { "arguments": [ { "slot_ref": "slot:round_enclosing_circle_radius.exp_factor", "value": { "type": "decimal", "value": "2" } }, { "slot_ref": "slot:round_enclosing_circle_radius.max_radius", ...
v3/base
null
v3/base:routing:ac09e95030e157f3
routing
en
[ { "role": "user", "content": "Minimize total fuel cost across all routes. If possible, keep the round enclosing-circle radius for every round trip on every route at 3 km or less." } ]
MINIMIZE( SUM(x0 in routes: fuel_cost(x0)) ) [SOFT] EACH(x1 in routes): EACH(x2 in rounds(x1)): sec_radius(x2) <= 3 km
execute
{ "constraints": [ { "arguments": [ { "slot_ref": "slot:round_enclosing_circle_radius.exp_factor", "value": { "type": "decimal", "value": "2" } }, { "slot_ref": "slot:round_enclosing_circle_radius.max_radius", ...
v3/base
null
v3/base:routing:344c650177829b59
routing
ko
[ { "role": "user", "content": "목표는 전체 노선의 총 연료비 최소화입니다. 소프트 제약으로, 모든 노선의 각 회전에서 정류소를 감싸는 최소 원의 반경이 가능하면 3 km 이하가 되게 해 주세요." } ]
MINIMIZE( SUM(x0 in routes: fuel_cost(x0)) ) [SOFT] EACH(x1 in routes): EACH(x2 in rounds(x1)): sec_radius(x2) <= 3 km
execute
{ "constraints": [ { "arguments": [ { "slot_ref": "slot:round_enclosing_circle_radius.exp_factor", "value": { "type": "decimal", "value": "2" } }, { "slot_ref": "slot:round_enclosing_circle_radius.max_radius", ...
v3/base
null
v3/base:routing:f86825c91a81e67c
routing
ko
[ { "role": "user", "content": "전체 배송 경로의 연료비를 최대한 낮추는 게 이번 계획의 핵심이고요, 가능하면 배송 우선순위 순으로 도착 시간도 맞춰주면 좋겠습니다." } ]
MINIMIZE( SUM(x0 in routes: fuel_cost(x0)) ) [SOFT] MINIMIZE( SUM(x1 in visits: priority_weighted_arrival(x1)) )
execute
{ "constraints": [ { "arguments": [ { "slot_ref": "slot:delivery_time_priority.exp_factor", "value": { "type": "decimal", "value": "2" } } ], "constraint_ref": "constraint:delivery_time_priority", "scope": null, "s...
v3/base
null
v3/base:routing:e58b4b960832d737
routing
ko
[ { "role": "user", "content": "이번 최적화 목표는 전체 경로의 연료비 총합을 최소화하는 거고요, 배송 우선순위에 따른 도착 시간 가중합은 소프트 제약으로 잡아서 가능한 선에서 줄여주시면 됩니다." } ]
MINIMIZE( SUM(x0 in routes: fuel_cost(x0)) ) [SOFT] MINIMIZE( SUM(x1 in visits: priority_weighted_arrival(x1)) )
execute
{ "constraints": [ { "arguments": [ { "slot_ref": "slot:delivery_time_priority.exp_factor", "value": { "type": "decimal", "value": "2" } } ], "constraint_ref": "constraint:delivery_time_priority", "scope": null, "s...
v3/base
null
v3/base:routing:4c0ca599c82e68b8
routing
mixed
[ { "role": "user", "content": "objective는 전체 routes의 fuel cost 총합을 minimize하는 것이고, 배송 priority로 weighted된 arrival time 합계는 soft constraint로 최대한 낮춰주세요." } ]
MINIMIZE( SUM(x0 in routes: fuel_cost(x0)) ) [SOFT] MINIMIZE( SUM(x1 in visits: priority_weighted_arrival(x1)) )
execute
{ "constraints": [ { "arguments": [ { "slot_ref": "slot:delivery_time_priority.exp_factor", "value": { "type": "decimal", "value": "2" } } ], "constraint_ref": "constraint:delivery_time_priority", "scope": null, "s...
v3/base
null
v3/base:routing:9ce033183e200b94
routing
mixed
[ { "role": "user", "content": "오늘 전체 라운드 fuel cost 최소화로 짜주시고요, 긴급이나 우선순위 높은 배송은 가능하면 도착시간 앞당겨주는 쪽으로 신경써주세요, must는 아니고 되는대로요" } ]
MINIMIZE( SUM(x0 in routes: fuel_cost(x0)) ) [SOFT] MINIMIZE( SUM(x1 in visits: priority_weighted_arrival(x1)) )
execute
{ "constraints": [ { "arguments": [ { "slot_ref": "slot:delivery_time_priority.exp_factor", "value": { "type": "decimal", "value": "2" } } ], "constraint_ref": "constraint:delivery_time_priority", "scope": null, "s...
v3/base
null
v3/base:routing:c3d6ced2bca1bddb
routing
mixed
[ { "role": "user", "content": "전체 route들의 총 소요시간을 최소화하는 게 목표입니다. 가능하면 each route의 이동거리도 80km 이내로 유지했으면 합니다." } ]
MINIMIZE( SUM(x0 in routes: duration(x0)) ) [SOFT] EACH(x1 in routes): travel_distance(x1) <= 80 km
execute
{ "constraints": [ { "arguments": [ { "slot_ref": "slot:max_distance.exp_factor", "value": { "type": "decimal", "value": "1" } }, { "slot_ref": "slot:max_distance.max_distance", "value": { "type": "...
v3/base
null
v3/base:routing:380e0346531d3eae
routing
mixed
[ { "role": "user", "content": "objective는 모든 routes의 total elapsed time을 minimize하는 것이고, soft constraint로 각 route의 travel distance가 80km를 넘지 않도록 시도해주세요." } ]
MINIMIZE( SUM(x0 in routes: duration(x0)) ) [SOFT] EACH(x1 in routes): travel_distance(x1) <= 80 km
execute
{ "constraints": [ { "arguments": [ { "slot_ref": "slot:max_distance.exp_factor", "value": { "type": "decimal", "value": "1" } }, { "slot_ref": "slot:max_distance.max_distance", "value": { "type": "...
v3/base
null
v3/base:routing:c3230852e254219e
routing
ko
[ { "role": "user", "content": "목표는 전체 경로의 총 운행 시간을 최소화하는 거고요, 소프트 제약으로 각 경로별 이동 거리는 가능하면 80km 이하로 맞춰주시면 좋겠습니다." } ]
MINIMIZE( SUM(x0 in routes: duration(x0)) ) [SOFT] EACH(x1 in routes): travel_distance(x1) <= 80 km
execute
{ "constraints": [ { "arguments": [ { "slot_ref": "slot:max_distance.exp_factor", "value": { "type": "decimal", "value": "1" } }, { "slot_ref": "slot:max_distance.max_distance", "value": { "type": "...
v3/base
null
v3/base:routing:7c73f4e24962bf72
routing
en
[ { "role": "user", "content": "I want the overall time from start to finish across all the routes to be as short as possible, and if you can, try to keep every route's distance under 80 km — not a must, just prefer it." } ]
MINIMIZE( UNSPECIFIED(x0 in routes: duration(x0)) ) [SOFT] EACH(x1 in routes): travel_distance(x1) <= 80 km
clarify
{ "candidate_refs": [], "kind": "clarify", "missing_field_refs": [], "reason_code": "ambiguous_capability", "required_inputs": [] }
v3/base
null
v3/base:routing:2cb0bf5d96eccb58
routing
ko
[ { "role": "user", "content": "전체 노선의 연료비 총합을 최소화하면서, 모든 차량은 반드시 계약된 최소 왕복(회전) 횟수 이상으로 운행해야 합니다. 이 기준은 절대 어겨서는 안 됩니다." } ]
MINIMIZE( SUM(x0 in routes: fuel_cost(x0)) ) [HARD] EACH(x1 in routes): round_count(x1) >= base_rounds(x1)
execute
{ "constraints": [ { "arguments": [], "constraint_ref": "constraint:minimum_round", "scope": null, "strength": { "kind": "hard" } } ], "data_binding": { "overrides": [], "selections": [] }, "kind": "execute", "objectives": { "method": "weighted_sum",...
v3/base
null
v3/base:routing:239af42f6bf2ecbf
routing
en
[ { "role": "user", "content": "Minimize the total fuel cost across all our routes, but every route must always complete at least the rider's contracted number of depot round trips — no exceptions." } ]
MINIMIZE( SUM(x0 in routes: fuel_cost(x0)) ) [HARD] EACH(x1 in routes): round_count(x1) >= base_rounds(x1)
execute
{ "constraints": [ { "arguments": [], "constraint_ref": "constraint:minimum_round", "scope": null, "strength": { "kind": "hard" } } ], "data_binding": { "overrides": [], "selections": [] }, "kind": "execute", "objectives": { "method": "weighted_sum",...
v3/base
null
v3/base:routing:415bfab99b9b53c9
routing
en
[ { "role": "user", "content": "I want our routing plan to bring down total fuel spend, but it has to guarantee every route always hits its rider's contracted minimum round trips." } ]
MINIMIZE( SUM(x0 in routes: fuel_cost(x0)) ) EACH(x1 in routes): round_count(x1) >= base_rounds(x1)
execute
{ "constraints": [ { "arguments": [], "constraint_ref": "constraint:minimum_round", "scope": null, "strength": { "kind": "hard" } } ], "data_binding": { "overrides": [], "selections": [] }, "kind": "execute", "objectives": { "method": "weighted_sum",...
v3/base
null
v3/base:routing:cd656e12ca4ee4a2
routing
ko
[ { "role": "user", "content": "전체 경로의 연료비 합계를 최소화하는 것이 목표이며, 모든 경로의 회전 수가 해당 라이더의 계약 최소 왕복 횟수 이상이 되도록 하드 제약으로 반영해야 합니다." } ]
MINIMIZE( SUM(x0 in routes: fuel_cost(x0)) ) [HARD] EACH(x1 in routes): round_count(x1) >= base_rounds(x1)
execute
{ "constraints": [ { "arguments": [], "constraint_ref": "constraint:minimum_round", "scope": null, "strength": { "kind": "hard" } } ], "data_binding": { "overrides": [], "selections": [] }, "kind": "execute", "objectives": { "method": "weighted_sum",...
v3/base
null
v3/base:routing:a6479df5238dfd33
routing
ko
[ { "role": "user", "content": "오늘 전체 배차 짜줄 때 말이야, 모든 경로 다 합쳐서 시작부터 끝까지 걸리는 총 운행시간이 제일 짧게 나오게 해줘. 그리고 각 경로에서 왕복(라운드)마다, 화물 종류별 적재율 중에 제일 높은 게 0.8 이상 되도록 가능하면 맞춰줘, 무리하게 강제할 필요는 없고." } ]
MINIMIZE( SUM(x0 in routes: duration(x0)) ) [SOFT] EACH(x1 in routes): EACH(x2 in rounds(x1)): MAX(x3 in keys(load): utilization[x3](x2)) >= 0.8
execute
{ "constraints": [ { "arguments": [ { "slot_ref": "slot:min_capacity.target_ratio", "value": { "type": "decimal", "value": "0.8" } } ], "constraint_ref": "constraint:min_capacity", "scope": null, "strength": { ...
v3/base
null
v3/base:routing:d4d226587e3e0025
routing
ko
[ { "role": "user", "content": "라이더들 스케줄 잡을 때 전체 노선들 걸리는 시간 총합이 최소가 되게 짜줘. 그리고 매 왕복마다 짐 종류 중 가장 적재율 높은 항목이 0.8 넘게, 되면 좋고 안 되면 어쩔 수 없다는 느낌으로 신경 좀 써줘." } ]
MINIMIZE( SUM(x0 in routes: duration(x0)) ) [SOFT] EACH(x1 in routes): EACH(x2 in rounds(x1)): MAX(x3 in keys(load): utilization[x3](x2)) >= 0.8
execute
{ "constraints": [ { "arguments": [ { "slot_ref": "slot:min_capacity.target_ratio", "value": { "type": "decimal", "value": "0.8" } } ], "constraint_ref": "constraint:min_capacity", "scope": null, "strength": { ...
v3/base
null
v3/base:routing:17e68bcedf94c097
routing
ko
[ { "role": "user", "content": "전체 경로의 시작~종료까지 걸리는 총 운행시간 합을 최소화해 주시기 바랍니다. 아울러 각 경로의 모든 왕복(라운드)에 대해, 화물 종류별 적재율 중 최댓값이 0.8 이상이 되도록 가능한 범위 내에서 맞춰 주시면 됩니다." } ]
MINIMIZE( SUM(x0 in routes: duration(x0)) ) [SOFT] EACH(x1 in routes): EACH(x2 in rounds(x1)): MAX(x3 in keys(load): utilization[x3](x2)) >= 0.8
execute
{ "constraints": [ { "arguments": [ { "slot_ref": "slot:min_capacity.target_ratio", "value": { "type": "decimal", "value": "0.8" } } ], "constraint_ref": "constraint:min_capacity", "scope": null, "strength": { ...
v3/base
null
v3/base:routing:f836ba85d9feabd0
routing
ko
[ { "role": "user", "content": "전체 라우트 기준으로 시작부터 종료까지의 총 소요시간 합을 목표식으로 최소화하려고 해요. 추가로 각 라운드마다 화물 차원별 적재율 중 최대값이 0.8 이상이 되게 하는 걸 소프트 제약으로 걸어서, 가능하면 맞추되 강제는 하지 않는 방향으로 부탁드려요." } ]
MINIMIZE( SUM(x0 in routes: duration(x0)) ) [SOFT] EACH(x1 in routes): EACH(x2 in rounds(x1)): MAX(x3 in keys(load): utilization[x3](x2)) >= 0.8
execute
{ "constraints": [ { "arguments": [ { "slot_ref": "slot:min_capacity.target_ratio", "value": { "type": "decimal", "value": "0.8" } } ], "constraint_ref": "constraint:min_capacity", "scope": null, "strength": { ...
v3/base
null
v3/base:routing:c75cbe2fb12ebd3a
routing
en
[ { "role": "user", "content": "Minimize total vehicle fixed operating cost, while preferably keeping every route to at least 8 deliveries." } ]
MINIMIZE( SUM(x0 in routes: fixed_cost(x0)) ) [SOFT] EACH(x1 in routes): delivery_count(x1) >= 8
execute
{ "constraints": [ { "arguments": [ { "slot_ref": "slot:minimum_order.target_order", "value": { "type": "decimal", "value": "8" } } ], "constraint_ref": "constraint:minimum_order", "scope": null, "strength": { ...
v3/base
null
v3/base:routing:f8718f16bb304557
routing
ko
[ { "role": "user", "content": "차량 고정 운영비는 가장 적게 하고, 가능하면 모든 배송 노선에 배송 건수가 최소 8건씩 되게 짜 주세요." } ]
MINIMIZE( SUM(x0 in routes: fixed_cost(x0)) ) [SOFT] EACH(x1 in routes): delivery_count(x1) >= 8
execute
{ "constraints": [ { "arguments": [ { "slot_ref": "slot:minimum_order.target_order", "value": { "type": "decimal", "value": "8" } } ], "constraint_ref": "constraint:minimum_order", "scope": null, "strength": { ...
v3/base
null
v3/base:routing:05dce1befae79b8d
routing
en
[ { "role": "user", "content": "Set the objective to minimize total vehicle fixed cost, with a soft preference that every route has at least 8 deliveries." } ]
MINIMIZE( SUM(x0 in routes: fixed_cost(x0)) ) [SOFT] EACH(x1 in routes): delivery_count(x1) >= 8
execute
{ "constraints": [ { "arguments": [ { "slot_ref": "slot:minimum_order.target_order", "value": { "type": "decimal", "value": "8" } } ], "constraint_ref": "constraint:minimum_order", "scope": null, "strength": { ...
v3/base
null
v3/base:routing:922af24232f40ded
routing
ko
[ { "role": "user", "content": "오늘 운행은 차량 고정비를 최대한 줄이고, 되도록이면 모든 코스가 배송 8건 이상 나오게 해 주세요." } ]
MINIMIZE( SUM(x0 in routes: fixed_cost(x0)) ) [SOFT] EACH(x1 in routes): delivery_count(x1) >= 8
execute
{ "constraints": [ { "arguments": [ { "slot_ref": "slot:minimum_order.target_order", "value": { "type": "decimal", "value": "8" } } ], "constraint_ref": "constraint:minimum_order", "scope": null, "strength": { ...
v3/base
null
v3/base:routing:6a0c3fdbbe90c16a
routing
ko
[ { "role": "user", "content": "전체 노선의 총 연료비를 최소화해 주세요. 가능하면 각 기사별 왕복 횟수와 회차별·전체 정차 수는 해당 기사의 한도 이내로 계획해 주세요." } ]
MINIMIZE( SUM(x0 in routes: fuel_cost(x0)) ) [SOFT] AND( EACH(x1 in routes): EACH(x2 in rounds(x1)): stop_count(x2) <= max_stops_per_round(x1), EACH(x3 in routes): round_count(x3) <= max_rounds(x3), EACH(x4 in routes): stop_count(x4) <= max_stops(x4) )
execute
{ "constraints": [ { "arguments": [ { "slot_ref": "slot:rider_delivery_length.exp_factor", "value": { "type": "decimal", "value": "2" } } ], "constraint_ref": "constraint:rider_delivery_length", "scope": null, "str...
v3/base
null
v3/base:routing:e0fb29591b2fc80a
routing
ko
[ { "role": "user", "content": "오늘 배송은 전체 연료비가 가장 적게 나오게 짜 주세요. 가능하면 기사마다 자기 왕복 횟수 한도, 회차당 정차 한도, 전체 정차 한도를 넘기지 않게 해 주세요." } ]
MINIMIZE( SUM(x0 in routes: fuel_cost(x0)) ) [SOFT] AND( EACH(x1 in routes): EACH(x2 in rounds(x1)): stop_count(x2) <= max_stops_per_round(x1), EACH(x3 in routes): round_count(x3) <= max_rounds(x3), EACH(x4 in routes): stop_count(x4) <= max_stops(x4) )
execute
{ "constraints": [ { "arguments": [ { "slot_ref": "slot:rider_delivery_length.exp_factor", "value": { "type": "decimal", "value": "2" } } ], "constraint_ref": "constraint:rider_delivery_length", "scope": null, "str...
v3/base
null
v3/base:routing:a2069bb0a15dc8fe
routing
ko
[ { "role": "user", "content": "목표는 모든 노선의 총 연료비 최소화입니다. 소프트 제약으로, 각 노선은 해당 기사의 왕복 횟수 한도와 회차별 정차 한도 및 전체 정차 한도를 가능하면 준수해야 합니다." } ]
MINIMIZE( SUM(x0 in routes: fuel_cost(x0)) ) [SOFT] AND( EACH(x1 in routes): EACH(x2 in rounds(x1)): stop_count(x2) <= max_stops_per_round(x1), EACH(x3 in routes): round_count(x3) <= max_rounds(x3), EACH(x4 in routes): stop_count(x4) <= max_stops(x4) )
execute
{ "constraints": [ { "arguments": [ { "slot_ref": "slot:rider_delivery_length.exp_factor", "value": { "type": "decimal", "value": "2" } } ], "constraint_ref": "constraint:rider_delivery_length", "scope": null, "str...
v3/base
null
v3/base:routing:271ee207fcd209e6
routing
en
[ { "role": "user", "content": "Keep total fuel cost across all routes as low as possible. If possible, keep each rider’s number of depot round trips, stops per round trip, and total distinct stops within that rider’s own limits." } ]
MINIMIZE( SUM(x0 in routes: fuel_cost(x0)) ) [SOFT] AND( EACH(x1 in routes): EACH(x2 in rounds(x1)): stop_count(x2) <= max_stops_per_round(x1), EACH(x3 in routes): round_count(x3) <= max_rounds(x3), EACH(x4 in routes): stop_count(x4) <= max_stops(x4) )
execute
{ "constraints": [ { "arguments": [ { "slot_ref": "slot:rider_delivery_length.exp_factor", "value": { "type": "decimal", "value": "2" } } ], "constraint_ref": "constraint:rider_delivery_length", "scope": null, "str...
v3/base
null
v3/base:routing:cd4c7d83b53a6f91
routing
ko
[ { "role": "user", "content": "차량 운영 고정비를 최소화하면서, 같은 주소에 있는 배송지들은 항상 같은 차량이 한 번에 처리하게 해주세요." } ]
MINIMIZE( SUM(x0 in routes: fixed_cost(x0)) ) EACH((x1, x2) in pairs(visits, same_coordinate)): TOGETHER(x1, x2, route)
execute
{ "constraints": [ { "arguments": [ { "slot_ref": "slot:same_coordinate_grouping.exp_factor", "value": { "type": "decimal", "value": "2" } } ], "constraint_ref": "constraint:same_coordinate_grouping", "scope": null, ...
v3/base
null
v3/base:routing:6b47fc08c6001cbc
routing
en
[ { "role": "user", "content": "Our plan must minimize the total fixed operating cost of vehicles across all routes, while every delivery at the same address is always handled by a single route." } ]
MINIMIZE( SUM(x0 in routes: fixed_cost(x0)) ) [HARD] EACH((x1, x2) in pairs(visits, same_coordinate)): TOGETHER(x1, x2, route)
execute
{ "constraints": [ { "arguments": [ { "slot_ref": "slot:same_coordinate_grouping.exp_factor", "value": { "type": "decimal", "value": "2" } } ], "constraint_ref": "constraint:same_coordinate_grouping", "scope": null, ...
v3/base
null
v3/base:routing:7f0cf21443e02403
routing
ko
[ { "role": "user", "content": "전체 경로에서 발생하는 차량 고정비용 합을 최소화하는 게 목표고요, 동일 좌표에 있는 배송지들은 반드시 같은 경로에 배정되도록 하드 제약으로 걸어주세요." } ]
MINIMIZE( SUM(x0 in routes: fixed_cost(x0)) ) [HARD] EACH((x1, x2) in pairs(visits, same_coordinate)): TOGETHER(x1, x2, route)
execute
{ "constraints": [ { "arguments": [ { "slot_ref": "slot:same_coordinate_grouping.exp_factor", "value": { "type": "decimal", "value": "2" } } ], "constraint_ref": "constraint:same_coordinate_grouping", "scope": null, ...
v3/base
null
v3/base:routing:8a6f30c12323c689
routing
en
[ { "role": "user", "content": "We need to cut total vehicle fixed costs across all routes, and any deliveries sharing the same address must always stay together on one route." } ]
MINIMIZE( SUM(x0 in routes: fixed_cost(x0)) ) [HARD] EACH((x1, x2) in pairs(visits, same_coordinate)): TOGETHER(x1, x2, route)
execute
{ "constraints": [ { "arguments": [ { "slot_ref": "slot:same_coordinate_grouping.exp_factor", "value": { "type": "decimal", "value": "2" } } ], "constraint_ref": "constraint:same_coordinate_grouping", "scope": null, ...
v3/base
null
v3/base:routing:7f1cfe7a8240c3e8
routing
ko
[ { "role": "user", "content": "총 연료비를 최소화하세요. 300 m 이내에 있는 모든 배송지 쌍은 반드시 같은 경로로 배정되어야 합니다." } ]
MINIMIZE( SUM(x0 in routes: fuel_cost(x0)) ) [HARD] EACH((x1, x2) in pairs(visits, nearby(300 m))): TOGETHER(x1, x2, route)
execute
{ "constraints": [ { "arguments": [ { "slot_ref": "slot:nearby_delivery_grouping.distance_threshold", "value": { "type": "decimal", "value": "300" } }, { "slot_ref": "slot:nearby_delivery_grouping.exp_factor", ...
v3/base
null
v3/base:routing:d8c26aff277c8e37
routing
ko
[ { "role": "user", "content": "오늘 운행은 연료비가 가장 적게 들게 짜고, 서로 300 m 이내인 배송지 두 곳은 항상 같은 노선에 넣어야 합니다." } ]
MINIMIZE( SUM(x0 in routes: fuel_cost(x0)) ) EACH((x1, x2) in pairs(visits, nearby(300 m))): TOGETHER(x1, x2, route)
execute
{ "constraints": [ { "arguments": [ { "slot_ref": "slot:nearby_delivery_grouping.distance_threshold", "value": { "type": "decimal", "value": "300" } }, { "slot_ref": "slot:nearby_delivery_grouping.exp_factor", ...
v3/base
null
v3/base:routing:63a0626f39dd914d
routing
ko
[ { "role": "user", "content": "목표는 전체 경로의 연료비 합계 최소화입니다. 300 m 이내인 모든 배송지 쌍은 같은 경로로 운행해야 하는 하드 제약으로 적용하세요." } ]
MINIMIZE( SUM(x0 in routes: fuel_cost(x0)) ) [HARD] EACH((x1, x2) in pairs(visits, nearby(300 m))): TOGETHER(x1, x2, route)
execute
{ "constraints": [ { "arguments": [ { "slot_ref": "slot:nearby_delivery_grouping.distance_threshold", "value": { "type": "decimal", "value": "300" } }, { "slot_ref": "slot:nearby_delivery_grouping.exp_factor", ...
v3/base
null
v3/base:routing:0b017857c1652969
routing
ko
[ { "role": "user", "content": "전체 라우트의 연료비를 최소화하되, 거리 300 m 이내의 모든 배송지 쌍은 반드시 동일한 경로에 배정해 주세요." } ]
MINIMIZE( SUM(x0 in routes: fuel_cost(x0)) ) [HARD] EACH((x1, x2) in pairs(visits, nearby(300 m))): TOGETHER(x1, x2, route)
execute
{ "constraints": [ { "arguments": [ { "slot_ref": "slot:nearby_delivery_grouping.distance_threshold", "value": { "type": "decimal", "value": "300" } }, { "slot_ref": "slot:nearby_delivery_grouping.exp_factor", ...
v3/base
null
v3/base:routing:b48ddc932c53ea82
routing
ko
[ { "role": "user", "content": "전체 노선 이동거리 합을 최소화하는 게 목표입니다. 가능하면 각 노선의 이동거리가 해당 기사님의 총 거리 한도를 넘지 않도록 하고, 각 왕복(라운드)의 이동거리도 그 기사님의 왕복별 한도 내에서, 그리고 연속된 정류지 간 이동거리도 그 기사님의 정류지 간 한도를 넘지 않게 최대한 맞춰주세요." } ]
MINIMIZE( SUM(x0 in routes: travel_distance(x0)) ) [SOFT] AND( EACH(x1 in routes): EACH(x2 in adjacent(visit_seq(x1))): travel_distance(x2) <= between_limit(x1), EACH(x3 in routes): EACH(x4 in rounds(x3)): travel_distance(x4) <= trip_limit(x3), EACH(x5 in routes): travel_distance(x5) <= total_limit(x5) )
execute
{ "constraints": [ { "arguments": [ { "slot_ref": "slot:rider_distance.exp_factor", "value": { "type": "decimal", "value": "2" } } ], "constraint_ref": "constraint:rider_distance", "scope": null, "strength": { ...
v3/base
null
v3/base:routing:d8e050ca5b37d679
routing
en
[ { "role": "user", "content": "So the objective here is just minimizing total travel distance summed across all routes. As a soft constraint, try to keep each route's distance within that rider's own total distance limit, keep every round trip within the rider's per-round limit, and keep every consecutive st...
MINIMIZE( SUM(x0 in routes: travel_distance(x0)) ) [SOFT] AND( EACH(x1 in routes): EACH(x2 in adjacent(visit_seq(x1))): travel_distance(x2) <= between_limit(x1), EACH(x3 in routes): EACH(x4 in rounds(x3)): travel_distance(x4) <= trip_limit(x3), EACH(x5 in routes): travel_distance(x5) <= total_limit(x5) )
execute
{ "constraints": [ { "arguments": [ { "slot_ref": "slot:rider_distance.exp_factor", "value": { "type": "decimal", "value": "2" } } ], "constraint_ref": "constraint:rider_distance", "scope": null, "strength": { ...
v3/base
null
v3/base:routing:aba1af794524ab1b
routing
en
[ { "role": "user", "content": "The objective is to minimize the sum of travel distance across all routes. On top of that, apply a soft constraint that, where possible, each route stays within its rider's total distance limit, each round trip within that rider's per-round distance limit, and each consecutive ...
MINIMIZE( SUM(x0 in routes: travel_distance(x0)) ) [SOFT] AND( EACH(x1 in routes): EACH(x2 in adjacent(visit_seq(x1))): travel_distance(x2) <= between_limit(x1), EACH(x3 in routes): EACH(x4 in rounds(x3)): travel_distance(x4) <= trip_limit(x3), EACH(x5 in routes): travel_distance(x5) <= total_limit(x5) )
execute
{ "constraints": [ { "arguments": [ { "slot_ref": "slot:rider_distance.exp_factor", "value": { "type": "decimal", "value": "2" } } ], "constraint_ref": "constraint:rider_distance", "scope": null, "strength": { ...
v3/base
null
v3/base:routing:5da6c5a7ec3d984f
routing
ko
[ { "role": "user", "content": "오늘 전체 노선의 이동거리 총합이 최소가 되도록 짜주세요. 그리고 가능하면 각 노선이 해당 기사의 총 거리 한도를, 각 왕복이 그 기사의 왕복 한도를, 연속된 정류지 간 거리가 그 기사의 정류지 간 한도를 넘지 않도록 신경 써주시고, 무리하게 지키려고 하지 않아도 됩니다." } ]
MINIMIZE( SUM(x0 in routes: travel_distance(x0)) ) [SOFT] AND( EACH(x1 in routes): EACH(x2 in adjacent(visit_seq(x1))): travel_distance(x2) <= between_limit(x1), EACH(x3 in routes): EACH(x4 in rounds(x3)): travel_distance(x4) <= trip_limit(x3), EACH(x5 in routes): travel_distance(x5) <= total_limit(x5) )
execute
{ "constraints": [ { "arguments": [ { "slot_ref": "slot:rider_distance.exp_factor", "value": { "type": "decimal", "value": "2" } } ], "constraint_ref": "constraint:rider_distance", "scope": null, "strength": { ...
v3/base
null
v3/base:routing:5ead1ea5e2ddb5ad
routing
en
[ { "role": "user", "content": "Minimize the total distance for all today’s delivery routes. If possible, keep the number of different delivery zones in each rider’s round trip as low as possible." } ]
MINIMIZE( SUM(x0 in routes: travel_distance(x0)) ) [SOFT] MINIMIZE( SUM(x1 in routes: SUM(x2 in rounds(x1): COUNT_DISTINCT(x3 in visits(x2): zone(x3)))) )
execute
{ "constraints": [ { "arguments": [ { "slot_ref": "slot:rider_route_zone.exp_factor", "value": { "type": "decimal", "value": "2" } } ], "constraint_ref": "constraint:rider_route_zone", "scope": null, "strength": { ...
v3/base
null
v3/base:routing:d71516c213d26a23
routing
mixed
[ { "role": "user", "content": "Objective는 모든 route의 총 이동거리 최소화입니다. Soft preference로, 각 route의 매 round trip에 포함되는 서로 다른 delivery zone 수의 총합도 가능하면 최소화하세요." } ]
MINIMIZE( SUM(x0 in routes: travel_distance(x0)) ) [SOFT] MINIMIZE( SUM(x1 in routes: SUM(x2 in rounds(x1): COUNT_DISTINCT(x3 in visits(x2): zone(x3)))) )
execute
{ "constraints": [ { "arguments": [ { "slot_ref": "slot:rider_route_zone.exp_factor", "value": { "type": "decimal", "value": "2" } } ], "constraint_ref": "constraint:rider_route_zone", "scope": null, "strength": { ...
v3/base
null
v3/base:routing:4e5dce3b7281a490
routing
ko
[ { "role": "user", "content": "전체 배달 경로의 이동거리를 가장 적게 해주세요. 가능하면 각 경로의 왕복 운행마다 포함되는 서로 다른 배달 구역 수도 최대한 줄여주세요." } ]
MINIMIZE( SUM(x0 in routes: travel_distance(x0)) ) [SOFT] MINIMIZE( SUM(x1 in routes: SUM(x2 in rounds(x1): COUNT_DISTINCT(x3 in visits(x2): zone(x3)))) )
execute
{ "constraints": [ { "arguments": [ { "slot_ref": "slot:rider_route_zone.exp_factor", "value": { "type": "decimal", "value": "2" } } ], "constraint_ref": "constraint:rider_route_zone", "scope": null, "strength": { ...
v3/base
null
v3/base:routing:a19101412c3dd13f
routing
ko
[ { "role": "user", "content": "총 이동거리를 최소화하십시오. 가능하면 모든 경로의 각 왕복 운행에서 포함되는 서로 다른 배달 구역 수의 총합도 최소화하십시오." } ]
MINIMIZE( SUM(x0 in routes: travel_distance(x0)) ) [SOFT] MINIMIZE( SUM(x1 in routes: SUM(x2 in rounds(x1): COUNT_DISTINCT(x3 in visits(x2): zone(x3)))) )
execute
{ "constraints": [ { "arguments": [ { "slot_ref": "slot:rider_route_zone.exp_factor", "value": { "type": "decimal", "value": "2" } } ], "constraint_ref": "constraint:rider_route_zone", "scope": null, "strength": { ...
v3/base
null
v3/base:routing:52103ac6d249a1f3
routing
ko
[ { "role": "user", "content": "오늘 모든 배송 경로의 연료비를 가장 적게 나오게 짜고, 가능하면 각 경로는 시간 우선순위가 높은 배송부터 순서대로 들르도록 해주세요." } ]
MINIMIZE( SUM(x0 in routes: fuel_cost(x0)) ) [SOFT] EACH(x1 in routes): ORDERED_BY(visit_seq(x1), time_priority, DESC)
execute
{ "constraints": [ { "arguments": [ { "slot_ref": "slot:time_priority_order.exp_factor", "value": { "type": "decimal", "value": "2" } } ], "constraint_ref": "constraint:time_priority_order", "scope": null, "strengt...
v3/base
null
v3/base:routing:26d3c9ee3379b7f8
routing
ko
[ { "role": "user", "content": "전체 운행의 연료비를 최소화해 주세요. 가능하면 모든 경로의 방문 순서는 시간 우선순위가 높은 건부터 잡아주세요." } ]
MINIMIZE( SUM(x0 in routes: fuel_cost(x0)) ) [SOFT] EACH(x1 in routes): ORDERED_BY(visit_seq(x1), time_priority, DESC)
execute
{ "constraints": [ { "arguments": [ { "slot_ref": "slot:time_priority_order.exp_factor", "value": { "type": "decimal", "value": "2" } } ], "constraint_ref": "constraint:time_priority_order", "scope": null, "strengt...
v3/base
null
v3/base:routing:6b2eb8c3710ce890
routing
ko
[ { "role": "user", "content": "총 연료비를 최소화하되, 가능하면 각 경로는 시간 우선순위 내림차순으로 방문 순서를 구성해 주세요." } ]
MINIMIZE( SUM(x0 in routes: fuel_cost(x0)) ) [SOFT] EACH(x1 in routes): ORDERED_BY(visit_seq(x1), time_priority, DESC)
execute
{ "constraints": [ { "arguments": [ { "slot_ref": "slot:time_priority_order.exp_factor", "value": { "type": "decimal", "value": "2" } } ], "constraint_ref": "constraint:time_priority_order", "scope": null, "strengt...
v3/base
null
v3/base:routing:6c687edf9a93dcc8
routing
ko
[ { "role": "user", "content": "오늘 배차는 전체 연료비가 가장 적게 들게 하고, 되도록 모든 배송 코스에서 시간 우선순위 높은 주문부터 먼저 들르게 해주세요." } ]
MINIMIZE( SUM(x0 in routes: fuel_cost(x0)) ) [SOFT] EACH(x1 in routes): ORDERED_BY(visit_seq(x1), time_priority, DESC)
execute
{ "constraints": [ { "arguments": [ { "slot_ref": "slot:time_priority_order.exp_factor", "value": { "type": "decimal", "value": "2" } } ], "constraint_ref": "constraint:time_priority_order", "scope": null, "strengt...
v3/base
null
v3/base:routing:a494cb4216adfaee
routing
ko
[ { "role": "user", "content": "전체 경로의 이동거리 합을 최소화하는 것이 이번 계획의 목표이며, 가능하다면 모든 배송이 약속된 시간 내에 출발하도록 맞춰주시기 바랍니다." } ]
MINIMIZE( SUM(x0 in routes: travel_distance(x0)) ) EACH(x1 in visits): departure_time(x1) <= tw_late(x1)
execute
{ "constraints": [ { "arguments": [ { "slot_ref": "slot:time_window.exp_factor", "value": { "type": "decimal", "value": "2" } } ], "constraint_ref": "constraint:time_window", "scope": null, "strength": { "k...
v3/base
null
v3/base:routing:2c4c4b1caf918543
routing
mixed
[ { "role": "user", "content": "목표는 전체 route의 total distance를 minimize하는 거고, soft constraint로 각 delivery의 departure time이 tw_late를 넘지 않게 가능하면 맞춰줬으면 좋겠어요." } ]
MINIMIZE( SUM(x0 in routes: travel_distance(x0)) ) [SOFT] EACH(x1 in visits): departure_time(x1) <= tw_late(x1)
execute
{ "constraints": [ { "arguments": [ { "slot_ref": "slot:time_window.exp_factor", "value": { "type": "decimal", "value": "2" } } ], "constraint_ref": "constraint:time_window", "scope": null, "strength": { "k...
v3/base
null
v3/base:routing:79caf6a2221dcac5
routing
ko
[ { "role": "user", "content": "오늘 전체 이동거리를 최대한 줄이는 방향으로 동선 짜주시고, 가능하면 각 배송이 약속한 시간보다 늦게 출발하지 않도록 신경 써주세요." } ]
MINIMIZE( SUM(x0 in routes: travel_distance(x0)) ) [SOFT] EACH(x1 in visits): departure_time(x1) <= tw_late(x1)
execute
{ "constraints": [ { "arguments": [ { "slot_ref": "slot:time_window.exp_factor", "value": { "type": "decimal", "value": "2" } } ], "constraint_ref": "constraint:time_window", "scope": null, "strength": { "k...
v3/base
null
v3/base:routing:bd4212e24257c040
routing
en
[ { "role": "user", "content": "The objective is to minimize total travel distance across all routes. As a soft constraint, try to ensure each delivery's departure time does not exceed its latest allowed time." } ]
MINIMIZE( SUM(x0 in routes: travel_distance(x0)) ) [SOFT] EACH(x1 in visits): departure_time(x1) <= tw_late(x1)
execute
{ "constraints": [ { "arguments": [ { "slot_ref": "slot:time_window.exp_factor", "value": { "type": "decimal", "value": "2" } } ], "constraint_ref": "constraint:time_window", "scope": null, "strength": { "k...
v3/base
null
v3/hole-scope:routing:d8a9ea575e0180c6
routing
ko
[ { "role": "user", "content": "총 이동거리를 최소화하되, 가능하면 배송 건수는 15 이하로 맞춰 주세요." } ]
MINIMIZE( SUM(x0 in routes: travel_distance(x0)) ) [SOFT] EACH(x1 in HOLE(scope)): delivery_count(x1) <= 15
clarify
{ "candidate_refs": [ "constraint:delivery_length" ], "kind": "clarify", "missing_field_refs": [], "reason_code": "ambiguous_capability", "required_inputs": [] }
v3/hole-scope
null
v3/hole-scope:routing:17bcf03bde16b15a
routing
ko
[ { "role": "user", "content": "오늘 배차는 전체 이동거리부터 줄이고, 가능하면 배송은 15건 이하로 해주세요." } ]
MINIMIZE( SUM(x0 in routes: travel_distance(x0)) ) [SOFT] EACH(x1 in HOLE(scope)): delivery_count(x1) <= 15
clarify
{ "candidate_refs": [ "constraint:delivery_length" ], "kind": "clarify", "missing_field_refs": [], "reason_code": "ambiguous_capability", "required_inputs": [] }
v3/hole-scope
null
v3/hole-scope:routing:f5456d44f8f2c0a8
routing
ko
[ { "role": "user", "content": "목표는 모든 경로의 총 이동거리 최소화입니다. 배송 건수는 가능하면 15 이하로 제한하는 소프트 조건을 적용해 주세요." } ]
MINIMIZE( SUM(x0 in routes: travel_distance(x0)) ) [SOFT] EACH(x1 in HOLE(scope)): delivery_count(x1) <= 15
clarify
{ "candidate_refs": [ "constraint:delivery_length" ], "kind": "clarify", "missing_field_refs": [], "reason_code": "ambiguous_capability", "required_inputs": [] }
v3/hole-scope
null
v3/hole-scope:routing:e78404b31353103a
routing
ko
[ { "role": "user", "content": "전체 이동거리를 가장 적게 잡아 주세요. 가능하면 배송은 15건 이하로 운영합시다." } ]
MINIMIZE( SUM(x0 in routes: travel_distance(x0)) ) [SOFT] EACH(x1 in HOLE(scope)): delivery_count(x1) <= 15
clarify
{ "candidate_refs": [ "constraint:delivery_length" ], "kind": "clarify", "missing_field_refs": [], "reason_code": "ambiguous_capability", "required_inputs": [] }
v3/hole-scope
null
v3/hole-measure:routing:995587a7aca1c257
routing
en
[ { "role": "user", "content": "Our main goal is to cut the fixed cost of running our vehicles as low as we can, and if it works out, we'd like each route's stops to stay clustered within about a 5 km radius instead of spreading out." } ]
MINIMIZE( SUM(x0 in routes: fixed_cost(x0)) ) [SOFT] EACH(x1 in routes): sec_radius(x1) <= 5 km
execute
{ "constraints": [ { "arguments": [ { "slot_ref": "slot:enclosing_circle_radius.exp_factor", "value": { "type": "decimal", "value": "2" } }, { "slot_ref": "slot:enclosing_circle_radius.max_radius", "value": { ...
v3/hole-measure
null
v3/hole-measure:routing:55f35884b47d8a54
routing
ko
[ { "role": "user", "content": "오늘 배차할 때 차량 고정비용을 최대한 줄이는 걸 목표로 잡아주세요. 그리고 가능하면 각 경로에 있는 정류지들이 5km 반경 안에 모이도록 해주시면 좋겠어요, 너무 넓게 흩어지지 않게요." } ]
MINIMIZE( SUM(x0 in routes: fixed_cost(x0)) ) [SOFT] EACH(x1 in routes): sec_radius(x1) <= 5 km
execute
{ "constraints": [ { "arguments": [ { "slot_ref": "slot:enclosing_circle_radius.exp_factor", "value": { "type": "decimal", "value": "2" } }, { "slot_ref": "slot:enclosing_circle_radius.max_radius", "value": { ...
v3/hole-measure
null
v3/hole-measure:routing:f1caaa4d4b652e16
routing
en
[ { "role": "user", "content": "Let's try to bring the fixed cost of running the vehicles down as much as we can today. And if possible, keep each route's stops within a 5 km radius so they're not scattered all over the place." } ]
MINIMIZE( SUM(x0 in routes: fixed_cost(x0)) ) [SOFT] EACH(x1 in routes): sec_radius(x1) <= 5 km
execute
{ "constraints": [ { "arguments": [ { "slot_ref": "slot:enclosing_circle_radius.exp_factor", "value": { "type": "decimal", "value": "2" } }, { "slot_ref": "slot:enclosing_circle_radius.max_radius", "value": { ...
v3/hole-measure
null
v3/hole-measure:routing:978e01337e29a1d1
routing
en
[ { "role": "user", "content": "The objective is to minimize total vehicle fixed operating cost across all routes. As a soft constraint, each route's stops should ideally fit within a 5 km enclosing radius, though this isn't mandatory." } ]
MINIMIZE( SUM(x0 in routes: fixed_cost(x0)) ) [SOFT] EACH(x1 in routes): sec_radius(x1) <= 5 km
execute
{ "constraints": [ { "arguments": [ { "slot_ref": "slot:enclosing_circle_radius.exp_factor", "value": { "type": "decimal", "value": "2" } }, { "slot_ref": "slot:enclosing_circle_radius.max_radius", "value": { ...
v3/hole-measure
null
v3/hole-measure:routing:5a924c7469b65f68
routing
ko
[ { "role": "user", "content": "오늘 모든 배송 코스의 총비용이 가장 적게 나오게 짜주세요." } ]
MINIMIZE( SUM(x0 in routes: HOLE(measure, cost, x0)) )
clarify
{ "candidate_refs": [ "objective:fixed_cost", "objective:fuel_cost" ], "kind": "clarify", "missing_field_refs": [], "reason_code": "ambiguous_capability", "required_inputs": [] }
v3/hole-measure
ep:e638bee36340fba9
v3/hole-measure:routing:971e5fa1a9b406ef
routing
mixed
[ { "role": "user", "content": "오늘 모든 배송 코스의 총비용이 가장 적게 나오게 짜주세요." }, { "role": "assistant", "content": "말씀하신 내용은 여러 가지로 읽혀요. 차량 고정 비용, 연료비 중 어느 쪽인가요?" }, { "role": "user", "content": "Keep the total fuel cost as low as possible across all routes." } ]
MINIMIZE( SUM(x0 in routes: fuel_cost(x0)) )
execute
{ "constraints": [], "data_binding": { "overrides": [], "selections": [] }, "kind": "execute", "objectives": { "method": "weighted_sum", "terms": [ { "objective_ref": "objective:fuel_cost", "weight": "1/1" } ] }, "parameters": [] }
v3/hole-measure
ep:e638bee36340fba9
v3/hole-measure:routing:56687e74a1435ecc
routing
mixed
[ { "role": "user", "content": "모든 route의 총 cost를 최소화해 주세요." } ]
MINIMIZE( SUM(x0 in routes: HOLE(measure, cost, x0)) )
clarify
{ "candidate_refs": [ "objective:fixed_cost", "objective:fuel_cost" ], "kind": "clarify", "missing_field_refs": [], "reason_code": "ambiguous_capability", "required_inputs": [] }
v3/hole-measure
ep:81bbf1315708dc99
v3/hole-measure:routing:edf29345e009f8a8
routing
mixed
[ { "role": "user", "content": "모든 route의 총 cost를 최소화해 주세요." }, { "role": "assistant", "content": "말씀하신 내용은 여러 가지로 읽혀요. 차량 고정 비용, 연료비 중 어느 쪽인가요?" }, { "role": "user", "content": "Minimize total fuel cost across all routes." } ]
MINIMIZE( SUM(x0 in routes: fuel_cost(x0)) )
execute
{ "constraints": [], "data_binding": { "overrides": [], "selections": [] }, "kind": "execute", "objectives": { "method": "weighted_sum", "terms": [ { "objective_ref": "objective:fuel_cost", "weight": "1/1" } ] }, "parameters": [] }
v3/hole-measure
ep:81bbf1315708dc99
v3/hole-measure:routing:5538ac7e5e1daee4
routing
en
[ { "role": "user", "content": "Plan the routes to keep total route costs as low as possible." } ]
MINIMIZE( SUM(x0 in routes: HOLE(measure, cost, x0)) )
clarify
{ "candidate_refs": [ "objective:fixed_cost", "objective:fuel_cost" ], "kind": "clarify", "missing_field_refs": [], "reason_code": "ambiguous_capability", "required_inputs": [] }
v3/hole-measure
ep:9a22c77ca38788f7
v3/hole-measure:routing:ef3df14512349914
routing
mixed
[ { "role": "user", "content": "Plan the routes to keep total route costs as low as possible." }, { "role": "assistant", "content": "That could mean more than one thing: Vehicle Fixed Cost, Fuel Cost. Which one do you mean?" }, { "role": "user", "content": "오늘 모든 배송 경로의 연료비가 가장 적게 들게 짜...
MINIMIZE( SUM(x0 in routes: fuel_cost(x0)) )
execute
{ "constraints": [], "data_binding": { "overrides": [], "selections": [] }, "kind": "execute", "objectives": { "method": "weighted_sum", "terms": [ { "objective_ref": "objective:fuel_cost", "weight": "1/1" } ] }, "parameters": [] }
v3/hole-measure
ep:9a22c77ca38788f7
v3/hole-measure:routing:6129ea8162566409
routing
en
[ { "role": "user", "content": "For this run, I just want the objective set so we minimize the sum of the cost across all the routes, without pinning down yet whether that's the fixed cost or the fuel cost." } ]
MINIMIZE( SUM(x0 in routes: HOLE(measure, cost, x0)) )
clarify
{ "candidate_refs": [ "objective:fixed_cost", "objective:fuel_cost" ], "kind": "clarify", "missing_field_refs": [], "reason_code": "ambiguous_capability", "required_inputs": [] }
v3/hole-measure
ep:963a3a41d0f116d3
v3/hole-measure:routing:97f54ddc176c57cc
routing
en
[ { "role": "user", "content": "For this run, I just want the objective set so we minimize the sum of the cost across all the routes, without pinning down yet whether that's the fixed cost or the fuel cost." }, { "role": "assistant", "content": "That could mean more than one thing: Vehicle Fixed C...
MINIMIZE( SUM(x0 in routes: fuel_cost(x0)) )
execute
{ "constraints": [], "data_binding": { "overrides": [], "selections": [] }, "kind": "execute", "objectives": { "method": "weighted_sum", "terms": [ { "objective_ref": "objective:fuel_cost", "weight": "1/1" } ] }, "parameters": [] }
v3/hole-measure
ep:963a3a41d0f116d3
v3/hole-measure:routing:525547ffae64791c
routing
ko
[ { "role": "user", "content": "모든 경로에 대해서 비용 합계를 최소로 만들어야 해요, 구체적으로 어떤 비용인지는 아직 말 안 할게요." } ]
MINIMIZE( SUM(x0 in routes: HOLE(measure, cost, x0)) )
clarify
{ "candidate_refs": [ "objective:fixed_cost", "objective:fuel_cost" ], "kind": "clarify", "missing_field_refs": [], "reason_code": "ambiguous_capability", "required_inputs": [] }
v3/hole-measure
ep:b511c7e5fa61dd65
v3/hole-measure:routing:942544023eb654dd
routing
ko
[ { "role": "user", "content": "모든 경로에 대해서 비용 합계를 최소로 만들어야 해요, 구체적으로 어떤 비용인지는 아직 말 안 할게요." }, { "role": "assistant", "content": "말씀하신 내용은 여러 가지로 읽혀요. 차량 고정 비용, 연료비 중 어느 쪽인가요?" }, { "role": "user", "content": "고정비 말고, 전체 경로에서 드는 총 연료비만 최소화하는 쪽으로 잡아주세요." } ]
MINIMIZE( SUM(x0 in routes: fuel_cost(x0)) )
execute
{ "constraints": [], "data_binding": { "overrides": [], "selections": [] }, "kind": "execute", "objectives": { "method": "weighted_sum", "terms": [ { "objective_ref": "objective:fuel_cost", "weight": "1/1" } ] }, "parameters": [] }
v3/hole-measure
ep:b511c7e5fa61dd65
v3/hole-measure:routing:47cfcdf570314e11
routing
ko
[ { "role": "user", "content": "전체 경로에 대한 차량 고정 운영비 총합을 최소화하는 것이 이번 계획의 목표입니다. 추가로 소프트 제약 성격으로, 각 경로의 회전마다 방문지들을 감싸는 회전 반경이 가능하면 3km를 넘지 않도록 해주시면 좋겠습니다. 다만 이는 반드시 지켜야 하는 하드 제약은 아닙니다." } ]
MINIMIZE( SUM(x0 in routes: fixed_cost(x0)) ) [SOFT] EACH(x1 in routes): EACH(x2 in rounds(x1)): sec_radius(x2) <= 3 km
execute
{ "constraints": [ { "arguments": [ { "slot_ref": "slot:round_enclosing_circle_radius.exp_factor", "value": { "type": "decimal", "value": "2" } }, { "slot_ref": "slot:round_enclosing_circle_radius.max_radius", ...
v3/hole-measure
null
v3/hole-measure:routing:d7d4d116f42c2791
routing
en
[ { "role": "user", "content": "Build the routes so that the total fixed cost of the vehicles used across every route is as low as possible. On top of that, for every round trip within every route, please try to keep the stops within a 3 km round radius if it's at all workable - it's just a preference, not so...
MINIMIZE( SUM(x0 in routes: fixed_cost(x0)) ) [SOFT] EACH(x1 in routes): EACH(x2 in rounds(x1)): sec_radius(x2) <= 3 km
execute
{ "constraints": [ { "arguments": [ { "slot_ref": "slot:round_enclosing_circle_radius.exp_factor", "value": { "type": "decimal", "value": "2" } }, { "slot_ref": "slot:round_enclosing_circle_radius.max_radius", ...
v3/hole-measure
null
v3/hole-measure:routing:dd6e24be3e6f6d32
routing
ko
[ { "role": "user", "content": "오늘 경로들 전체 고정비용 합계를 최대한 낮게 짜주세요. 그리고 각 경로의 회전마다 도는 반경이 가능하면 3km 안쪽으로 들어오게 해주면 좋겠는데, 이건 꼭 지켜야 하는 건 아니고 그냥 되면 그렇게 해달라는 거예요." } ]
MINIMIZE( SUM(x0 in routes: fixed_cost(x0)) ) [SOFT] EACH(x1 in routes): EACH(x2 in rounds(x1)): sec_radius(x2) <= 3 km
execute
{ "constraints": [ { "arguments": [ { "slot_ref": "slot:round_enclosing_circle_radius.exp_factor", "value": { "type": "decimal", "value": "2" } }, { "slot_ref": "slot:round_enclosing_circle_radius.max_radius", ...
v3/hole-measure
null
v3/hole-measure:routing:9fffd6590c2c3c39
routing
en
[ { "role": "user", "content": "We need to bring down the total fixed cost of the vehicles running across all our routes. Ideally, each route's round trips should also stay within a 3 km radius, but that's a nice-to-have, not a strict requirement." } ]
MINIMIZE( SUM(x0 in routes: fixed_cost(x0)) ) [SOFT] EACH(x1 in routes): EACH(x2 in rounds(x1)): sec_radius(x2) <= 3 km
execute
{ "constraints": [ { "arguments": [ { "slot_ref": "slot:round_enclosing_circle_radius.exp_factor", "value": { "type": "decimal", "value": "2" } }, { "slot_ref": "slot:round_enclosing_circle_radius.max_radius", ...
v3/hole-measure
null
v3/hole-measure:routing:c775ef0d892ccd23
routing
en
[ { "role": "user", "content": "Plan today's rounds to minimize the total distance driven across all riders, and if possible try to keep each rider's route under 80 km." } ]
MINIMIZE( SUM(x0 in routes: travel_distance(x0)) ) [SOFT] EACH(x1 in routes): travel_distance(x1) < 80 km
unsupported
{ "kind": "unsupported", "reason_code": "semantic_not_declared", "related_refs": [] }
v3/hole-measure
null
v3/hole-measure:routing:5128597d285e7470
routing
ko
[ { "role": "user", "content": "전체 배송 경로의 총 이동거리를 최소화해 주시고, 가능하면 각 경로는 80km 이내로 유지되도록 해주세요." } ]
MINIMIZE( SUM(x0 in routes: travel_distance(x0)) ) [SOFT] EACH(x1 in routes): travel_distance(x1) <= 80 km
execute
{ "constraints": [ { "arguments": [ { "slot_ref": "slot:max_distance.exp_factor", "value": { "type": "decimal", "value": "1" } }, { "slot_ref": "slot:max_distance.max_distance", "value": { "type": "...
v3/hole-measure
null
v3/hole-measure:routing:4072b28a403a5307
routing
ko
[ { "role": "user", "content": "오늘 전체 동선 이동거리 최소화해서 짜줘. 그리고 되도록이면 한 사람당 도는 거리는 80km 안 넘게 해줘." } ]
MINIMIZE( SUM(x0 in routes: travel_distance(x0)) ) [SOFT] EACH(x1 in routes): travel_distance(x1) <= 80 km
execute
{ "constraints": [ { "arguments": [ { "slot_ref": "slot:max_distance.exp_factor", "value": { "type": "decimal", "value": "1" } }, { "slot_ref": "slot:max_distance.max_distance", "value": { "type": "...
v3/hole-measure
null
v3/hole-measure:routing:483426109125d6c1
routing
en
[ { "role": "user", "content": "I want our overall travel distance minimized, and ideally no route should go past 80 km." } ]
MINIMIZE( SUM(x0 in routes: travel_distance(x0)) ) [SOFT] EACH(x1 in routes): travel_distance(x1) <= 80 km
execute
{ "constraints": [ { "arguments": [ { "slot_ref": "slot:max_distance.exp_factor", "value": { "type": "decimal", "value": "1" } }, { "slot_ref": "slot:max_distance.max_distance", "value": { "type": "...
v3/hole-measure
null
v3/hole-scope:routing:d6f46cd11ac6a1de
routing
en
[ { "role": "user", "content": "Minimize the total fixed operating cost for the vehicles used. If possible, keep travel distance to 80 km or less." } ]
MINIMIZE( SUM(x0 in routes: fixed_cost(x0)) ) [SOFT] EACH(x1 in HOLE(scope)): travel_distance(x1) <= 80 km
clarify
{ "candidate_refs": [ "constraint:max_distance" ], "kind": "clarify", "missing_field_refs": [], "reason_code": "ambiguous_capability", "required_inputs": [] }
v3/hole-scope
null
v3/hole-scope:routing:769ef633598c7d5a
routing
ko
[ { "role": "user", "content": "차량 운영 고정비는 최대한 줄이고, 가능하면 이동거리는 80km 이내로 잡아 주세요." } ]
MINIMIZE( SUM(x0 in routes: fixed_cost(x0)) ) [SOFT] EACH(x1 in HOLE(scope)): travel_distance(x1) <= 80 km
clarify
{ "candidate_refs": [ "constraint:max_distance" ], "kind": "clarify", "missing_field_refs": [], "reason_code": "ambiguous_capability", "required_inputs": [] }
v3/hole-scope
null
End of preview. Expand in Data Studio

OptiLIR-Instruct-v1

Each row pairs a user's optimization request with its IR in OptiLIR (Optimization-oriented Language Intermediate Representation; see Terms), a short line-based text that states the objectives and constraints of the request over a fixed domain vocabulary. Requests are in Korean, English, or a mix of the two. Most are a single user turn; some are three turns, where the user answers a clarification question that the system asked about the first turn.

A parser model reads the conversation and writes the IR. A deterministic grounder then maps the IR onto the capabilities that the optimization server declares and returns one of three decisions:

  • execute: the request maps onto declared objectives and constraints (refs with strengths, weights and values);
  • clarify: the system must ask the user, because the IR has a hole, names a quantity without its aggregation, has no objective, does not determine what to optimize (CLARIFY(intent)), or names a way of combining objectives that the server does not offer;
  • unsupported: the request is declined, because it has no optimization intent, needs a meaning the server does not declare, or needs a declared capability that cannot run here (input data the server does not supply, a configuration it does not realize, a strict priority order between objectives).

The model only writes what the user meant. Whether the request can be executed is decided by the grounder, not by the model, so the IR must stay faithful even when the meaning is unsupported. The grounder is not part of this dataset; gold_decision records its output for each row. Code (the IR parser and grammar, the grounder, training and evaluation): omelet-ai/OptiLIR. Adapters trained on this dataset: omelet-ai/OptiLIR-Qwen3-8B and omelet-ai/OptiLIR-Gemma-4-12B.

The dataset has 14,212 rows in three domains: vehicle routing (routing), nurse scheduling (nurse) and retail inventory (retail).

Task

  • Input: the system prompt of the row's domain (prompts/<domain>.txt), followed by messages.
  • Output: the ir string and nothing else.

The system prompt contains a summary of the IR grammar, the domain vocabulary (populations, measures, accessors, units) and the capability forms, that is, how the server writes each declared objective and constraint. The released adapters were trained and evaluated with these prompts, their vocabulary listing shuffled per row and seeded by the row id (system_prompt(domain, seed=id, forms=True) in the code repository); at inference, use the files unchanged. grammar/<domain>.ebnf is an EBNF (xgrammar / GBNF style) for the domain's IR; it can be used for grammar-constrained decoding.

registry.json is the registry that produced gold_decision, with binding.projections and binding.required_paths left empty in every domain (neither grounding nor scoring reads them). With EXECUTION_LLM_REGISTRY set to its path, decide in the code repository reproduces each row's gold_decision from its gold IR and user turns, and scripts/evaluate.py also reports decision match:

export EXECUTION_LLM_REGISTRY="$(python -c 'from huggingface_hub import hf_hub_download
print(hf_hub_download("omelet-ai/OptiLIR-Instruct-v1", "registry.json", repo_type="dataset"))')"

IR format

One item per line. Objective and constraint lines are frames; the COMPOSE line, UNEXPRESSED lines and the whole-output answers are not:

  • objective frames: MINIMIZE( term ) or MAXIMIZE( term ). The term usually aggregates a measure over a population, for example SUM(x0 in routes: travel_distance(x0)); some objectives are a bare measure, for example the retail MAXIMIZE( profit );
  • constraint frames: EACH(x in P): body, AND( ... ) over several comparisons, a bare comparison such as the vehicle count COUNT(x1 in routes) <= 6, or HOLE(constraint, family) (a rule named only loosely);
  • marks: [HARD] (the user made it mandatory) or [SOFT] (the user made it preferential) at the start of a frame, and no mark when the user did not say. Marks are mostly on constraint frames, but in routing four capabilities that the server declares as constraints are written as MINIMIZE frames (priority-weighted arrival, the zone count and two region preferences), and those frames can take marks too;
  • a COMPOSE(...) line (weighted_sum, lexicographic or product) when the user states how several objectives combine;
  • holes for what the user left open: HOLE(value) (a bound without a number), HOLE(measure, family, x) (an unresolved quantity), EACH(x in HOLE(scope)) (an unstated per-unit scope), HOLE(constraint, family) (see above) and UNSPECIFIED(x in P: m(x)) (a quantity named without its aggregation). A family is a group of measures or rules listed in the prompt. Every row with a hole is clarify;
  • UNDECIDED in place of a bound's value that the user has not decided yet. The prompt lists it with the holes, but it is not asked about: the grounder leaves the bound out and grounds the rest, with a notice (138 of the 139 such rows execute);
  • UNEXPRESSED(class, side) in place of a stated requirement that the grammar cannot express (class condition, relative, literal for a clock time or date, or other; side objective or constraint);
  • whole-output answers: NO_INTENT (no optimization request, for example a status question) and CLARIFY(intent) (an optimization request whose objective the conversation does not determine).

Bound variables are written x0, x1, ... in order of first binding across the frames.

Terms

  • OptiLIR (Optimization-oriented Language Intermediate Representation): the line-based language the parser model writes, used both for the capability forms in the prompt and for the model's output. The system prompt and the code (execution_llm.tier2) use its earlier name, Tier-2 IR; tier 1 was a flat record per capability (measure, aggregation, direction or comparator, unit) and is not part of this release. Below, "IR" means OptiLIR.
  • Frame: one objective line (MINIMIZE(...), MAXIMIZE(...)) or one constraint line (EACH(...), AND(...), a bare comparison such as a vehicle count, or HOLE(constraint, family)). COMPOSE, UNEXPRESSED, NO_INTENT and CLARIFY(intent) lines are not frames; the prompt's "one frame per line" means one item per line. The form a frame matches decides which capability it grounds to, not its first word: in routing, four capabilities the server declares as constraints are written as MINIMIZE frames.
  • Mark: [HARD] (mandatory) or [SOFT] (preferential) at the start of a frame, written only when the user says so; otherwise the server's default applies. The code calls it hardness; decisions call it strength.
  • COMPOSE line: how several objectives combine (weighted_sum, lexicographic, product). Without one, the server's default applies.
  • Hole: a marker for something the user left unstated, so that the parser never guesses: HOLE(value), HOLE(measure, family, x), HOLE(scope), HOLE(constraint, family), and UNSPECIFIED(...) (a quantity named without its aggregation). A family is a group of measures or rules listed in the prompt. A hole leads to clarify. The prompt's "Holes" heading also lists UNDECIDED, which behaves differently.
  • UNDECIDED: a bound the user wants but has not set a value for yet. The system does not ask: the bound is left out, the rest is grounded as usual, and a notice says so.
  • UNEXPRESSED(class, side): a clear requirement that the IR cannot express (class: what kind, such as a literal clock time or date). The request is unsupported, unless another line needs a clarification, which is asked first.
  • NO_INTENT / CLARIFY(intent): the whole output when there is no optimization request / when it does not determine what to optimize.
  • Vocabulary: the domain names the prompt lists: populations (sets such as routes), measures (quantities such as travel_distance), accessors (per-item data such as capacity) and units. "Sort" there means value type. In code, a domain's vocabulary and capability forms together are its surface (execution_llm.tier2.domains.SURFACES).
  • Capability: an objective or constraint the server declares. Its capability form is how it is written in IR, as listed in the prompt (class Signature in the code). Its ref is its id in decisions, such as objective:distance_cost. Refs never appear in the IR, and their names can differ from the IR's names.
  • Slot: a value a capability takes, such as the 80 km of a distance limit; written $name in a capability form. The registry declares each slot's type, unit, default and bounds (its value policy).
  • Deferred: a declared capability whose input data the server does not supply; a request for it is declined with required_primitive_absent.
  • Server, registry: the optimization service of a domain, and the JSON file that lists what it declares. The registry behind gold_decision is registry.json in this repository; decisions follow whichever registry you supply.
  • Grounder: the deterministic code (execution_llm.grounding) that turns an IR into one decision against a registry.
  • Decision: execute (run with these refs and values), clarify (ask the user) or unsupported (decline). Clarify and unsupported decisions carry a reason code; together they are called abstentions.
  • Fleet: a stated vehicle count is returned beside the decision (fleet), not in it.
  • Gold: a row's reference label: the gold IR (ir) and the gold decision (gold_decision: what decide returns for the gold IR and the row's user turns).
  • Stratum: the recipe that produced a row. It records where the row came from, not its outcome.
  • Held-out capability: upper bounds on route duration. Its form is in the prompt, but no training row uses it; the held-out test subset does (928 rows; 822 of them name constraint:max_duration in gold_decision).
  • Capability forms in the prompt (forms=True): system_prompt(domain, forms=True) includes the capability forms, and the adapters were trained with it (each training row with its own shuffled order, seed=<row id>). The default, forms=False, leaves the forms out.
  • Parse rate, IR match, decision match: the output is accepted by the IR parser; it equals the gold IR once both are in normal form; its grounded decision equals the gold decision.
  • Normal form: values in base units (80 km = 80000 m); the quantity on the left of a comparison; an upper bound on a MAX (or a lower bound on a MIN) written as the same bound under EACH; AND items flattened, sorted and deduplicated; TOGETHER/OVERLAPS arguments and EACH chains in a fixed order; binders renumbered. For an IR match, frames must come in the same order with the same marks; COMPOSE, NO_INTENT and CLARIFY(intent) lines must agree; UNEXPRESSED lines are compared regardless of order.

Examples

Three rows from this release, one per decision kind.

Example 1: execute (routing, ko, stratum v4/vehicle)

user: 총 운행시간 최소화 부탁드립니다. 차량은 반드시 6대 이하입니다

IR:

MINIMIZE( SUM(x0 in routes: duration(x0)) )
[HARD] COUNT(x1 in routes) <= 6

Gold decision:

{"constraints": [], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:duration_cost", "weight": "1/1"}]}, "parameters": []}

Example 2: clarify (nurse, mixed, stratum 3.2/1)

user: Nurses’ preferences를 우선 반영하되, 근무시간에 대한 필수 규정은 꼭 맞춰 주세요.

IR:

MAXIMIZE( SUM(x0 in assignments: preference_score(x0)) )
[HARD] HOLE(constraint, hours)

Gold decision:

{"candidate_refs": ["constraint:max_hours_per_week", "constraint:min_rest_hours"], "kind": "clarify", "missing_field_refs": [], "reason_code": "ambiguous_capability", "required_inputs": []}

Example 3: unsupported (retail, en, stratum v4/residual)

user: Reduce waste by 30% compared with last month

IR:

UNEXPRESSED(relative, objective)

Gold decision:

{"kind": "unsupported", "reason_code": "semantic_not_declared", "related_refs": []}

A stated vehicle count, as in Example 1, is returned beside the decision (fleet), not in it, so that row's constraints list is empty.

Data fields

Field Type Description
id string Row id from the source corpus (<stratum>:<domain>:<hash>; the 66 hand-written clarify-contrast rows use clarify-20260916:<group>:<case>, a topic group and a case within it; the date is when they were written).
domain string routing, nurse or retail.
language string ko, en or mixed, computed from the user turns: mixed when they contain both Hangul words and Latin-script words (unit symbols such as km and h are ignored).
messages list of {role, content} The conversation, ending with a user turn. An assistant turn, when present, is the system's clarification question. The system prompt is not included.
ir string The target output: the gold IR.
decision_kind string execute, clarify or unsupported (equal to gold_decision.kind).
gold_decision object The decision that the grounder's decide returns for the gold IR and the row's user turns. execute: objectives (method and weighted terms), constraints (ref, strength, arguments), parameters, data_binding. clarify: reason_code, candidate_refs, required_inputs, missing_field_refs. unsupported: reason_code, related_refs. Constraints also carry declared defaults that the IR never states: exp_factor, a penalty parameter of routing constraints (11,895 arguments in 7,131 rows, on hard and soft constraints alike), and the weight of a soft constraint (1, except 100 for nurse constraint:max_consecutive_days). Refs are the server's ids and can differ from the IR's names: the objective over travel_distance is objective:distance_cost, a per-route bound on sec_radius is constraint:enclosing_circle_radius, delivery_count(x) <= $max_size is constraint:delivery_length, and the MINIMIZE frame over priority_weighted_arrival is the constraint constraint:delivery_time_priority.
stratum string The recipe that produced the row (see Rows by stratum). It records provenance, not the outcome: 183 of the 226 v3/hole-measure rows execute.
episode_id string or null Links the rows of one clarification episode: the first turn alone and the full three-turn conversation. 95 of the 110 ids have both rows; 15 have only one (14 a first turn, 1 a three-turn conversation). Null otherwise, also for the 30 hand-written three-turn clarify-contrast rows, which have no first-turn row. Keep rows with the same episode_id in the same split.

To build a training example, put the domain prompt first and the IR last:

from datasets import load_dataset
from huggingface_hub import hf_hub_download

REPO = "omelet-ai/OptiLIR-Instruct-v1"
ds = load_dataset(REPO)
prompts = {d: open(hf_hub_download(REPO, f"prompts/{d}.txt", repo_type="dataset"), encoding="utf-8").read()
           for d in ("routing", "nurse", "retail")}

def to_prompt_completion(row):
    return {"prompt": [{"role": "system", "content": prompts[row["domain"]]}] + row["messages"],
            "completion": [{"role": "assistant", "content": row["ir"]}]}

train = ds["train"].map(to_prompt_completion)

The snippet uses the prompts as published. The released adapters were trained with the vocabulary listing shuffled per row; scripts/train_lora.py in the code repository does this with SHUFFLE=1.

Splits

Source splits were mapped to release splits as follows:

Source split Release split Rows
dev validation 880
held-out capability test 928
test test 988
train train 11416
  • validation: distinct IRs shared with train: 0 of 256; refs in its gold decisions that never occur in train: none.
  • test: distinct IRs shared with train: 3 of 557; refs in its gold decisions that never occur in train: constraint:max_duration.
  • Clarification episodes split across splits: 0.

The 66 hand-written clarify-contrast rows were split by case, not by topic group. Three topic groups (routing_time, nurse_fairness and nurse_rule) have rows in both train and test, and in each of them one opening request occurs in both splits: alone or with a continuation in one split, with another continuation in the other.

Rows by domain

Domain train validation test total
nurse 2045 131 269 2445
retail 1852 165 168 2185
routing 7519 584 1479 9582

Rows by language

Language train validation test total
en 2783 243 439 3465
ko 7085 529 1243 8857
mixed 1548 108 234 1890

Rows by decision kind

Decision kind train validation test total
clarify 810 69 182 1061
execute 9610 771 1558 11939
unsupported 996 40 176 1212

Rows by reason code

Reason code train validation test total
(execute) 9610 771 1558 11939
ambiguous_capability 379 45 118 542
composition_choice_required 50 0 0 50
missing_value 381 24 64 469
realization_absent 87 2 0 89
request_out_of_scope 53 0 3 56
required_primitive_absent 188 0 0 188
semantic_not_declared 648 38 173 859
unsupported_composition 20 0 0 20
  • (execute): execute rows, which have no reason code.
  • ambiguous_capability (clarify): the IR leaves open which capability is meant: a measure, scope or constraint hole, UNSPECIFIED, or CLARIFY(intent). candidate_refs lists the options, even when there is only one. It is empty for CLARIFY(intent) (4 rows) and for UNSPECIFIED over routing duration, for which the server declares no candidate (76 rows).
  • missing_value (clarify): a needed value is missing: a HOLE(value) on a required slot (34 rows; required_inputs names the slot), or no objective at all (435 rows; required_inputs names the objectives field).
  • composition_choice_required (clarify): the user named a way of combining objectives that the server does not offer (COMPOSE(product)).
  • semantic_not_declared (unsupported): a meaning the server does not declare, including every UNEXPRESSED line (207 rows).
  • realization_absent (unsupported): a related capability is declared (related_refs), but not this configuration, for example an upper bound on rest between shifts, where the server declares only a minimum.
  • required_primitive_absent (unsupported): the capability is declared, but it needs input data that the server does not supply, such as cost tables or regions.
  • request_out_of_scope (unsupported): NO_INTENT.
  • unsupported_composition (unsupported): a strict priority order between objectives ("first A, then B, no trade-off").

The schema defines more clarify codes (ambiguous_scope, missing_composition, unit_ambiguity, data_shortage, hardness_ambiguity, form_choice_required) that this grounder never emits.

Rows by stratum

Stratum train validation test total
2.4/activation 7 0 3 10
2.4/binding_intervention 1 0 0 1
2.4/half_selection 3 0 0 3
2.4/minimal_contrast 4 0 0 4
2.4/near_miss 6 0 1 7
3.1/4 27 0 0 27
3.1/6 31 10 0 41
3.2/1 182 33 0 215
3.3/1 100 0 0 100
clarify-contrast 17 0 49 66
v3/base 313 44 94 451
v3/deferred 72 0 0 72
v3/extra 60 0 0 60
v3/hole-measure 127 12 87 226
v3/hole-scope 55 12 16 83
v3/hole-value 0 0 11 11
v3/multi 294 42 28 364
v3/perturb 176 8 62 246
v4/base 393 61 96 550
v4/combo 5577 392 1001 6970
v4/deferred 115 0 0 115
v4/extra 73 0 10 83
v4/fragment 366 24 45 435
v4/hole-measure 6 0 0 6
v4/hole-scope 95 5 19 119
v4/hole-value 15 0 18 33
v4/multi 633 71 105 809
v4/perturb 325 25 83 433
v4/plain 23 6 18 47
v4/residual 176 18 13 207
v4/scenario 297 13 18 328
v4/short 853 48 54 955
v4/undecided 106 0 27 133
v4/vehicle 175 2 13 190
v4/wide 713 54 45 812

The v3/... and numeric strata are the earlier corpus (1,921 rows, built in September 2026; see "How the rows were made"). v3/base: one declared capability with its values bound. v3/multi: one objective with two or three constraints in one request. v3/hole-measure, v3/hole-scope, v3/hole-value: a measure, a scope or a value left unstated. v3/perturb: one element of a declared form changed, so that the grounder decides the outcome. v3/extra: meanings the vocabulary can express but the server does not declare. v3/deferred: capabilities whose data primitive the server defers. Strata with numeric names (2.4/..., 3.1/..., 3.2/..., 3.3/...) are the 408 rows that the earlier corpus took over from its first version. The numbers are cells of that version's coverage plan and mean nothing more: execute variants (3.1), both turns of clarification episodes (3.2), requests meant to be out of scope or unsupported (3.3; 29 of its 100 rows ended up clarify) and contrast probes (2.4). clarify-contrast: hand-written contrast cases for clarification, grouped by topic (34 of the 66 rows execute, 17 clarify and 15 are unsupported).

v4/... strata come from the meaning-first generator of this release. The names shared with v3/... mean the same recipes. The others: v4/combo, one or two objectives with up to three constraints, values and strengths sampled; v4/plain, a quantity named without its aggregation; v4/fragment, constraints stated without an objective; v4/residual, a clear requirement the grammar cannot express; v4/vehicle, vehicle-count directives; v4/undecided, a bound whose value the user has not decided yet. Added for this release: v4/short, v4/wide and v4/scenario (see "Revisions in this release").

Distinct IRs

train validation test all
Distinct IR strings 3506 256 557 4316

How the rows were made

The rows are synthetic. They were produced by a meaning-first pipeline:

  1. Meanings. A sampler enumerates target meanings from each domain's vocabulary and capability forms, and writes each one as a gold IR (see the strata above). For 408 rows of the earlier corpus, the gold IR was derived from an existing gold decision.
  2. Utterances. An LLM writes a user request that expresses the target meaning, following a style card (language, persona, written or spoken register). Generator models: claude-sonnet-5-5, gpt-6.1-sol for the v4/... strata. The earlier corpus was generated with gpt-5.6-terra and claude-sonnet-5 and cross-certified with claude-opus-5 and gpt-5.6-terra, each request by the other provider's model.
  3. Certification. A model from a second provider parses the request with the same system prompt the parser is trained on, and a row is kept only when its IR equals the gold IR in normal form (see Terms), in any frame order when there is no COMPOSE line (the IR match metric always requires the same order). Rows of the earlier corpus were certified at the decision level instead (the certifier's decision had to equal the gold decision); the marks of their unsupported rows were later re-certified at the IR level (see "Revisions in this release"). For per-unit constraints, a second question checked whether the request states the unit; a constraint whose unit is not stated is labeled EACH(x in HOLE(scope)). Certifier models: claude-opus-5 and gpt-5.6-terra for the rows of the pre-release build; gpt-6.1-sol (checking Sonnet 5.5) and claude-opus-5-5 (checking gpt-6.1-sol) for the rows added for this release and for the re-certification of marks.
  4. Clarification episodes. For some clarify rows, a second row continues the conversation with the system's clarification question and a generated user answer; its gold IR states the resolved meaning.
  5. Gold decisions. gold_decision is what decide returns for the gold IR and the row's user turns.

People audited a sample of 55 rows of the earlier corpus, and the labeling conventions were revised from that audit and from a later diagnosis. The rows generated since then were checked by the automated certification and by the gates of the build (every IR parses, is admitted by the published grammar, and grounds; no request carries two labels; no clarification episode spans two splits). The hand-written contrast rows are split by case instead (see Splits).

The prompts and grammars were generated with grounder version 2026-10-24.1. SHA-256 of the files:

File SHA-256
prompts/nurse.txt 96a9fb26233a0e234be00281b3a55194e7c9c36346b891bc226044d6db316bac
grammar/nurse.ebnf d3bf570cb32315212330252f6c2f77ee1e6f630311237c5b09ddc5e3d1a4876b
prompts/retail.txt db5127ba8db344d54e105bad3787e3def4157b4bf9bd10f8801ef62c679e873b
grammar/retail.ebnf a399c3130e1c6d55758872a93cbc35a5272fd7a327bcb7738229c439431ea36c
prompts/routing.txt d0e05a63aaf448d55e168f6e76c43c717e2b94b821bf6263631a4acbc410085f
grammar/routing.ebnf f1b510377624a63997b6ac8f446348735a3615eb5cc012c9eb94b77ddb57161d

Revisions in this release

Compared with the pre-release build of this dataset, the release has these revisions:

  • New rows. 2,095 rows were added in three new strata. Their briefs give the generator the user's situation and what the user wants, in work words, instead of the definitions of the measures.

    • v4/short (nurse and retail, 955 rows): chat requests typed in one line, with one or two objectives and at most one constraint.
    • v4/wide (nurse and retail, 812 rows): up to three objectives and four constraints, told from a ward's or a store's situation.
    • v4/scenario (routing, 328 rows): three to five constraints that occur together in one kind of operation, with values in working ranges. Example operations: a refrigerated-truck run, a parcel agency serving large apartment complexes, a motorbike delivery hub.

    Generators: claude-sonnet-5-5 and gpt-6.1-sol. Certifiers: gpt-6.1-sol for the rows Sonnet 5.5 wrote, and claude-opus-5-5 for the rows gpt-6.1-sol wrote. In the v4/... strata, a nurse or retail IR may now have up to ten paraphrases; routing keeps six. 33 generated rows had more than six frame or UNEXPRESSED lines, the most the published grammar admits besides one COMPOSE line; they were dropped.

  • Rows let back in. The higher cap let 86 rows of the pre-release run back in, all nurse or retail rows in existing v4/... strata. With the two dropped contrast rows (see Splits), the release has 12,033 + 2,095 + 86 - 2 = 14,212 rows.

  • Marks. Some unsupported rows of the earlier corpus state how strict a constraint is ("if possible", "without exception") but had no [SOFT] or [HARD] mark. Both certifiers of the new rows re-parsed all 156 unsupported single-turn rows of that origin that have a constraint line. Where both read the same marks, and otherwise the gold frames, the marks were taken over: 107 rows changed. The other rows are unchanged.

  • Splits.

    • NO_INTENT and CLARIFY(intent) no longer pull rows into one split by meaning: each is one label per domain, whatever the user said. Train now has 53 NO_INTENT rows and 1 CLARIFY(intent) row; in the pre-release build all of them were in test.
    • Seven stale CLARIFY(intent) labels were relabeled to the objective the request names, for example "minimize waste" became MINIMIZE( waste_rate ).
    • Two hand-written contrast rows were dropped, because relabeling them would have pulled train meanings into test.
    • 8 more rows left train: 6 v4/extra rows moved to test and 2 v3/perturb rows to validation.
  • Clarification wording. After the adapters were trained, the system's clarification question was reworded in 96 rows (84 train, 6 validation, 6 test). Only that turn changed, and the IRs are the same. The released adapters were trained on the earlier wording.

Intended use

  • Training and evaluating parsers that turn optimization requests into IR that a downstream system can check before running a solver.
  • Research on semantic parsing with abstention, where a model must keep ambiguous and unsupported meanings visible instead of mapping them to the nearest supported capability.

The dataset is not a sample of real user traffic, and it is not a general Korean or English instruction dataset.

Limitations

  • Synthetic data. All requests were written by LLMs from sampled meanings. They cover the meanings that the sampler enumerates, not the distribution of real requests, and many rows paraphrase the same IR (14,212 rows, 4,316 distinct IRs).
  • Realism. Many requests read more like a specification than like what a user would type, long routing requests most of all. The 2,095 rows added for this release were written from the user's situation, but they are 15% of the data. Korean and mixed-language requests were generated, not collected, and some read as translated or overly explicit. See Planned updates.
  • Few human checks. Rows passed automated cross-certification and the build gates; people checked only a small sample. Some labels are likely wrong.
  • Skewed decisions. About 84% of the rows execute; clarification and unsupported rows are fewer than real traffic may need.
  • One capability held out. Every routing row whose IR bounds route duration from above, per route or per round (928 rows; 822 of them name constraint:max_duration in gold_decision), is in the test split only. Its capability form is in the prompt, but no training row uses it, so the test measures transfer to a form seen only in the prompt.
  • Open conventions. Strict comparisons ("more than N") and bounds stated without a number follow the conventions at release time and may change.
  • Behaviors without eval rows. Five behaviors have training rows but no validation or test rows, so the metrics reported on this dataset say nothing about them:
    • clarifying an unresolved measure (HOLE(measure, ...), 23 rows, one IR);
    • clarifying a loosely named rule (HOLE(constraint, ...), 32 rows);
    • asking for another way to combine objectives when the user names one the server does not offer (COMPOSE(product), 50 rows);
    • declining a capability whose input data the server does not supply (188 rows, 19 of them objectives);
    • declining a strict priority order between objectives (20 rows).
  • Unstated evenness (nurse). If a nurse request asks for an even workload without saying how evenness is measured, its label asks back (UNSPECIFIED). Train has 25 such rows (9 of them also leave the overtime aggregation open). Against them stand 479 rows whose requests state the gap between the busiest and the least busy nurse (RANGE), a few of them only loosely ("even out the shifts"). A model trained on train may fill in the gap instead of asking. The Qwen3-8B adapter trained on this release did so on 8 of the 19 such validation rows.
  • Nurse scope. Nurse requests execute with four objectives (overtime, preference satisfaction, unmet demand, workload balance) and three constraints (consecutive working days, hours per week, rest between shifts). Other common rostering constraints, such as forbidden shift patterns, minimum staffing per shift and skills, are declined as unsupported: the prompt lists their forms, but they need input data or a configuration that the server does not provide here. The nurse rows therefore cover a narrow slice of real rostering.
  • Domain ratio. Routing is 67% of the rows, nurse 17% and retail 15%. Routing has far more capabilities that execute: 4 objectives and 20 constraints, against 4 and 3 for nurse and 4 and 4 for retail. It therefore has far more distinct meanings.
  • Unsupported meanings by design. Many rows are clarify or unsupported. The vocabulary, capability forms, refs (such as objective:distance_cost) and units belong to one optimization server's declarations at the time of release; a different server needs different prompts and decisions.
  • Closed domains. Only the three domains above are covered.

Planned updates

This dataset will be updated: the planned work brings its requests closer to the way real users phrase optimization requests. All requests in this version were written by LLMs (see Limitations).

License

The dataset is released under CC BY 4.0.

Citation

@misc{omelet-ai-optilir-instruct-v1,
  title   = {OptiLIR-Instruct-v1},
  author  = {omelet-ai},
  year    = {2026},
  url     = {https://huggingface.co/datasets/omelet-ai/OptiLIR-Instruct-v1}
}
Downloads last month
46

Models trained or fine-tuned on omelet-ai/OptiLIR-Instruct-v1