{"id": "v3/base:routing:87d6be60f47df885", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "목표는 모든 경로의 총 연료비를 최소화하는 것입니다. 가능하면 각 경로의 최소 외접원 반경이 해당 라이더의 개인 반경 제한을 넘지 않도록 하는 소프트 제약을 함께 적용해주세요."}], "ir": "MINIMIZE( SUM(x0 in routes: fuel_cost(x0)) )\n[SOFT] EACH(x1 in routes): sec_radius(x1) <= individual_radius_limit(x1)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:individual_enclosing_circle_radius.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:individual_enclosing_circle_radius", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fuel_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v3/base", "episode_id": null} {"id": "v3/base:routing:7ed56fdd3303b3e0", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "전체 라우트의 연료비 합계를 최소화하는 것이 목표이며, 각 경로의 외접원 반경이 라이더별 반경 한도를 초과하지 않는 것은 소프트 조건으로 반영하고 싶습니다."}], "ir": "MINIMIZE( SUM(x0 in routes: fuel_cost(x0)) )\n[SOFT] EACH(x1 in routes): sec_radius(x1) <= individual_radius_limit(x1)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:individual_enclosing_circle_radius.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:individual_enclosing_circle_radius", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fuel_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v3/base", "episode_id": null} {"id": "v3/base:routing:a1bf0c4a76b35d18", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "전체 배송 경로의 연료비를 최대한 줄이고, 가능하면 각 배송 구역이 담당 라이더의 서비스 반경 안에서 운영되도록 해주세요."}], "ir": "MINIMIZE( SUM(x0 in routes: fuel_cost(x0)) )\n[SOFT] EACH(x1 in routes): sec_radius(x1) <= individual_radius_limit(x1)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:individual_enclosing_circle_radius.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:individual_enclosing_circle_radius", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fuel_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v3/base", "episode_id": null} {"id": "v3/base:routing:0ddf90de03b4c0a4", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "전체 경로 연료비 합을 최소로 맞춰주시고요, 가능하면 각 경로 반경이 그 라이더 개인 반경 제한을 넘지 않게 해주세요. 안 되면 어쩔 수 없고요."}], "ir": "MINIMIZE( SUM(x0 in routes: fuel_cost(x0)) )\n[SOFT] EACH(x1 in routes): sec_radius(x1) <= individual_radius_limit(x1)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:individual_enclosing_circle_radius.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:individual_enclosing_circle_radius", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fuel_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v3/base", "episode_id": null} {"id": "v3/base:routing:76f355c378ca8474", "domain": "routing", "language": "en", "messages": [{"role": "user", "content": "Let's keep total vehicle fixed costs as low as possible across every route today. Also, try to make sure no delivery waits longer than each rider's own wait-time limit, keep every route finishing before the rider's shift end, and if possible have every round trip wrap up within that rider's round window end."}], "ir": "MINIMIZE( SUM(x0 in routes: fixed_cost(x0)) )\n[SOFT] AND( EACH(x1 in routes): EACH(x2 in rounds(x1)): end_time(x2) <= round_window_end(x1), EACH(x3 in routes): EACH(x4 in visits(x3)): wait_duration(x4) <= max_wait(x3), EACH(x5 in routes): end_time(x5) <= work_end(x5) )", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:rider_time_window.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:rider_time_window", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fixed_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v3/base", "episode_id": null} {"id": "v3/base:routing:475e510831262473", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "모든 경로에 걸친 차량 고정비용 합계를 최소화하는 것을 목표로 합니다. 다만 각 배송의 대기시간이 해당 라이더의 최대 대기시간을 넘지 않도록 하고, 각 경로의 종료시간이 라이더의 근무 종료시간을 넘지 않도록 하며, 각 경로의 모든 순회의 종료시간이 라이더의 순회 윈도우 종료시간을 넘지 않도록 하는 것은 소프트 제약으로 가능하면 지켜주세요."}], "ir": "MINIMIZE( SUM(x0 in routes: fixed_cost(x0)) )\n[SOFT] AND( EACH(x1 in routes): EACH(x2 in rounds(x1)): end_time(x2) <= round_window_end(x1), EACH(x3 in routes): EACH(x4 in visits(x3)): wait_duration(x4) <= max_wait(x3), EACH(x5 in routes): end_time(x5) <= work_end(x5) )", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:rider_time_window.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:rider_time_window", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fixed_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v3/base", "episode_id": null} {"id": "v3/base:routing:a7dde15a4e53d17a", "domain": "routing", "language": "en", "messages": [{"role": "user", "content": "Our main goal is to cut down the total fixed cost of running vehicles across all the routes. When you can, try not to let any delivery's wait time go over that rider's own limit, keep each route ending before the rider's work hours are up, and aim for every round trip to finish by the rider's round window end."}], "ir": "MINIMIZE( SUM(x0 in routes: fixed_cost(x0)) )\nAND( EACH(x1 in routes): EACH(x2 in rounds(x1)): end_time(x2) <= round_window_end(x1), EACH(x3 in routes): EACH(x4 in visits(x3)): wait_duration(x4) <= max_wait(x3), EACH(x5 in routes): end_time(x5) <= work_end(x5) )", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:rider_time_window.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:rider_time_window", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fixed_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v3/base", "episode_id": null} {"id": "v3/base:routing:66c1f53a2fe10a7f", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "오늘 목표는 전체 경로의 차량 고정비용 합을 최소화하는 거예요. 그리고 소프트 조건으로, 각 배송 대기시간이 라이더 최대 대기시간 이내이면 좋고, 각 경로 종료시간도 근무 종료시간 안에 들어오면 좋고, 각 라운드 종료시간도 라이더의 라운드 윈도우 종료시간 안에 들어오도록 가능하면 맞춰주세요."}], "ir": "MINIMIZE( SUM(x0 in routes: fixed_cost(x0)) )\n[SOFT] AND( EACH(x1 in routes): EACH(x2 in rounds(x1)): end_time(x2) <= round_window_end(x1), EACH(x3 in routes): EACH(x4 in visits(x3)): wait_duration(x4) <= max_wait(x3), EACH(x5 in routes): end_time(x5) <= work_end(x5) )", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:rider_time_window.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:rider_time_window", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fixed_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v3/base", "episode_id": null} {"id": "v3/perturb:routing:100da99f8bfd21fc", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "오늘 모든 운행의 차량 고정비용은 가장 적게 들게 잡고, 가능하면 각 운행마다 배송은 최소 12건씩 배정해 주세요."}], "ir": "MINIMIZE( SUM(x0 in routes: fixed_cost(x0)) )\n[SOFT] EACH(x1 in routes): delivery_count(x1) >= 12", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:minimum_order.target_order", "value": {"type": "decimal", "value": "12"}}], "constraint_ref": "constraint:minimum_order", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fixed_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v3/perturb", "episode_id": null} {"id": "v3/perturb:routing:21dc59fefba47c2a", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "전체 차량 고정 운영비를 최소화하되, 가능하면 모든 운행이 배송 12건 이상이 되도록 해주세요."}], "ir": "MINIMIZE( SUM(x0 in routes: fixed_cost(x0)) )\n[SOFT] EACH(x1 in routes): delivery_count(x1) >= 12", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:minimum_order.target_order", "value": {"type": "decimal", "value": "12"}}], "constraint_ref": "constraint:minimum_order", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fixed_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v3/perturb", "episode_id": null} {"id": "v3/perturb:routing:982dc9c515c53778", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "차량 고정비용 총액을 가장 낮추고, 가능하면 각 노선의 배송 건수는 12건 이상으로 맞춰주세요."}], "ir": "MINIMIZE( SUM(x0 in routes: fixed_cost(x0)) )\n[SOFT] EACH(x1 in routes): delivery_count(x1) >= 12", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:minimum_order.target_order", "value": {"type": "decimal", "value": "12"}}], "constraint_ref": "constraint:minimum_order", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fixed_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v3/perturb", "episode_id": null} {"id": "v3/perturb:routing:212e2966992ba7b6", "domain": "routing", "language": "mixed", "messages": [{"role": "user", "content": "모든 route의 vehicle fixed operating cost 합계를 최소화하되, 가능하면 각 route는 배송 12건 이상으로 구성해 주세요."}], "ir": "MINIMIZE( SUM(x0 in routes: fixed_cost(x0)) )\n[SOFT] EACH(x1 in routes): delivery_count(x1) >= 12", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:minimum_order.target_order", "value": {"type": "decimal", "value": "12"}}], "constraint_ref": "constraint:minimum_order", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fixed_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v3/perturb", "episode_id": null} {"id": "v3/hole-scope:routing:605a0d27e585cb3e", "domain": "routing", "language": "en", "messages": [{"role": "user", "content": "Minimize total elapsed time from start to finish across all routes. If possible, keep each run’s stops within a 5 km enclosing-circle radius."}], "ir": "MINIMIZE( UNSPECIFIED(x0 in routes: duration(x0)) )\n[SOFT] EACH(x1 in HOLE(scope)): sec_radius(x1) <= 5 km", "decision_kind": "clarify", "gold_decision": {"candidate_refs": [], "kind": "clarify", "missing_field_refs": [], "reason_code": "ambiguous_capability", "required_inputs": []}, "stratum": "v3/hole-scope", "episode_id": "ep:4aa5fd4efa6a44df"} {"id": "v3/hole-scope:routing:d0a80b48f2108a0b", "domain": "routing", "language": "en", "messages": [{"role": "user", "content": "Minimize total elapsed time from start to finish across all routes. If possible, keep each run’s stops within a 5 km enclosing-circle radius."}, {"role": "assistant", "content": "That could mean more than one thing: Route Enclosing Circle Radius, Round Enclosing Circle Radius. Which one do you mean?"}, {"role": "user", "content": "Every route must fit within the chosen radius."}], "ir": "MINIMIZE( UNSPECIFIED(x0 in routes: duration(x0)) )\n[SOFT] EACH(x1 in routes): sec_radius(x1) <= 5 km", "decision_kind": "clarify", "gold_decision": {"candidate_refs": [], "kind": "clarify", "missing_field_refs": [], "reason_code": "ambiguous_capability", "required_inputs": []}, "stratum": "v3/hole-scope", "episode_id": "ep:4aa5fd4efa6a44df"} {"id": "v3/hole-scope:routing:b6027c7e01355f37", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "전체 경로의 차량 사용 고정비용 합계를 최소화해 주세요. 각 운행 단위의 정차지를 둘러싼 최소 원의 반경은 가능하면 3 km 이하로 유지해 주세요."}], "ir": "MINIMIZE( SUM(x0 in routes: fixed_cost(x0)) )\n[SOFT] EACH(x1 in HOLE(scope)): sec_radius(x1) <= 3 km", "decision_kind": "clarify", "gold_decision": {"candidate_refs": ["constraint:enclosing_circle_radius", "constraint:round_enclosing_circle_radius"], "kind": "clarify", "missing_field_refs": [], "reason_code": "ambiguous_capability", "required_inputs": []}, "stratum": "v3/hole-scope", "episode_id": "ep:557c253e01921435"} {"id": "v3/hole-scope:routing:ecbce78db389de38", "domain": "routing", "language": "mixed", "messages": [{"role": "user", "content": "전체 경로의 차량 사용 고정비용 합계를 최소화해 주세요. 각 운행 단위의 정차지를 둘러싼 최소 원의 반경은 가능하면 3 km 이하로 유지해 주세요."}, {"role": "assistant", "content": "말씀하신 내용은 여러 가지로 읽혀요. 경로 외접원 반경 제한, 회전별 외접원 반경 제한 중 어느 쪽인가요?"}, {"role": "user", "content": "각 route의 모든 stop을 감싸는 가장 작은 circle의 radius는 정한 한도 이하여야 합니다."}], "ir": "MINIMIZE( SUM(x0 in routes: fixed_cost(x0)) )\n[SOFT] EACH(x1 in routes): sec_radius(x1) <= 3 km", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:enclosing_circle_radius.exp_factor", "value": {"type": "decimal", "value": "2"}}, {"slot_ref": "slot:enclosing_circle_radius.max_radius", "value": {"type": "decimal", "value": "3000"}}], "constraint_ref": "constraint:enclosing_circle_radius", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fixed_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v3/hole-scope", "episode_id": "ep:557c253e01921435"} {"id": "v3/perturb:routing:cf068a75fcdda323", "domain": "routing", "language": "en", "messages": [{"role": "user", "content": "Objective: minimize the total elapsed time from start to finish summed across all routes. As a soft constraint, we'd like every round trip within each route to have at least 12 deliveries, but this is a preference, not mandatory."}], "ir": "MINIMIZE( SUM(x0 in routes: duration(x0)) )\n[SOFT] EACH(x1 in routes): EACH(x2 in rounds(x1)): delivery_count(x2) >= 12", "decision_kind": "unsupported", "gold_decision": {"kind": "unsupported", "reason_code": "semantic_not_declared", "related_refs": []}, "stratum": "v3/perturb", "episode_id": null} {"id": "v3/perturb:routing:605b5d51c2cea4fa", "domain": "routing", "language": "en", "messages": [{"role": "user", "content": "Set the goal to minimizing the combined start-to-finish duration over every route. Separately, try to have each round trip on each route hit a minimum of 12 deliveries if possible - treat that as a soft target, not a hard rule."}], "ir": "MINIMIZE( SUM(x0 in routes: duration(x0)) )\n[SOFT] EACH(x1 in routes): EACH(x2 in rounds(x1)): delivery_count(x2) >= 12", "decision_kind": "unsupported", "gold_decision": {"kind": "unsupported", "reason_code": "semantic_not_declared", "related_refs": []}, "stratum": "v3/perturb", "episode_id": null} {"id": "v3/perturb:routing:95df7d933fc568cc", "domain": "routing", "language": "en", "messages": [{"role": "user", "content": "I need the plan to cut down the overall time from start to finish across all our routes today. Also, for every round trip on every route, try to keep at least 12 deliveries if you can, but don't force it."}], "ir": "MINIMIZE( UNSPECIFIED(x0 in routes: duration(x0)) )\nEACH(x1 in routes): EACH(x2 in rounds(x1)): delivery_count(x2) >= 12", "decision_kind": "clarify", "gold_decision": {"candidate_refs": [], "kind": "clarify", "missing_field_refs": [], "reason_code": "ambiguous_capability", "required_inputs": []}, "stratum": "v3/perturb", "episode_id": null} {"id": "v3/perturb:routing:1815070011d7dbbf", "domain": "routing", "language": "en", "messages": [{"role": "user", "content": "We need every route finished in the shortest total time possible overall, and ideally each round trip should hit at least 12 deliveries if we can manage it, but that's not a hard requirement."}], "ir": "MINIMIZE( UNSPECIFIED(x0 in routes: duration(x0)) )\nEACH(x1 in routes): EACH(x2 in rounds(x1)): delivery_count(x2) >= 12", "decision_kind": "clarify", "gold_decision": {"candidate_refs": [], "kind": "clarify", "missing_field_refs": [], "reason_code": "ambiguous_capability", "required_inputs": []}, "stratum": "v3/perturb", "episode_id": null} {"id": "v3/base:routing:b71f55c1c9fe2514", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "오늘 모든 배송 경로의 총 이동거리는 최소로 잡고, 가능하면 각 경로 정류지의 외접원 반경이 5 km를 넘지 않게 해주세요."}], "ir": "MINIMIZE( SUM(x0 in routes: travel_distance(x0)) )\n[SOFT] EACH(x1 in routes): sec_radius(x1) <= 5 km", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:enclosing_circle_radius.exp_factor", "value": {"type": "decimal", "value": "2"}}, {"slot_ref": "slot:enclosing_circle_radius.max_radius", "value": {"type": "decimal", "value": "5000"}}], "constraint_ref": "constraint:enclosing_circle_radius", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:distance_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v3/base", "episode_id": null} {"id": "v3/base:routing:e5c1b7fd4ec1fb9b", "domain": "routing", "language": "mixed", "messages": [{"role": "user", "content": "오늘 운행은 전체 distance를 최소화하되, 각 route의 enclosing circle radius는 가능하면 5 km 이하로 유지해 주세요."}], "ir": "MINIMIZE( SUM(x0 in routes: travel_distance(x0)) )\n[SOFT] EACH(x1 in routes): sec_radius(x1) <= 5 km", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:enclosing_circle_radius.exp_factor", "value": {"type": "decimal", "value": "2"}}, {"slot_ref": "slot:enclosing_circle_radius.max_radius", "value": {"type": "decimal", "value": "5000"}}], "constraint_ref": "constraint:enclosing_circle_radius", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:distance_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v3/base", "episode_id": null} {"id": "v3/base:routing:237799f25cdd7d7b", "domain": "routing", "language": "mixed", "messages": [{"role": "user", "content": "목표는 모든 경로의 총 travel distance 최소화입니다. Soft constraint로 각 경로의 최소 외접원 반경은 가능하면 5 km 이하로 해주세요."}], "ir": "MINIMIZE( SUM(x0 in routes: travel_distance(x0)) )\n[SOFT] EACH(x1 in routes): sec_radius(x1) <= 5 km", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:enclosing_circle_radius.exp_factor", "value": {"type": "decimal", "value": "2"}}, {"slot_ref": "slot:enclosing_circle_radius.max_radius", "value": {"type": "decimal", "value": "5000"}}], "constraint_ref": "constraint:enclosing_circle_radius", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:distance_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v3/base", "episode_id": null} {"id": "v3/base:routing:6e6d39807ad5e539", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "총 이동거리를 최소화해 주세요. 가능하면 모든 경로가 5 km 반경 안에 집중되도록 계획해 주세요."}], "ir": "MINIMIZE( SUM(x0 in routes: travel_distance(x0)) )\n[SOFT] EACH(x1 in routes): sec_radius(x1) <= 5 km", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:enclosing_circle_radius.exp_factor", "value": {"type": "decimal", "value": "2"}}, {"slot_ref": "slot:enclosing_circle_radius.max_radius", "value": {"type": "decimal", "value": "5000"}}], "constraint_ref": "constraint:enclosing_circle_radius", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:distance_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v3/base", "episode_id": null} {"id": "v3/base:routing:fd7db9086a3b3c32", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "전체 경로의 연료비 합계를 최소화하는 게 목표고요, 소프트 제약으로는 각 경로 정류지들을 감싸는 최소 외접원 반경이 해당 라이더 개인의 반경 한도를 넘지 않도록 가능하면 맞춰주시면 됩니다."}], "ir": "MINIMIZE( SUM(x0 in routes: fuel_cost(x0)) )\n[SOFT] EACH(x1 in routes): sec_radius(x1) <= individual_radius_limit(x1)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:individual_enclosing_circle_radius.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:individual_enclosing_circle_radius", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fuel_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v3/base", "episode_id": null} {"id": "v3/base:routing:16e7e15fd992124c", "domain": "routing", "language": "en", "messages": [{"role": "user", "content": "Our top priority is cutting total fuel spend across every route we run. Where possible, let's also keep each route's coverage area within that rider's own radius limit."}], "ir": "MINIMIZE( SUM(x0 in routes: fuel_cost(x0)) )\n[SOFT] EACH(x1 in routes): sec_radius(x1) <= individual_radius_limit(x1)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:individual_enclosing_circle_radius.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:individual_enclosing_circle_radius", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fuel_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v3/base", "episode_id": null} {"id": "v3/base:routing:fd68aa4de2cf517b", "domain": "routing", "language": "en", "messages": [{"role": "user", "content": "We need to bring the overall fuel cost down across all routes. And ideally, every route stays inside the individual radius each rider is set for, though that's a nice-to-have."}], "ir": "MINIMIZE( SUM(x0 in routes: fuel_cost(x0)) )\n[SOFT] EACH(x1 in routes): sec_radius(x1) <= individual_radius_limit(x1)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:individual_enclosing_circle_radius.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:individual_enclosing_circle_radius", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fuel_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v3/base", "episode_id": null} {"id": "v3/base:routing:3f30003741b82600", "domain": "routing", "language": "en", "messages": [{"role": "user", "content": "Main thing today - get the total fuel cost down across every route we're running. And try to keep each route's stops inside that rider's own radius limit if you can, but it's not a must."}], "ir": "MINIMIZE( SUM(x0 in routes: fuel_cost(x0)) )\n[SOFT] EACH(x1 in routes): sec_radius(x1) <= individual_radius_limit(x1)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:individual_enclosing_circle_radius.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:individual_enclosing_circle_radius", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fuel_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v3/base", "episode_id": null} {"id": "v3/hole-measure:routing:38fa9dbbb307cf54", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "전체 라이더 경로 다 합쳐서 시작부터 끝까지 걸리는 시간을 최대한 줄여줘. 그리고 가능하면 각 경로 다닐 때 정류지들이 5km 반경 안에 모이게 해줘. 안 되면 어쩔 수 없고."}], "ir": "MINIMIZE( SUM(x0 in routes: duration(x0)) )\n[SOFT] EACH(x1 in routes): sec_radius(x1) <= 5 km", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:enclosing_circle_radius.exp_factor", "value": {"type": "decimal", "value": "2"}}, {"slot_ref": "slot:enclosing_circle_radius.max_radius", "value": {"type": "decimal", "value": "5000"}}], "constraint_ref": "constraint:enclosing_circle_radius", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:duration_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v3/hole-measure", "episode_id": null} {"id": "v3/hole-measure:routing:a3a72187fd43a6b7", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "전체 배송이 시작부터 끝까지 걸리는 시간을 최소화해야 합니다. 가능하다면 각 경로의 이동 범위도 5km 반경 이내로 유지해 주십시오."}], "ir": "MINIMIZE( UNSPECIFIED(x0 in routes: duration(x0)) )\n[SOFT] EACH(x1 in routes): sec_radius(x1) <= 5 km", "decision_kind": "clarify", "gold_decision": {"candidate_refs": [], "kind": "clarify", "missing_field_refs": [], "reason_code": "ambiguous_capability", "required_inputs": []}, "stratum": "v3/hole-measure", "episode_id": null} {"id": "v3/hole-measure:routing:ae6f57eb2456bc53", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "목표는 전체 경로의 총 소요시간을 최소화하는 것입니다. 추가로, 각 경로의 정류지가 반경 5km 이내에 모이도록 하는 소프트 제약을 적용해 주세요."}], "ir": "MINIMIZE( SUM(x0 in routes: duration(x0)) )\n[SOFT] EACH(x1 in routes): sec_radius(x1) <= 5 km", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:enclosing_circle_radius.exp_factor", "value": {"type": "decimal", "value": "2"}}, {"slot_ref": "slot:enclosing_circle_radius.max_radius", "value": {"type": "decimal", "value": "5000"}}], "constraint_ref": "constraint:enclosing_circle_radius", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:duration_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v3/hole-measure", "episode_id": null} {"id": "v3/hole-measure:routing:924985cc366061ff", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "총 이동거리를 최소화해 주세요. 가능하면 모든 배송 경로가 12건 이상을 처리하도록 해 주세요."}], "ir": "MINIMIZE( SUM(x0 in routes: travel_distance(x0)) )\n[SOFT] EACH(x1 in routes): delivery_count(x1) >= 12", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:minimum_order.target_order", "value": {"type": "decimal", "value": "12"}}], "constraint_ref": "constraint:minimum_order", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:distance_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v3/hole-measure", "episode_id": null} {"id": "v3/hole-measure:routing:9affbf0e6e28904b", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "오늘 운행은 전체 이동거리가 가장 짧게 짜고, 가능하면 각 코스마다 배송을 12건 이상씩 넣어 주세요."}], "ir": "MINIMIZE( SUM(x0 in routes: travel_distance(x0)) )\n[SOFT] EACH(x1 in routes): delivery_count(x1) >= 12", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:minimum_order.target_order", "value": {"type": "decimal", "value": "12"}}], "constraint_ref": "constraint:minimum_order", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:distance_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v3/hole-measure", "episode_id": null} {"id": "v3/hole-measure:routing:1e067633b2316c9c", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "목표는 전체 경로의 이동거리 최소화입니다. 소프트하게 모든 경로의 배송 건수가 12건 이상이 되도록 선호해 주세요."}], "ir": "MINIMIZE( SUM(x0 in routes: travel_distance(x0)) )\n[SOFT] EACH(x1 in routes): delivery_count(x1) >= 12", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:minimum_order.target_order", "value": {"type": "decimal", "value": "12"}}], "constraint_ref": "constraint:minimum_order", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:distance_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v3/hole-measure", "episode_id": null} {"id": "v3/hole-measure:routing:9c36d19ba37e0834", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "총 주행거리를 최소화하되, 가능하면 모든 운행 경로에 배송 12건 이상을 배정해 주세요."}], "ir": "MINIMIZE( SUM(x0 in routes: travel_distance(x0)) )\n[SOFT] EACH(x1 in routes): delivery_count(x1) >= 12", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:minimum_order.target_order", "value": {"type": "decimal", "value": "12"}}], "constraint_ref": "constraint:minimum_order", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:distance_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v3/hole-measure", "episode_id": null} {"id": "v3/hole-scope:routing:3a9e2402dfded484", "domain": "routing", "language": "en", "messages": [{"role": "user", "content": "Minimize total travel distance across all routes, while preferably keeping the enclosing-circle radius for each run at no more than 5 km."}], "ir": "MINIMIZE( SUM(x0 in routes: travel_distance(x0)) )\n[SOFT] EACH(x1 in HOLE(scope)): sec_radius(x1) <= 5 km", "decision_kind": "clarify", "gold_decision": {"candidate_refs": ["constraint:enclosing_circle_radius", "constraint:round_enclosing_circle_radius"], "kind": "clarify", "missing_field_refs": [], "reason_code": "ambiguous_capability", "required_inputs": []}, "stratum": "v3/hole-scope", "episode_id": "ep:b42d0915299dceb6"} {"id": "v3/hole-scope:routing:0d2787c6e01d7976", "domain": "routing", "language": "mixed", "messages": [{"role": "user", "content": "Minimize total travel distance across all routes, while preferably keeping the enclosing-circle radius for each run at no more than 5 km."}, {"role": "assistant", "content": "That could mean more than one thing: Route Enclosing Circle Radius, Round Enclosing Circle Radius. Which one do you mean?"}, {"role": "user", "content": "모든 노선의 정류장이 들어가는 가장 작은 원의 반경으로 제한해 주세요."}], "ir": "MINIMIZE( SUM(x0 in routes: travel_distance(x0)) )\n[SOFT] EACH(x1 in routes): sec_radius(x1) <= 5 km", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:enclosing_circle_radius.exp_factor", "value": {"type": "decimal", "value": "2"}}, {"slot_ref": "slot:enclosing_circle_radius.max_radius", "value": {"type": "decimal", "value": "5000"}}], "constraint_ref": "constraint:enclosing_circle_radius", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:distance_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v3/hole-scope", "episode_id": "ep:b42d0915299dceb6"} {"id": "v3/base:routing:9973138255b803f9", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "전체 노선에서 사용하는 차량의 고정 운영비 합계를 최소화해 주세요. 단, 모든 노선의 모든 왕복 구간에서 각 화물 종류별로 실린 최대 적재량은 해당 차량의 용량을 절대 초과해서는 안 됩니다."}], "ir": "MINIMIZE( SUM(x0 in routes: fixed_cost(x0)) )\n[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)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:capacity.exp_factor", "value": {"type": "decimal", "value": "1"}}], "constraint_ref": "constraint:capacity", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fixed_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v3/base", "episode_id": null} {"id": "v3/base:routing:031ab83092fb3661", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "음, 목표는 전체 경로에서 차량 고정비용 합을 최소화하는 거고요, 제약으로는 모든 경로의 모든 왕복에서 각 적재 항목별 최대 적재량이 차량 용량을 절대 넘으면 안 된다는 걸 꼭 지켜야 해요."}], "ir": "MINIMIZE( SUM(x0 in routes: fixed_cost(x0)) )\n[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)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:capacity.exp_factor", "value": {"type": "decimal", "value": "1"}}], "constraint_ref": "constraint:capacity", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fixed_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v3/base", "episode_id": null} {"id": "v3/base:routing:cb4d762204610d35", "domain": "routing", "language": "en", "messages": [{"role": "user", "content": "Let's cut down the total fixed cost of running the vehicles across all our routes. But every route, on every round trip, the highest load we carry in each cargo dimension must never go over that vehicle's capacity."}], "ir": "MINIMIZE( SUM(x0 in routes: fixed_cost(x0)) )\n[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)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:capacity.exp_factor", "value": {"type": "decimal", "value": "1"}}], "constraint_ref": "constraint:capacity", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fixed_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v3/base", "episode_id": null} {"id": "v3/base:routing:35fc4672a4280c5f", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "오늘 전체 노선 차량 고정비용 합을 최대한 줄여주세요. 대신 모든 노선, 모든 왕복에서 각 화물 종류별 최대 적재량은 차량 용량을 절대 넘으면 안 돼요, 항상 지켜야 합니다."}], "ir": "MINIMIZE( SUM(x0 in routes: fixed_cost(x0)) )\n[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)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:capacity.exp_factor", "value": {"type": "decimal", "value": "1"}}], "constraint_ref": "constraint:capacity", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fixed_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v3/base", "episode_id": null} {"id": "v3/base:routing:cd5ce32bc962dc22", "domain": "routing", "language": "en", "messages": [{"role": "user", "content": "Minimize total vehicle fixed operating costs. If possible, keep every route geographically compact within an enclosing-circle radius of 3 km."}], "ir": "MINIMIZE( SUM(x0 in routes: fixed_cost(x0)) )\n[SOFT] EACH(x1 in routes): sec_radius(x1) <= 3 km", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:enclosing_circle_radius.exp_factor", "value": {"type": "decimal", "value": "2"}}, {"slot_ref": "slot:enclosing_circle_radius.max_radius", "value": {"type": "decimal", "value": "3000"}}], "constraint_ref": "constraint:enclosing_circle_radius", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fixed_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v3/base", "episode_id": null} {"id": "v3/base:routing:8b6f1491633ed40e", "domain": "routing", "language": "en", "messages": [{"role": "user", "content": "Minimize the total fixed operating cost across all routes. As a soft constraint, try to keep every route’s minimum enclosing-circle radius at or below 3 km."}], "ir": "MINIMIZE( SUM(x0 in routes: fixed_cost(x0)) )\n[SOFT] EACH(x1 in routes): sec_radius(x1) <= 3 km", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:enclosing_circle_radius.exp_factor", "value": {"type": "decimal", "value": "2"}}, {"slot_ref": "slot:enclosing_circle_radius.max_radius", "value": {"type": "decimal", "value": "3000"}}], "constraint_ref": "constraint:enclosing_circle_radius", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fixed_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v3/base", "episode_id": null} {"id": "v3/base:routing:cb157049c04c3d97", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "전체 경로의 차량 고정 운영비 합계를 최소화해 주세요. 가능하면 모든 경로의 최소 외접원 반경은 3km 이하로 유지해 주세요."}], "ir": "MINIMIZE( SUM(x0 in routes: fixed_cost(x0)) )\n[SOFT] EACH(x1 in routes): sec_radius(x1) <= 3 km", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:enclosing_circle_radius.exp_factor", "value": {"type": "decimal", "value": "2"}}, {"slot_ref": "slot:enclosing_circle_radius.max_radius", "value": {"type": "decimal", "value": "3000"}}], "constraint_ref": "constraint:enclosing_circle_radius", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fixed_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v3/base", "episode_id": null} {"id": "v3/base:routing:8eb06ea20e19c50b", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "차량 고정 운영비가 가장 적게 들게 짜고, 가능하면 모든 운행 경로의 외접원 반경은 3km 이하로 맞춰 주세요."}], "ir": "MINIMIZE( SUM(x0 in routes: fixed_cost(x0)) )\n[SOFT] EACH(x1 in routes): sec_radius(x1) <= 3 km", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:enclosing_circle_radius.exp_factor", "value": {"type": "decimal", "value": "2"}}, {"slot_ref": "slot:enclosing_circle_radius.max_radius", "value": {"type": "decimal", "value": "3000"}}], "constraint_ref": "constraint:enclosing_circle_radius", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fixed_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v3/base", "episode_id": null} {"id": "v3/base:routing:9460ff8228dbef07", "domain": "routing", "language": "en", "messages": [{"role": "user", "content": "Keep total travel distance as low as possible, and any two deliveries within 2 km of each other must be on the same route."}], "ir": "MINIMIZE( SUM(x0 in routes: travel_distance(x0)) )\n[HARD] EACH((x1, x2) in pairs(visits, nearby(2 km))): TOGETHER(x1, x2, route)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:nearby_delivery_grouping.distance_threshold", "value": {"type": "decimal", "value": "2000"}}, {"slot_ref": "slot:nearby_delivery_grouping.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:nearby_delivery_grouping", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:distance_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v3/base", "episode_id": null} {"id": "v3/base:routing:9fd231f0f9bbe3d9", "domain": "routing", "language": "mixed", "messages": [{"role": "user", "content": "총 이동거리를 최소화하세요. 서로 2 km 이내인 모든 배송지는 반드시 같은 route로 묶어 주세요."}], "ir": "MINIMIZE( SUM(x0 in routes: travel_distance(x0)) )\n[HARD] EACH((x1, x2) in pairs(visits, nearby(2 km))): TOGETHER(x1, x2, route)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:nearby_delivery_grouping.distance_threshold", "value": {"type": "decimal", "value": "2000"}}, {"slot_ref": "slot:nearby_delivery_grouping.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:nearby_delivery_grouping", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:distance_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v3/base", "episode_id": null} {"id": "v3/base:routing:c12685beb485a66b", "domain": "routing", "language": "en", "messages": [{"role": "user", "content": "Minimize total travel distance across all routes. Every pair of deliveries within 2 km of each other must be served on the same route."}], "ir": "MINIMIZE( SUM(x0 in routes: travel_distance(x0)) )\n[HARD] EACH((x1, x2) in pairs(visits, nearby(2 km))): TOGETHER(x1, x2, route)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:nearby_delivery_grouping.distance_threshold", "value": {"type": "decimal", "value": "2000"}}, {"slot_ref": "slot:nearby_delivery_grouping.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:nearby_delivery_grouping", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:distance_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v3/base", "episode_id": null} {"id": "v3/base:routing:f7b13c6679f86d0e", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "전체 이동거리는 최소로 하고, 2 km 이내의 배송지들은 반드시 같은 경로로 처리해 주세요."}], "ir": "MINIMIZE( SUM(x0 in routes: travel_distance(x0)) )\n[HARD] EACH((x1, x2) in pairs(visits, nearby(2 km))): TOGETHER(x1, x2, route)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:nearby_delivery_grouping.distance_threshold", "value": {"type": "decimal", "value": "2000"}}, {"slot_ref": "slot:nearby_delivery_grouping.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:nearby_delivery_grouping", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:distance_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v3/base", "episode_id": null} {"id": "v3/base:routing:d962fa8fb5efc75f", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "모든 경로의 차량 고정 운영비 합계를 최소화하되, 가능하면 각 경로의 방문 순서는 시간 우선순위가 높은 순서로 정렬해 주세요."}], "ir": "MINIMIZE( SUM(x0 in routes: fixed_cost(x0)) )\n[SOFT] EACH(x1 in routes): ORDERED_BY(visit_seq(x1), time_priority, DESC)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:time_priority_order.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:time_priority_order", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fixed_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v3/base", "episode_id": null} {"id": "v3/base:routing:8ebf8df65d0cd19a", "domain": "routing", "language": "en", "messages": [{"role": "user", "content": "Keep the total vehicle fixed cost as low as possible, and if possible, run every route’s stops in descending time-priority order."}], "ir": "MINIMIZE( SUM(x0 in routes: fixed_cost(x0)) )\n[SOFT] EACH(x1 in routes): ORDERED_BY(visit_seq(x1), time_priority, DESC)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:time_priority_order.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:time_priority_order", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fixed_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v3/base", "episode_id": null} {"id": "v3/base:routing:b1cc63e703eea070", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "차량 고정 운영비 총액을 최소화하고, 가능하면 모든 경로는 시간 우선순위가 높은 방문지부터 순서대로 배정해 주세요."}], "ir": "MINIMIZE( SUM(x0 in routes: fixed_cost(x0)) )\n[SOFT] EACH(x1 in routes): ORDERED_BY(visit_seq(x1), time_priority, DESC)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:time_priority_order.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:time_priority_order", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fixed_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v3/base", "episode_id": null} {"id": "v3/base:routing:6779f4224d4fb4f9", "domain": "routing", "language": "en", "messages": [{"role": "user", "content": "The objective is to minimize total fixed operating cost across all routes. Prefer descending time-priority order for the visits on every route."}], "ir": "MINIMIZE( SUM(x0 in routes: fixed_cost(x0)) )\n[SOFT] EACH(x1 in routes): ORDERED_BY(visit_seq(x1), time_priority, DESC)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:time_priority_order.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:time_priority_order", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fixed_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v3/base", "episode_id": null} {"id": "v3/hole-measure:routing:64978639a62e7e5f", "domain": "routing", "language": "en", "messages": [{"role": "user", "content": "Plan today's runs so the whole schedule wraps up as fast as possible, and try to keep each rider's route distance under 50 km if possible."}], "ir": "MINIMIZE( UNSPECIFIED(x0 in routes: duration(x0)) )\n[SOFT] EACH(x1 in routes): travel_distance(x1) < 50 km", "decision_kind": "clarify", "gold_decision": {"candidate_refs": [], "kind": "clarify", "missing_field_refs": [], "reason_code": "ambiguous_capability", "required_inputs": []}, "stratum": "v3/hole-measure", "episode_id": null} {"id": "v3/hole-scope:routing:cdcffab568912c1b", "domain": "routing", "language": "mixed", "messages": [{"role": "user", "content": "모든 routes의 total fuel cost를 minimize하고, 운행 단위마다 stops를 enclosing하는 가장 작은 원의 반경은 가능하면 10 km 이하로 해주세요."}], "ir": "MINIMIZE( SUM(x0 in routes: fuel_cost(x0)) )\n[SOFT] EACH(x1 in HOLE(scope)): sec_radius(x1) <= 10 km", "decision_kind": "clarify", "gold_decision": {"candidate_refs": ["constraint:enclosing_circle_radius", "constraint:round_enclosing_circle_radius"], "kind": "clarify", "missing_field_refs": [], "reason_code": "ambiguous_capability", "required_inputs": []}, "stratum": "v3/hole-scope", "episode_id": "ep:b4b073fa19522251"} {"id": "v3/hole-scope:routing:e5f64e09320f7582", "domain": "routing", "language": "mixed", "messages": [{"role": "user", "content": "모든 routes의 total fuel cost를 minimize하고, 운행 단위마다 stops를 enclosing하는 가장 작은 원의 반경은 가능하면 10 km 이하로 해주세요."}, {"role": "assistant", "content": "말씀하신 내용은 여러 가지로 읽혀요. 경로 외접원 반경 제한, 회전별 외접원 반경 제한 중 어느 쪽인가요?"}, {"role": "user", "content": "각 노선의 모든 정류지가 일정 반경 안에 들어가야 합니다."}], "ir": "MINIMIZE( SUM(x0 in routes: fuel_cost(x0)) )\n[SOFT] EACH(x1 in routes): sec_radius(x1) <= 10 km", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:enclosing_circle_radius.exp_factor", "value": {"type": "decimal", "value": "2"}}, {"slot_ref": "slot:enclosing_circle_radius.max_radius", "value": {"type": "decimal", "value": "10000"}}], "constraint_ref": "constraint:enclosing_circle_radius", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fuel_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v3/hole-scope", "episode_id": "ep:b4b073fa19522251"} {"id": "v3/hole-scope:routing:5fb59c00159ea912", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "전체 노선의 연료비를 최소로 하되, 되도록 운행 단위의 외접원 반경은 10km 이내로 잡아주세요."}], "ir": "MINIMIZE( SUM(x0 in routes: fuel_cost(x0)) )\n[SOFT] EACH(x1 in HOLE(scope)): sec_radius(x1) <= 10 km", "decision_kind": "clarify", "gold_decision": {"candidate_refs": ["constraint:enclosing_circle_radius", "constraint:round_enclosing_circle_radius"], "kind": "clarify", "missing_field_refs": [], "reason_code": "ambiguous_capability", "required_inputs": []}, "stratum": "v3/hole-scope", "episode_id": "ep:aa25832552a62cd5"} {"id": "v3/hole-scope:routing:f245ba6a35776dff", "domain": "routing", "language": "mixed", "messages": [{"role": "user", "content": "전체 노선의 연료비를 최소로 하되, 되도록 운행 단위의 외접원 반경은 10km 이내로 잡아주세요."}, {"role": "assistant", "content": "말씀하신 내용은 여러 가지로 읽혀요. 경로 외접원 반경 제한, 회전별 외접원 반경 제한 중 어느 쪽인가요?"}, {"role": "user", "content": "Every route must stay within the selected limit."}], "ir": "MINIMIZE( SUM(x0 in routes: fuel_cost(x0)) )\n[SOFT] EACH(x1 in routes): sec_radius(x1) <= 10 km", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:enclosing_circle_radius.exp_factor", "value": {"type": "decimal", "value": "2"}}, {"slot_ref": "slot:enclosing_circle_radius.max_radius", "value": {"type": "decimal", "value": "10000"}}], "constraint_ref": "constraint:enclosing_circle_radius", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fuel_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v3/hole-scope", "episode_id": "ep:aa25832552a62cd5"} {"id": "v3/hole-scope:routing:971b008801c459d4", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "오늘 전체 경로 연료비는 가장 적게 잡고, 가능하면 각 운행 단위의 외접원 반경은 10 km 이하로 해주세요."}], "ir": "MINIMIZE( SUM(x0 in routes: fuel_cost(x0)) )\n[SOFT] EACH(x1 in HOLE(scope)): sec_radius(x1) <= 10 km", "decision_kind": "clarify", "gold_decision": {"candidate_refs": ["constraint:enclosing_circle_radius", "constraint:round_enclosing_circle_radius"], "kind": "clarify", "missing_field_refs": [], "reason_code": "ambiguous_capability", "required_inputs": []}, "stratum": "v3/hole-scope", "episode_id": "ep:56ad2fa957fe7020"} {"id": "v3/hole-scope:routing:8688f1df4cf4a194", "domain": "routing", "language": "mixed", "messages": [{"role": "user", "content": "오늘 전체 경로 연료비는 가장 적게 잡고, 가능하면 각 운행 단위의 외접원 반경은 10 km 이하로 해주세요."}, {"role": "assistant", "content": "말씀하신 내용은 여러 가지로 읽혀요. 경로 외접원 반경 제한, 회전별 외접원 반경 제한 중 어느 쪽인가요?"}, {"role": "user", "content": "For each route, the radius of the smallest circle enclosing all stops must not exceed the selected limit."}], "ir": "MINIMIZE( SUM(x0 in routes: fuel_cost(x0)) )\n[SOFT] EACH(x1 in routes): sec_radius(x1) <= 10 km", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:enclosing_circle_radius.exp_factor", "value": {"type": "decimal", "value": "2"}}, {"slot_ref": "slot:enclosing_circle_radius.max_radius", "value": {"type": "decimal", "value": "10000"}}], "constraint_ref": "constraint:enclosing_circle_radius", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fuel_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v3/hole-scope", "episode_id": "ep:56ad2fa957fe7020"} {"id": "v3/base:nurse:cf85ce52cbd45f5b", "domain": "nurse", "language": "ko", "messages": [{"role": "user", "content": "모든 근무조의 인력 부족분을 최소화해서 환자 안전을 확보해야 합니다. 다만 가능하다면 간호사들의 연속 근무일이 4일을 넘지 않도록 배려해 주시기 바랍니다."}], "ir": "MINIMIZE( SUM(x0 in shift_instances: unmet_demand(x0)) )\nEACH(x1 in workers): RUN_LENGTH(x2 in day_seq(x1): works(x1, x2)) <= 4 day", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:max_days", "value": {"type": "duration", "unit_ref": "unit:day", "value": "4"}}], "constraint_ref": "constraint:max_consecutive_days", "scope": null, "strength": {"kind": "soft", "weight": "100"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:unmet_demand", "weight": "1/1"}]}, "parameters": []}, "stratum": "v3/base", "episode_id": null} {"id": "v3/base:nurse:499cd926b22b2e91", "domain": "nurse", "language": "ko", "messages": [{"role": "user", "content": "전체 시프트 기준으로 인력 부족한 부분을 최소화하도록 스케줄을 짜주시고요, 가능하면 각 간호사가 4일 넘게 연속으로 근무하지 않도록 해주시면 좋겠습니다."}], "ir": "MINIMIZE( SUM(x0 in shift_instances: unmet_demand(x0)) )\n[SOFT] EACH(x1 in workers): RUN_LENGTH(x2 in day_seq(x1): works(x1, x2)) <= 4 day", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:max_days", "value": {"type": "duration", "unit_ref": "unit:day", "value": "4"}}], "constraint_ref": "constraint:max_consecutive_days", "scope": null, "strength": {"kind": "soft", "weight": "100"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:unmet_demand", "weight": "1/1"}]}, "parameters": []}, "stratum": "v3/base", "episode_id": null} {"id": "v3/base:nurse:cb6f670843d7b7ec", "domain": "nurse", "language": "ko", "messages": [{"role": "user", "content": "모든 시프트에서 인력 부족한 거를 최대한 줄여야 돼요. 그리고 되도록이면 간호사들 4일 넘게 계속 이어서 근무하는 일 없게 해주세요."}], "ir": "MINIMIZE( SUM(x0 in shift_instances: unmet_demand(x0)) )\n[SOFT] EACH(x1 in workers): RUN_LENGTH(x2 in day_seq(x1): works(x1, x2)) <= 4 day", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:max_days", "value": {"type": "duration", "unit_ref": "unit:day", "value": "4"}}], "constraint_ref": "constraint:max_consecutive_days", "scope": null, "strength": {"kind": "soft", "weight": "100"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:unmet_demand", "weight": "1/1"}]}, "parameters": []}, "stratum": "v3/base", "episode_id": null} {"id": "v3/base:nurse:8111693ae2bd5bbd", "domain": "nurse", "language": "en", "messages": [{"role": "user", "content": "We need to minimize the unmet staffing across every shift, that's the main thing. And if you can, try to keep each nurse's run of consecutive workdays to no more than 4 days."}], "ir": "MINIMIZE( SUM(x0 in shift_instances: unmet_demand(x0)) )\n[SOFT] EACH(x1 in workers): RUN_LENGTH(x2 in day_seq(x1): works(x1, x2)) <= 4 day", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:max_days", "value": {"type": "duration", "unit_ref": "unit:day", "value": "4"}}], "constraint_ref": "constraint:max_consecutive_days", "scope": null, "strength": {"kind": "soft", "weight": "100"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:unmet_demand", "weight": "1/1"}]}, "parameters": []}, "stratum": "v3/base", "episode_id": null} {"id": "v3/hole-measure:nurse:1163c2b2bc226d1f", "domain": "nurse", "language": "ko", "messages": [{"role": "user", "content": "전체 근무조에 걸친 인력 부족분의 총합을 최소화하는 것을 목표로 하되, 모든 간호사의 주당 총 근무시간이 44시간을 초과하지 않는 하드 제약은 항상 지켜야 합니다."}], "ir": "MINIMIZE( SUM(x0 in shift_instances: unmet_demand(x0)) )\n[HARD] EACH(x1 in windows(WEEK, 1)): EACH(x2 in workers): SUM(x3 in assignments(x2) WHERE DURING(interval(x3), x1): work_hours(x3)) <= 44 h", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:max_hours", "value": {"type": "duration", "unit_ref": "unit:hour", "value": "44"}}], "constraint_ref": "constraint:max_hours_per_week", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:unmet_demand", "weight": "1/1"}]}, "parameters": []}, "stratum": "v3/hole-measure", "episode_id": null} {"id": "v3/hole-measure:nurse:8a23855bd760aadd", "domain": "nurse", "language": "en", "messages": [{"role": "user", "content": "Every shift's staffing gap must be closed as much as possible, and no nurse's total hours in any week can go above 44 h."}], "ir": "MINIMIZE( SUM(x0 in shift_instances: unmet_demand(x0)) )\n[HARD] EACH(x1 in windows(WEEK, 1)): EACH(x2 in workers): SUM(x3 in assignments(x2) WHERE DURING(interval(x3), x1): work_hours(x3)) <= 44 h", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:max_hours", "value": {"type": "duration", "unit_ref": "unit:hour", "value": "44"}}], "constraint_ref": "constraint:max_hours_per_week", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:unmet_demand", "weight": "1/1"}]}, "parameters": []}, "stratum": "v3/hole-measure", "episode_id": null} {"id": "v3/hole-measure:nurse:b0a9d4f4b5ff5720", "domain": "nurse", "language": "ko", "messages": [{"role": "user", "content": "모든 시프트에 대한 미충족 수요의 합을 최소화하는 것이 목표이며, 각 간호사의 주간 누적 근무시간은 44시간을 넘어서는 안 된다는 제약을 반드시 준수해야 합니다."}], "ir": "MINIMIZE( SUM(x0 in shift_instances: unmet_demand(x0)) )\n[HARD] EACH(x1 in windows(WEEK, 1)): EACH(x2 in workers): SUM(x3 in assignments(x2) WHERE DURING(interval(x3), x1): work_hours(x3)) <= 44 h", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:max_hours", "value": {"type": "duration", "unit_ref": "unit:hour", "value": "44"}}], "constraint_ref": "constraint:max_hours_per_week", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:unmet_demand", "weight": "1/1"}]}, "parameters": []}, "stratum": "v3/hole-measure", "episode_id": null} {"id": "v3/hole-measure:nurse:d03c8bec56ce6120", "domain": "nurse", "language": "ko", "messages": [{"role": "user", "content": "모든 시프트의 인력부족(미충족 수요)을 최소화하도록 스케줄을 짜되, 각 간호사는 매주 근무시간이 44시간을 절대 넘지 않도록 반드시 지켜주세요."}], "ir": "MINIMIZE( SUM(x0 in shift_instances: unmet_demand(x0)) )\n[HARD] EACH(x1 in windows(WEEK, 1)): EACH(x2 in workers): SUM(x3 in assignments(x2) WHERE DURING(interval(x3), x1): work_hours(x3)) <= 44 h", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:max_hours", "value": {"type": "duration", "unit_ref": "unit:hour", "value": "44"}}], "constraint_ref": "constraint:max_hours_per_week", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:unmet_demand", "weight": "1/1"}]}, "parameters": []}, "stratum": "v3/hole-measure", "episode_id": null} {"id": "v3/base:nurse:d183e13ed85af8d4", "domain": "nurse", "language": "ko", "messages": [{"role": "user", "content": "음, 이번 로스터는 간호사들 근무량 편차를 최소화하는 걸 목표로 잡고 싶어요. 그리고 하드 제약으로, 모든 간호사가 매주 근무시간 합이 40시간을 넘지 않도록 반드시 지켜야 해요."}], "ir": "MINIMIZE( RANGE(x0 in workers: workload(x0)) )\n[HARD] EACH(x1 in windows(WEEK, 1)): EACH(x2 in workers): SUM(x3 in assignments(x2) WHERE DURING(interval(x3), x1): work_hours(x3)) <= 40 h", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:max_hours", "value": {"type": "duration", "unit_ref": "unit:hour", "value": "40"}}], "constraint_ref": "constraint:max_hours_per_week", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:workload_balance", "weight": "1/1"}]}, "parameters": []}, "stratum": "v3/base", "episode_id": null} {"id": "v3/base:nurse:06bf83bba88c684d", "domain": "nurse", "language": "en", "messages": [{"role": "user", "content": "Please try to even out the shifts so no nurse ends up carrying a lot more work than the others, but every nurse must never work more than 40 hours in any given week."}], "ir": "MINIMIZE( UNSPECIFIED(x0 in workers: workload(x0)) )\n[HARD] EACH(x1 in windows(WEEK, 1)): EACH(x2 in workers): SUM(x3 in assignments(x2) WHERE DURING(interval(x3), x1): work_hours(x3)) <= 40 h", "decision_kind": "clarify", "gold_decision": {"candidate_refs": ["objective:workload_balance"], "kind": "clarify", "missing_field_refs": [], "reason_code": "ambiguous_capability", "required_inputs": []}, "stratum": "v3/base", "episode_id": null} {"id": "v3/base:nurse:1d31daf7dea9a468", "domain": "nurse", "language": "ko", "messages": [{"role": "user", "content": "업무량 균형화를 목표로 넣어서 간호사 간 근무 편차를 최대한 줄이고 싶고, 대신 각 간호사의 주간 근무시간 총합은 40시간을 절대 넘지 않는 하드 제약으로 걸어주세요."}], "ir": "MINIMIZE( RANGE(x0 in workers: workload(x0)) )\n[HARD] EACH(x1 in windows(WEEK, 1)): EACH(x2 in workers): SUM(x3 in assignments(x2) WHERE DURING(interval(x3), x1): work_hours(x3)) <= 40 h", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:max_hours", "value": {"type": "duration", "unit_ref": "unit:hour", "value": "40"}}], "constraint_ref": "constraint:max_hours_per_week", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:workload_balance", "weight": "1/1"}]}, "parameters": []}, "stratum": "v3/base", "episode_id": null} {"id": "v3/base:nurse:eb475a8f020f9d6c", "domain": "nurse", "language": "en", "messages": [{"role": "user", "content": "Our roster needs to spread shifts fairly across every nurse on the ward, and no nurse may ever work beyond 40 hours in a single week."}], "ir": "MINIMIZE( UNSPECIFIED(x0 in workers: workload(x0)) )\nEACH(x1 in windows(WEEK, 1)): EACH(x2 in workers): SUM(x3 in assignments(x2) WHERE DURING(interval(x3), x1): work_hours(x3)) <= 40 h", "decision_kind": "clarify", "gold_decision": {"candidate_refs": ["objective:workload_balance"], "kind": "clarify", "missing_field_refs": [], "reason_code": "ambiguous_capability", "required_inputs": []}, "stratum": "v3/base", "episode_id": null} {"id": "v3/base:retail:575685a192ee7e4c", "domain": "retail", "language": "ko", "messages": [{"role": "user", "content": "폐기율을 최소화하고 싶습니다. 단, 모든 발주는 반드시 해당 상품의 발주 가능 요일에만 넣어야 합니다."}], "ir": "MINIMIZE( waste_rate )\n[HARD] EACH(x0 in orders): day_of_week(x0) IN allowed_order_days(x0)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:order_days", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:minimize_waste", "weight": "1/1"}]}, "parameters": []}, "stratum": "v3/base", "episode_id": null} {"id": "v3/base:retail:e55fac396a745b9c", "domain": "retail", "language": "ko", "messages": [{"role": "user", "content": "폐기되는 재고 비율을 최대한 줄여주세요. 그리고 모든 주문은 각 품목별로 정해진 발주 가능 요일에만 이루어져야 하며, 이 요일 제한은 절대 어기면 안 됩니다."}], "ir": "MINIMIZE( waste_rate )\n[HARD] EACH(x0 in orders): day_of_week(x0) IN allowed_order_days(x0)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:order_days", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:minimize_waste", "weight": "1/1"}]}, "parameters": []}, "stratum": "v3/base", "episode_id": null} {"id": "v3/base:retail:450635d33523bdb3", "domain": "retail", "language": "ko", "messages": [{"role": "user", "content": "폐기율을 최소화하는 게 목표고요, 발주는 항상 품목별로 지정된 요일에만 나가야 해요."}], "ir": "MINIMIZE( waste_rate )\nEACH(x0 in orders): day_of_week(x0) IN allowed_order_days(x0)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:order_days", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:minimize_waste", "weight": "1/1"}]}, "parameters": []}, "stratum": "v3/base", "episode_id": null} {"id": "v3/base:retail:3c93b1a9798b1acf", "domain": "retail", "language": "ko", "messages": [{"role": "user", "content": "목표는 폐기율 최소화입니다. 모든 발주는 반드시 품목별로 지정된 발주 가능 요일에만 이루어져야 합니다."}], "ir": "MINIMIZE( waste_rate )\n[HARD] EACH(x0 in orders): day_of_week(x0) IN allowed_order_days(x0)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:order_days", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:minimize_waste", "weight": "1/1"}]}, "parameters": []}, "stratum": "v3/base", "episode_id": null} {"id": "3.2/1:nurse:7e27e41ed605d4ba", "domain": "nurse", "language": "en", "messages": [{"role": "user", "content": "For next month’s roster, try to honor everyone’s shift preferences and keep the workload fair across the nurses."}], "ir": "MAXIMIZE( SUM(x0 in assignments: preference_score(x0)) )\nMINIMIZE( UNSPECIFIED(x1 in workers: workload(x1)) )", "decision_kind": "clarify", "gold_decision": {"candidate_refs": ["objective:workload_balance"], "kind": "clarify", "missing_field_refs": [], "reason_code": "ambiguous_capability", "required_inputs": []}, "stratum": "3.2/1", "episode_id": null} {"id": "3.2/1:nurse:34fb17e9b7ac8c0f", "domain": "nurse", "language": "en", "messages": [{"role": "user", "content": "Create the ward roster with strong respect for staff shift preferences and an even distribution of workload."}], "ir": "MAXIMIZE( SUM(x0 in assignments: preference_score(x0)) )\nMINIMIZE( UNSPECIFIED(x1 in workers: workload(x1)) )", "decision_kind": "clarify", "gold_decision": {"candidate_refs": ["objective:workload_balance"], "kind": "clarify", "missing_field_refs": [], "reason_code": "ambiguous_capability", "required_inputs": []}, "stratum": "3.2/1", "episode_id": null} {"id": "3.2/1:nurse:4e6867f6aef120e7", "domain": "nurse", "language": "en", "messages": [{"role": "user", "content": "We need a roster that accommodates nurses’ preferences while keeping workloads balanced across the team."}], "ir": "MAXIMIZE( SUM(x0 in assignments: preference_score(x0)) )\nMINIMIZE( UNSPECIFIED(x1 in workers: workload(x1)) )", "decision_kind": "clarify", "gold_decision": {"candidate_refs": ["objective:workload_balance"], "kind": "clarify", "missing_field_refs": [], "reason_code": "ambiguous_capability", "required_inputs": []}, "stratum": "3.2/1", "episode_id": null} {"id": "3.2/1:nurse:71b18d6b346815c7", "domain": "nurse", "language": "en", "messages": [{"role": "user", "content": "Build the schedule to support staff preferences and maintain a fair workload for every nurse."}], "ir": "MAXIMIZE( SUM(x0 in assignments: preference_score(x0)) )\nMINIMIZE( UNSPECIFIED(x1 in workers: workload(x1)) )", "decision_kind": "clarify", "gold_decision": {"candidate_refs": ["objective:workload_balance"], "kind": "clarify", "missing_field_refs": [], "reason_code": "ambiguous_capability", "required_inputs": []}, "stratum": "3.2/1", "episode_id": null} {"id": "3.2/1:nurse:b7721f511784cb55", "domain": "nurse", "language": "ko", "messages": [{"role": "user", "content": "이번 달 근무표 짤 때 간호사들 선호도 반영이랑 업무량 균형, 이 두 가지를 같이 신경 써서 최적화하고 싶어요. 어떤 식으로 비중을 둬야 할지 정확히는 모르겠고, 일단 둘 다 챙겨줬으면 해요."}], "ir": "MAXIMIZE( SUM(x0 in assignments: preference_score(x0)) )\nMINIMIZE( UNSPECIFIED(x1 in workers: workload(x1)) )", "decision_kind": "clarify", "gold_decision": {"candidate_refs": ["objective:workload_balance"], "kind": "clarify", "missing_field_refs": [], "reason_code": "ambiguous_capability", "required_inputs": []}, "stratum": "3.2/1", "episode_id": null} {"id": "3.2/1:nurse:6796a44c7bd6d8dd", "domain": "nurse", "language": "ko", "messages": [{"role": "user", "content": "이번 달 근무표는 간호사들 희망 근무 들어주면서 동시에 다들 일이 골고루 나눠지게 짜고 싶어요. 어느 쪽을 더 우선할지는 아직 안 정했고, 둘 다 신경 써줬으면 좋겠어요."}], "ir": "MAXIMIZE( SUM(x0 in assignments: preference_score(x0)) )\nMINIMIZE( UNSPECIFIED(x1 in workers: workload(x1)) )", "decision_kind": "clarify", "gold_decision": {"candidate_refs": ["objective:workload_balance"], "kind": "clarify", "missing_field_refs": [], "reason_code": "ambiguous_capability", "required_inputs": []}, "stratum": "3.2/1", "episode_id": null} {"id": "3.2/1:nurse:7dc2e8087372ab44", "domain": "nurse", "language": "en", "messages": [{"role": "user", "content": "I'd like the nurse schedule to take both preference satisfaction and workload balance into account together, but I haven't decided how to weigh one against the other yet."}], "ir": "MAXIMIZE( SUM(x0 in assignments: preference_score(x0)) )\nMINIMIZE( UNSPECIFIED(x1 in workers: workload(x1)) )", "decision_kind": "clarify", "gold_decision": {"candidate_refs": ["objective:workload_balance"], "kind": "clarify", "missing_field_refs": [], "reason_code": "ambiguous_capability", "required_inputs": []}, "stratum": "3.2/1", "episode_id": null} {"id": "3.2/1:nurse:8dfef42e6a724d22", "domain": "nurse", "language": "mixed", "messages": [{"role": "user", "content": "우리 병동 스케줄은 nurse preference랑 workload balance 둘 다 잘 챙겨줘야 해요. 어느 게 더 중요한지는 아직 정하지 않았어요."}], "ir": "MAXIMIZE( SUM(x0 in assignments: preference_score(x0)) )\nMINIMIZE( UNSPECIFIED(x1 in workers: workload(x1)) )", "decision_kind": "clarify", "gold_decision": {"candidate_refs": ["objective:workload_balance"], "kind": "clarify", "missing_field_refs": [], "reason_code": "ambiguous_capability", "required_inputs": []}, "stratum": "3.2/1", "episode_id": null} {"id": "3.2/1:nurse:cc47384eac747d19", "domain": "nurse", "language": "ko", "messages": [{"role": "user", "content": "다음 달 근무표에서 간호사들 희망 근무를 반영하고 업무량도 공평하게 맞춰 주세요."}], "ir": "MAXIMIZE( SUM(x0 in assignments: preference_score(x0)) )\nMINIMIZE( UNSPECIFIED(x1 in workers: workload(x1)) )", "decision_kind": "clarify", "gold_decision": {"candidate_refs": ["objective:workload_balance"], "kind": "clarify", "missing_field_refs": [], "reason_code": "ambiguous_capability", "required_inputs": []}, "stratum": "3.2/1", "episode_id": null} {"id": "3.2/1:nurse:269b5c56861a00e9", "domain": "nurse", "language": "ko", "messages": [{"role": "user", "content": "다음 달 로스터는 각 간호사의 근무 선호를 살리면서 업무가 한쪽에 몰리지 않게 짜 주세요."}], "ir": "MAXIMIZE( SUM(x0 in assignments: preference_score(x0)) )\nMINIMIZE( UNSPECIFIED(x1 in workers: workload(x1)) )", "decision_kind": "clarify", "gold_decision": {"candidate_refs": ["objective:workload_balance"], "kind": "clarify", "missing_field_refs": [], "reason_code": "ambiguous_capability", "required_inputs": []}, "stratum": "3.2/1", "episode_id": null} {"id": "3.2/1:nurse:56ea3ffc80a24984", "domain": "nurse", "language": "ko", "messages": [{"role": "user", "content": "간호사들이 원하는 근무를 최대한 반영하고, 사람별 근무량도 고르게 해 주세요."}], "ir": "MAXIMIZE( SUM(x0 in assignments: preference_score(x0)) )\nMINIMIZE( UNSPECIFIED(x1 in workers: workload(x1)) )", "decision_kind": "clarify", "gold_decision": {"candidate_refs": ["objective:workload_balance"], "kind": "clarify", "missing_field_refs": [], "reason_code": "ambiguous_capability", "required_inputs": []}, "stratum": "3.2/1", "episode_id": null} {"id": "3.2/1:nurse:0dc2e8938b102d20", "domain": "nurse", "language": "en", "messages": [{"role": "user", "content": "Please build next month’s roster to honor nurses’ shift preferences and keep workloads fair across the team."}], "ir": "MAXIMIZE( SUM(x0 in assignments: preference_score(x0)) )\nMINIMIZE( UNSPECIFIED(x1 in workers: workload(x1)) )", "decision_kind": "clarify", "gold_decision": {"candidate_refs": ["objective:workload_balance"], "kind": "clarify", "missing_field_refs": [], "reason_code": "ambiguous_capability", "required_inputs": []}, "stratum": "3.2/1", "episode_id": null} {"id": "3.2/1:nurse:fb982209a9a2d5d8", "domain": "nurse", "language": "ko", "messages": [{"role": "user", "content": "이번 달 로스터 짤 때 간호사들 근무 선호도 최대한 반영하고, 업무량도 다들 공평하게 나눠지도록 신경 써 주세요."}], "ir": "MAXIMIZE( SUM(x0 in assignments: preference_score(x0)) )\nMINIMIZE( UNSPECIFIED(x1 in workers: workload(x1)) )", "decision_kind": "clarify", "gold_decision": {"candidate_refs": ["objective:workload_balance"], "kind": "clarify", "missing_field_refs": [], "reason_code": "ambiguous_capability", "required_inputs": []}, "stratum": "3.2/1", "episode_id": null} {"id": "3.2/1:nurse:ee8eb56bdea71ca2", "domain": "nurse", "language": "ko", "messages": [{"role": "user", "content": "이번 스케줄에서는 선호도 만족이랑 업무량 균형, 이 두 목표를 같이 고려해서 짜 주셨으면 해요."}], "ir": "MAXIMIZE( SUM(x0 in assignments: preference_score(x0)) )\nMINIMIZE( UNSPECIFIED(x1 in workers: workload(x1)) )", "decision_kind": "clarify", "gold_decision": {"candidate_refs": ["objective:workload_balance"], "kind": "clarify", "missing_field_refs": [], "reason_code": "ambiguous_capability", "required_inputs": []}, "stratum": "3.2/1", "episode_id": null} {"id": "3.2/1:nurse:c26ad7bed3720542", "domain": "nurse", "language": "ko", "messages": [{"role": "user", "content": "다음 달 근무표는 간호사 개인 선호를 존중하면서도 업무 부담이 고르게 분배되도록 해야 합니다."}], "ir": "MAXIMIZE( SUM(x0 in assignments: preference_score(x0)) )\nMINIMIZE( UNSPECIFIED(x1 in workers: workload(x1)) )", "decision_kind": "clarify", "gold_decision": {"candidate_refs": ["objective:workload_balance"], "kind": "clarify", "missing_field_refs": [], "reason_code": "ambiguous_capability", "required_inputs": []}, "stratum": "3.2/1", "episode_id": null} {"id": "3.2/1:nurse:4eaff90c7f44caeb", "domain": "nurse", "language": "ko", "messages": [{"role": "user", "content": "이번 로스터는 선호 반영이랑 업무량 형평성, 둘 다 챙겨줬으면 좋겠어요."}], "ir": "MAXIMIZE( SUM(x0 in assignments: preference_score(x0)) )\nMINIMIZE( UNSPECIFIED(x1 in workers: workload(x1)) )", "decision_kind": "clarify", "gold_decision": {"candidate_refs": ["objective:workload_balance"], "kind": "clarify", "missing_field_refs": [], "reason_code": "ambiguous_capability", "required_inputs": []}, "stratum": "3.2/1", "episode_id": null} {"id": "3.2/1:nurse:8ce7042292d05718", "domain": "nurse", "language": "ko", "messages": [{"role": "user", "content": "다음 달 근무표에서 간호사들 희망 근무는 최대한 반영하고, 업무량도 고르게 맞춰 주세요."}], "ir": "MAXIMIZE( SUM(x0 in assignments: preference_score(x0)) )\nMINIMIZE( UNSPECIFIED(x1 in workers: workload(x1)) )", "decision_kind": "clarify", "gold_decision": {"candidate_refs": ["objective:workload_balance"], "kind": "clarify", "missing_field_refs": [], "reason_code": "ambiguous_capability", "required_inputs": []}, "stratum": "3.2/1", "episode_id": null} {"id": "3.1/6:retail:91eb04a530ed0115", "domain": "retail", "language": "ko", "messages": [{"role": "user", "content": "재고 보충 주문을 잡아줘. 이익은 3분의 2 비중으로 보고, 품절을 줄이는 건 3분의 1 비중으로 봐줘."}], "ir": "MAXIMIZE( profit )\nMAXIMIZE( in_stock_rate )\nCOMPOSE(weighted_sum: 1=2/3, 2=1/3)", "decision_kind": "execute", "gold_decision": {"constraints": [], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:maximize_profit", "weight": "2/3"}, {"objective_ref": "objective:minimize_stockout", "weight": "1/3"}]}, "parameters": []}, "stratum": "3.1/6", "episode_id": null} {"id": "3.1/6:retail:8973a53d2c29671b", "domain": "retail", "language": "ko", "messages": [{"role": "user", "content": "보충 계획을 실행해 주세요. 이익 극대화에 2/3, 품절 최소화에 1/3의 가중치를 적용합니다."}], "ir": "MAXIMIZE( profit )\nMAXIMIZE( in_stock_rate )\nCOMPOSE(weighted_sum: 1=2/3, 2=1/3)", "decision_kind": "execute", "gold_decision": {"constraints": [], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:maximize_profit", "weight": "2/3"}, {"objective_ref": "objective:minimize_stockout", "weight": "1/3"}]}, "parameters": []}, "stratum": "3.1/6", "episode_id": null} {"id": "3.1/6:retail:32150f86ab1b9d42", "domain": "retail", "language": "mixed", "messages": [{"role": "user", "content": "Replenishment run 해주세요. 수익 최대화는 2/3, stockout 최소화는 1/3 비중으로 설정합니다."}], "ir": "MAXIMIZE( profit )\nMAXIMIZE( in_stock_rate )\nCOMPOSE(weighted_sum: 1=2/3, 2=1/3)", "decision_kind": "execute", "gold_decision": {"constraints": [], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:maximize_profit", "weight": "2/3"}, {"objective_ref": "objective:minimize_stockout", "weight": "1/3"}]}, "parameters": []}, "stratum": "3.1/6", "episode_id": null} {"id": "3.1/6:retail:409ffb9e0cc34691", "domain": "retail", "language": "mixed", "messages": [{"role": "user", "content": "보충 주문을 진행해 주세요. Profit은 2/3, 품절 감소는 1/3 비중으로 반영해 주세요."}], "ir": "MAXIMIZE( profit )\nMAXIMIZE( in_stock_rate )\nCOMPOSE(weighted_sum: 1=2/3, 2=1/3)", "decision_kind": "execute", "gold_decision": {"constraints": [], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:maximize_profit", "weight": "2/3"}, {"objective_ref": "objective:minimize_stockout", "weight": "1/3"}]}, "parameters": []}, "stratum": "3.1/6", "episode_id": null} {"id": "3.1/6:retail:eaab117cd790e082", "domain": "retail", "language": "ko", "messages": [{"role": "user", "content": "이익 위주로 발주 잡아주시고요, 품절도 좀 줄여주셨으면 하는데 이익 비중을 품절 방지보다 두 배 정도로 높게 잡아주세요."}], "ir": "MAXIMIZE( profit )\nMAXIMIZE( in_stock_rate )\nCOMPOSE(weighted_sum: 1=2/3, 2=1/3)", "decision_kind": "execute", "gold_decision": {"constraints": [], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:maximize_profit", "weight": "2/3"}, {"objective_ref": "objective:minimize_stockout", "weight": "1/3"}]}, "parameters": []}, "stratum": "3.1/6", "episode_id": null} {"id": "3.1/6:retail:8f1ecedb27ffae18", "domain": "retail", "language": "ko", "messages": [{"role": "user", "content": "매출 이익 쪽에 더 무게 두고, 품절 나는 것도 어느 정도는 신경 써주세요. 이익이 품절 방지보다 두 배 중요하게 잡아주시면 됩니다."}], "ir": "MAXIMIZE( profit )\nMAXIMIZE( in_stock_rate )\nCOMPOSE(weighted_sum: 1=2/3, 2=1/3)", "decision_kind": "execute", "gold_decision": {"constraints": [], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:maximize_profit", "weight": "2/3"}, {"objective_ref": "objective:minimize_stockout", "weight": "1/3"}]}, "parameters": []}, "stratum": "3.1/6", "episode_id": null} {"id": "3.1/6:retail:b93f7f9df8b12e79", "domain": "retail", "language": "ko", "messages": [{"role": "user", "content": "마진을 최우선으로 하되, 품절도 어느 정도는 줄여주세요. 마진 비중을 품절 방지의 두 배로 둬주세요."}], "ir": "MAXIMIZE( profit )\nMAXIMIZE( in_stock_rate )\nCOMPOSE(weighted_sum: 1=2/3, 2=1/3)", "decision_kind": "execute", "gold_decision": {"constraints": [], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:maximize_profit", "weight": "2/3"}, {"objective_ref": "objective:minimize_stockout", "weight": "1/3"}]}, "parameters": []}, "stratum": "3.1/6", "episode_id": null} {"id": "3.1/6:retail:ba24e42f2a6b78a3", "domain": "retail", "language": "en", "messages": [{"role": "user", "content": "Prioritize margin over reducing stockouts, weighting profit twice as heavily as stockout prevention."}], "ir": "MAXIMIZE( profit )\nMAXIMIZE( in_stock_rate )\nCOMPOSE(weighted_sum: 1=2/3, 2=1/3)", "decision_kind": "execute", "gold_decision": {"constraints": [], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:maximize_profit", "weight": "2/3"}, {"objective_ref": "objective:minimize_stockout", "weight": "1/3"}]}, "parameters": []}, "stratum": "3.1/6", "episode_id": null} {"id": "3.1/6:retail:f8c65eaf2026eb1c", "domain": "retail", "language": "en", "messages": [{"role": "user", "content": "Prioritize margin, with stockouts carrying one-third of the emphasis and profit two-thirds."}], "ir": "MAXIMIZE( profit )\nMAXIMIZE( in_stock_rate )\nCOMPOSE(weighted_sum: 1=2/3, 2=1/3)", "decision_kind": "execute", "gold_decision": {"constraints": [], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:maximize_profit", "weight": "2/3"}, {"objective_ref": "objective:minimize_stockout", "weight": "1/3"}]}, "parameters": []}, "stratum": "3.1/6", "episode_id": null} {"id": "3.1/6:retail:b24962bfa9461d6b", "domain": "retail", "language": "en", "messages": [{"role": "user", "content": "Run the replenishment plan with a weighted objective: maximize profit at 2/3 and minimize stockouts at 1/3."}], "ir": "MAXIMIZE( profit )\nMAXIMIZE( in_stock_rate )\nCOMPOSE(weighted_sum: 1=2/3, 2=1/3)", "decision_kind": "execute", "gold_decision": {"constraints": [], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:maximize_profit", "weight": "2/3"}, {"objective_ref": "objective:minimize_stockout", "weight": "1/3"}]}, "parameters": []}, "stratum": "3.1/6", "episode_id": null} {"id": "3.2/1:retail:41e40d60f0bd7869", "domain": "retail", "language": "mixed", "messages": [{"role": "user", "content": "폐기 최소화만 목표로 돌리고, lead time constraint는 soft로 해주세요."}], "ir": "MINIMIZE( waste_rate )\n[SOFT] EACH(x0 in orders): arrival_day(x0) = offset(order_day(x0), lead_time(x0))", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:lead_time", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:minimize_waste", "weight": "1/1"}]}, "parameters": []}, "stratum": "3.2/1", "episode_id": null} {"id": "3.2/1:retail:3ce4d0032daed11e", "domain": "retail", "language": "ko", "messages": [{"role": "user", "content": "폐기를 최소화하세요. 리드타임은 가능하면 지켜주세요."}], "ir": "MINIMIZE( waste_rate )\n[SOFT] EACH(x0 in orders): arrival_day(x0) = offset(order_day(x0), lead_time(x0))", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:lead_time", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:minimize_waste", "weight": "1/1"}]}, "parameters": []}, "stratum": "3.2/1", "episode_id": null} {"id": "3.2/1:retail:c2b8d8c6628f31fe", "domain": "retail", "language": "ko", "messages": [{"role": "user", "content": "이번 재고 최적화는 폐기량 최소화에 집중해서 잡아주시고, 리드타임은 소프트 제약으로 두되 가능하면 지켜주시면 좋겠어요."}], "ir": "MINIMIZE( waste_rate )\n[SOFT] EACH(x0 in orders): arrival_day(x0) = offset(order_day(x0), lead_time(x0))", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:lead_time", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:minimize_waste", "weight": "1/1"}]}, "parameters": []}, "stratum": "3.2/1", "episode_id": null} {"id": "3.2/1:retail:0f6de9a059bb3d8e", "domain": "retail", "language": "ko", "messages": [{"role": "user", "content": "일단 폐기 줄이는 쪽으로 발주 좀 맞춰주시고, 리드타임은 가능하면 맞춰주면 좋겠어요, 못 맞춰도 괜찮고요."}], "ir": "MINIMIZE( waste_rate )\n[SOFT] EACH(x0 in orders): arrival_day(x0) = offset(order_day(x0), lead_time(x0))", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:lead_time", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:minimize_waste", "weight": "1/1"}]}, "parameters": []}, "stratum": "3.2/1", "episode_id": null} {"id": "3.2/1:retail:ab5c8803dead4fc8", "domain": "retail", "language": "ko", "messages": [{"role": "user", "content": "이번 발주는 리드타임은 가능하면 맞추고, 폐기만 최소로 해서 짜줘."}], "ir": "MINIMIZE( waste_rate )\n[SOFT] EACH(x0 in orders): arrival_day(x0) = offset(order_day(x0), lead_time(x0))", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:lead_time", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:minimize_waste", "weight": "1/1"}]}, "parameters": []}, "stratum": "3.2/1", "episode_id": null} {"id": "3.2/1:retail:e92731cc229aab99", "domain": "retail", "language": "ko", "messages": [{"role": "user", "content": "폐기는 최소화하되, 리드타임은 가능한 범위에서 맞춰주세요."}], "ir": "MINIMIZE( waste_rate )\n[SOFT] EACH(x0 in orders): arrival_day(x0) = offset(order_day(x0), lead_time(x0))", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:lead_time", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:minimize_waste", "weight": "1/1"}]}, "parameters": []}, "stratum": "3.2/1", "episode_id": null} {"id": "3.2/1:retail:877abb7c1547008f", "domain": "retail", "language": "ko", "messages": [{"role": "user", "content": "폐기 손실을 최대한 줄이는 쪽으로 발주 좀 짜주시고요, 배송 리드타임은 가능하면 지켜주세요."}], "ir": "MINIMIZE( waste_rate )\n[SOFT] EACH(x0 in orders): arrival_day(x0) = offset(order_day(x0), lead_time(x0))", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:lead_time", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:minimize_waste", "weight": "1/1"}]}, "parameters": []}, "stratum": "3.2/1", "episode_id": null} {"id": "3.2/1:retail:e4cf5f08122a0615", "domain": "retail", "language": "en", "messages": [{"role": "user", "content": "Priority is cutting waste to a minimum. Try to hit delivery lead times where you can, but that's secondary."}], "ir": "MINIMIZE( waste_rate )\n[SOFT] EACH(x0 in orders): arrival_day(x0) = offset(order_day(x0), lead_time(x0))", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:lead_time", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:minimize_waste", "weight": "1/1"}]}, "parameters": []}, "stratum": "3.2/1", "episode_id": null} {"id": "3.2/1:retail:97c44ddd75a80947", "domain": "retail", "language": "ko", "messages": [{"role": "user", "content": "이번 주문 계획은 폐기량 최소화가 목표입니다. 리드타임은 지킬 수 있으면 지켜주시고, 안 되면 어쩔 수 없어요."}], "ir": "MINIMIZE( waste_rate )\n[SOFT] EACH(x0 in orders): arrival_day(x0) = offset(order_day(x0), lead_time(x0))", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:lead_time", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:minimize_waste", "weight": "1/1"}]}, "parameters": []}, "stratum": "3.2/1", "episode_id": null} {"id": "3.2/1:retail:fd6403dd11358b39", "domain": "retail", "language": "ko", "messages": [{"role": "user", "content": "폐기 최소화만 목표로 재고 보충 계획을 실행해 주세요. 리드타임 제약은 소프트로 둘 예정인데, 가중치는 무엇으로 정해야 하나요?"}], "ir": "MINIMIZE( waste_rate )\n[SOFT] EACH(x0 in orders): arrival_day(x0) = offset(order_day(x0), lead_time(x0))", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:lead_time", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:minimize_waste", "weight": "1/1"}]}, "parameters": []}, "stratum": "3.2/1", "episode_id": null} {"id": "3.2/1:retail:6b8e5b32ed55a060", "domain": "retail", "language": "en", "messages": [{"role": "user", "content": "Run the replenishment plan with minimizing waste as the sole objective. Treat lead time as a soft constraint, but what weight should I assign to it?"}], "ir": "MINIMIZE( waste_rate )\n[SOFT] EACH(x0 in orders): arrival_day(x0) = offset(order_day(x0), lead_time(x0))", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:lead_time", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:minimize_waste", "weight": "1/1"}]}, "parameters": []}, "stratum": "3.2/1", "episode_id": null} {"id": "3.2/1:retail:f8ba55a5f272f052", "domain": "retail", "language": "ko", "messages": [{"role": "user", "content": "폐기 최소화만 목표로 잡고, 리드타임은 하드가 아니라 소프트 제약으로 최대한 지켜주면 좋겠어요."}], "ir": "MINIMIZE( waste_rate )\n[SOFT] EACH(x0 in orders): arrival_day(x0) = offset(order_day(x0), lead_time(x0))", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:lead_time", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:minimize_waste", "weight": "1/1"}]}, "parameters": []}, "stratum": "3.2/1", "episode_id": null} {"id": "3.2/1:retail:c036743b29fc1b47", "domain": "retail", "language": "en", "messages": [{"role": "user", "content": "Let's just focus on cutting waste as our only goal, and try to keep the lead time on track if possible—it doesn't have to be strict."}], "ir": "MINIMIZE( waste_rate )\n[SOFT] EACH(x0 in orders): arrival_day(x0) = offset(order_day(x0), lead_time(x0))", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:lead_time", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:minimize_waste", "weight": "1/1"}]}, "parameters": []}, "stratum": "3.2/1", "episode_id": null} {"id": "3.2/1:retail:ee742e029911c8f3", "domain": "retail", "language": "ko", "messages": [{"role": "user", "content": "폐기량 줄이는 것만 목표로 하고, 리드타임은 반드시는 아니고 가능하면 지켜줬으면 좋겠어요."}], "ir": "MINIMIZE( waste_rate )\n[SOFT] EACH(x0 in orders): arrival_day(x0) = offset(order_day(x0), lead_time(x0))", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:lead_time", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:minimize_waste", "weight": "1/1"}]}, "parameters": []}, "stratum": "3.2/1", "episode_id": null} {"id": "3.2/1:retail:b6d3967199e27db2", "domain": "retail", "language": "ko", "messages": [{"role": "user", "content": "이번 발주는 폐기를 가장 적게 하게 잡고, 납품 리드타임은 가능하면 맞춰 주세요."}], "ir": "MINIMIZE( waste_rate )\n[SOFT] EACH(x0 in orders): arrival_day(x0) = offset(order_day(x0), lead_time(x0))", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:lead_time", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:minimize_waste", "weight": "1/1"}]}, "parameters": []}, "stratum": "3.2/1", "episode_id": null} {"id": "3.2/1:retail:b851878528a9f8df", "domain": "retail", "language": "ko", "messages": [{"role": "user", "content": "목표는 폐기 최소화 하나로 두고, 리드타임 제약은 소프트로 적용해 주세요."}], "ir": "MINIMIZE( waste_rate )\n[SOFT] EACH(x0 in orders): arrival_day(x0) = offset(order_day(x0), lead_time(x0))", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:lead_time", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:minimize_waste", "weight": "1/1"}]}, "parameters": []}, "stratum": "3.2/1", "episode_id": null} {"id": "v3/multi:routing:43fad5312df2302b", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "전체 경로의 총 이동거리를 최소화해 주세요. 가능하면 각 라이더가 맡은 배송지들이 퍼진 범위의 반경은 그 라이더별 한도 안에 들게 하고, 가능하면 모든 경로의 배송 건수는 5건 이하로 맞춰 주세요."}], "ir": "MINIMIZE( SUM(x0 in routes: travel_distance(x0)) )\n[SOFT] EACH(x1 in routes): sec_radius(x1) <= individual_radius_limit(x1)\n[SOFT] EACH(x2 in routes): delivery_count(x2) <= 5", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:delivery_length.exp_factor", "value": {"type": "decimal", "value": "2"}}, {"slot_ref": "slot:delivery_length.max_size", "value": {"type": "decimal", "value": "5"}}], "constraint_ref": "constraint:delivery_length", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:individual_enclosing_circle_radius.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:individual_enclosing_circle_radius", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:distance_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v3/multi", "episode_id": null} {"id": "v3/multi:routing:1ecd54019c5e162c", "domain": "routing", "language": "en", "messages": [{"role": "user", "content": "Minimize total travel distance. If possible, keep each rider’s route within that rider’s radius limit, and if possible, limit every route to 5 deliveries."}], "ir": "MINIMIZE( SUM(x0 in routes: travel_distance(x0)) )\n[SOFT] EACH(x1 in routes): sec_radius(x1) <= individual_radius_limit(x1)\n[SOFT] EACH(x2 in routes): delivery_count(x2) <= 5", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:delivery_length.exp_factor", "value": {"type": "decimal", "value": "2"}}, {"slot_ref": "slot:delivery_length.max_size", "value": {"type": "decimal", "value": "5"}}], "constraint_ref": "constraint:delivery_length", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:individual_enclosing_circle_radius.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:individual_enclosing_circle_radius", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:distance_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v3/multi", "episode_id": null} {"id": "v3/multi:routing:794890fc8cf26497", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "오늘 배송은 총 이동거리가 가장 짧게 짜 주세요. 가능하면 각 라이더 경로의 배송지가 퍼진 반경은 그 라이더 한도 안으로 하고, 가능하면 한 경로 배송 건수는 5건 이하로 해 주세요."}], "ir": "MINIMIZE( SUM(x0 in routes: travel_distance(x0)) )\n[SOFT] EACH(x1 in routes): sec_radius(x1) <= individual_radius_limit(x1)\n[SOFT] EACH(x2 in routes): delivery_count(x2) <= 5", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:delivery_length.exp_factor", "value": {"type": "decimal", "value": "2"}}, {"slot_ref": "slot:delivery_length.max_size", "value": {"type": "decimal", "value": "5"}}], "constraint_ref": "constraint:delivery_length", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:individual_enclosing_circle_radius.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:individual_enclosing_circle_radius", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:distance_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v3/multi", "episode_id": null} {"id": "v3/multi:routing:6377c0dfeb4ec2f0", "domain": "routing", "language": "en", "messages": [{"role": "user", "content": "Keep total travel distance to a minimum. If possible, keep every rider’s route within their own radius limit, and if possible, keep each route to 5 deliveries or fewer."}], "ir": "MINIMIZE( SUM(x0 in routes: travel_distance(x0)) )\n[SOFT] EACH(x1 in routes): sec_radius(x1) <= individual_radius_limit(x1)\n[SOFT] EACH(x2 in routes): delivery_count(x2) <= 5", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:delivery_length.exp_factor", "value": {"type": "decimal", "value": "2"}}, {"slot_ref": "slot:delivery_length.max_size", "value": {"type": "decimal", "value": "5"}}], "constraint_ref": "constraint:delivery_length", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:individual_enclosing_circle_radius.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:individual_enclosing_circle_radius", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:distance_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v3/multi", "episode_id": null} {"id": "v3/multi:routing:0cad29a362ed3be3", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "오늘 전체 경로의 이동거리 합이 최소가 되도록 배차 짜주시고요, 가능하면 각 배송 건의 출발시간이 약속시간(시간 윈도우) 안에 들어가게 해주시고, 그리고 가능하면 각 경로의 방문 순서는 시간 우선순위가 높은 것부터 낮은 순으로 정렬해주세요."}], "ir": "MINIMIZE( SUM(x0 in routes: travel_distance(x0)) )\n[SOFT] EACH(x1 in visits): departure_time(x1) <= tw_late(x1)\n[SOFT] EACH(x2 in routes): ORDERED_BY(visit_seq(x2), time_priority, DESC)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:time_priority_order.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:time_priority_order", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:time_window.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:time_window", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:distance_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v3/multi", "episode_id": null} {"id": "v3/multi:routing:1e7e17ee9f72e844", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "오늘 전체 이동거리 최소로 되게 동선 짜줘요. 가능하면 각 배송 출발시간이 약속시간 넘기지 않게 하고, 가능하면 경로 안에서는 우선순위 높은 배송부터 순서대로 돌게 해줘요."}], "ir": "MINIMIZE( SUM(x0 in routes: travel_distance(x0)) )\n[SOFT] EACH(x1 in visits): departure_time(x1) <= tw_late(x1)\n[SOFT] EACH(x2 in routes): ORDERED_BY(visit_seq(x2), time_priority, DESC)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:time_priority_order.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:time_priority_order", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:time_window.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:time_window", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:distance_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v3/multi", "episode_id": null} {"id": "v3/multi:routing:720ad8b248037b6b", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "이동거리 합이 제일 적게 나오도록 코스 짜주세요. 가능하면 각 배송이 늦어도 약속시간까지는 출발하게 해주고요, 또 가능하면 경로마다 방문 순서는 우선순위 높은 순서대로 먼저 가게 해주세요."}], "ir": "MINIMIZE( SUM(x0 in routes: travel_distance(x0)) )\n[SOFT] EACH(x1 in visits): departure_time(x1) <= tw_late(x1)\n[SOFT] EACH(x2 in routes): ORDERED_BY(visit_seq(x2), time_priority, DESC)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:time_priority_order.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:time_priority_order", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:time_window.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:time_window", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:distance_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v3/multi", "episode_id": null} {"id": "v3/multi:routing:43b3a65087aef7ed", "domain": "routing", "language": "en", "messages": [{"role": "user", "content": "Please build today's routes to minimize the total travel distance across all runs. If possible, keep every delivery's departure time within its promised time window. And if possible, sequence the stops on each route by time priority, from highest to lowest."}], "ir": "MINIMIZE( SUM(x0 in routes: travel_distance(x0)) )\n[SOFT] EACH(x1 in visits): departure_time(x1) <= tw_late(x1)\n[SOFT] EACH(x2 in routes): ORDERED_BY(visit_seq(x2), time_priority, DESC)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:time_priority_order.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:time_priority_order", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:time_window.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:time_window", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:distance_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v3/multi", "episode_id": null} {"id": "v3/multi:routing:a20ab9f179217988", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "전체 운행의 시작부터 종료까지 걸리는 시간을 최소화하세요. 가능하면 배송 우선순위가 높은 건의 도착을 앞당기고, 각 배송의 대기시간은 기사별 허용 대기시간 이내, 각 기사 운행 종료와 각 왕복 종료는 각각 정해진 종료 시각 이내로 하며, 가능하면 각 경로의 이동거리는 100 km를 넘지 않게 해주세요."}], "ir": "MINIMIZE( UNSPECIFIED(x0 in routes: duration(x0)) )\n[SOFT] MINIMIZE( SUM(x1 in visits: priority_weighted_arrival(x1)) )\n[SOFT] AND( EACH(x2 in routes): EACH(x3 in rounds(x2)): end_time(x3) <= round_window_end(x2), EACH(x4 in routes): EACH(x5 in visits(x4)): wait_duration(x5) <= max_wait(x4), EACH(x6 in routes): end_time(x6) <= work_end(x6) )\n[SOFT] EACH(x7 in routes): travel_distance(x7) <= 100 km", "decision_kind": "clarify", "gold_decision": {"candidate_refs": [], "kind": "clarify", "missing_field_refs": [], "reason_code": "ambiguous_capability", "required_inputs": []}, "stratum": "v3/multi", "episode_id": null} {"id": "v3/multi:routing:9c0fc5b13360c334", "domain": "routing", "language": "en", "messages": [{"role": "user", "content": "Minimize total route duration. If possible, prioritize earlier arrivals for urgent deliveries; if possible, keep every stop's wait within that rider's wait limit, finish each rider's route by their work end and each round by that rider's round-window end; if possible, keep each route within 100 km."}], "ir": "MINIMIZE( SUM(x0 in routes: duration(x0)) )\n[SOFT] MINIMIZE( SUM(x1 in visits: priority_weighted_arrival(x1)) )\n[SOFT] AND( EACH(x2 in routes): EACH(x3 in rounds(x2)): end_time(x3) <= round_window_end(x2), EACH(x4 in routes): EACH(x5 in visits(x4)): wait_duration(x5) <= max_wait(x4), EACH(x6 in routes): end_time(x6) <= work_end(x6) )\n[SOFT] EACH(x7 in routes): travel_distance(x7) <= 100 km", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:delivery_time_priority.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:delivery_time_priority", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:max_distance.exp_factor", "value": {"type": "decimal", "value": "1"}}, {"slot_ref": "slot:max_distance.max_distance", "value": {"type": "decimal", "value": "100000"}}], "constraint_ref": "constraint:max_distance", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:rider_time_window.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:rider_time_window", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:duration_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v3/multi", "episode_id": null} {"id": "v3/multi:routing:1f571274c723cd4a", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "오늘 전체 운행은 시작해서 끝날 때까지 걸리는 시간이 제일 짧게 짜 주세요. 가능하면 우선순위 높은 배송부터 일찍 도착하게 하고, 모든 배송은 기사별 대기 가능 시간 안에 처리하고 기사 운행은 근무 종료 전, 매 왕복은 해당 기사 회차 마감 전까지 끝내 주세요. 가능하면 경로마다 100 km는 넘기지 말아 주세요."}], "ir": "MINIMIZE( UNSPECIFIED(x0 in routes: duration(x0)) )\n[SOFT] MINIMIZE( SUM(x1 in visits: priority_weighted_arrival(x1)) )\n[SOFT] AND( EACH(x2 in routes): EACH(x3 in rounds(x2)): end_time(x3) <= round_window_end(x2), EACH(x4 in routes): EACH(x5 in visits(x4)): wait_duration(x5) <= max_wait(x4), EACH(x6 in routes): end_time(x6) <= work_end(x6) )\n[SOFT] EACH(x7 in routes): travel_distance(x7) <= 100 km", "decision_kind": "clarify", "gold_decision": {"candidate_refs": [], "kind": "clarify", "missing_field_refs": [], "reason_code": "ambiguous_capability", "required_inputs": []}, "stratum": "v3/multi", "episode_id": null} {"id": "v3/multi:routing:552cfa5b8f07812b", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "목표는 모든 경로의 총 운행시간 최소화입니다. 소프트 조건으로는 배송 우선순위가 높은 건의 도착시간을 가능한 한 앞당기고, 모든 배송의 대기시간은 해당 기사별 허용 대기시간 이내, 각 경로 종료는 해당 기사 근무 종료시각 이내, 각 왕복 종료는 해당 기사 회차 마감시각 이내로 해주세요. 또한 가능하면 각 경로의 이동거리를 100 km 이하로 유지하세요."}], "ir": "MINIMIZE( SUM(x0 in routes: duration(x0)) )\n[SOFT] MINIMIZE( SUM(x1 in visits: priority_weighted_arrival(x1)) )\n[SOFT] AND( EACH(x2 in routes): EACH(x3 in rounds(x2)): end_time(x3) <= round_window_end(x2), EACH(x4 in routes): EACH(x5 in visits(x4)): wait_duration(x5) <= max_wait(x4), EACH(x6 in routes): end_time(x6) <= work_end(x6) )\n[SOFT] EACH(x7 in routes): travel_distance(x7) <= 100 km", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:delivery_time_priority.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:delivery_time_priority", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:max_distance.exp_factor", "value": {"type": "decimal", "value": "1"}}, {"slot_ref": "slot:max_distance.max_distance", "value": {"type": "decimal", "value": "100000"}}], "constraint_ref": "constraint:max_distance", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:rider_time_window.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:rider_time_window", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:duration_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v3/multi", "episode_id": null} {"id": "v3/multi:routing:27f03c3248ec9ab1", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "오늘 전체 이동거리 최소화하는 걸 목표로 잡아주시고요, 가능하면 한 경로당 배송 건수는 8건 넘지 않게 해주시고, 이것도 가능하면 매 왕복마다 화물 적재율 중 제일 높은 항목이 0.6 이상은 되게 맞춰주세요."}], "ir": "MINIMIZE( SUM(x0 in routes: travel_distance(x0)) )\n[SOFT] EACH(x1 in routes): delivery_count(x1) <= 8\n[SOFT] EACH(x2 in routes): EACH(x3 in rounds(x2)): MAX(x4 in keys(load): utilization[x4](x3)) >= 0.6", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:delivery_length.exp_factor", "value": {"type": "decimal", "value": "2"}}, {"slot_ref": "slot:delivery_length.max_size", "value": {"type": "decimal", "value": "8"}}], "constraint_ref": "constraint:delivery_length", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:min_capacity.target_ratio", "value": {"type": "decimal", "value": "0.6"}}], "constraint_ref": "constraint:min_capacity", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:distance_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v3/multi", "episode_id": null} {"id": "v3/multi:routing:cc6fe9878e4965c2", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "전체 경로의 이동거리 합을 최소화하는 것을 목표로 합니다. 가능하면 각 경로의 배송 건수는 8건 이하로 유지해 주시고, 가능하면 각 경로의 매 왕복마다 화물 칸별 적재율 중 최댓값이 0.6 이상이 되도록 해주십시오."}], "ir": "MINIMIZE( SUM(x0 in routes: travel_distance(x0)) )\n[SOFT] EACH(x1 in routes): delivery_count(x1) <= 8\n[SOFT] EACH(x2 in routes): EACH(x3 in rounds(x2)): MAX(x4 in keys(load): utilization[x4](x3)) >= 0.6", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:delivery_length.exp_factor", "value": {"type": "decimal", "value": "2"}}, {"slot_ref": "slot:delivery_length.max_size", "value": {"type": "decimal", "value": "8"}}], "constraint_ref": "constraint:delivery_length", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:min_capacity.target_ratio", "value": {"type": "decimal", "value": "0.6"}}], "constraint_ref": "constraint:min_capacity", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:distance_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v3/multi", "episode_id": null} {"id": "v3/multi:routing:1f3bcb1ac890f7a4", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "모든 경로를 합친 이동거리가 가장 짧아지도록 짜주세요. 그리고 가능하면 경로별 배송 건수는 8건을 넘지 않도록 하고, 또한 가능하면 왕복할 때마다 적재율 중 가장 높은 값이 0.6 이상 나오도록 해주시면 좋겠습니다."}], "ir": "MINIMIZE( SUM(x0 in routes: travel_distance(x0)) )\n[SOFT] EACH(x1 in routes): delivery_count(x1) <= 8\n[SOFT] EACH(x2 in routes): EACH(x3 in rounds(x2)): MAX(x4 in keys(load): utilization[x4](x3)) >= 0.6", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:delivery_length.exp_factor", "value": {"type": "decimal", "value": "2"}}, {"slot_ref": "slot:delivery_length.max_size", "value": {"type": "decimal", "value": "8"}}], "constraint_ref": "constraint:delivery_length", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:min_capacity.target_ratio", "value": {"type": "decimal", "value": "0.6"}}], "constraint_ref": "constraint:min_capacity", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:distance_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v3/multi", "episode_id": null} {"id": "v3/multi:routing:7c47ca768842f0cf", "domain": "routing", "language": "en", "messages": [{"role": "user", "content": "Let's plan today's routes to keep the total driving distance as low as possible. If you can, try to keep each route to 8 deliveries or fewer, and also if possible make sure that on every round trip, the highest load ratio among the cargo compartments is at least 0.6."}], "ir": "MINIMIZE( SUM(x0 in routes: travel_distance(x0)) )\n[SOFT] EACH(x1 in routes): delivery_count(x1) <= 8\n[SOFT] EACH(x2 in routes): EACH(x3 in rounds(x2)): MAX(x4 in keys(load): utilization[x4](x3)) >= 0.6", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:delivery_length.exp_factor", "value": {"type": "decimal", "value": "2"}}, {"slot_ref": "slot:delivery_length.max_size", "value": {"type": "decimal", "value": "8"}}], "constraint_ref": "constraint:delivery_length", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:min_capacity.target_ratio", "value": {"type": "decimal", "value": "0.6"}}], "constraint_ref": "constraint:min_capacity", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:distance_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v3/multi", "episode_id": null} {"id": "v3/multi:routing:85d6f737b2c2d547", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "오늘 모든 노선의 연료비 합계를 가장 낮게 잡아주세요. 모든 노선의 각 회차에서는 모든 적재 항목별로 각 정차 지점에서 실린 양 중 가장 큰 값이 그 차량의 해당 용량을 절대 넘으면 안 됩니다. 가능하면 모든 배송 건의 서비스 전 대기시간은 해당 기사별 대기 한도 이내로 맞춰주세요. 가능하면 각 노선은 해당 기사의 근무 종료 전까지 끝내고, 각 회차도 그 기사의 회차 시간창 종료 전까지 마쳐주세요. 가능하면 배송별 시간 우선순위를 반영한 전체 도착시간도 최소로 해주세요."}], "ir": "MINIMIZE( SUM(x0 in routes: fuel_cost(x0)) )\n[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)\n[SOFT] AND( EACH(x5 in routes): EACH(x6 in rounds(x5)): end_time(x6) <= round_window_end(x5), EACH(x7 in routes): EACH(x8 in visits(x7)): wait_duration(x8) <= max_wait(x7), EACH(x9 in routes): end_time(x9) <= work_end(x9) )\n[SOFT] MINIMIZE( SUM(x10 in visits: priority_weighted_arrival(x10)) )", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:capacity.exp_factor", "value": {"type": "decimal", "value": "1"}}], "constraint_ref": "constraint:capacity", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [{"slot_ref": "slot:delivery_time_priority.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:delivery_time_priority", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:rider_time_window.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:rider_time_window", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fuel_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v3/multi", "episode_id": null} {"id": "v3/multi:routing:af4800d7411abfd3", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "전체 노선의 연료비를 최소화해 주세요. 반드시 모든 노선의 모든 회차에서, 모든 적재 항목에 대해 각 정차지의 최대 적재량이 해당 차량의 용량 이하여야 합니다. 가능하면 각 배송의 서비스 전 대기시간은 해당 기사의 대기 한도 이내로 유지해 주세요. 가능하면 각 노선의 종료 시각은 해당 기사의 근무 종료 시각을 넘지 않게 해 주세요. 가능하면 각 회차의 종료 시각도 해당 기사의 회차 시간창 종료 시각을 넘지 않게 해 주세요. 가능하면 배송별 시간 우선순위를 반영한 도착시간 합계도 최소화해 주세요."}], "ir": "MINIMIZE( SUM(x0 in routes: fuel_cost(x0)) )\n[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)\n[SOFT] AND( EACH(x5 in routes): EACH(x6 in rounds(x5)): end_time(x6) <= round_window_end(x5), EACH(x7 in routes): EACH(x8 in visits(x7)): wait_duration(x8) <= max_wait(x7), EACH(x9 in routes): end_time(x9) <= work_end(x9) )\n[SOFT] MINIMIZE( SUM(x10 in visits: priority_weighted_arrival(x10)) )", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:capacity.exp_factor", "value": {"type": "decimal", "value": "1"}}], "constraint_ref": "constraint:capacity", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [{"slot_ref": "slot:delivery_time_priority.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:delivery_time_priority", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:rider_time_window.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:rider_time_window", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fuel_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v3/multi", "episode_id": null} {"id": "v3/multi:routing:f9b179f60770f1c2", "domain": "routing", "language": "en", "messages": [{"role": "user", "content": "Minimize total fuel cost across all routes. As a hard rule, on every round trip of every route, the maximum load at any position in each cargo dimension must not exceed that route vehicle's capacity in that dimension. If possible, keep every delivery's pre-service wait within its route rider's waiting limit. If possible, finish every route by its rider's work end. If possible, finish every round trip by its rider's round-window end. If possible, also minimize total arrival time weighted by each delivery's time priority."}], "ir": "MINIMIZE( SUM(x0 in routes: fuel_cost(x0)) )\n[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)\n[SOFT] AND( EACH(x5 in routes): EACH(x6 in rounds(x5)): end_time(x6) <= round_window_end(x5), EACH(x7 in routes): EACH(x8 in visits(x7)): wait_duration(x8) <= max_wait(x7), EACH(x9 in routes): end_time(x9) <= work_end(x9) )\n[SOFT] MINIMIZE( SUM(x10 in visits: priority_weighted_arrival(x10)) )", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:capacity.exp_factor", "value": {"type": "decimal", "value": "1"}}], "constraint_ref": "constraint:capacity", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [{"slot_ref": "slot:delivery_time_priority.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:delivery_time_priority", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:rider_time_window.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:rider_time_window", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fuel_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v3/multi", "episode_id": null} {"id": "v3/multi:routing:645cd074f5b6e6ad", "domain": "routing", "language": "mixed", "messages": [{"role": "user", "content": "전체 route의 fuel cost 합계는 최소로 해주세요. 단, 모든 route의 모든 round trip에서 각 cargo 항목별 최대 적재량은 그 route 차량의 해당 capacity를 반드시 넘지 않아야 합니다. 가능하면 각 delivery의 service 전 wait time은 그 route rider의 wait limit 안으로 맞춰주세요. 가능하면 각 route는 해당 rider의 work end 전까지 끝내고, 각 round trip도 해당 rider의 round window end 전까지 끝내주세요. 가능하면 delivery별 time priority를 반영한 전체 arrival time도 최소화해 주세요."}], "ir": "MINIMIZE( SUM(x0 in routes: fuel_cost(x0)) )\n[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)\n[SOFT] AND( EACH(x5 in routes): EACH(x6 in rounds(x5)): end_time(x6) <= round_window_end(x5), EACH(x7 in routes): EACH(x8 in visits(x7)): wait_duration(x8) <= max_wait(x7), EACH(x9 in routes): end_time(x9) <= work_end(x9) )\n[SOFT] MINIMIZE( SUM(x10 in visits: priority_weighted_arrival(x10)) )", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:capacity.exp_factor", "value": {"type": "decimal", "value": "1"}}], "constraint_ref": "constraint:capacity", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [{"slot_ref": "slot:delivery_time_priority.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:delivery_time_priority", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:rider_time_window.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:rider_time_window", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fuel_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v3/multi", "episode_id": null} {"id": "v3/multi:routing:376fd3c94c393fbe", "domain": "routing", "language": "en", "messages": [{"role": "user", "content": "Minimize total vehicle fixed operating cost. If possible, keep each route’s stops within an 8 km enclosing-circle radius; also try to meet every rider’s own delivery-wait limit, work end time, and round-end window."}], "ir": "MINIMIZE( SUM(x0 in routes: fixed_cost(x0)) )\n[SOFT] EACH(x1 in routes): sec_radius(x1) <= 8 km\n[SOFT] AND( EACH(x2 in routes): EACH(x3 in rounds(x2)): end_time(x3) <= round_window_end(x2), EACH(x4 in routes): EACH(x5 in visits(x4)): wait_duration(x5) <= max_wait(x4), EACH(x6 in routes): end_time(x6) <= work_end(x6) )", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:enclosing_circle_radius.exp_factor", "value": {"type": "decimal", "value": "2"}}, {"slot_ref": "slot:enclosing_circle_radius.max_radius", "value": {"type": "decimal", "value": "8000"}}], "constraint_ref": "constraint:enclosing_circle_radius", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:rider_time_window.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:rider_time_window", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fixed_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v3/multi", "episode_id": null} {"id": "v3/multi:routing:df9cdd138b9b0e67", "domain": "routing", "language": "en", "messages": [{"role": "user", "content": "Keep total vehicle fixed costs as low as possible. Prefer routes whose stops fit within an 8 km radius, and if possible ensure each rider’s delivery waits, shift finish, and each round’s finish stay within that rider’s respective limits."}], "ir": "MINIMIZE( SUM(x0 in routes: fixed_cost(x0)) )\n[SOFT] EACH(x1 in routes): sec_radius(x1) <= 8 km\n[SOFT] AND( EACH(x2 in routes): EACH(x3 in rounds(x2)): end_time(x3) <= round_window_end(x2), EACH(x4 in routes): EACH(x5 in visits(x4)): wait_duration(x5) <= max_wait(x4), EACH(x6 in routes): end_time(x6) <= work_end(x6) )", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:enclosing_circle_radius.exp_factor", "value": {"type": "decimal", "value": "2"}}, {"slot_ref": "slot:enclosing_circle_radius.max_radius", "value": {"type": "decimal", "value": "8000"}}], "constraint_ref": "constraint:enclosing_circle_radius", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:rider_time_window.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:rider_time_window", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fixed_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v3/multi", "episode_id": null} {"id": "v3/multi:routing:8fc35062a6f4b711", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "차량 전체 고정 운영비는 가장 적게 잡아 주세요. 가능하면 모든 배송 경로의 정차지가 퍼진 범위는 8 km 안으로 하고, 각 기사 기준으로 모든 배송 대기시간과 근무 종료시간, 각 회차 종료시간도 각각 정해진 시간 안에 맞춰 주세요."}], "ir": "MINIMIZE( SUM(x0 in routes: fixed_cost(x0)) )\n[SOFT] EACH(x1 in routes): sec_radius(x1) <= 8 km\n[SOFT] AND( EACH(x2 in routes): EACH(x3 in rounds(x2)): end_time(x3) <= round_window_end(x2), EACH(x4 in routes): EACH(x5 in visits(x4)): wait_duration(x5) <= max_wait(x4), EACH(x6 in routes): end_time(x6) <= work_end(x6) )", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:enclosing_circle_radius.exp_factor", "value": {"type": "decimal", "value": "2"}}, {"slot_ref": "slot:enclosing_circle_radius.max_radius", "value": {"type": "decimal", "value": "8000"}}], "constraint_ref": "constraint:enclosing_circle_radius", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:rider_time_window.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:rider_time_window", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fixed_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v3/multi", "episode_id": null} {"id": "v3/multi:routing:a7fb41c23ab9327d", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "차량 고정 운영비 합계를 최소화해 주세요. 가능하면 모든 경로의 정차지가 퍼진 범위는 8 km 이내로 유지하고, 각 기사의 배송 대기시간·근무 종료시간·각 회차 종료시간은 해당 기사별 허용 시간 안에 맞춰 주세요."}], "ir": "MINIMIZE( SUM(x0 in routes: fixed_cost(x0)) )\n[SOFT] EACH(x1 in routes): sec_radius(x1) <= 8 km\n[SOFT] AND( EACH(x2 in routes): EACH(x3 in rounds(x2)): end_time(x3) <= round_window_end(x2), EACH(x4 in routes): EACH(x5 in visits(x4)): wait_duration(x5) <= max_wait(x4), EACH(x6 in routes): end_time(x6) <= work_end(x6) )", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:enclosing_circle_radius.exp_factor", "value": {"type": "decimal", "value": "2"}}, {"slot_ref": "slot:enclosing_circle_radius.max_radius", "value": {"type": "decimal", "value": "8000"}}], "constraint_ref": "constraint:enclosing_circle_radius", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:rider_time_window.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:rider_time_window", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fixed_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v3/multi", "episode_id": null} {"id": "v3/multi:routing:9b901783183eb52f", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "오늘 배차는 차량 고정 운영비가 가장 적게 들게 잡아줘. 각 경로 배송은 가능하면 3건 이하로 하고, 가능하면 각 배송 대기시간은 해당 기사 기준 안에, 운행 종료는 기사 근무 종료 전까지, 각 왕복도 기사 왕복 시간 창이 끝나기 전까지 맞춰줘. 대신 모든 경로는 기사 계약 최소 왕복 횟수만큼은 반드시 왕복해야 해."}], "ir": "MINIMIZE( SUM(x0 in routes: fixed_cost(x0)) )\n[SOFT] EACH(x1 in routes): delivery_count(x1) <= 3\n[SOFT] AND( EACH(x2 in routes): EACH(x3 in rounds(x2)): end_time(x3) <= round_window_end(x2), EACH(x4 in routes): EACH(x5 in visits(x4)): wait_duration(x5) <= max_wait(x4), EACH(x6 in routes): end_time(x6) <= work_end(x6) )\n[HARD] EACH(x7 in routes): round_count(x7) >= base_rounds(x7)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:minimum_round", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [{"slot_ref": "slot:delivery_length.exp_factor", "value": {"type": "decimal", "value": "2"}}, {"slot_ref": "slot:delivery_length.max_size", "value": {"type": "decimal", "value": "3"}}], "constraint_ref": "constraint:delivery_length", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:rider_time_window.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:rider_time_window", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fixed_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v3/multi", "episode_id": null} {"id": "v3/multi:routing:71785ad14bebfc3f", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "오늘 운행 계획은 차량 고정 운영비를 최소화해 주세요. 경로별 배송 건수는 가능하면 3건 이하로 해 주시고, 가능하면 각 배송의 대기시간은 해당 기사 대기 기준 이내로, 경로 종료는 기사 근무 종료 전으로, 각 왕복 종료는 해당 기사 왕복 시간대 종료 전으로 맞춰 주세요. 각 경로의 왕복 횟수는 반드시 해당 기사 계약 최소 왕복 횟수 이상이어야 합니다."}], "ir": "MINIMIZE( SUM(x0 in routes: fixed_cost(x0)) )\n[SOFT] EACH(x1 in routes): delivery_count(x1) <= 3\n[SOFT] AND( EACH(x2 in routes): EACH(x3 in rounds(x2)): end_time(x3) <= round_window_end(x2), EACH(x4 in routes): EACH(x5 in visits(x4)): wait_duration(x5) <= max_wait(x4), EACH(x6 in routes): end_time(x6) <= work_end(x6) )\n[HARD] EACH(x7 in routes): round_count(x7) >= base_rounds(x7)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:minimum_round", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [{"slot_ref": "slot:delivery_length.exp_factor", "value": {"type": "decimal", "value": "2"}}, {"slot_ref": "slot:delivery_length.max_size", "value": {"type": "decimal", "value": "3"}}], "constraint_ref": "constraint:delivery_length", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:rider_time_window.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:rider_time_window", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fixed_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v3/multi", "episode_id": null} {"id": "v3/multi:routing:2c86bcb6f88519a0", "domain": "routing", "language": "en", "messages": [{"role": "user", "content": "Plan today’s runs to minimize total vehicle fixed operating cost. If possible, keep each route to no more than 3 deliveries; also, if possible, keep every delivery’s wait within that rider’s own limit, finish each route by that rider’s work end, and finish every round trip by that rider’s round-window end. Every route must make at least its rider’s contracted number of round trips."}], "ir": "MINIMIZE( SUM(x0 in routes: fixed_cost(x0)) )\n[SOFT] EACH(x1 in routes): delivery_count(x1) <= 3\n[SOFT] AND( EACH(x2 in routes): EACH(x3 in rounds(x2)): end_time(x3) <= round_window_end(x2), EACH(x4 in routes): EACH(x5 in visits(x4)): wait_duration(x5) <= max_wait(x4), EACH(x6 in routes): end_time(x6) <= work_end(x6) )\n[HARD] EACH(x7 in routes): round_count(x7) >= base_rounds(x7)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:minimum_round", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [{"slot_ref": "slot:delivery_length.exp_factor", "value": {"type": "decimal", "value": "2"}}, {"slot_ref": "slot:delivery_length.max_size", "value": {"type": "decimal", "value": "3"}}], "constraint_ref": "constraint:delivery_length", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:rider_time_window.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:rider_time_window", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fixed_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v3/multi", "episode_id": null} {"id": "v3/multi:routing:b17dcd0c8911ded3", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "오늘 배차는 차량 고정 운영비를 가장 적게 하자. 경로마다 배송은 가능하면 3건 이하로 하고, 가능하면 배송 대기는 각 기사 기준 안으로, 운행 끝나는 시간은 기사 퇴근 전으로, 왕복은 기사 왕복 시간대 끝나기 전으로 맞춰줘. 각 경로는 기사 계약 최소 왕복 횟수 이상을 반드시 채워."}], "ir": "MINIMIZE( SUM(x0 in routes: fixed_cost(x0)) )\n[SOFT] EACH(x1 in routes): delivery_count(x1) <= 3\n[SOFT] AND( EACH(x2 in routes): EACH(x3 in rounds(x2)): end_time(x3) <= round_window_end(x2), EACH(x4 in routes): EACH(x5 in visits(x4)): wait_duration(x5) <= max_wait(x4), EACH(x6 in routes): end_time(x6) <= work_end(x6) )\n[HARD] EACH(x7 in routes): round_count(x7) >= base_rounds(x7)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:minimum_round", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [{"slot_ref": "slot:delivery_length.exp_factor", "value": {"type": "decimal", "value": "2"}}, {"slot_ref": "slot:delivery_length.max_size", "value": {"type": "decimal", "value": "3"}}], "constraint_ref": "constraint:delivery_length", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:rider_time_window.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:rider_time_window", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fixed_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v3/multi", "episode_id": null} {"id": "v3/multi:retail:72eee98a0c8937d8", "domain": "retail", "language": "ko", "messages": [{"role": "user", "content": "발주는 반드시 품목별 발주 가능 요일에만 넣어야 하고, 주문 수량은 항상 최소 발주량의 배수로만 넣어야 합니다. 또한 모든 품목의 모든 재고 단위는 유통기한이 입고일에 그 품목의 제품 수명을 더한 날짜와 정확히 같아야 합니다. 이 조건들을 다 지키면서 전체 계획 기간의 평균 재고 보유비용을 최소화해 주세요."}], "ir": "MINIMIZE( MEAN(x0 in days(horizon): holding_cost(x0)) )\n[HARD] EACH(x1 in orders): day_of_week(x1) IN allowed_order_days(x1)\n[HARD] EACH(x2 in orders): quantity(x2) MULTIPLE_OF min_order_quantity(x2)\n[HARD] EACH(x3 in items): EACH(x4 in units(x3)): expiry_day(x4) = offset(arrival_day(x4), product_life(x3))", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:minimum_order_quantity", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [], "constraint_ref": "constraint:order_days", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [], "constraint_ref": "constraint:shelf_life", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:minimize_holding_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v3/multi", "episode_id": null} {"id": "v3/multi:retail:0690ddd9384b8ff4", "domain": "retail", "language": "en", "messages": [{"role": "user", "content": "So the objective is to minimize the average holding cost across the planning days. Then as hard constraints, every order must fall on one of the item's allowed order weekdays, every order quantity must be a multiple of that item's minimum order quantity, and for every stock unit the expiry day must equal the arrival day plus the item's shelf life."}], "ir": "MINIMIZE( MEAN(x0 in days(horizon): holding_cost(x0)) )\n[HARD] EACH(x1 in orders): day_of_week(x1) IN allowed_order_days(x1)\n[HARD] EACH(x2 in orders): quantity(x2) MULTIPLE_OF min_order_quantity(x2)\n[HARD] EACH(x3 in items): EACH(x4 in units(x3)): expiry_day(x4) = offset(arrival_day(x4), product_life(x3))", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:minimum_order_quantity", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [], "constraint_ref": "constraint:order_days", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [], "constraint_ref": "constraint:shelf_life", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:minimize_holding_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v3/multi", "episode_id": null} {"id": "v3/multi:retail:3b421738f13c1854", "domain": "retail", "language": "en", "messages": [{"role": "user", "content": "Look, orders must only go out on the days each item is allowed to be ordered, no exceptions there, and every order quantity must always be a multiple of that item's minimum order quantity. Also expiry dates always have to match the arrival date plus the item's shelf life. On top of that, try to bring the average holding cost down across the whole planning period."}], "ir": "MINIMIZE( MEAN(x0 in days(horizon): holding_cost(x0)) )\n[HARD] EACH(x1 in orders): day_of_week(x1) IN allowed_order_days(x1)\n[HARD] EACH(x2 in orders): quantity(x2) MULTIPLE_OF min_order_quantity(x2)\n[HARD] EACH(x3 in items): EACH(x4 in units(x3)): expiry_day(x4) = offset(arrival_day(x4), product_life(x3))", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:minimum_order_quantity", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [], "constraint_ref": "constraint:order_days", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [], "constraint_ref": "constraint:shelf_life", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:minimize_holding_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v3/multi", "episode_id": null} {"id": "v3/multi:retail:81e495226d8df1c9", "domain": "retail", "language": "en", "messages": [{"role": "user", "content": "The objective here is minimizing the mean holding cost over the planning days. On the constraint side, three things are hard: each order's weekday has to be one of the item's allowed order days, each order quantity has to be a multiple of the item's minimum order quantity, and every stock unit's expiry day has to equal its arrival day plus the item's shelf life, all non-negotiable."}], "ir": "MINIMIZE( MEAN(x0 in days(horizon): holding_cost(x0)) )\n[HARD] EACH(x1 in orders): day_of_week(x1) IN allowed_order_days(x1)\n[HARD] EACH(x2 in orders): quantity(x2) MULTIPLE_OF min_order_quantity(x2)\n[HARD] EACH(x3 in items): EACH(x4 in units(x3)): expiry_day(x4) = offset(arrival_day(x4), product_life(x3))", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:minimum_order_quantity", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [], "constraint_ref": "constraint:order_days", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [], "constraint_ref": "constraint:shelf_life", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:minimize_holding_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v3/multi", "episode_id": null} {"id": "v3/multi:retail:3c4fbfed5b3ffc5c", "domain": "retail", "language": "ko", "messages": [{"role": "user", "content": "계획 기간 동안 품목이 재고로 있는 날의 비율을 최대화해 주세요. 모든 보충 발주는 해당 품목의 최소 발주량 배수여야 합니다. 모든 품목의 각 재고 단위는 입고일에 해당 품목의 유통기한을 더한 날이 만료일이어야 합니다. 모든 보충 발주는 발주일에 해당 품목의 공급업체 리드타임을 더한 날에 입고되어야 합니다."}], "ir": "MAXIMIZE( in_stock_rate )\nEACH(x0 in orders): quantity(x0) MULTIPLE_OF min_order_quantity(x0)\nEACH(x1 in items): EACH(x2 in units(x1)): expiry_day(x2) = offset(arrival_day(x2), product_life(x1))\nEACH(x3 in orders): arrival_day(x3) = offset(order_day(x3), lead_time(x3))", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:lead_time", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [], "constraint_ref": "constraint:minimum_order_quantity", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [], "constraint_ref": "constraint:shelf_life", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:minimize_stockout", "weight": "1/1"}]}, "parameters": []}, "stratum": "v3/multi", "episode_id": null} {"id": "v3/multi:retail:2c4353e86d98f748", "domain": "retail", "language": "ko", "messages": [{"role": "user", "content": "기간 내내 물건이 재고 있는 날 비율을 최대한 높여 주세요. 발주는 건마다 꼭 그 품목 최소 발주량의 배수로 넣어야 하고요. 각 품목의 재고 하나하나는 입고일에서 그 품목 유통기한만큼 지난 날이 반드시 만료일이어야 해요. 또 모든 발주는 발주일에 해당 품목 공급처 리드타임을 더한 날에 꼭 들어와야 합니다."}], "ir": "MAXIMIZE( in_stock_rate )\n[HARD] EACH(x0 in orders): quantity(x0) MULTIPLE_OF min_order_quantity(x0)\n[HARD] EACH(x1 in items): EACH(x2 in units(x1)): expiry_day(x2) = offset(arrival_day(x2), product_life(x1))\n[HARD] EACH(x3 in orders): arrival_day(x3) = offset(order_day(x3), lead_time(x3))", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:lead_time", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [], "constraint_ref": "constraint:minimum_order_quantity", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [], "constraint_ref": "constraint:shelf_life", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:minimize_stockout", "weight": "1/1"}]}, "parameters": []}, "stratum": "v3/multi", "episode_id": null} {"id": "v3/multi:retail:6e7973e412aa4194", "domain": "retail", "language": "ko", "messages": [{"role": "user", "content": "재고가 있는 날의 비중을 최대화해 주세요. 모든 발주는 품목별 최소 발주량의 배수여야 하며, 모든 재고 단위의 만료일은 입고일에 해당 품목의 유통기한을 더한 날이어야 합니다. 또한 모든 발주의 입고일은 발주일에 해당 품목의 공급업체 리드타임을 더한 날이어야 합니다."}], "ir": "MAXIMIZE( in_stock_rate )\nEACH(x0 in orders): quantity(x0) MULTIPLE_OF min_order_quantity(x0)\nEACH(x1 in items): EACH(x2 in units(x1)): expiry_day(x2) = offset(arrival_day(x2), product_life(x1))\nEACH(x3 in orders): arrival_day(x3) = offset(order_day(x3), lead_time(x3))", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:lead_time", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [], "constraint_ref": "constraint:minimum_order_quantity", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [], "constraint_ref": "constraint:shelf_life", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:minimize_stockout", "weight": "1/1"}]}, "parameters": []}, "stratum": "v3/multi", "episode_id": null} {"id": "v3/multi:retail:2c15153519193d43", "domain": "retail", "language": "en", "messages": [{"role": "user", "content": "Maximize the share of days items are in stock. Every replenishment order must be a whole multiple of that item’s minimum order quantity; every unit’s expiry day must be its arrival day plus the item’s shelf life; and every order’s arrival day must be its order day plus the item’s supplier lead time."}], "ir": "MAXIMIZE( in_stock_rate )\n[HARD] EACH(x0 in orders): quantity(x0) MULTIPLE_OF min_order_quantity(x0)\n[HARD] EACH(x1 in items): EACH(x2 in units(x1)): expiry_day(x2) = offset(arrival_day(x2), product_life(x1))\n[HARD] EACH(x3 in orders): arrival_day(x3) = offset(order_day(x3), lead_time(x3))", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:lead_time", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [], "constraint_ref": "constraint:minimum_order_quantity", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [], "constraint_ref": "constraint:shelf_life", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:minimize_stockout", "weight": "1/1"}]}, "parameters": []}, "stratum": "v3/multi", "episode_id": null} {"id": "v3/multi:retail:9fe32e9ca2446d02", "domain": "retail", "language": "mixed", "messages": [{"role": "user", "content": "목표는 폐기율을 최소화하는 것입니다. 입고일은 항상 발주일에 리드타임을 더한 날짜여야 하고, 발주량은 항상 MOQ(최소 발주량)의 배수여야 하며, 유통기한은 항상 입고일에 shelf life를 더한 날짜로 고정되어야 합니다."}], "ir": "MINIMIZE( waste_rate )\nEACH(x0 in orders): arrival_day(x0) = offset(order_day(x0), lead_time(x0))\nEACH(x1 in orders): quantity(x1) MULTIPLE_OF min_order_quantity(x1)\nEACH(x2 in items): EACH(x3 in units(x2)): expiry_day(x3) = offset(arrival_day(x3), product_life(x2))", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:lead_time", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [], "constraint_ref": "constraint:minimum_order_quantity", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [], "constraint_ref": "constraint:shelf_life", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:minimize_waste", "weight": "1/1"}]}, "parameters": []}, "stratum": "v3/multi", "episode_id": null} {"id": "v3/multi:retail:21eed1eb7c4f3049", "domain": "retail", "language": "mixed", "messages": [{"role": "user", "content": "이번엔 폐기부터 줄이는 게 목표예요. 입고일은 무조건 발주일에 리드타임 더한 날짜로 잡아야 하고, 발주 수량도 꼭 MOQ 배수로 맞춰야 하고, 유통기한은 항상 입고일에 shelf life 더한 날짜로 정해야 해요."}], "ir": "MINIMIZE( waste_rate )\n[HARD] EACH(x0 in orders): arrival_day(x0) = offset(order_day(x0), lead_time(x0))\n[HARD] EACH(x1 in orders): quantity(x1) MULTIPLE_OF min_order_quantity(x1)\n[HARD] EACH(x2 in items): EACH(x3 in units(x2)): expiry_day(x3) = offset(arrival_day(x3), product_life(x2))", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:lead_time", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [], "constraint_ref": "constraint:minimum_order_quantity", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [], "constraint_ref": "constraint:shelf_life", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:minimize_waste", "weight": "1/1"}]}, "parameters": []}, "stratum": "v3/multi", "episode_id": null} {"id": "v3/multi:retail:4e5a0d4bb411f36c", "domain": "retail", "language": "mixed", "messages": [{"role": "user", "content": "이번 리플레니시먼트 모델의 objective는 waste rate 최소화입니다. hard 제약으로, 입고일은 항상 발주일+리드타임이어야 하고, 발주량은 항상 최소 발주량의 배수여야 하며, 유통기한도 항상 입고일+shelf life로 고정되어야 합니다."}], "ir": "MINIMIZE( waste_rate )\n[HARD] EACH(x0 in orders): arrival_day(x0) = offset(order_day(x0), lead_time(x0))\n[HARD] EACH(x1 in orders): quantity(x1) MULTIPLE_OF min_order_quantity(x1)\n[HARD] EACH(x2 in items): EACH(x3 in units(x2)): expiry_day(x3) = offset(arrival_day(x3), product_life(x2))", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:lead_time", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [], "constraint_ref": "constraint:minimum_order_quantity", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [], "constraint_ref": "constraint:shelf_life", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:minimize_waste", "weight": "1/1"}]}, "parameters": []}, "stratum": "v3/multi", "episode_id": null} {"id": "v3/multi:retail:9c73d8e1f0aa6ffa", "domain": "retail", "language": "ko", "messages": [{"role": "user", "content": "폐기율을 최소화하는 방향으로 가야 합니다. 입고일은 항상 발주일에 리드타임을 더한 날짜여야 하고, 발주량은 항상 최소 발주량의 배수여야 하며, 유통기한은 항상 입고일에 제품 수명을 더한 날짜여야 합니다."}], "ir": "MINIMIZE( waste_rate )\nEACH(x0 in orders): arrival_day(x0) = offset(order_day(x0), lead_time(x0))\nEACH(x1 in orders): quantity(x1) MULTIPLE_OF min_order_quantity(x1)\nEACH(x2 in items): EACH(x3 in units(x2)): expiry_day(x3) = offset(arrival_day(x3), product_life(x2))", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:lead_time", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [], "constraint_ref": "constraint:minimum_order_quantity", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [], "constraint_ref": "constraint:shelf_life", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:minimize_waste", "weight": "1/1"}]}, "parameters": []}, "stratum": "v3/multi", "episode_id": null} {"id": "v3/multi:retail:7d56146151b2d9c2", "domain": "retail", "language": "ko", "messages": [{"role": "user", "content": "평균 재고 유지비 최소화하는 쪽으로 발주 좀 짜줘. 발주는 되도록 품목별 정해진 요일에 맞춰서 넣고, 입고일도 되도록 발주일에 리드타임 더한 날짜로 맞춰주면 좋겠어."}], "ir": "MINIMIZE( MEAN(x0 in days(horizon): holding_cost(x0)) )\n[SOFT] EACH(x1 in orders): day_of_week(x1) IN allowed_order_days(x1)\n[SOFT] EACH(x2 in orders): arrival_day(x2) = offset(order_day(x2), lead_time(x2))", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:lead_time", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [], "constraint_ref": "constraint:order_days", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:minimize_holding_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v3/multi", "episode_id": null} {"id": "v3/multi:retail:d3a93740c1eea184", "domain": "retail", "language": "en", "messages": [{"role": "user", "content": "Let's aim to bring the average daily holding cost down across the whole planning horizon. As a soft preference, try to keep every replenishment order's weekday within that item's allowed order days. Separately, also try to make sure each order's arrival day lands exactly on its order day plus that item's lead time — but neither of these should be treated as a hard rule."}], "ir": "MINIMIZE( MEAN(x0 in days(horizon): holding_cost(x0)) )\n[SOFT] EACH(x1 in orders): day_of_week(x1) IN allowed_order_days(x1)\n[SOFT] EACH(x2 in orders): arrival_day(x2) = offset(order_day(x2), lead_time(x2))", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:lead_time", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [], "constraint_ref": "constraint:order_days", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:minimize_holding_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v3/multi", "episode_id": null} {"id": "v4/base:routing:0a9c1c5d6e9f17bc", "domain": "routing", "language": "en", "messages": [{"role": "user", "content": "Minimize the total time from start to finish across all routes. Each route needs at least 15 deliveries."}], "ir": "MINIMIZE( SUM(x0 in routes: duration(x0)) )\nEACH(x1 in routes): delivery_count(x1) >= 15", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:minimum_order.target_order", "value": {"type": "decimal", "value": "15"}}], "constraint_ref": "constraint:minimum_order", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:duration_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/base", "episode_id": null} {"id": "v4/base:routing:c1190876c48dc949", "domain": "routing", "language": "en", "messages": [{"role": "user", "content": "Plan it so the total elapsed time over all routes is as short as possible, and every route has 15 or more deliveries."}], "ir": "MINIMIZE( SUM(x0 in routes: duration(x0)) )\nEACH(x1 in routes): delivery_count(x1) >= 15", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:minimum_order.target_order", "value": {"type": "decimal", "value": "15"}}], "constraint_ref": "constraint:minimum_order", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:duration_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/base", "episode_id": null} {"id": "v4/base:routing:0a50b3fef4f67142", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "모든 경로의 총 운행시간을 최소로 해줘. 그리고 경로마다 배송 건수는 최소 15건 이상으로 하자."}], "ir": "MINIMIZE( SUM(x0 in routes: duration(x0)) )\nEACH(x1 in routes): delivery_count(x1) >= 15", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:minimum_order.target_order", "value": {"type": "decimal", "value": "15"}}], "constraint_ref": "constraint:minimum_order", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:duration_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/base", "episode_id": null} {"id": "v4/plain:routing:3fe559fdc7aaabeb", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "전체 경로의 차량 운행 고정비 총액을 최소화하고 매 왕복 적재율을 0.6 이상으로 맞춰 주세요"}], "ir": "MINIMIZE( SUM(x0 in routes: fixed_cost(x0)) )\nEACH(x1 in routes): EACH(x2 in rounds(x1)): UNSPECIFIED(x3 in keys(load): utilization[x3](x2)) >= 0.6", "decision_kind": "clarify", "gold_decision": {"candidate_refs": ["constraint:min_capacity"], "kind": "clarify", "missing_field_refs": [], "reason_code": "ambiguous_capability", "required_inputs": []}, "stratum": "v4/plain", "episode_id": null} {"id": "v4/plain:routing:764de4e9adcc5e5b", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "전체 루트의 차량 운행 고정비 합계를 최소화하고 매 라운드 트립 적재율은 0.6 이상으로 맞춰 주세요"}], "ir": "MINIMIZE( SUM(x0 in routes: fixed_cost(x0)) )\nEACH(x1 in routes): EACH(x2 in rounds(x1)): UNSPECIFIED(x3 in keys(load): utilization[x3](x2)) >= 0.6", "decision_kind": "clarify", "gold_decision": {"candidate_refs": ["constraint:min_capacity"], "kind": "clarify", "missing_field_refs": [], "reason_code": "ambiguous_capability", "required_inputs": []}, "stratum": "v4/plain", "episode_id": null} {"id": "v4/plain:routing:a1c59a8506fed1fe", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "모든 경로에서 차량 운행에 드는 고정비 총액을 최소화해 주세요. 각 경로의 매 왕복 적재율은 0.6 이상으로 맞춰 주세요"}], "ir": "MINIMIZE( SUM(x0 in routes: fixed_cost(x0)) )\nEACH(x1 in routes): EACH(x2 in rounds(x1)): UNSPECIFIED(x3 in keys(load): utilization[x3](x2)) >= 0.6", "decision_kind": "clarify", "gold_decision": {"candidate_refs": ["constraint:min_capacity"], "kind": "clarify", "missing_field_refs": [], "reason_code": "ambiguous_capability", "required_inputs": []}, "stratum": "v4/plain", "episode_id": null} {"id": "v4/base:nurse:87241c9f0cdc1951", "domain": "nurse", "language": "ko", "messages": [{"role": "user", "content": "전체 근무조의 수요 대비 부족 인원 합계를 최소화하는 근무표로 부탁드립니다. 모든 간호사의 연속 근무는 4일 이내로 편성 부탁드립니다."}], "ir": "MINIMIZE( SUM(x0 in shift_instances: unmet_demand(x0)) )\nEACH(x1 in workers): RUN_LENGTH(x2 in day_seq(x1): works(x1, x2)) <= 4 day", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:max_days", "value": {"type": "duration", "unit_ref": "unit:day", "value": "4"}}], "constraint_ref": "constraint:max_consecutive_days", "scope": null, "strength": {"kind": "soft", "weight": "100"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:unmet_demand", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/base", "episode_id": null} {"id": "v4/base:nurse:b13fc6b69296a9c9", "domain": "nurse", "language": "en", "messages": [{"role": "user", "content": "Please minimize the total staffing shortfall against demand across all shifts in the roster. Keep consecutive working days to at most 4 days for every nurse."}], "ir": "MINIMIZE( SUM(x0 in shift_instances: unmet_demand(x0)) )\nEACH(x1 in workers): RUN_LENGTH(x2 in day_seq(x1): works(x1, x2)) <= 4 day", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:max_days", "value": {"type": "duration", "unit_ref": "unit:day", "value": "4"}}], "constraint_ref": "constraint:max_consecutive_days", "scope": null, "strength": {"kind": "soft", "weight": "100"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:unmet_demand", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/base", "episode_id": null} {"id": "v4/base:nurse:b6b21a22b2c473c3", "domain": "nurse", "language": "ko", "messages": [{"role": "user", "content": "근무표 짤 때 전체 근무조에서 필요한 인원보다 부족한 인원의 합계를 최소화해줘. 모든 간호사는 연속으로 일하는 날이 4일을 넘지 않게 해줘"}], "ir": "MINIMIZE( SUM(x0 in shift_instances: unmet_demand(x0)) )\nEACH(x1 in workers): RUN_LENGTH(x2 in day_seq(x1): works(x1, x2)) <= 4 day", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:max_days", "value": {"type": "duration", "unit_ref": "unit:day", "value": "4"}}], "constraint_ref": "constraint:max_consecutive_days", "scope": null, "strength": {"kind": "soft", "weight": "100"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:unmet_demand", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/base", "episode_id": null} {"id": "v4/combo:routing:611e0f4d9a370f43", "domain": "routing", "language": "mixed", "messages": [{"role": "user", "content": "전체 route 총 이동거리 최소로, 가능하면 rider 계약 최소 round 수는 채우자"}], "ir": "MINIMIZE( SUM(x0 in routes: travel_distance(x0)) )\n[SOFT] EACH(x1 in routes): round_count(x1) >= base_rounds(x1)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:minimum_round", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:distance_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:c25907b335d17de2", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "모든 경로 합친 총 이동거리를 최소화해줘. 그리고 되도록 각 경로의 왕복 횟수가 그 기사 계약 최소 왕복 횟수 이상이 되게 해줘"}], "ir": "MINIMIZE( SUM(x0 in routes: travel_distance(x0)) )\n[SOFT] EACH(x1 in routes): round_count(x1) >= base_rounds(x1)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:minimum_round", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:distance_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:e74f4bf61ff289a0", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "전체 경로의 총 이동거리를 가장 짧게 만들어 주세요. 가능하면 각 경로마다 창고 왕복 횟수가 해당 기사님의 계약상 최소 왕복 횟수 이상이면 좋겠어요."}], "ir": "MINIMIZE( SUM(x0 in routes: travel_distance(x0)) )\n[SOFT] EACH(x1 in routes): round_count(x1) >= base_rounds(x1)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:minimum_round", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:distance_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:nurse:a96961d20956a351", "domain": "nurse", "language": "ko", "messages": [{"role": "user", "content": "이번 달 근무표 새로 돌릴 건데, 모든 근무 통틀어서 필요 인원보다 모자라는 인원 합이 최소가 되게 해줘. 간호사 전부 연속된 두 근무 사이에는 무조건 10시간 이상 쉬게 하고, 주마다 근무시간은 40시간 이하로 가자"}], "ir": "MINIMIZE( SUM(x0 in shift_instances: unmet_demand(x0)) )\n[HARD] EACH(x1 in workers): EACH(x2 in adjacent(assignment_seq(x1))): gap_duration(x2) >= 10 h\nEACH(x3 in workers): EACH(x4 in windows(WEEK, 1)): SUM(x5 in assignments(x3) WHERE DURING(interval(x5), x4): work_hours(x5)) <= 40 h", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:max_hours", "value": {"type": "duration", "unit_ref": "unit:hour", "value": "40"}}], "constraint_ref": "constraint:max_hours_per_week", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [{"slot_ref": "slot:min_hours", "value": {"type": "duration", "unit_ref": "unit:hour", "value": "10"}}], "constraint_ref": "constraint:min_rest_hours", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:unmet_demand", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/multi:retail:9c8971a0ec9410fd", "domain": "retail", "language": "mixed", "messages": [{"role": "user", "content": "품목별로 재고가 있는 날의 비율을 최대화하도록 발주 계획을 잡아 주세요. 모든 품목의 낱개 재고마다 유통기한 날짜는 입고일에 해당 품목의 shelf life를 더한 날로 잡고, 모든 발주의 수량은 해당 품목 MOQ의 배수로, 입고일은 발주일에 해당 품목 공급업체의 lead time을 더한 날로 잡아 주세요"}], "ir": "MAXIMIZE( in_stock_rate )\nEACH(x0 in items): EACH(x1 in units(x0)): expiry_day(x1) = offset(arrival_day(x1), product_life(x0))\nEACH(x2 in orders): quantity(x2) MULTIPLE_OF min_order_quantity(x2)\nEACH(x3 in orders): arrival_day(x3) = offset(order_day(x3), lead_time(x3))", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:lead_time", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [], "constraint_ref": "constraint:minimum_order_quantity", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [], "constraint_ref": "constraint:shelf_life", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:minimize_stockout", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/multi", "episode_id": null} {"id": "v4/multi:retail:54977a7cca5681c3", "domain": "retail", "language": "en", "messages": [{"role": "user", "content": "Please plan replenishment to maximize the share of days each item is in stock. For every unit of every item, set its expiry date to its arrival date plus that item's shelf life. For every replenishment order, set the quantity to a multiple of the item's minimum order quantity and the arrival date to the order date plus the supplier lead time for that item"}], "ir": "MAXIMIZE( in_stock_rate )\nEACH(x0 in items): EACH(x1 in units(x0)): expiry_day(x1) = offset(arrival_day(x1), product_life(x0))\nEACH(x2 in orders): quantity(x2) MULTIPLE_OF min_order_quantity(x2)\nEACH(x3 in orders): arrival_day(x3) = offset(order_day(x3), lead_time(x3))", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:lead_time", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [], "constraint_ref": "constraint:minimum_order_quantity", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [], "constraint_ref": "constraint:shelf_life", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:minimize_stockout", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/multi", "episode_id": null} {"id": "v4/multi:retail:c0afc74ab7451205", "domain": "retail", "language": "ko", "messages": [{"role": "user", "content": "품목별로 재고가 있는 날의 비율을 최대화하는 발주 계획을 세워 주세요. 모든 품목의 개별 재고마다 유통기한 날짜는 입고일에 그 품목의 유통기한 기간을 더한 날로 잡아 주세요. 모든 보충 발주는 수량을 해당 품목 최소 발주량의 배수로 잡고, 입고일은 발주일에 해당 품목 공급업체의 입고 소요일을 더한 날로 잡아 주세요"}], "ir": "MAXIMIZE( in_stock_rate )\nEACH(x0 in items): EACH(x1 in units(x0)): expiry_day(x1) = offset(arrival_day(x1), product_life(x0))\nEACH(x2 in orders): quantity(x2) MULTIPLE_OF min_order_quantity(x2)\nEACH(x3 in orders): arrival_day(x3) = offset(order_day(x3), lead_time(x3))", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:lead_time", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [], "constraint_ref": "constraint:minimum_order_quantity", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [], "constraint_ref": "constraint:shelf_life", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:minimize_stockout", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/multi", "episode_id": null} {"id": "v4/fragment:routing:72be489bb7c5503f", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "가능하면 모든 경로에서 물류센터 왕복 횟수는 해당 경로 담당 기사님의 개인별 왕복 횟수 한도 이내로, 매 왕복의 중복을 뺀 방문지 수는 그 기사님의 왕복당 방문지 수 한도 이내로 맞춰 주세요. 경로 전체의 중복을 뺀 방문지 수도 해당 기사님의 개인별 방문지 수 한도 이내로 맞춰 주시면 좋겠어요"}], "ir": "[SOFT] AND( EACH(x0 in routes): round_count(x0) <= max_rounds(x0), EACH(x1 in routes): EACH(x2 in rounds(x1)): stop_count(x2) <= max_stops_per_round(x1), EACH(x3 in routes): stop_count(x3) <= max_stops(x3) )", "decision_kind": "clarify", "gold_decision": {"candidate_refs": [], "kind": "clarify", "missing_field_refs": [], "reason_code": "missing_value", "required_inputs": [{"field": "objectives", "kind": "decision_field"}]}, "stratum": "v4/fragment", "episode_id": null} {"id": "v4/fragment:routing:3e95fc5bd8a89a16", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "가능하면 모든 루트의 물류센터 왕복 횟수는 담당 라이더 본인의 왕복 횟수 한도 안으로, 각 왕복에서 중복을 뺀 방문지 수는 그 라이더의 왕복당 방문지 수 한도 안으로 맞춰 주세요. 루트 전체에서도 중복을 뺀 방문지 수가 담당 라이더 본인의 방문지 수 한도 안에 들면 좋겠어요"}], "ir": "[SOFT] AND( EACH(x0 in routes): round_count(x0) <= max_rounds(x0), EACH(x1 in routes): EACH(x2 in rounds(x1)): stop_count(x2) <= max_stops_per_round(x1), EACH(x3 in routes): stop_count(x3) <= max_stops(x3) )", "decision_kind": "clarify", "gold_decision": {"candidate_refs": [], "kind": "clarify", "missing_field_refs": [], "reason_code": "missing_value", "required_inputs": [{"field": "objectives", "kind": "decision_field"}]}, "stratum": "v4/fragment", "episode_id": null} {"id": "v4/base:routing:7bd2aea3b6935b1e", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "전체 경로의 차량 고정 운영비 합계를 최소화해줘. 모든 경로는 배송 건수를 15건 이하로 잡아줘"}], "ir": "MINIMIZE( SUM(x0 in routes: fixed_cost(x0)) )\nEACH(x1 in routes): delivery_count(x1) <= 15", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:delivery_length.exp_factor", "value": {"type": "decimal", "value": "2"}}, {"slot_ref": "slot:delivery_length.max_size", "value": {"type": "decimal", "value": "15"}}], "constraint_ref": "constraint:delivery_length", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fixed_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/base", "episode_id": null} {"id": "v4/base:routing:fd6f41eebf1dcc60", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "모든 경로에 드는 차량 고정 운영비의 총합을 최소화해 주세요. 각 경로의 배송 건수는 15건 이하로 해 주세요."}], "ir": "MINIMIZE( SUM(x0 in routes: fixed_cost(x0)) )\nEACH(x1 in routes): delivery_count(x1) <= 15", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:delivery_length.exp_factor", "value": {"type": "decimal", "value": "2"}}, {"slot_ref": "slot:delivery_length.max_size", "value": {"type": "decimal", "value": "15"}}], "constraint_ref": "constraint:delivery_length", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fixed_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/base", "episode_id": null} {"id": "v4/base:routing:f81544b9ee6d4249", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "전체 경로에 걸쳐 차량 고정 운영비 합계가 최소가 되도록 배차해 주세요. 경로마다 배송은 15건 이하로 잡아 주세요"}], "ir": "MINIMIZE( SUM(x0 in routes: fixed_cost(x0)) )\nEACH(x1 in routes): delivery_count(x1) <= 15", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:delivery_length.exp_factor", "value": {"type": "decimal", "value": "2"}}, {"slot_ref": "slot:delivery_length.max_size", "value": {"type": "decimal", "value": "15"}}], "constraint_ref": "constraint:delivery_length", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fixed_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/base", "episode_id": null} {"id": "v4/combo:routing:18e863876ca468ba", "domain": "routing", "language": "en", "messages": [{"role": "user", "content": "minimize total travel distance, and ideally at least 12 deliveries on every route"}], "ir": "MINIMIZE( SUM(x0 in routes: travel_distance(x0)) )\n[SOFT] EACH(x1 in routes): delivery_count(x1) >= 12", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:minimum_order.target_order", "value": {"type": "decimal", "value": "12"}}], "constraint_ref": "constraint:minimum_order", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:distance_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:67e0f7e65a0911a7", "domain": "routing", "language": "mixed", "messages": [{"role": "user", "content": "오늘 배차는 모든 route의 총 이동거리를 최소화하는 쪽으로 짜줘. 그리고 가능하면 route마다 배송 건수가 12건 이상 되도록 맞춰줘"}], "ir": "MINIMIZE( SUM(x0 in routes: travel_distance(x0)) )\n[SOFT] EACH(x1 in routes): delivery_count(x1) >= 12", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:minimum_order.target_order", "value": {"type": "decimal", "value": "12"}}], "constraint_ref": "constraint:minimum_order", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:distance_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:a65633aa81c72211", "domain": "routing", "language": "en", "messages": [{"role": "user", "content": "shortest total distance across all routes; if possible each route gets 12+ deliveries"}], "ir": "MINIMIZE( SUM(x0 in routes: travel_distance(x0)) )\n[SOFT] EACH(x1 in routes): delivery_count(x1) >= 12", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:minimum_order.target_order", "value": {"type": "decimal", "value": "12"}}], "constraint_ref": "constraint:minimum_order", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:distance_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:nurse:ea97e57beef9a7b1", "domain": "nurse", "language": "ko", "messages": [{"role": "user", "content": "간호사들 사이에서 근무 횟수의 최대와 최소 차이가 작아지도록 해 주시고, 모든 근무 배정의 선호도 점수 합계는 높아지도록 부탁드립니다. 그리고 가능하면 모든 간호사가 3일 넘게 연속으로 근무하지 않도록 하고, 근무와 근무 사이에는 되도록 10시간 이상 쉬게 해 주시기 바랍니다."}], "ir": "MINIMIZE( RANGE(x0 in workers: workload(x0)) )\nMAXIMIZE( SUM(x1 in assignments: preference_score(x1)) )\n[SOFT] EACH(x2 in workers): RUN_LENGTH(x3 in day_seq(x2): works(x2, x3)) <= 3 day\n[SOFT] EACH(x4 in workers): EACH(x5 in adjacent(assignment_seq(x4))): gap_duration(x5) >= 10 h", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:max_days", "value": {"type": "duration", "unit_ref": "unit:day", "value": "3"}}], "constraint_ref": "constraint:max_consecutive_days", "scope": null, "strength": {"kind": "soft", "weight": "100"}}, {"arguments": [{"slot_ref": "slot:min_hours", "value": {"type": "duration", "unit_ref": "unit:hour", "value": "10"}}], "constraint_ref": "constraint:min_rest_hours", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:preference_satisfaction", "weight": "3/4"}, {"objective_ref": "objective:workload_balance", "weight": "1/4"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:nurse:52b6eb2fd16d0c68", "domain": "nurse", "language": "en", "messages": [{"role": "user", "content": "Please make the gap between the nurse who works the most shifts and the one who works the fewest as small as possible, and also maximize the total preference score across all shift assignments. If possible, no nurse should work more than 3 days in a row, and ideally every nurse gets at least 10 hours of rest between consecutive shifts."}], "ir": "MINIMIZE( RANGE(x0 in workers: workload(x0)) )\nMAXIMIZE( SUM(x1 in assignments: preference_score(x1)) )\n[SOFT] EACH(x2 in workers): RUN_LENGTH(x3 in day_seq(x2): works(x2, x3)) <= 3 day\n[SOFT] EACH(x4 in workers): EACH(x5 in adjacent(assignment_seq(x4))): gap_duration(x5) >= 10 h", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:max_days", "value": {"type": "duration", "unit_ref": "unit:day", "value": "3"}}], "constraint_ref": "constraint:max_consecutive_days", "scope": null, "strength": {"kind": "soft", "weight": "100"}}, {"arguments": [{"slot_ref": "slot:min_hours", "value": {"type": "duration", "unit_ref": "unit:hour", "value": "10"}}], "constraint_ref": "constraint:min_rest_hours", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:preference_satisfaction", "weight": "3/4"}, {"objective_ref": "objective:workload_balance", "weight": "1/4"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:nurse:ca5a8769fc08961d", "domain": "nurse", "language": "mixed", "messages": [{"role": "user", "content": "이번 달 근무표에서는 간호사별 근무 횟수 balance를 맞춰서 가장 많이 하는 사람과 가장 적게 하는 사람의 차이를 줄여 주시고, 전체 preference 점수 합도 최대한 높게 부탁드립니다. 그리고 가능하면 모든 간호사가 연속 근무는 3일까지만 하도록 하고, 근무와 근무 사이 rest는 되도록 10시간 이상 확보되게 해 주시기 바랍니다."}], "ir": "MINIMIZE( RANGE(x0 in workers: workload(x0)) )\nMAXIMIZE( SUM(x1 in assignments: preference_score(x1)) )\n[SOFT] EACH(x2 in workers): RUN_LENGTH(x3 in day_seq(x2): works(x2, x3)) <= 3 day\n[SOFT] EACH(x4 in workers): EACH(x5 in adjacent(assignment_seq(x4))): gap_duration(x5) >= 10 h", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:max_days", "value": {"type": "duration", "unit_ref": "unit:day", "value": "3"}}], "constraint_ref": "constraint:max_consecutive_days", "scope": null, "strength": {"kind": "soft", "weight": "100"}}, {"arguments": [{"slot_ref": "slot:min_hours", "value": {"type": "duration", "unit_ref": "unit:hour", "value": "10"}}], "constraint_ref": "constraint:min_rest_hours", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:preference_satisfaction", "weight": "3/4"}, {"objective_ref": "objective:workload_balance", "weight": "1/4"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/multi:retail:b979959c3d328c01", "domain": "retail", "language": "ko", "messages": [{"role": "user", "content": "품목이 재고 있는 날의 비율을 최대로 하는 발주안을 만들어 주세요. 발주마다 도착일은 발주일에 공급자 리드타임을 더한 날로 하고, 품목별 재고 단위마다 소비기한은 입고일에 그 품목의 유통기한 기간을 더한 날로 계산해 주세요. 그리고 발주 수량은 항상 그 품목 최소 발주량의 배수로 해 주세요."}], "ir": "MAXIMIZE( in_stock_rate )\nEACH(x0 in orders): arrival_day(x0) = offset(order_day(x0), lead_time(x0))\nEACH(x1 in items): EACH(x2 in units(x1)): expiry_day(x2) = offset(arrival_day(x2), product_life(x1))\nEACH(x3 in orders): quantity(x3) MULTIPLE_OF min_order_quantity(x3)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:lead_time", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [], "constraint_ref": "constraint:minimum_order_quantity", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [], "constraint_ref": "constraint:shelf_life", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:minimize_stockout", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/multi", "episode_id": null} {"id": "v4/fragment:routing:a33f370884665216", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "모든 루트는 배송 건수가 반드시 8건 이하여야 해. 그리고 각 루트의 왕복 운행마다 화물 종류별로 실리는 최대 적재량이 절대 그 루트 차량의 용량을 넘으면 안 돼."}], "ir": "[HARD] EACH(x0 in routes): delivery_count(x0) <= 8\n[HARD] EACH(x1 in routes): EACH(x2 in rounds(x1)): EACH(x3 in keys(load)): MAX(x4 in positions(x2): load[x3](x4)) <= capacity[x3](x1)", "decision_kind": "clarify", "gold_decision": {"candidate_refs": [], "kind": "clarify", "missing_field_refs": [], "reason_code": "missing_value", "required_inputs": [{"field": "objectives", "kind": "decision_field"}]}, "stratum": "v4/fragment", "episode_id": null} {"id": "v4/fragment:routing:275ac53b772e0fa8", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "모든 루트의 배송 건수는 반드시 8건 이하로 해 주시기 바랍니다. 또한 각 루트의 왕복 운행마다 화물 종류별 최대 적재량이 해당 차량의 용량을 절대 초과하지 않도록 부탁드립니다"}], "ir": "[HARD] EACH(x0 in routes): delivery_count(x0) <= 8\n[HARD] EACH(x1 in routes): EACH(x2 in rounds(x1)): EACH(x3 in keys(load)): MAX(x4 in positions(x2): load[x3](x4)) <= capacity[x3](x1)", "decision_kind": "clarify", "gold_decision": {"candidate_refs": [], "kind": "clarify", "missing_field_refs": [], "reason_code": "missing_value", "required_inputs": [{"field": "objectives", "kind": "decision_field"}]}, "stratum": "v4/fragment", "episode_id": null} {"id": "v4/fragment:routing:351852e7f0b9570e", "domain": "routing", "language": "en", "messages": [{"role": "user", "content": "Every route must have at most 8 deliveries. Also, on every round trip, the largest load for each cargo type must never exceed the vehicle's capacity for that type."}], "ir": "[HARD] EACH(x0 in routes): delivery_count(x0) <= 8\n[HARD] EACH(x1 in routes): EACH(x2 in rounds(x1)): EACH(x3 in keys(load)): MAX(x4 in positions(x2): load[x3](x4)) <= capacity[x3](x1)", "decision_kind": "clarify", "gold_decision": {"candidate_refs": [], "kind": "clarify", "missing_field_refs": [], "reason_code": "missing_value", "required_inputs": [{"field": "objectives", "kind": "decision_field"}]}, "stratum": "v4/fragment", "episode_id": null} {"id": "v4/perturb:routing:36b401a6ced87041", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "모든 경로의 차량 고정 운영비 총합이 최소가 되도록 배차해 주시고, 각 경로의 모든 왕복 운행에서 정차지를 모두 포함하는 가장 작은 원의 반지름이 3km 이상이어야 합니다"}], "ir": "MINIMIZE( SUM(x0 in routes: fixed_cost(x0)) )\nEACH(x1 in routes): EACH(x2 in rounds(x1)): sec_radius(x2) >= 3 km", "decision_kind": "unsupported", "gold_decision": {"kind": "unsupported", "reason_code": "semantic_not_declared", "related_refs": []}, "stratum": "v4/perturb", "episode_id": null} {"id": "v4/perturb:routing:e4e40828fa54dd05", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "전 경로 차량 고정비 총합 최소로, 경로별 왕복마다 정차지 최소 외접원 반경 3km 이상 해 주세요"}], "ir": "MINIMIZE( SUM(x0 in routes: fixed_cost(x0)) )\nEACH(x1 in routes): EACH(x2 in rounds(x1)): sec_radius(x2) >= 3 km", "decision_kind": "unsupported", "gold_decision": {"kind": "unsupported", "reason_code": "semantic_not_declared", "related_refs": []}, "stratum": "v4/perturb", "episode_id": null} {"id": "v4/perturb:routing:2d53c2871ab139ff", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "차량 고정비 총합 최소화하고, 모든 경로의 왕복마다 정차지 감싸는 최소 원 반경은 3km 이상으로 해 주세요"}], "ir": "MINIMIZE( SUM(x0 in routes: fixed_cost(x0)) )\nEACH(x1 in routes): EACH(x2 in rounds(x1)): sec_radius(x2) >= 3 km", "decision_kind": "unsupported", "gold_decision": {"kind": "unsupported", "reason_code": "semantic_not_declared", "related_refs": []}, "stratum": "v4/perturb", "episode_id": null} {"id": "v4/multi:routing:deac3b36704d7c97", "domain": "routing", "language": "en", "messages": [{"role": "user", "content": "Minimize the total fuel cost across all routes, and on every round trip of every route, keep the highest utilization ratio across the cargo capacity dimensions at least 0.6. For every route, keep the route's distance within its driver's own total distance limit, each round trip's distance within that driver's own per-round-trip limit, and the distance between each consecutive pair of stops within that driver's own between-stop limit."}], "ir": "MINIMIZE( SUM(x0 in routes: fuel_cost(x0)) )\nEACH(x1 in routes): EACH(x2 in rounds(x1)): MAX(x3 in keys(load): utilization[x3](x2)) >= 0.6\nAND( EACH(x4 in routes): travel_distance(x4) <= total_limit(x4), EACH(x5 in routes): EACH(x6 in rounds(x5)): travel_distance(x6) <= trip_limit(x5), EACH(x7 in routes): EACH(x8 in adjacent(visit_seq(x7))): travel_distance(x8) <= between_limit(x7) )", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:min_capacity.target_ratio", "value": {"type": "decimal", "value": "0.6"}}], "constraint_ref": "constraint:min_capacity", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:rider_distance.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:rider_distance", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fuel_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/multi", "episode_id": null} {"id": "v4/multi:routing:a8ec96ce08c29b76", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "전체 경로의 연료비 합계를 최소화해 주시기 바랍니다. 모든 경로의 각 왕복 운행에서 화물 용량 항목별 적재율 중 가장 큰 값이 0.6 이상이 되도록 배차 부탁드립니다. 모든 경로에서 총 이동거리는 해당 기사의 총 거리 한도 이내로, 각 왕복 운행의 이동거리는 해당 기사의 왕복 운행당 거리 한도 이내로, 연속한 두 방문지 사이의 이동거리는 해당 기사의 방문지 간 거리 한도 이내로 계획 부탁드립니다"}], "ir": "MINIMIZE( SUM(x0 in routes: fuel_cost(x0)) )\nEACH(x1 in routes): EACH(x2 in rounds(x1)): MAX(x3 in keys(load): utilization[x3](x2)) >= 0.6\nAND( EACH(x4 in routes): travel_distance(x4) <= total_limit(x4), EACH(x5 in routes): EACH(x6 in rounds(x5)): travel_distance(x6) <= trip_limit(x5), EACH(x7 in routes): EACH(x8 in adjacent(visit_seq(x7))): travel_distance(x8) <= between_limit(x7) )", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:min_capacity.target_ratio", "value": {"type": "decimal", "value": "0.6"}}], "constraint_ref": "constraint:min_capacity", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:rider_distance.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:rider_distance", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fuel_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/multi", "episode_id": null} {"id": "v4/multi:routing:5c53204b437ae611", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "모든 경로의 연료비를 합한 금액을 최소화해 주세요. 각 경로의 매 왕복 운행마다 화물 용량 항목별 적재율 가운데 가장 높은 값이 0.6 이상이 되게 해 주세요. 모든 경로의 전체 이동거리, 각 왕복 운행의 이동거리, 연속한 두 방문지 사이의 이동거리는 각각 그 경로 담당 기사에게 정해진 총 거리 한도, 왕복 운행당 거리 한도, 방문지 간 거리 한도를 넘지 않게 해 주세요"}], "ir": "MINIMIZE( SUM(x0 in routes: fuel_cost(x0)) )\nEACH(x1 in routes): EACH(x2 in rounds(x1)): MAX(x3 in keys(load): utilization[x3](x2)) >= 0.6\nAND( EACH(x4 in routes): travel_distance(x4) <= total_limit(x4), EACH(x5 in routes): EACH(x6 in rounds(x5)): travel_distance(x6) <= trip_limit(x5), EACH(x7 in routes): EACH(x8 in adjacent(visit_seq(x7))): travel_distance(x8) <= between_limit(x7) )", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:min_capacity.target_ratio", "value": {"type": "decimal", "value": "0.6"}}], "constraint_ref": "constraint:min_capacity", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:rider_distance.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:rider_distance", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fuel_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/multi", "episode_id": null} {"id": "v4/combo:routing:3c39ba7c2f8987b7", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "오늘 배차 계획을 부탁드립니다. 모든 노선의 차량 고정 비용을 합친 총액이 가장 적도록 짜 주십시오. 그리고 각 노선의 왕복 운행마다 적재 항목 중 가장 높은 적재율이 0.6 이상이어야 하고, 노선별 이동거리는 120km 이하여야 합니다."}], "ir": "MINIMIZE( SUM(x0 in routes: fixed_cost(x0)) )\nEACH(x1 in routes): EACH(x2 in rounds(x1)): MAX(x3 in keys(load): utilization[x3](x2)) >= 0.6\nEACH(x4 in routes): travel_distance(x4) <= 120 km", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:max_distance.exp_factor", "value": {"type": "decimal", "value": "1"}}, {"slot_ref": "slot:max_distance.max_distance", "value": {"type": "decimal", "value": "120000"}}], "constraint_ref": "constraint:max_distance", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:min_capacity.target_ratio", "value": {"type": "decimal", "value": "0.6"}}], "constraint_ref": "constraint:min_capacity", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fixed_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:737701dc3d796db4", "domain": "routing", "language": "en", "messages": [{"role": "user", "content": "Plan the routes to minimize the total fixed cost of the vehicles across all routes. Every round trip on every route needs its highest cargo-dimension utilization at 0.6 or above, and each route's distance has to stay within 120 km."}], "ir": "MINIMIZE( SUM(x0 in routes: fixed_cost(x0)) )\nEACH(x1 in routes): EACH(x2 in rounds(x1)): MAX(x3 in keys(load): utilization[x3](x2)) >= 0.6\nEACH(x4 in routes): travel_distance(x4) <= 120 km", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:max_distance.exp_factor", "value": {"type": "decimal", "value": "1"}}, {"slot_ref": "slot:max_distance.max_distance", "value": {"type": "decimal", "value": "120000"}}], "constraint_ref": "constraint:max_distance", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:min_capacity.target_ratio", "value": {"type": "decimal", "value": "0.6"}}], "constraint_ref": "constraint:min_capacity", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fixed_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:25f8ed0545931e48", "domain": "routing", "language": "en", "messages": [{"role": "user", "content": "Need a plan for tomorrow's dispatch. Please keep the total fixed operating cost of the vehicles across all routes as low as possible. For each round trip on every route, the highest utilization among the cargo dimensions should be at least 0.6, and each route's travel distance should be no more than 120 km."}], "ir": "MINIMIZE( SUM(x0 in routes: fixed_cost(x0)) )\nEACH(x1 in routes): EACH(x2 in rounds(x1)): MAX(x3 in keys(load): utilization[x3](x2)) >= 0.6\nEACH(x4 in routes): travel_distance(x4) <= 120 km", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:max_distance.exp_factor", "value": {"type": "decimal", "value": "1"}}, {"slot_ref": "slot:max_distance.max_distance", "value": {"type": "decimal", "value": "120000"}}], "constraint_ref": "constraint:max_distance", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:min_capacity.target_ratio", "value": {"type": "decimal", "value": "0.6"}}], "constraint_ref": "constraint:min_capacity", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fixed_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:1c841157644621fa", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "전체 경로의 총 이동거리를 최소화하고, 가능하면 각 경로의 정차지를 모두 감싸는 가장 작은 원의 반경은 5km 이하로 해 주세요"}], "ir": "MINIMIZE( SUM(x0 in routes: travel_distance(x0)) )\n[SOFT] EACH(x1 in routes): sec_radius(x1) <= 5 km", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:enclosing_circle_radius.exp_factor", "value": {"type": "decimal", "value": "2"}}, {"slot_ref": "slot:enclosing_circle_radius.max_radius", "value": {"type": "decimal", "value": "5000"}}], "constraint_ref": "constraint:enclosing_circle_radius", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:distance_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:b106ca1a77f882b7", "domain": "routing", "language": "en", "messages": [{"role": "user", "content": "Minimize the total travel distance across all routes. If possible, keep the radius of the smallest circle enclosing all stops on each route at or below 5 km."}], "ir": "MINIMIZE( SUM(x0 in routes: travel_distance(x0)) )\n[SOFT] EACH(x1 in routes): sec_radius(x1) <= 5 km", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:enclosing_circle_radius.exp_factor", "value": {"type": "decimal", "value": "2"}}, {"slot_ref": "slot:enclosing_circle_radius.max_radius", "value": {"type": "decimal", "value": "5000"}}], "constraint_ref": "constraint:enclosing_circle_radius", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:distance_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:4e21ad91ac11f29b", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "전체 경로의 총 이동거리를 최소화해 주시기 바랍니다. 가능하면 모든 경로에서 각 경로의 정차지를 모두 포함하는 가장 작은 원의 반경이 5km 이하가 되도록 부탁드립니다."}], "ir": "MINIMIZE( SUM(x0 in routes: travel_distance(x0)) )\n[SOFT] EACH(x1 in routes): sec_radius(x1) <= 5 km", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:enclosing_circle_radius.exp_factor", "value": {"type": "decimal", "value": "2"}}, {"slot_ref": "slot:enclosing_circle_radius.max_radius", "value": {"type": "decimal", "value": "5000"}}], "constraint_ref": "constraint:enclosing_circle_radius", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:distance_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:0985e5c8d071de6b", "domain": "routing", "language": "en", "messages": [{"role": "user", "content": "I'm putting together tomorrow's routes. Please cut the total fixed cost of the vehicles and the total fuel cost across all routes, both matter. On every route, each delivery's wait before service stays within that rider's own wait limit, the route finishes by that rider's end of working hours, and each round trip finishes by that rider's round window end. Also, any two deliveries at the same coordinate go on the same route."}], "ir": "MINIMIZE( SUM(x0 in routes: fixed_cost(x0)) )\nMINIMIZE( SUM(x1 in routes: fuel_cost(x1)) )\nAND( EACH(x2 in routes): EACH(x3 in visits(x2)): wait_duration(x3) <= max_wait(x2), EACH(x4 in routes): end_time(x4) <= work_end(x4), EACH(x5 in routes): EACH(x6 in rounds(x5)): end_time(x6) <= round_window_end(x5) )\nEACH((x7, x8) in pairs(visits, same_coordinate)): TOGETHER(x7, x8, route)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:rider_time_window.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:rider_time_window", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:same_coordinate_grouping.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:same_coordinate_grouping", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fixed_cost", "weight": "1/2"}, {"objective_ref": "objective:fuel_cost", "weight": "1/2"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:b03113701778fba3", "domain": "routing", "language": "en", "messages": [{"role": "user", "content": "Minimize total vehicle fixed cost and total fuel cost over all routes. Keep every delivery's wait within its rider's wait limit, every route done by the rider's end of working hours, every round trip done by the rider's round window end, and put deliveries at the same coordinate on the same route."}], "ir": "MINIMIZE( SUM(x0 in routes: fixed_cost(x0)) )\nMINIMIZE( SUM(x1 in routes: fuel_cost(x1)) )\nAND( EACH(x2 in routes): EACH(x3 in visits(x2)): wait_duration(x3) <= max_wait(x2), EACH(x4 in routes): end_time(x4) <= work_end(x4), EACH(x5 in routes): EACH(x6 in rounds(x5)): end_time(x6) <= round_window_end(x5) )\nEACH((x7, x8) in pairs(visits, same_coordinate)): TOGETHER(x7, x8, route)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:rider_time_window.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:rider_time_window", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:same_coordinate_grouping.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:same_coordinate_grouping", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fixed_cost", "weight": "1/2"}, {"objective_ref": "objective:fuel_cost", "weight": "1/2"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:7bae485085c71711", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "오늘 배차 짜는 중인데요, 모든 경로를 합친 총 운행시간이 가장 짧게 나오게 해 주세요. 각 배달은 그 배달의 배달 금지 시간대와 겹치지 않게 방문해 주세요. 그리고 모든 경로의 회차마다 적재 항목별로 가장 많이 실었을 때의 적재량이 차량 용량을 반드시 넘지 않게 해 주세요"}], "ir": "MINIMIZE( SUM(x0 in routes: duration(x0)) )\nEACH(x1 in visits): NOT OVERLAPS(service_interval(x1), prohibited_window(x1))\n[HARD] EACH(x2 in routes): EACH(x3 in rounds(x2)): EACH(x4 in keys(load)): MAX(x5 in positions(x3): load[x4](x5)) <= capacity[x4](x2)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:prohibited_time_window", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:capacity.exp_factor", "value": {"type": "decimal", "value": "1"}}], "constraint_ref": "constraint:capacity", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:duration_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:e167b4bba439720a", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "전체 경로 운행시간 합이 제일 짧게 짜줘, 배달마다 금지 시간대랑 안 겹치게 하고, 회차마다 항목별 최대 적재량은 차량 용량을 무조건 안 넘게 해줘"}], "ir": "MINIMIZE( SUM(x0 in routes: duration(x0)) )\nEACH(x1 in visits): NOT OVERLAPS(service_interval(x1), prohibited_window(x1))\n[HARD] EACH(x2 in routes): EACH(x3 in rounds(x2)): EACH(x4 in keys(load)): MAX(x5 in positions(x3): load[x4](x5)) <= capacity[x4](x2)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:prohibited_time_window", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:capacity.exp_factor", "value": {"type": "decimal", "value": "1"}}], "constraint_ref": "constraint:capacity", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:duration_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:ce712f0b94533e67", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "배차 메모입니다. 모든 경로의 운행시간을 다 더한 총합이 최소가 되도록 계획해 주세요. 배달마다 정해진 금지 시간대와 서비스 시간이 겹치지 않게 해 주시고, 모든 경로의 각 회차에서 적재 항목별로 가장 많이 실은 양은 차량 용량을 절대 넘으면 안 돼요"}], "ir": "MINIMIZE( SUM(x0 in routes: duration(x0)) )\nEACH(x1 in visits): NOT OVERLAPS(service_interval(x1), prohibited_window(x1))\n[HARD] EACH(x2 in routes): EACH(x3 in rounds(x2)): EACH(x4 in keys(load)): MAX(x5 in positions(x3): load[x4](x5)) <= capacity[x4](x2)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:prohibited_time_window", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:capacity.exp_factor", "value": {"type": "decimal", "value": "1"}}], "constraint_ref": "constraint:capacity", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:duration_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/multi:routing:ee388e5045370980", "domain": "routing", "language": "en", "messages": [{"role": "user", "content": "Plan the routes to minimize total travel distance across all routes and minimize the sum, across all routes and their round trips, of the number of distinct delivery zones visited on each round trip. For every round trip on every route, keep the radius of the smallest circle enclosing its delivery stops at 3 km or less."}], "ir": "MINIMIZE( SUM(x0 in routes: travel_distance(x0)) )\nMINIMIZE( SUM(x1 in routes: SUM(x2 in rounds(x1): COUNT_DISTINCT(x3 in visits(x2): zone(x3)))) )\nEACH(x4 in routes): EACH(x5 in rounds(x4)): sec_radius(x5) <= 3 km", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:rider_route_zone.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:rider_route_zone", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:round_enclosing_circle_radius.exp_factor", "value": {"type": "decimal", "value": "2"}}, {"slot_ref": "slot:round_enclosing_circle_radius.max_radius", "value": {"type": "decimal", "value": "3000"}}], "constraint_ref": "constraint:round_enclosing_circle_radius", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:distance_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/multi", "episode_id": null} {"id": "v4/multi:routing:76619b75afcffff5", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "전체 경로의 총 이동거리와, 각 경로의 각 회전에서 방문하는 서로 다른 배달 구역 수를 모든 경로와 회전에 걸쳐 합산한 값을 모두 최소화해 주시기 바랍니다. 모든 경로의 각 회전에서 배송 지점들을 포함하는 가장 작은 원의 반경은 3 km 이하로 설정 부탁드립니다."}], "ir": "MINIMIZE( SUM(x0 in routes: travel_distance(x0)) )\nMINIMIZE( SUM(x1 in routes: SUM(x2 in rounds(x1): COUNT_DISTINCT(x3 in visits(x2): zone(x3)))) )\nEACH(x4 in routes): EACH(x5 in rounds(x4)): sec_radius(x5) <= 3 km", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:rider_route_zone.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:rider_route_zone", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:round_enclosing_circle_radius.exp_factor", "value": {"type": "decimal", "value": "2"}}, {"slot_ref": "slot:round_enclosing_circle_radius.max_radius", "value": {"type": "decimal", "value": "3000"}}], "constraint_ref": "constraint:round_enclosing_circle_radius", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:distance_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/multi", "episode_id": null} {"id": "v4/multi:routing:9617c00eb7f8c4fb", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "전체 경로를 합친 총 이동거리를 최소화해 주세요. 각 경로의 각 회전에서 방문하는 서로 다른 배달 구역 수를 세어 모든 경로와 회전에 걸쳐 더한 값도 최소화해 주세요. 모든 경로의 각 회전에서 배송 지점들을 감싸는 가장 작은 원의 반경은 3 km 이하로 잡아 주세요."}], "ir": "MINIMIZE( SUM(x0 in routes: travel_distance(x0)) )\nMINIMIZE( SUM(x1 in routes: SUM(x2 in rounds(x1): COUNT_DISTINCT(x3 in visits(x2): zone(x3)))) )\nEACH(x4 in routes): EACH(x5 in rounds(x4)): sec_radius(x5) <= 3 km", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:rider_route_zone.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:rider_route_zone", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:round_enclosing_circle_radius.exp_factor", "value": {"type": "decimal", "value": "2"}}, {"slot_ref": "slot:round_enclosing_circle_radius.max_radius", "value": {"type": "decimal", "value": "3000"}}], "constraint_ref": "constraint:round_enclosing_circle_radius", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:distance_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/multi", "episode_id": null} {"id": "v4/combo:routing:54189a7e560abf3d", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "내일 배차 계획을 짜고 있습니다. 모든 노선의 연료비 합계가 최소가 되도록 부탁드립니다. 서로 300m 이내에 있는 배송지끼리는 같은 노선에서 처리하게 해 주시고, 각 노선의 매 왕복 운행마다 실린 짐의 적재량이 차량 용량을 반드시 넘지 않아야 합니다. 무게, 부피 등 모든 적재 항목에 해당합니다"}], "ir": "MINIMIZE( SUM(x0 in routes: fuel_cost(x0)) )\nEACH((x1, x2) in pairs(visits, nearby(300 m))): TOGETHER(x1, x2, route)\n[HARD] EACH(x3 in routes): EACH(x4 in rounds(x3)): EACH(x5 in keys(load)): MAX(x6 in positions(x4): load[x5](x6)) <= capacity[x5](x3)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:capacity.exp_factor", "value": {"type": "decimal", "value": "1"}}], "constraint_ref": "constraint:capacity", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [{"slot_ref": "slot:nearby_delivery_grouping.distance_threshold", "value": {"type": "decimal", "value": "300"}}, {"slot_ref": "slot:nearby_delivery_grouping.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:nearby_delivery_grouping", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fuel_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:49dab41f0024ab5a", "domain": "routing", "language": "mixed", "messages": [{"role": "user", "content": "전체 route의 fuel cost 총합을 최소화해 주세요. 300m 안에 붙어 있는 배송지 둘은 같은 route로 묶어 주시고, 각 route의 왕복(trip)마다 무게·부피 같은 항목별 최대 적재량이 차량 capacity를 절대 넘으면 안 돼요."}], "ir": "MINIMIZE( SUM(x0 in routes: fuel_cost(x0)) )\nEACH((x1, x2) in pairs(visits, nearby(300 m))): TOGETHER(x1, x2, route)\n[HARD] EACH(x3 in routes): EACH(x4 in rounds(x3)): EACH(x5 in keys(load)): MAX(x6 in positions(x4): load[x5](x6)) <= capacity[x5](x3)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:capacity.exp_factor", "value": {"type": "decimal", "value": "1"}}], "constraint_ref": "constraint:capacity", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [{"slot_ref": "slot:nearby_delivery_grouping.distance_threshold", "value": {"type": "decimal", "value": "300"}}, {"slot_ref": "slot:nearby_delivery_grouping.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:nearby_delivery_grouping", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fuel_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:13a054ea820b05d0", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "배차 메모예요. 모든 경로의 연료비 합계를 최소로 해 주세요. 서로 300m 이내인 배송지는 같은 경로에 배정해 주세요. 그리고 각 경로의 왕복마다 중량, 부피 등 각 항목별로 가장 많이 실은 양이 그 경로 차량의 적재 용량 이하여야 해요, 무조건 지켜야 해요."}], "ir": "MINIMIZE( SUM(x0 in routes: fuel_cost(x0)) )\nEACH((x1, x2) in pairs(visits, nearby(300 m))): TOGETHER(x1, x2, route)\n[HARD] EACH(x3 in routes): EACH(x4 in rounds(x3)): EACH(x5 in keys(load)): MAX(x6 in positions(x4): load[x5](x6)) <= capacity[x5](x3)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:capacity.exp_factor", "value": {"type": "decimal", "value": "1"}}], "constraint_ref": "constraint:capacity", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [{"slot_ref": "slot:nearby_delivery_grouping.distance_threshold", "value": {"type": "decimal", "value": "300"}}, {"slot_ref": "slot:nearby_delivery_grouping.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:nearby_delivery_grouping", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fuel_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:retail:540771dbb2196617", "domain": "retail", "language": "en", "messages": [{"role": "user", "content": "Plan replenishment to minimize the average inventory holding cost across the planning days, with each order quantity a multiple of the item's minimum order quantity. If possible, set the expiry day for every stock unit of every item to its arrival day plus that item's shelf life."}], "ir": "MINIMIZE( MEAN(x0 in days(horizon): holding_cost(x0)) )\nEACH(x1 in orders): quantity(x1) MULTIPLE_OF min_order_quantity(x1)\n[SOFT] EACH(x2 in items): EACH(x3 in units(x2)): expiry_day(x3) = offset(arrival_day(x3), product_life(x2))", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:minimum_order_quantity", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [], "constraint_ref": "constraint:shelf_life", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:minimize_holding_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:retail:d9cea5023e4398be", "domain": "retail", "language": "en", "messages": [{"role": "user", "content": "Minimize the average holding cost over the days in the plan. For each replenishment order, use a quantity that's a multiple of the item's minimum order quantity. Ideally, every unit of every item would have an expiry day equal to its arrival day plus the item's shelf life."}], "ir": "MINIMIZE( MEAN(x0 in days(horizon): holding_cost(x0)) )\nEACH(x1 in orders): quantity(x1) MULTIPLE_OF min_order_quantity(x1)\n[SOFT] EACH(x2 in items): EACH(x3 in units(x2)): expiry_day(x3) = offset(arrival_day(x3), product_life(x2))", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:minimum_order_quantity", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [], "constraint_ref": "constraint:shelf_life", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:minimize_holding_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:retail:c63b2b534b83c598", "domain": "retail", "language": "ko", "messages": [{"role": "user", "content": "계획 기간 동안 하루 재고 보유비용의 평균을 최소화하고, 각 보충 발주 수량은 해당 품목 최소 발주량의 배수로 잡아줘. 가능하면 모든 품목의 재고 낱개마다 만료일을 입고일에 해당 품목의 유통기한을 더한 날짜로 정해줘"}], "ir": "MINIMIZE( MEAN(x0 in days(horizon): holding_cost(x0)) )\nEACH(x1 in orders): quantity(x1) MULTIPLE_OF min_order_quantity(x1)\n[SOFT] EACH(x2 in items): EACH(x3 in units(x2)): expiry_day(x3) = offset(arrival_day(x3), product_life(x2))", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:minimum_order_quantity", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [], "constraint_ref": "constraint:shelf_life", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:minimize_holding_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/perturb:routing:1c514588cceb4cc2", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "차량 고정 운영비 총합 최소로, 모든 루트의 각 왕복 정류장 최소 외접원 반경은 3km 이상으로 가자"}], "ir": "MINIMIZE( SUM(x0 in routes: fixed_cost(x0)) )\nEACH(x1 in routes): EACH(x2 in rounds(x1)): sec_radius(x2) >= 3 km", "decision_kind": "unsupported", "gold_decision": {"kind": "unsupported", "reason_code": "semantic_not_declared", "related_refs": []}, "stratum": "v4/perturb", "episode_id": null} {"id": "v4/perturb:routing:9f39aecf6c2fbf5c", "domain": "routing", "language": "en", "messages": [{"role": "user", "content": "minimize total fixed vehicle cost across all routes, every round trip's smallest enclosing circle radius at least 3 km"}], "ir": "MINIMIZE( SUM(x0 in routes: fixed_cost(x0)) )\nEACH(x1 in routes): EACH(x2 in rounds(x1)): sec_radius(x2) >= 3 km", "decision_kind": "unsupported", "gold_decision": {"kind": "unsupported", "reason_code": "semantic_not_declared", "related_refs": []}, "stratum": "v4/perturb", "episode_id": null} {"id": "v4/perturb:routing:1cd5a76fe765829f", "domain": "routing", "language": "en", "messages": [{"role": "user", "content": "Can you minimize the total fixed operating cost of using the vehicle over all routes? Also, on every route, each round trip needs the smallest circle enclosing its stops to have a radius of at least 3 km."}], "ir": "MINIMIZE( SUM(x0 in routes: fixed_cost(x0)) )\nEACH(x1 in routes): EACH(x2 in rounds(x1)): sec_radius(x2) >= 3 km", "decision_kind": "unsupported", "gold_decision": {"kind": "unsupported", "reason_code": "semantic_not_declared", "related_refs": []}, "stratum": "v4/perturb", "episode_id": null} {"id": "v4/base:retail:c51115cf2780fcb3", "domain": "retail", "language": "ko", "messages": [{"role": "user", "content": "계획 기간 동안 하루 평균 재고 보유비용을 최소화해 주세요. 모든 보충 발주는 해당 품목의 발주 가능 요일에 넣어 주세요."}], "ir": "MINIMIZE( MEAN(x0 in days(horizon): holding_cost(x0)) )\nEACH(x1 in orders): day_of_week(x1) IN allowed_order_days(x1)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:order_days", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:minimize_holding_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/base", "episode_id": null} {"id": "v4/base:retail:4d249b2dbe2672f8", "domain": "retail", "language": "en", "messages": [{"role": "user", "content": "Minimize the average daily holding cost over the planning period. Place every replenishment order on one of the item's allowed order weekdays."}], "ir": "MINIMIZE( MEAN(x0 in days(horizon): holding_cost(x0)) )\nEACH(x1 in orders): day_of_week(x1) IN allowed_order_days(x1)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:order_days", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:minimize_holding_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/base", "episode_id": null} {"id": "v4/base:retail:5c4cb1b5bc31b002", "domain": "retail", "language": "en", "messages": [{"role": "user", "content": "Minimize average daily holding cost over the planning period; place every replenishment order on an allowed weekday for its item"}], "ir": "MINIMIZE( MEAN(x0 in days(horizon): holding_cost(x0)) )\nEACH(x1 in orders): day_of_week(x1) IN allowed_order_days(x1)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:order_days", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:minimize_holding_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/base", "episode_id": null} {"id": "v4/combo:routing:ef3f241a0b367b79", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "전체 경로의 총 운행시간이랑 차량 고정비용을 둘 다 줄여 주세요. 각 경로의 각 회차는 가장 많이 찬 적재 항목 기준으로 적재율이 0.7 이상이어야 하고, 500m 이내 가까운 배송지끼리는 가능하면 같은 경로로 묶어 주세요."}], "ir": "MINIMIZE( SUM(x0 in routes: duration(x0)) )\nMINIMIZE( SUM(x1 in routes: fixed_cost(x1)) )\nEACH(x2 in routes): EACH(x3 in rounds(x2)): MAX(x4 in keys(load): utilization[x4](x3)) >= 0.7\n[SOFT] EACH((x5, x6) in pairs(visits, nearby(500 m))): TOGETHER(x5, x6, route)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:min_capacity.target_ratio", "value": {"type": "decimal", "value": "0.7"}}], "constraint_ref": "constraint:min_capacity", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:nearby_delivery_grouping.distance_threshold", "value": {"type": "decimal", "value": "500"}}, {"slot_ref": "slot:nearby_delivery_grouping.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:nearby_delivery_grouping", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:duration_cost", "weight": "1/2"}, {"objective_ref": "objective:fixed_cost", "weight": "1/2"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:dfb8e0ea4e8bfdb4", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "모든 경로의 총 운행시간과 차량 고정 운영비용을 함께 최소화해 주시기 바랍니다. 각 경로의 모든 회차에서 적재 항목 중 가장 높은 적재율이 0.7 이상이 되도록 부탁드립니다. 또한 서로 500m 이내에 있는 배송지는 가능하면 같은 경로에서 처리되도록 배정 부탁드립니다"}], "ir": "MINIMIZE( SUM(x0 in routes: duration(x0)) )\nMINIMIZE( SUM(x1 in routes: fixed_cost(x1)) )\nEACH(x2 in routes): EACH(x3 in rounds(x2)): MAX(x4 in keys(load): utilization[x4](x3)) >= 0.7\n[SOFT] EACH((x5, x6) in pairs(visits, nearby(500 m))): TOGETHER(x5, x6, route)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:min_capacity.target_ratio", "value": {"type": "decimal", "value": "0.7"}}], "constraint_ref": "constraint:min_capacity", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:nearby_delivery_grouping.distance_threshold", "value": {"type": "decimal", "value": "500"}}, {"slot_ref": "slot:nearby_delivery_grouping.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:nearby_delivery_grouping", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:duration_cost", "weight": "1/2"}, {"objective_ref": "objective:fixed_cost", "weight": "1/2"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/multi:nurse:a228ba792654cc59", "domain": "nurse", "language": "ko", "messages": [{"role": "user", "content": "간호사별 근무 횟수의 최댓값과 최솟값 차이를 최소화하는 근무표를 부탁드립니다. 모든 간호사의 연속근무는 가능하면 6일 이하로, 매주 총 근무시간은 되도록 44시간 이하로 편성해 주시기 바랍니다."}], "ir": "MINIMIZE( RANGE(x0 in workers: workload(x0)) )\n[SOFT] EACH(x1 in workers): RUN_LENGTH(x2 in day_seq(x1): works(x1, x2)) <= 6 day\n[SOFT] EACH(x3 in workers): EACH(x4 in windows(WEEK, 1)): SUM(x5 in assignments(x3) WHERE DURING(interval(x5), x4): work_hours(x5)) <= 44 h", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:max_days", "value": {"type": "duration", "unit_ref": "unit:day", "value": "6"}}], "constraint_ref": "constraint:max_consecutive_days", "scope": null, "strength": {"kind": "soft", "weight": "100"}}, {"arguments": [{"slot_ref": "slot:max_hours", "value": {"type": "duration", "unit_ref": "unit:hour", "value": "44"}}], "constraint_ref": "constraint:max_hours_per_week", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:workload_balance", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/multi", "episode_id": null} {"id": "v4/multi:nurse:897e89b95a5c208d", "domain": "nurse", "language": "en", "messages": [{"role": "user", "content": "Build the roster to minimize the difference between the highest and lowest numbers of shifts worked across all nurses. If possible, keep every nurse's consecutive working days to at most 6 days and their total working hours in each week to at most 44 hours."}], "ir": "MINIMIZE( RANGE(x0 in workers: workload(x0)) )\n[SOFT] EACH(x1 in workers): RUN_LENGTH(x2 in day_seq(x1): works(x1, x2)) <= 6 day\n[SOFT] EACH(x3 in workers): EACH(x4 in windows(WEEK, 1)): SUM(x5 in assignments(x3) WHERE DURING(interval(x5), x4): work_hours(x5)) <= 44 h", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:max_days", "value": {"type": "duration", "unit_ref": "unit:day", "value": "6"}}], "constraint_ref": "constraint:max_consecutive_days", "scope": null, "strength": {"kind": "soft", "weight": "100"}}, {"arguments": [{"slot_ref": "slot:max_hours", "value": {"type": "duration", "unit_ref": "unit:hour", "value": "44"}}], "constraint_ref": "constraint:max_hours_per_week", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:workload_balance", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/multi", "episode_id": null} {"id": "v4/perturb:routing:94ee08bd3e2ca2fb", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "전체 경로 총 이동거리 최소로 짜줘, 그리고 경로마다 배송 건수는 최소 8건 이상으로 해줘"}], "ir": "MINIMIZE( SUM(x0 in routes: travel_distance(x0)) )\nEACH(x1 in routes): delivery_count(x1) >= 8", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:minimum_order.target_order", "value": {"type": "decimal", "value": "8"}}], "constraint_ref": "constraint:minimum_order", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:distance_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/perturb", "episode_id": null} {"id": "v4/perturb:routing:a2559f7a083fc21f", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "오늘 배차 다시 짜보자. 모든 경로의 총 이동거리가 최소가 되게 해줘. 대신 각 경로는 최소 8건은 배송하도록 맞춰줘"}], "ir": "MINIMIZE( SUM(x0 in routes: travel_distance(x0)) )\nEACH(x1 in routes): delivery_count(x1) >= 8", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:minimum_order.target_order", "value": {"type": "decimal", "value": "8"}}], "constraint_ref": "constraint:minimum_order", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:distance_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/perturb", "episode_id": null} {"id": "v4/perturb:routing:1b99191bf6673ebd", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "연료비 줄이고 싶어서 그러는데 전체 이동거리 합이 제일 짧게 경로 잡아줘. 그리고 차량마다 배송 건수가 8건 이상 나오게 해줘"}], "ir": "MINIMIZE( SUM(x0 in routes: travel_distance(x0)) )\nEACH(x1 in routes): delivery_count(x1) >= 8", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:minimum_order.target_order", "value": {"type": "decimal", "value": "8"}}], "constraint_ref": "constraint:minimum_order", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:distance_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/perturb", "episode_id": null} {"id": "v4/combo:routing:b387dd756abe0cc0", "domain": "routing", "language": "mixed", "messages": [{"role": "user", "content": "전체 route의 총 이동거리를 최소화하도록 배차 부탁드립니다. 모든 배송의 서비스 시작부터 종료까지가 해당 배송의 방문 금지 시간대와 겹치지 않게 해주십시오. 모든 route의 각 왕복 운행마다 화물 용량 항목별 적재율 중 가장 높은 값이 반드시 0.8 이상이어야 합니다."}], "ir": "MINIMIZE( SUM(x0 in routes: travel_distance(x0)) )\nEACH(x1 in visits): NOT OVERLAPS(service_interval(x1), prohibited_window(x1))\n[HARD] EACH(x2 in routes): EACH(x3 in rounds(x2)): MAX(x4 in keys(load): utilization[x4](x3)) >= 0.8", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:prohibited_time_window", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:min_capacity.target_ratio", "value": {"type": "decimal", "value": "0.8"}}], "constraint_ref": "constraint:min_capacity", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:distance_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:2cd3ae0477a91159", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "전체 경로의 이동거리 합계가 최소가 되게 짜줘. 모든 배송은 작업 시작부터 끝까지 해당 배송의 방문 금지 시간대와 겹치지 않게 해줘. 모든 경로에서 매 왕복 운행마다 화물 용량 항목별 적재율 중 가장 높은 값은 반드시 0.8 이상으로 맞춰줘"}], "ir": "MINIMIZE( SUM(x0 in routes: travel_distance(x0)) )\nEACH(x1 in visits): NOT OVERLAPS(service_interval(x1), prohibited_window(x1))\n[HARD] EACH(x2 in routes): EACH(x3 in rounds(x2)): MAX(x4 in keys(load): utilization[x4](x3)) >= 0.8", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:prohibited_time_window", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:min_capacity.target_ratio", "value": {"type": "decimal", "value": "0.8"}}], "constraint_ref": "constraint:min_capacity", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:distance_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:d11535a07f8461f5", "domain": "routing", "language": "en", "messages": [{"role": "user", "content": "Minimize the total travel distance across all routes, and keep every delivery's entire service interval from overlapping its prohibited delivery window. For every round trip on every route, the highest utilization ratio among the cargo capacity dimensions must be at least 0.8."}], "ir": "MINIMIZE( SUM(x0 in routes: travel_distance(x0)) )\nEACH(x1 in visits): NOT OVERLAPS(service_interval(x1), prohibited_window(x1))\n[HARD] EACH(x2 in routes): EACH(x3 in rounds(x2)): MAX(x4 in keys(load): utilization[x4](x3)) >= 0.8", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:prohibited_time_window", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:min_capacity.target_ratio", "value": {"type": "decimal", "value": "0.8"}}], "constraint_ref": "constraint:min_capacity", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:distance_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/base:routing:f9e50cc696ee9009", "domain": "routing", "language": "mixed", "messages": [{"role": "user", "content": "오늘 배차 짜는 중인데요, 모든 route의 연료비 총합이 줄어들게 해 주세요. 그리고 round마다 들르는 배달 구역 수를 세서, 전체 route의 모든 round에 대해 그 합계도 같이 줄여 주세요. 두 가지 다 중요해요."}], "ir": "MINIMIZE( SUM(x0 in routes: fuel_cost(x0)) )\nMINIMIZE( SUM(x1 in routes: SUM(x2 in rounds(x1): COUNT_DISTINCT(x3 in visits(x2): zone(x3)))) )", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:rider_route_zone.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:rider_route_zone", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fuel_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/base", "episode_id": null} {"id": "v4/base:routing:3493964789124531", "domain": "routing", "language": "en", "messages": [{"role": "user", "content": "Please minimize total fuel cost across all routes, and also minimize the total number of distinct delivery zones per round trip, summed over every round trip on every route. Both matter."}], "ir": "MINIMIZE( SUM(x0 in routes: fuel_cost(x0)) )\nMINIMIZE( SUM(x1 in routes: SUM(x2 in rounds(x1): COUNT_DISTINCT(x3 in visits(x2): zone(x3)))) )", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:rider_route_zone.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:rider_route_zone", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fuel_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/base", "episode_id": null} {"id": "v4/base:routing:0f9bc9f70fa412a5", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "배차 계획을 부탁드립니다. 전체 경로의 연료비 총합을 최소화하고, 동시에 각 경로의 왕복 배달마다 포함되는 서로 다른 배달 구역의 수를 모든 왕복과 모든 경로에 걸쳐 합산한 값도 최소화해 주십시오. 두 목표 모두 중요합니다"}], "ir": "MINIMIZE( SUM(x0 in routes: fuel_cost(x0)) )\nMINIMIZE( SUM(x1 in routes: SUM(x2 in rounds(x1): COUNT_DISTINCT(x3 in visits(x2): zone(x3)))) )", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:rider_route_zone.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:rider_route_zone", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fuel_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/base", "episode_id": null} {"id": "v4/combo:routing:b3f4f36b644a5dd3", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "내일 배차 계획 짜는데 전체 운행시간이랑 총 이동거리를 둘 다 줄여 주세요. 기사별로 전체 이동거리, 한 번 나갔다 오는 회차당 거리, 그리고 정류장 사이 거리가 각자 정해진 한도를 넘지 않게 해 주세요. 그리고 가능하면 배송 순서는 시간 우선순위가 높은 주문부터 가게 하고, 되도록 각 경로의 서비스 반경도 기사별 반경 제한 안에 들어오게 부탁해요"}], "ir": "MINIMIZE( SUM(x0 in routes: duration(x0)) )\nMINIMIZE( SUM(x1 in routes: travel_distance(x1)) )\nAND( EACH(x2 in routes): travel_distance(x2) <= total_limit(x2), EACH(x3 in routes): EACH(x4 in rounds(x3)): travel_distance(x4) <= trip_limit(x3), EACH(x5 in routes): EACH(x6 in adjacent(visit_seq(x5))): travel_distance(x6) <= between_limit(x5) )\n[SOFT] EACH(x7 in routes): ORDERED_BY(visit_seq(x7), time_priority, DESC)\n[SOFT] EACH(x8 in routes): sec_radius(x8) <= individual_radius_limit(x8)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:individual_enclosing_circle_radius.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:individual_enclosing_circle_radius", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:rider_distance.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:rider_distance", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:time_priority_order.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:time_priority_order", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:distance_cost", "weight": "1/2"}, {"objective_ref": "objective:duration_cost", "weight": "1/2"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:acd0c2ce198d6062", "domain": "routing", "language": "mixed", "messages": [{"role": "user", "content": "이번 배차는 전체 duration이랑 total distance 둘 다 최소화해 주세요. 각 route마다 기사별 total distance limit, round별 거리 limit, 그리고 stop 간 거리 limit을 넘지 않게 해 주세요. 가능하면 배송 order는 time priority 높은 순으로 가고, 되도록 각 route의 반경이 기사별 radius 제한 안에 들어오면 좋겠어요"}], "ir": "MINIMIZE( SUM(x0 in routes: duration(x0)) )\nMINIMIZE( SUM(x1 in routes: travel_distance(x1)) )\nAND( EACH(x2 in routes): travel_distance(x2) <= total_limit(x2), EACH(x3 in routes): EACH(x4 in rounds(x3)): travel_distance(x4) <= trip_limit(x3), EACH(x5 in routes): EACH(x6 in adjacent(visit_seq(x5))): travel_distance(x6) <= between_limit(x5) )\n[SOFT] EACH(x7 in routes): ORDERED_BY(visit_seq(x7), time_priority, DESC)\n[SOFT] EACH(x8 in routes): sec_radius(x8) <= individual_radius_limit(x8)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:individual_enclosing_circle_radius.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:individual_enclosing_circle_radius", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:rider_distance.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:rider_distance", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:time_priority_order.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:time_priority_order", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:distance_cost", "weight": "1/2"}, {"objective_ref": "objective:duration_cost", "weight": "1/2"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:82602c41fffa6733", "domain": "routing", "language": "en", "messages": [{"role": "user", "content": "Minimize the total fixed operating cost of the vehicles used across all routes. Also, on every round trip of every route, the largest load in each cargo dimension (weight, volume, etc.) must never exceed that route's vehicle capacity."}], "ir": "MINIMIZE( SUM(x0 in routes: fixed_cost(x0)) )\n[HARD] EACH(x1 in routes): EACH(x2 in rounds(x1)): EACH(x3 in keys(load)): MAX(x4 in positions(x2): load[x3](x4)) <= capacity[x3](x1)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:capacity.exp_factor", "value": {"type": "decimal", "value": "1"}}], "constraint_ref": "constraint:capacity", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fixed_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:7c19113b85980adc", "domain": "routing", "language": "en", "messages": [{"role": "user", "content": "keep the total vehicle fixed cost across all routes as low as possible, and for each round trip on every route the peak load in each cargo dimension must never go over the vehicle's capacity"}], "ir": "MINIMIZE( SUM(x0 in routes: fixed_cost(x0)) )\n[HARD] EACH(x1 in routes): EACH(x2 in rounds(x1)): EACH(x3 in keys(load)): MAX(x4 in positions(x2): load[x3](x4)) <= capacity[x3](x1)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:capacity.exp_factor", "value": {"type": "decimal", "value": "1"}}], "constraint_ref": "constraint:capacity", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fixed_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:728251145498cc07", "domain": "routing", "language": "mixed", "messages": [{"role": "user", "content": "전체 경로에 사용되는 차량의 고정비용 총합을 최소화해 주시기 바랍니다. 또한 모든 경로의 각 왕복 운행에서 적재 항목별(중량, 부피 등) 최대 적재량은 반드시 해당 차량의 capacity 이하여야 합니다."}], "ir": "MINIMIZE( SUM(x0 in routes: fixed_cost(x0)) )\n[HARD] EACH(x1 in routes): EACH(x2 in rounds(x1)): EACH(x3 in keys(load)): MAX(x4 in positions(x2): load[x3](x4)) <= capacity[x3](x1)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:capacity.exp_factor", "value": {"type": "decimal", "value": "1"}}], "constraint_ref": "constraint:capacity", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fixed_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/base:routing:dfdbe3b1291f0b0e", "domain": "routing", "language": "en", "messages": [{"role": "user", "content": "Please plan the routes to minimize total fuel cost across all routes. Also minimize the sum, across every round trip on every route, of the number of distinct delivery zones visited in that round trip."}], "ir": "MINIMIZE( SUM(x0 in routes: fuel_cost(x0)) )\nMINIMIZE( SUM(x1 in routes: SUM(x2 in rounds(x1): COUNT_DISTINCT(x3 in visits(x2): zone(x3)))) )", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:rider_route_zone.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:rider_route_zone", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fuel_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/base", "episode_id": null} {"id": "v4/base:routing:16a2228ed4cd1188", "domain": "routing", "language": "mixed", "messages": [{"role": "user", "content": "전체 route의 연료비 합계를 줄이고, 각 route의 각 왕복 운행에서 배송하는 서로 다른 zone 수를 센 뒤 전체 왕복 운행에 걸쳐 합산한 값도 줄이도록 배차 계획 부탁드립니다"}], "ir": "MINIMIZE( SUM(x0 in routes: fuel_cost(x0)) )\nMINIMIZE( SUM(x1 in routes: SUM(x2 in rounds(x1): COUNT_DISTINCT(x3 in visits(x2): zone(x3)))) )", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:rider_route_zone.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:rider_route_zone", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fuel_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/base", "episode_id": null} {"id": "v4/base:routing:ac02fdcd48225766", "domain": "routing", "language": "en", "messages": [{"role": "user", "content": "Please reduce the total fuel cost for all routes. Also reduce the total obtained by counting the distinct delivery zones served on each round trip and adding those counts across all round trips on all routes"}], "ir": "MINIMIZE( SUM(x0 in routes: fuel_cost(x0)) )\nMINIMIZE( SUM(x1 in routes: SUM(x2 in rounds(x1): COUNT_DISTINCT(x3 in visits(x2): zone(x3)))) )", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:rider_route_zone.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:rider_route_zone", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fuel_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/base", "episode_id": null} {"id": "v4/fragment:routing:baafd8db128124c0", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "모든 노선의 매 왕복 운행마다 적재 항목별 지점 최대 적재량은 반드시 해당 차량의 항목별 용량 이하로, 항목별 용량 이용률 중 최댓값은 반드시 0.7 이상으로 해 주세요"}], "ir": "[HARD] EACH(x0 in routes): EACH(x1 in rounds(x0)): EACH(x2 in keys(load)): MAX(x3 in positions(x1): load[x2](x3)) <= capacity[x2](x0)\n[HARD] EACH(x4 in routes): EACH(x5 in rounds(x4)): MAX(x6 in keys(load): utilization[x6](x5)) >= 0.7", "decision_kind": "clarify", "gold_decision": {"candidate_refs": [], "kind": "clarify", "missing_field_refs": [], "reason_code": "missing_value", "required_inputs": [{"field": "objectives", "kind": "decision_field"}]}, "stratum": "v4/fragment", "episode_id": null} {"id": "v4/fragment:routing:84a710e78d4acf5d", "domain": "routing", "language": "en", "messages": [{"role": "user", "content": "For every round trip on every route, the highest load at any point for each cargo measure must stay within the route vehicle’s capacity for that measure. The highest capacity utilization ratio across the cargo measures for each round trip must be at least 0.7"}], "ir": "[HARD] EACH(x0 in routes): EACH(x1 in rounds(x0)): EACH(x2 in keys(load)): MAX(x3 in positions(x1): load[x2](x3)) <= capacity[x2](x0)\n[HARD] EACH(x4 in routes): EACH(x5 in rounds(x4)): MAX(x6 in keys(load): utilization[x6](x5)) >= 0.7", "decision_kind": "clarify", "gold_decision": {"candidate_refs": [], "kind": "clarify", "missing_field_refs": [], "reason_code": "missing_value", "required_inputs": [{"field": "objectives", "kind": "decision_field"}]}, "stratum": "v4/fragment", "episode_id": null} {"id": "v4/fragment:routing:0832655734242e6e", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "모든 노선의 매 왕복 운행에서 각 적재 항목의 지점별 적재량 중 최댓값은 반드시 해당 노선 차량의 항목별 용량을 넘지 않게 해 주세요. 각 왕복 운행의 항목별 용량 이용률 중 최댓값은 반드시 0.7 이상이 되게 해 주세요"}], "ir": "[HARD] EACH(x0 in routes): EACH(x1 in rounds(x0)): EACH(x2 in keys(load)): MAX(x3 in positions(x1): load[x2](x3)) <= capacity[x2](x0)\n[HARD] EACH(x4 in routes): EACH(x5 in rounds(x4)): MAX(x6 in keys(load): utilization[x6](x5)) >= 0.7", "decision_kind": "clarify", "gold_decision": {"candidate_refs": [], "kind": "clarify", "missing_field_refs": [], "reason_code": "missing_value", "required_inputs": [{"field": "objectives", "kind": "decision_field"}]}, "stratum": "v4/fragment", "episode_id": null} {"id": "v4/multi:retail:96d93b44e90a99d0", "domain": "retail", "language": "ko", "messages": [{"role": "user", "content": "매출에서 매입 비용과 폐기 비용을 뺀 이익이 최대가 되도록 발주를 계획해 주세요. 각 발주의 입고일은 발주일에 해당 품목 공급업체의 입고 소요일을 더한 날로 잡고, 발주 요일은 해당 품목의 발주 가능 요일 중에서 정해 주세요"}], "ir": "MAXIMIZE( profit )\nEACH(x0 in orders): arrival_day(x0) = offset(order_day(x0), lead_time(x0))\nEACH(x1 in orders): day_of_week(x1) IN allowed_order_days(x1)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:lead_time", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [], "constraint_ref": "constraint:order_days", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:maximize_profit", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/multi", "episode_id": null} {"id": "v4/multi:retail:8e7e3da027fce83f", "domain": "retail", "language": "en", "messages": [{"role": "user", "content": "Plan replenishment orders to maximize profit, meaning sales revenue minus the cost of goods and discards. For each order, set the arrival date to the order date plus the item's supplier lead time, and place it on one of that item's allowed order weekdays."}], "ir": "MAXIMIZE( profit )\nEACH(x0 in orders): arrival_day(x0) = offset(order_day(x0), lead_time(x0))\nEACH(x1 in orders): day_of_week(x1) IN allowed_order_days(x1)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:lead_time", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [], "constraint_ref": "constraint:order_days", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:maximize_profit", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/multi", "episode_id": null} {"id": "v4/multi:retail:45207e78626ed520", "domain": "retail", "language": "en", "messages": [{"role": "user", "content": "I'd like a replenishment plan that maximizes sales revenue minus the cost of goods and discards. Each order's arrival date should equal its order date plus the supplier lead time for that item. Schedule each order on one of the weekdays allowed for ordering that item."}], "ir": "MAXIMIZE( profit )\nEACH(x0 in orders): arrival_day(x0) = offset(order_day(x0), lead_time(x0))\nEACH(x1 in orders): day_of_week(x1) IN allowed_order_days(x1)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:lead_time", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [], "constraint_ref": "constraint:order_days", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:maximize_profit", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/multi", "episode_id": null} {"id": "v4/combo:routing:58c5b87d32242213", "domain": "routing", "language": "en", "messages": [{"role": "user", "content": "I'm setting up tomorrow's routes. Please keep the total elapsed time across all routes as short as possible, and put any two deliveries that are within 500 m of each other on the same route. Every route must make at least as many depot round trips as its rider's contracted round trips, no exceptions, and if possible don't let any delivery's service time overlap its prohibited time window."}], "ir": "MINIMIZE( SUM(x0 in routes: duration(x0)) )\nEACH((x1, x2) in pairs(visits, nearby(500 m))): TOGETHER(x1, x2, route)\n[HARD] EACH(x3 in routes): round_count(x3) >= base_rounds(x3)\n[SOFT] EACH(x4 in visits): NOT OVERLAPS(service_interval(x4), prohibited_window(x4))", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:minimum_round", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [], "constraint_ref": "constraint:prohibited_time_window", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:nearby_delivery_grouping.distance_threshold", "value": {"type": "decimal", "value": "500"}}, {"slot_ref": "slot:nearby_delivery_grouping.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:nearby_delivery_grouping", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:duration_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:d2fbe3037b269197", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "내일 배차 짜는 중인데요, 전체 경로의 총 운행시간이 최대한 짧게 나오도록 해 주세요. 서로 500m 이내인 배송지끼리는 같은 경로에 묶어서 배정해 주시고요. 모든 경로는 기사님 계약 회전 수 이상으로 반드시 창고를 왕복해야 하고, 가능하면 각 배송지 서비스 시간이 배달 금지 시간대와 겹치지 않게 해 주세요"}], "ir": "MINIMIZE( SUM(x0 in routes: duration(x0)) )\nEACH((x1, x2) in pairs(visits, nearby(500 m))): TOGETHER(x1, x2, route)\n[HARD] EACH(x3 in routes): round_count(x3) >= base_rounds(x3)\n[SOFT] EACH(x4 in visits): NOT OVERLAPS(service_interval(x4), prohibited_window(x4))", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:minimum_round", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [], "constraint_ref": "constraint:prohibited_time_window", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:nearby_delivery_grouping.distance_threshold", "value": {"type": "decimal", "value": "500"}}, {"slot_ref": "slot:nearby_delivery_grouping.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:nearby_delivery_grouping", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:duration_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:851d1591396cc5b6", "domain": "routing", "language": "en", "messages": [{"role": "user", "content": "Minimize the total fixed vehicle operating cost across all routes. For every round trip on every route, the highest load carried at any point in each cargo dimension must not exceed that route's vehicle capacity for that dimension."}], "ir": "MINIMIZE( SUM(x0 in routes: fixed_cost(x0)) )\n[HARD] EACH(x1 in routes): EACH(x2 in rounds(x1)): EACH(x3 in keys(load)): MAX(x4 in positions(x2): load[x3](x4)) <= capacity[x3](x1)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:capacity.exp_factor", "value": {"type": "decimal", "value": "1"}}], "constraint_ref": "constraint:capacity", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fixed_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:23337e77e55e9b42", "domain": "routing", "language": "en", "messages": [{"role": "user", "content": "Minimize the total fixed cost of operating vehicles across all routes. On every round trip of every route, the maximum load along the trip in each cargo dimension must stay within the assigned vehicle's capacity for that dimension"}], "ir": "MINIMIZE( SUM(x0 in routes: fixed_cost(x0)) )\n[HARD] EACH(x1 in routes): EACH(x2 in rounds(x1)): EACH(x3 in keys(load)): MAX(x4 in positions(x2): load[x3](x4)) <= capacity[x3](x1)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:capacity.exp_factor", "value": {"type": "decimal", "value": "1"}}], "constraint_ref": "constraint:capacity", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fixed_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:ba1406ec78df1a7e", "domain": "routing", "language": "mixed", "messages": [{"role": "user", "content": "전체 노선의 차량 고정 운영비 합계를 최소화해 주시기 바랍니다. 모든 노선의 매 왕복 운행에서 각 적재 항목별 최대 적재량은 운행 중 모든 지점을 기준으로 확인하여 해당 노선 차량의 항목별 capacity를 반드시 넘지 않도록 계획 부탁드립니다."}], "ir": "MINIMIZE( SUM(x0 in routes: fixed_cost(x0)) )\n[HARD] EACH(x1 in routes): EACH(x2 in rounds(x1)): EACH(x3 in keys(load)): MAX(x4 in positions(x2): load[x3](x4)) <= capacity[x3](x1)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:capacity.exp_factor", "value": {"type": "decimal", "value": "1"}}], "constraint_ref": "constraint:capacity", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fixed_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:64875f0758dfb07f", "domain": "routing", "language": "mixed", "messages": [{"role": "user", "content": "오늘 배차 짜는 중인데요, 모든 루트의 총 이동거리가 최소가 되게 해 주세요. 그리고 각 route는 되도록 time priority 높은 순서대로 방문하게 하고, 서로 1km 안에 있는 배송지끼리는 가능하면 같은 route로 묶어 주세요"}], "ir": "MINIMIZE( SUM(x0 in routes: travel_distance(x0)) )\n[SOFT] EACH(x1 in routes): ORDERED_BY(visit_seq(x1), time_priority, DESC)\n[SOFT] EACH((x2, x3) in pairs(visits, nearby(1 km))): TOGETHER(x2, x3, route)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:nearby_delivery_grouping.distance_threshold", "value": {"type": "decimal", "value": "1000"}}, {"slot_ref": "slot:nearby_delivery_grouping.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:nearby_delivery_grouping", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:time_priority_order.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:time_priority_order", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:distance_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:6e5b7f85a58ed972", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "전체 경로의 총 이동거리를 최소화해 주시고, 가능하면 각 경로마다 시간 우선순위가 높은 순서대로 방문하도록 하며, 서로 1km 이내인 배송지는 되도록 같은 경로에 배정 부탁드립니다."}], "ir": "MINIMIZE( SUM(x0 in routes: travel_distance(x0)) )\n[SOFT] EACH(x1 in routes): ORDERED_BY(visit_seq(x1), time_priority, DESC)\n[SOFT] EACH((x2, x3) in pairs(visits, nearby(1 km))): TOGETHER(x2, x3, route)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:nearby_delivery_grouping.distance_threshold", "value": {"type": "decimal", "value": "1000"}}, {"slot_ref": "slot:nearby_delivery_grouping.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:nearby_delivery_grouping", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:time_priority_order.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:time_priority_order", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:distance_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:25dc21ac0516f8c9", "domain": "routing", "language": "mixed", "messages": [{"role": "user", "content": "이번 배차 건은 전체 route의 총 distance를 최소화하는 방향으로 부탁드립니다. 모든 route에서 방문 순서는 가능하면 시간 우선순위가 높은 것부터 내림차순으로 맞춰 주시고, 1km 이내로 가까운 배송지 두 곳은 되도록 같은 route에 배정 부탁드립니다"}], "ir": "MINIMIZE( SUM(x0 in routes: travel_distance(x0)) )\n[SOFT] EACH(x1 in routes): ORDERED_BY(visit_seq(x1), time_priority, DESC)\n[SOFT] EACH((x2, x3) in pairs(visits, nearby(1 km))): TOGETHER(x2, x3, route)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:nearby_delivery_grouping.distance_threshold", "value": {"type": "decimal", "value": "1000"}}, {"slot_ref": "slot:nearby_delivery_grouping.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:nearby_delivery_grouping", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:time_priority_order.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:time_priority_order", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:distance_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:0a4e1752451214b4", "domain": "routing", "language": "en", "messages": [{"role": "user", "content": "Quick one for today's dispatch: minimize the total fixed operating cost of the vehicles we use across all routes. If possible, also keep each rider's waiting time before a delivery within their own waiting limit, have every route finish by that rider's end of working hours, and have every round trip end by that rider's round window end."}], "ir": "MINIMIZE( SUM(x0 in routes: fixed_cost(x0)) )\n[SOFT] AND( EACH(x1 in routes): EACH(x2 in visits(x1)): wait_duration(x2) <= max_wait(x1), EACH(x3 in routes): end_time(x3) <= work_end(x3), EACH(x4 in routes): EACH(x5 in rounds(x4)): end_time(x5) <= round_window_end(x4) )", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:rider_time_window.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:rider_time_window", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fixed_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:b57b4d03b0f67002", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "모든 경로에서 쓰는 차량 고정비용 총합을 최소화해줘. 가능하면 배송마다 대기시간은 그 기사 대기 한도 이하로, 경로 종료는 기사 퇴근시간 전에, 왕복 끝나는 시간도 기사 왕복 마감 전으로 맞춰줘"}], "ir": "MINIMIZE( SUM(x0 in routes: fixed_cost(x0)) )\n[SOFT] AND( EACH(x1 in routes): EACH(x2 in visits(x1)): wait_duration(x2) <= max_wait(x1), EACH(x3 in routes): end_time(x3) <= work_end(x3), EACH(x4 in routes): EACH(x5 in rounds(x4)): end_time(x5) <= round_window_end(x4) )", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:rider_time_window.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:rider_time_window", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fixed_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/base:retail:082d6755bb31d37c", "domain": "retail", "language": "en", "messages": [{"role": "user", "content": "Minimize the average daily holding cost over the planning period. Place each replenishment order on an allowed order weekday for its item."}], "ir": "MINIMIZE( MEAN(x0 in days(horizon): holding_cost(x0)) )\nEACH(x1 in orders): day_of_week(x1) IN allowed_order_days(x1)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:order_days", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:minimize_holding_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/base", "episode_id": null} {"id": "v4/combo:routing:b0052c0d727a8ca6", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "내일 배차 짜는 중인데 전체 경로의 총 이동거리랑 총 운행시간 둘 다 줄여줘. 그리고 가능하면 우선순위 높은 배송일수록 더 일찍 도착하게 해줘, 모든 배송 기준으로 우선순위 가중해서 도착시간 합이 작게."}], "ir": "MINIMIZE( SUM(x0 in routes: travel_distance(x0)) )\nMINIMIZE( SUM(x1 in routes: duration(x1)) )\n[SOFT] MINIMIZE( SUM(x2 in visits: priority_weighted_arrival(x2)) )", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:delivery_time_priority.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:delivery_time_priority", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:distance_cost", "weight": "1/2"}, {"objective_ref": "objective:duration_cost", "weight": "1/2"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:5d53f25d77df3417", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "모든 경로 총 이동거리 최소화, 총 운행시간도 최소화로 가자. 되도록 우선순위 가중한 전체 배송 도착시간 합도 줄여줘."}], "ir": "MINIMIZE( SUM(x0 in routes: travel_distance(x0)) )\nMINIMIZE( SUM(x1 in routes: duration(x1)) )\n[SOFT] MINIMIZE( SUM(x2 in visits: priority_weighted_arrival(x2)) )", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:delivery_time_priority.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:delivery_time_priority", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:distance_cost", "weight": "1/2"}, {"objective_ref": "objective:duration_cost", "weight": "1/2"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:b7c697ebe3d52c09", "domain": "routing", "language": "en", "messages": [{"role": "user", "content": "Minimize total distance across all routes; every route must stay within 80 km."}], "ir": "MINIMIZE( SUM(x0 in routes: travel_distance(x0)) )\n[HARD] EACH(x1 in routes): travel_distance(x1) <= 80 km", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:max_distance.exp_factor", "value": {"type": "decimal", "value": "1"}}, {"slot_ref": "slot:max_distance.max_distance", "value": {"type": "decimal", "value": "80000"}}], "constraint_ref": "constraint:max_distance", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:distance_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:0f9d5ea2151e942f", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "전체 배송 경로의 총 이동거리를 최소화해 주세요. 각 경로의 이동거리는 반드시 80km 이하여야 해요"}], "ir": "MINIMIZE( SUM(x0 in routes: travel_distance(x0)) )\n[HARD] EACH(x1 in routes): travel_distance(x1) <= 80 km", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:max_distance.exp_factor", "value": {"type": "decimal", "value": "1"}}, {"slot_ref": "slot:max_distance.max_distance", "value": {"type": "decimal", "value": "80000"}}], "constraint_ref": "constraint:max_distance", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:distance_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:8b7dc263785d53eb", "domain": "routing", "language": "mixed", "messages": [{"role": "user", "content": "전체 route의 총 이동거리를 최소화해줘. route별 distance는 반드시 80km 이하로 잡아줘"}], "ir": "MINIMIZE( SUM(x0 in routes: travel_distance(x0)) )\n[HARD] EACH(x1 in routes): travel_distance(x1) <= 80 km", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:max_distance.exp_factor", "value": {"type": "decimal", "value": "1"}}, {"slot_ref": "slot:max_distance.max_distance", "value": {"type": "decimal", "value": "80000"}}], "constraint_ref": "constraint:max_distance", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:distance_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:24211ff9d44acdb8", "domain": "routing", "language": "en", "messages": [{"role": "user", "content": "Minimize the total travel distance across all routes. Every route must have at most 8 deliveries, and deliveries at the same coordinate must always be on the same route."}], "ir": "MINIMIZE( SUM(x0 in routes: travel_distance(x0)) )\n[HARD] EACH(x1 in routes): delivery_count(x1) <= 8\n[HARD] EACH((x2, x3) in pairs(visits, same_coordinate)): TOGETHER(x2, x3, route)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:delivery_length.exp_factor", "value": {"type": "decimal", "value": "2"}}, {"slot_ref": "slot:delivery_length.max_size", "value": {"type": "decimal", "value": "8"}}], "constraint_ref": "constraint:delivery_length", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [{"slot_ref": "slot:same_coordinate_grouping.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:same_coordinate_grouping", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:distance_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:f443f7218000427c", "domain": "routing", "language": "mixed", "messages": [{"role": "user", "content": "오늘 배차 짤 때 모든 route의 총 이동거리를 최소화하는 걸로 가자. 한 route당 배송 건수는 반드시 8개 이하여야 하고, 같은 좌표에 있는 배송지는 무조건 같은 route에 묶어서 배정해줘."}], "ir": "MINIMIZE( SUM(x0 in routes: travel_distance(x0)) )\n[HARD] EACH(x1 in routes): delivery_count(x1) <= 8\n[HARD] EACH((x2, x3) in pairs(visits, same_coordinate)): TOGETHER(x2, x3, route)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:delivery_length.exp_factor", "value": {"type": "decimal", "value": "2"}}, {"slot_ref": "slot:delivery_length.max_size", "value": {"type": "decimal", "value": "8"}}], "constraint_ref": "constraint:delivery_length", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [{"slot_ref": "slot:same_coordinate_grouping.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:same_coordinate_grouping", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:distance_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:e2eea08c8eaf577e", "domain": "routing", "language": "en", "messages": [{"role": "user", "content": "I'm building the routes for tomorrow and want the total distance driven over all routes to be as small as possible. No route may ever have more than 8 deliveries, and any deliveries going to the same coordinate must be served on the same route"}], "ir": "MINIMIZE( SUM(x0 in routes: travel_distance(x0)) )\n[HARD] EACH(x1 in routes): delivery_count(x1) <= 8\n[HARD] EACH((x2, x3) in pairs(visits, same_coordinate)): TOGETHER(x2, x3, route)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:delivery_length.exp_factor", "value": {"type": "decimal", "value": "2"}}, {"slot_ref": "slot:delivery_length.max_size", "value": {"type": "decimal", "value": "8"}}], "constraint_ref": "constraint:delivery_length", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [{"slot_ref": "slot:same_coordinate_grouping.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:same_coordinate_grouping", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:distance_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/multi:nurse:d5589412860c3add", "domain": "nurse", "language": "ko", "messages": [{"role": "user", "content": "이번 달 근무표 짤 건데 간호사들 사이에 근무 횟수 차이가 제일 많은 사람이랑 제일 적은 사람 격차를 최대한 줄여줘. 그리고 가능하면 연속 근무는 6일 넘지 않게, 주당 근무시간도 가능하면 44시간 안으로 맞춰줘"}], "ir": "MINIMIZE( RANGE(x0 in workers: workload(x0)) )\n[SOFT] EACH(x1 in workers): RUN_LENGTH(x2 in day_seq(x1): works(x1, x2)) <= 6 day\n[SOFT] EACH(x3 in workers): EACH(x4 in windows(WEEK, 1)): SUM(x5 in assignments(x3) WHERE DURING(interval(x5), x4): work_hours(x5)) <= 44 h", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:max_days", "value": {"type": "duration", "unit_ref": "unit:day", "value": "6"}}], "constraint_ref": "constraint:max_consecutive_days", "scope": null, "strength": {"kind": "soft", "weight": "100"}}, {"arguments": [{"slot_ref": "slot:max_hours", "value": {"type": "duration", "unit_ref": "unit:hour", "value": "44"}}], "constraint_ref": "constraint:max_hours_per_week", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:workload_balance", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/multi", "episode_id": null} {"id": "v4/multi:nurse:ce592603060e2280", "domain": "nurse", "language": "ko", "messages": [{"role": "user", "content": "다음 달 병동 근무표를 작성하려고 합니다. 간호사 간 근무 횟수에서 가장 많은 사람과 가장 적은 사람의 차이가 최소가 되도록 부탁드립니다. 또한 모든 간호사가 되도록 연속 6일을 넘겨 근무하지 않고, 주당 총 근무시간도 가능하면 44시간 이하가 되도록 해주세요"}], "ir": "MINIMIZE( RANGE(x0 in workers: workload(x0)) )\n[SOFT] EACH(x1 in workers): RUN_LENGTH(x2 in day_seq(x1): works(x1, x2)) <= 6 day\n[SOFT] EACH(x3 in workers): EACH(x4 in windows(WEEK, 1)): SUM(x5 in assignments(x3) WHERE DURING(interval(x5), x4): work_hours(x5)) <= 44 h", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:max_days", "value": {"type": "duration", "unit_ref": "unit:day", "value": "6"}}], "constraint_ref": "constraint:max_consecutive_days", "scope": null, "strength": {"kind": "soft", "weight": "100"}}, {"arguments": [{"slot_ref": "slot:max_hours", "value": {"type": "duration", "unit_ref": "unit:hour", "value": "44"}}], "constraint_ref": "constraint:max_hours_per_week", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:workload_balance", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/multi", "episode_id": null} {"id": "v4/multi:nurse:f5834ee34183493f", "domain": "nurse", "language": "en", "messages": [{"role": "user", "content": "Need the next duty roster done. Please minimize the gap between the nurse who works the most shifts and the one who works the fewest. If possible, keep every nurse to no more than 6 consecutive working days, and ideally no more than 44 hours of work in any week."}], "ir": "MINIMIZE( RANGE(x0 in workers: workload(x0)) )\n[SOFT] EACH(x1 in workers): RUN_LENGTH(x2 in day_seq(x1): works(x1, x2)) <= 6 day\n[SOFT] EACH(x3 in workers): EACH(x4 in windows(WEEK, 1)): SUM(x5 in assignments(x3) WHERE DURING(interval(x5), x4): work_hours(x5)) <= 44 h", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:max_days", "value": {"type": "duration", "unit_ref": "unit:day", "value": "6"}}], "constraint_ref": "constraint:max_consecutive_days", "scope": null, "strength": {"kind": "soft", "weight": "100"}}, {"arguments": [{"slot_ref": "slot:max_hours", "value": {"type": "duration", "unit_ref": "unit:hour", "value": "44"}}], "constraint_ref": "constraint:max_hours_per_week", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:workload_balance", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/multi", "episode_id": null} {"id": "v4/combo:routing:5873fc7fd70439aa", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "전체 경로의 총 이동거리가 제일 짧게 짜줘. 경로마다 그 기사님 서비스 반경 안에 들어와야 하고, 같은 좌표 배송지는 한 경로로 묶고, 300m 이내 가까운 배송지끼리는 반드시 같은 경로로 가야 해."}], "ir": "MINIMIZE( SUM(x0 in routes: travel_distance(x0)) )\nEACH(x1 in routes): sec_radius(x1) <= individual_radius_limit(x1)\nEACH((x2, x3) in pairs(visits, same_coordinate)): TOGETHER(x2, x3, route)\n[HARD] EACH((x4, x5) in pairs(visits, nearby(300 m))): TOGETHER(x4, x5, route)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:individual_enclosing_circle_radius.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:individual_enclosing_circle_radius", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:nearby_delivery_grouping.distance_threshold", "value": {"type": "decimal", "value": "300"}}, {"slot_ref": "slot:nearby_delivery_grouping.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:nearby_delivery_grouping", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [{"slot_ref": "slot:same_coordinate_grouping.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:same_coordinate_grouping", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:distance_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:nurse:431934bbdcbcd1b2", "domain": "nurse", "language": "ko", "messages": [{"role": "user", "content": "간호사 전체의 주간 한도를 넘는 초과근무시간을 합해서 최소화해줘. 모든 간호사는 가능하면 매주 그 주 안에 시작하고 끝나는 근무시간 합계가 44시간 이하가 되게 하고, 되도록 연이은 두 근무 사이에 12시간 이상 쉬게 해주고, 가능하면 연속근무는 3일을 넘지 않게 해줘."}], "ir": "MINIMIZE( SUM(x0 in workers: overtime_hours(x0)) )\n[SOFT] EACH(x1 in workers): EACH(x2 in windows(WEEK, 1)): SUM(x3 in assignments(x1) WHERE DURING(interval(x3), x2): work_hours(x3)) <= 44 h\n[SOFT] EACH(x4 in workers): EACH(x5 in adjacent(assignment_seq(x4))): gap_duration(x5) >= 12 h\n[SOFT] EACH(x6 in workers): RUN_LENGTH(x7 in day_seq(x6): works(x6, x7)) <= 3 day", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:max_days", "value": {"type": "duration", "unit_ref": "unit:day", "value": "3"}}], "constraint_ref": "constraint:max_consecutive_days", "scope": null, "strength": {"kind": "soft", "weight": "100"}}, {"arguments": [{"slot_ref": "slot:max_hours", "value": {"type": "duration", "unit_ref": "unit:hour", "value": "44"}}], "constraint_ref": "constraint:max_hours_per_week", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:min_hours", "value": {"type": "duration", "unit_ref": "unit:hour", "value": "12"}}], "constraint_ref": "constraint:min_rest_hours", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:overtime", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/base:routing:2593345b62b764ad", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "모든 노선의 시작부터 종료까지 걸리는 시간 합계를 줄이고, 각 노선의 이동거리는 100km 이하로 해 주세요"}], "ir": "MINIMIZE( SUM(x0 in routes: duration(x0)) )\nEACH(x1 in routes): travel_distance(x1) <= 100 km", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:max_distance.exp_factor", "value": {"type": "decimal", "value": "1"}}, {"slot_ref": "slot:max_distance.max_distance", "value": {"type": "decimal", "value": "100000"}}], "constraint_ref": "constraint:max_distance", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:duration_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/base", "episode_id": null} {"id": "v4/base:routing:6c0945d389322b26", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "각 노선에서 시작부터 종료까지 걸리는 시간을 모두 합쳐서 줄여 주세요. 모든 노선의 이동거리는 각각 100km 이하로 잡아 주세요."}], "ir": "MINIMIZE( SUM(x0 in routes: duration(x0)) )\nEACH(x1 in routes): travel_distance(x1) <= 100 km", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:max_distance.exp_factor", "value": {"type": "decimal", "value": "1"}}, {"slot_ref": "slot:max_distance.max_distance", "value": {"type": "decimal", "value": "100000"}}], "constraint_ref": "constraint:max_distance", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:duration_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/base", "episode_id": null} {"id": "v4/base:routing:a49ada46bc6ee86c", "domain": "routing", "language": "en", "messages": [{"role": "user", "content": "Minimize the sum of the elapsed times from start to finish across all routes. Keep each route's travel distance at or below 100 km."}], "ir": "MINIMIZE( SUM(x0 in routes: duration(x0)) )\nEACH(x1 in routes): travel_distance(x1) <= 100 km", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:max_distance.exp_factor", "value": {"type": "decimal", "value": "1"}}, {"slot_ref": "slot:max_distance.max_distance", "value": {"type": "decimal", "value": "100000"}}], "constraint_ref": "constraint:max_distance", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:duration_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/base", "episode_id": null} {"id": "v4/combo:routing:0f8cd8d33da2604a", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "전체 루트의 차량 고정 운영비 합계를 최소화해 주시기 바랍니다. 가능하면 각 루트의 배송지를 모두 감싸는 가장 작은 원의 반경이 3km 이내가 되도록 플래닝 부탁드립니다."}], "ir": "MINIMIZE( SUM(x0 in routes: fixed_cost(x0)) )\n[SOFT] EACH(x1 in routes): sec_radius(x1) <= 3 km", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:enclosing_circle_radius.exp_factor", "value": {"type": "decimal", "value": "2"}}, {"slot_ref": "slot:enclosing_circle_radius.max_radius", "value": {"type": "decimal", "value": "3000"}}], "constraint_ref": "constraint:enclosing_circle_radius", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fixed_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:58e2b127b67afcef", "domain": "routing", "language": "en", "messages": [{"role": "user", "content": "Minimize total vehicle fixed operating costs across all routes; ideally keep each route’s stops within a smallest enclosing circle of radius at most 3 km"}], "ir": "MINIMIZE( SUM(x0 in routes: fixed_cost(x0)) )\n[SOFT] EACH(x1 in routes): sec_radius(x1) <= 3 km", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:enclosing_circle_radius.exp_factor", "value": {"type": "decimal", "value": "2"}}, {"slot_ref": "slot:enclosing_circle_radius.max_radius", "value": {"type": "decimal", "value": "3000"}}], "constraint_ref": "constraint:enclosing_circle_radius", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fixed_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:65f60fa7c345ba48", "domain": "routing", "language": "en", "messages": [{"role": "user", "content": "Please minimize the total fixed cost of operating vehicles across all routes. If possible, keep the radius of the smallest circle enclosing all stops on each route to at most 3 km."}], "ir": "MINIMIZE( SUM(x0 in routes: fixed_cost(x0)) )\n[SOFT] EACH(x1 in routes): sec_radius(x1) <= 3 km", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:enclosing_circle_radius.exp_factor", "value": {"type": "decimal", "value": "2"}}, {"slot_ref": "slot:enclosing_circle_radius.max_radius", "value": {"type": "decimal", "value": "3000"}}], "constraint_ref": "constraint:enclosing_circle_radius", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fixed_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:5e8354e777f6bc1e", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "배차 계획은 전체 경로의 연료비 합계와 각 경로의 출발부터 종료까지 걸리는 시간의 합계를 줄이는 방향으로 부탁드립니다. 모든 경로의 배송 건수는 경로당 3건 이하로 잡아 주시기 바랍니다."}], "ir": "MINIMIZE( SUM(x0 in routes: fuel_cost(x0)) )\nMINIMIZE( SUM(x1 in routes: duration(x1)) )\nEACH(x2 in routes): delivery_count(x2) <= 3", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:delivery_length.exp_factor", "value": {"type": "decimal", "value": "2"}}, {"slot_ref": "slot:delivery_length.max_size", "value": {"type": "decimal", "value": "3"}}], "constraint_ref": "constraint:delivery_length", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:duration_cost", "weight": "1/2"}, {"objective_ref": "objective:fuel_cost", "weight": "1/2"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:a64ee58ccf23aaa8", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "전체 경로의 총연료비와 각 경로의 시작부터 종료까지 소요시간을 합산한 총시간을 최소화해 주시기 바랍니다. 경로별 배송 건수는 3건 이하로 부탁드립니다."}], "ir": "MINIMIZE( SUM(x0 in routes: fuel_cost(x0)) )\nMINIMIZE( SUM(x1 in routes: duration(x1)) )\nEACH(x2 in routes): delivery_count(x2) <= 3", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:delivery_length.exp_factor", "value": {"type": "decimal", "value": "2"}}, {"slot_ref": "slot:delivery_length.max_size", "value": {"type": "decimal", "value": "3"}}], "constraint_ref": "constraint:delivery_length", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:duration_cost", "weight": "1/2"}, {"objective_ref": "objective:fuel_cost", "weight": "1/2"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:6b0e48b4b640f110", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "배차 플랜을 잡을 때 전체 루트의 연료비 합계와 각 루트의 출발부터 종료까지 걸리는 시간의 합계를 줄여 주시기 바랍니다. 모든 루트의 배송 건수는 루트당 3건 이하로 설정 부탁드립니다."}], "ir": "MINIMIZE( SUM(x0 in routes: fuel_cost(x0)) )\nMINIMIZE( SUM(x1 in routes: duration(x1)) )\nEACH(x2 in routes): delivery_count(x2) <= 3", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:delivery_length.exp_factor", "value": {"type": "decimal", "value": "2"}}, {"slot_ref": "slot:delivery_length.max_size", "value": {"type": "decimal", "value": "3"}}], "constraint_ref": "constraint:delivery_length", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:duration_cost", "weight": "1/2"}, {"objective_ref": "objective:fuel_cost", "weight": "1/2"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:9bbc7aa57dd2ec85", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "전체 경로의 총 연료비를 최소화해 주세요. 각 경로는 정류장을 모두 포함하는 가장 작은 원의 반경이 반드시 8km 이하여야 하고, 같은 좌표의 배송건은 가능하면 같은 경로로 배정 부탁드립니다."}], "ir": "MINIMIZE( SUM(x0 in routes: fuel_cost(x0)) )\n[HARD] EACH(x1 in routes): sec_radius(x1) <= 8 km\n[SOFT] EACH((x2, x3) in pairs(visits, same_coordinate)): TOGETHER(x2, x3, route)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:enclosing_circle_radius.exp_factor", "value": {"type": "decimal", "value": "2"}}, {"slot_ref": "slot:enclosing_circle_radius.max_radius", "value": {"type": "decimal", "value": "8000"}}], "constraint_ref": "constraint:enclosing_circle_radius", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [{"slot_ref": "slot:same_coordinate_grouping.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:same_coordinate_grouping", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fuel_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:575aa992466ce091", "domain": "routing", "language": "en", "messages": [{"role": "user", "content": "Please minimize the total fuel cost across all routes. Every route must have an enclosing circle radius of 8 km or less, and ideally deliveries at the same coordinate should be on the same route."}], "ir": "MINIMIZE( SUM(x0 in routes: fuel_cost(x0)) )\n[HARD] EACH(x1 in routes): sec_radius(x1) <= 8 km\n[SOFT] EACH((x2, x3) in pairs(visits, same_coordinate)): TOGETHER(x2, x3, route)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:enclosing_circle_radius.exp_factor", "value": {"type": "decimal", "value": "2"}}, {"slot_ref": "slot:enclosing_circle_radius.max_radius", "value": {"type": "decimal", "value": "8000"}}], "constraint_ref": "constraint:enclosing_circle_radius", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [{"slot_ref": "slot:same_coordinate_grouping.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:same_coordinate_grouping", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fuel_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:a8fe4f42ccbac5a5", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "모든 경로 연료비 합계 최소로 가자. 경로마다 외접원 반경은 무조건 8km 이내여야 하고, 같은 좌표 배송은 되도록 한 경로로 묶어줘"}], "ir": "MINIMIZE( SUM(x0 in routes: fuel_cost(x0)) )\n[HARD] EACH(x1 in routes): sec_radius(x1) <= 8 km\n[SOFT] EACH((x2, x3) in pairs(visits, same_coordinate)): TOGETHER(x2, x3, route)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:enclosing_circle_radius.exp_factor", "value": {"type": "decimal", "value": "2"}}, {"slot_ref": "slot:enclosing_circle_radius.max_radius", "value": {"type": "decimal", "value": "8000"}}], "constraint_ref": "constraint:enclosing_circle_radius", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [{"slot_ref": "slot:same_coordinate_grouping.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:same_coordinate_grouping", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fuel_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:ab70ced3e7dc8aca", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "전체 노선의 시작부터 종료까지 걸리는 시간 합계를 최소화하고, 모든 노선의 각 회전에서 배송지를 모두 감싸는 최소 원의 반경은 반드시 10km 이하로 부탁드립니다"}], "ir": "MINIMIZE( SUM(x0 in routes: duration(x0)) )\n[HARD] EACH(x1 in routes): EACH(x2 in rounds(x1)): sec_radius(x2) <= 10 km", "decision_kind": "execute", "gold_decision": {"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", "value": {"type": "decimal", "value": "10000"}}], "constraint_ref": "constraint:round_enclosing_circle_radius", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:duration_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:d64124571477cd6f", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "모든 노선의 시작부터 끝까지 걸리는 시간을 합쳐서 최소화해줘. 모든 노선에서 매 회전 배송지를 전부 감싸는 가장 작은 원의 반경은 반드시 10km 이하여야 해"}], "ir": "MINIMIZE( SUM(x0 in routes: duration(x0)) )\n[HARD] EACH(x1 in routes): EACH(x2 in rounds(x1)): sec_radius(x2) <= 10 km", "decision_kind": "execute", "gold_decision": {"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", "value": {"type": "decimal", "value": "10000"}}], "constraint_ref": "constraint:round_enclosing_circle_radius", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:duration_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:602a91049e9bc29d", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "전체 노선의 시작~종료 시간 합계를 최소화하고 모든 노선의 매 회전 배송지를 감싸는 최소 원 반경은 반드시 10km 이하로 해줘"}], "ir": "MINIMIZE( SUM(x0 in routes: duration(x0)) )\n[HARD] EACH(x1 in routes): EACH(x2 in rounds(x1)): sec_radius(x2) <= 10 km", "decision_kind": "execute", "gold_decision": {"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", "value": {"type": "decimal", "value": "10000"}}], "constraint_ref": "constraint:round_enclosing_circle_radius", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:duration_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:d26099c8d5a28fd7", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "전체 경로의 연료비 합계가 최소가 되게 짜주고, 모든 배송은 가능하면 배송지에서 출발하는 시간이 배송 허용 시간대의 끝을 넘지 않게 해줘. 각 경로의 방문지를 전부 감싸는 가장 작은 원의 반경은 반드시 5km 이하여야 해."}], "ir": "MINIMIZE( SUM(x0 in routes: fuel_cost(x0)) )\n[SOFT] EACH(x1 in visits): departure_time(x1) <= tw_late(x1)\n[HARD] EACH(x2 in routes): sec_radius(x2) <= 5 km", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:enclosing_circle_radius.exp_factor", "value": {"type": "decimal", "value": "2"}}, {"slot_ref": "slot:enclosing_circle_radius.max_radius", "value": {"type": "decimal", "value": "5000"}}], "constraint_ref": "constraint:enclosing_circle_radius", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [{"slot_ref": "slot:time_window.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:time_window", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fuel_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:b424cfe714c50850", "domain": "routing", "language": "mixed", "messages": [{"role": "user", "content": "전체 route의 총 연료비를 최소화해 주시고, 모든 배송은 가능하면 배송지 출발 시간이 time window 종료 시각을 넘지 않게 해 주세요. 모든 route에서 방문지를 전부 포함하는 가장 작은 원의 반경은 반드시 5km 이하로 해 주세요"}], "ir": "MINIMIZE( SUM(x0 in routes: fuel_cost(x0)) )\n[SOFT] EACH(x1 in visits): departure_time(x1) <= tw_late(x1)\n[HARD] EACH(x2 in routes): sec_radius(x2) <= 5 km", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:enclosing_circle_radius.exp_factor", "value": {"type": "decimal", "value": "2"}}, {"slot_ref": "slot:enclosing_circle_radius.max_radius", "value": {"type": "decimal", "value": "5000"}}], "constraint_ref": "constraint:enclosing_circle_radius", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [{"slot_ref": "slot:time_window.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:time_window", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fuel_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:8fc886f5d4e113a8", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "모든 경로를 합친 총 연료비가 최소가 되도록 계획해 주세요. 모든 배송은 되도록 배송지에서 출발하는 시각이 배송 허용 시간대의 종료 시각 이내가 되게 해 주시고, 각 경로의 방문지를 모두 둘러싸는 가장 작은 원의 반경은 반드시 5km 이하로 제한해 주세요"}], "ir": "MINIMIZE( SUM(x0 in routes: fuel_cost(x0)) )\n[SOFT] EACH(x1 in visits): departure_time(x1) <= tw_late(x1)\n[HARD] EACH(x2 in routes): sec_radius(x2) <= 5 km", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:enclosing_circle_radius.exp_factor", "value": {"type": "decimal", "value": "2"}}, {"slot_ref": "slot:enclosing_circle_radius.max_radius", "value": {"type": "decimal", "value": "5000"}}], "constraint_ref": "constraint:enclosing_circle_radius", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [{"slot_ref": "slot:time_window.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:time_window", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fuel_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:c1face70cc07f290", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "전체 경로에 걸쳐 차량 사용에 드는 고정 운영비 합계를 최소화해줘. 모든 경로의 방문 순서는 반드시 시간 우선순위가 높은 순으로 잡아줘. 가능하면 모든 경로에서 각 배송의 서비스 시작 전 대기시간은 해당 기사별 대기시간 한도 이내로, 경로 종료는 해당 기사 근무 종료시간 이내로, 각 왕복 운행 종료는 해당 기사의 왕복 운행 허용시간대 끝을 넘기지 않게 해줘"}], "ir": "MINIMIZE( SUM(x0 in routes: fixed_cost(x0)) )\n[HARD] EACH(x1 in routes): ORDERED_BY(visit_seq(x1), time_priority, DESC)\n[SOFT] AND( EACH(x2 in routes): EACH(x3 in visits(x2)): wait_duration(x3) <= max_wait(x2), EACH(x4 in routes): end_time(x4) <= work_end(x4), EACH(x5 in routes): EACH(x6 in rounds(x5)): end_time(x6) <= round_window_end(x5) )", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:rider_time_window.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:rider_time_window", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:time_priority_order.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:time_priority_order", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fixed_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:82dc777879a30b7b", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "전체 경로의 차량 사용 고정 운영비 총합을 최소화하고, 모든 경로의 방문 순서는 반드시 시간 우선순위가 높은 순으로 배정해 주시기 바랍니다. 가능하면 모든 경로에서 각 배송의 서비스 시작 전 대기시간은 해당 기사의 대기시간 한도를 넘지 않고, 경로 종료시간은 해당 기사의 근무 종료시간을 넘지 않으며, 각 왕복 운행의 종료시간은 해당 기사의 왕복 운행 허용시간대 종료시각을 넘지 않도록 부탁드립니다"}], "ir": "MINIMIZE( SUM(x0 in routes: fixed_cost(x0)) )\n[HARD] EACH(x1 in routes): ORDERED_BY(visit_seq(x1), time_priority, DESC)\n[SOFT] AND( EACH(x2 in routes): EACH(x3 in visits(x2)): wait_duration(x3) <= max_wait(x2), EACH(x4 in routes): end_time(x4) <= work_end(x4), EACH(x5 in routes): EACH(x6 in rounds(x5)): end_time(x6) <= round_window_end(x5) )", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:rider_time_window.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:rider_time_window", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:time_priority_order.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:time_priority_order", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fixed_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:94344cc48a4e8c9b", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "차량 사용 고정 운영비는 전체 경로 합계로 최소화해줘. 모든 경로 방문 순서는 무조건 시간 우선순위 높은 순으로 해줘. 되도록 모든 경로에서 배송마다 서비스 시작 전 대기는 담당 기사 본인의 대기시간 한도 안으로, 경로 종료는 그 기사 근무 종료시간 안으로, 매 왕복 운행 종료는 그 기사의 왕복 운행 허용시간대 종료시각 안으로 맞춰줘"}], "ir": "MINIMIZE( SUM(x0 in routes: fixed_cost(x0)) )\n[HARD] EACH(x1 in routes): ORDERED_BY(visit_seq(x1), time_priority, DESC)\n[SOFT] AND( EACH(x2 in routes): EACH(x3 in visits(x2)): wait_duration(x3) <= max_wait(x2), EACH(x4 in routes): end_time(x4) <= work_end(x4), EACH(x5 in routes): EACH(x6 in rounds(x5)): end_time(x6) <= round_window_end(x5) )", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:rider_time_window.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:rider_time_window", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:time_priority_order.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:time_priority_order", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fixed_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/fragment:routing:4326f52fc3a7ddf9", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "내일 배차 짜는 중인데요, 모든 루트에서 각 배송의 서비스 시작 전 대기시간이 그 루트 기사님 본인의 대기시간 한도를 넘지 않게 해 주세요. 그리고 루트 종료 시각은 기사님 근무 종료 시간 이내여야 하고, 각 왕복 회차가 끝나는 시각도 그 기사님의 회차 허용 종료 시각을 넘지 않도록 맞춰 주세요"}], "ir": "AND( EACH(x0 in routes): EACH(x1 in visits(x0)): wait_duration(x1) <= max_wait(x0), EACH(x2 in routes): end_time(x2) <= work_end(x2), EACH(x3 in routes): EACH(x4 in rounds(x3)): end_time(x4) <= round_window_end(x3) )", "decision_kind": "clarify", "gold_decision": {"candidate_refs": [], "kind": "clarify", "missing_field_refs": [], "reason_code": "missing_value", "required_inputs": [{"field": "objectives", "kind": "decision_field"}]}, "stratum": "v4/fragment", "episode_id": null} {"id": "v4/fragment:routing:49c2836e1a54b7cc", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "모든 루트에서 배송별 대기시간은 담당 기사 대기 한도 안으로, 루트 종료는 기사 퇴근 시간 안으로, 각 회차 종료는 그 기사 회차 마감 시각 안으로 맞춰줘"}], "ir": "AND( EACH(x0 in routes): EACH(x1 in visits(x0)): wait_duration(x1) <= max_wait(x0), EACH(x2 in routes): end_time(x2) <= work_end(x2), EACH(x3 in routes): EACH(x4 in rounds(x3)): end_time(x4) <= round_window_end(x3) )", "decision_kind": "clarify", "gold_decision": {"candidate_refs": [], "kind": "clarify", "missing_field_refs": [], "reason_code": "missing_value", "required_inputs": [{"field": "objectives", "kind": "decision_field"}]}, "stratum": "v4/fragment", "episode_id": null} {"id": "v4/fragment:routing:5584dd88d04efb0a", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "기사마다 사정이 달라서 한도가 다 달라. 모든 루트에서 배송 하나하나의 서비스 전 대기시간은 그 루트 기사 본인의 대기 한도 이하로 해줘. 루트가 끝나는 시간은 그 기사 근무 종료 시간 안으로, 각 왕복 회차가 끝나는 시간도 그 기사의 회차 종료 시각 안으로 가자"}], "ir": "AND( EACH(x0 in routes): EACH(x1 in visits(x0)): wait_duration(x1) <= max_wait(x0), EACH(x2 in routes): end_time(x2) <= work_end(x2), EACH(x3 in routes): EACH(x4 in rounds(x3)): end_time(x4) <= round_window_end(x3) )", "decision_kind": "clarify", "gold_decision": {"candidate_refs": [], "kind": "clarify", "missing_field_refs": [], "reason_code": "missing_value", "required_inputs": [{"field": "objectives", "kind": "decision_field"}]}, "stratum": "v4/fragment", "episode_id": null} {"id": "v4/combo:nurse:97f7457538de4f70", "domain": "nurse", "language": "ko", "messages": [{"role": "user", "content": "전체 근무 배정의 선호도 만족도 점수 합계를 최대화해 주시고, 모든 간호사의 연이은 근무 사이 휴식시간은 8시간 이상으로 잡아 주시기 바랍니다."}], "ir": "MAXIMIZE( SUM(x0 in assignments: preference_score(x0)) )\nEACH(x1 in workers): EACH(x2 in adjacent(assignment_seq(x1))): gap_duration(x2) >= 8 h", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:min_hours", "value": {"type": "duration", "unit_ref": "unit:hour", "value": "8"}}], "constraint_ref": "constraint:min_rest_hours", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:preference_satisfaction", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:nurse:e59d06b5e44c5df0", "domain": "nurse", "language": "ko", "messages": [{"role": "user", "content": "전체 근무 배정의 선호도 만족도 점수 합계가 최대가 되게 짜줘. 모든 간호사가 연이어 하는 근무 사이에는 8시간 이상 쉬게 해줘"}], "ir": "MAXIMIZE( SUM(x0 in assignments: preference_score(x0)) )\nEACH(x1 in workers): EACH(x2 in adjacent(assignment_seq(x1))): gap_duration(x2) >= 8 h", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:min_hours", "value": {"type": "duration", "unit_ref": "unit:hour", "value": "8"}}], "constraint_ref": "constraint:min_rest_hours", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:preference_satisfaction", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:nurse:d48b2d1fd230ab4a", "domain": "nurse", "language": "ko", "messages": [{"role": "user", "content": "전체 근무 배정 선호도 만족도 점수 합계 최대화하고, 모든 간호사 연이은 근무 사이 휴식은 8시간 이상으로 해줘"}], "ir": "MAXIMIZE( SUM(x0 in assignments: preference_score(x0)) )\nEACH(x1 in workers): EACH(x2 in adjacent(assignment_seq(x1))): gap_duration(x2) >= 8 h", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:min_hours", "value": {"type": "duration", "unit_ref": "unit:hour", "value": "8"}}], "constraint_ref": "constraint:min_rest_hours", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:preference_satisfaction", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/perturb:routing:cd7fdd188e71b86e", "domain": "routing", "language": "en", "messages": [{"role": "user", "content": "Minimize total fixed vehicle cost across all routes; each route's smallest enclosing circle radius at least 10 km."}], "ir": "MINIMIZE( SUM(x0 in routes: fixed_cost(x0)) )\nEACH(x1 in routes): sec_radius(x1) >= 10 km", "decision_kind": "unsupported", "gold_decision": {"kind": "unsupported", "reason_code": "semantic_not_declared", "related_refs": []}, "stratum": "v4/perturb", "episode_id": null} {"id": "v4/perturb:routing:3c6b5640107e8449", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "모든 경로에 쓰는 차량 고정 운영비 합계를 최소로 하자. 그리고 경로마다 정류장을 다 감싸는 가장 작은 원의 반경은 10km 이상이어야 해."}], "ir": "MINIMIZE( SUM(x0 in routes: fixed_cost(x0)) )\nEACH(x1 in routes): sec_radius(x1) >= 10 km", "decision_kind": "unsupported", "gold_decision": {"kind": "unsupported", "reason_code": "semantic_not_declared", "related_refs": []}, "stratum": "v4/perturb", "episode_id": null} {"id": "v4/perturb:routing:ec425849d515de32", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "이번 배차 짜줄 때 차량 고정 운영비를 전체 경로 합쳐서 최소로 줄여줘. 그리고 각 경로는 거기 들르는 정류장들을 다 감싸는 가장 작은 원의 반경이 10km 이상 되게 해줘"}], "ir": "MINIMIZE( SUM(x0 in routes: fixed_cost(x0)) )\nEACH(x1 in routes): sec_radius(x1) >= 10 km", "decision_kind": "unsupported", "gold_decision": {"kind": "unsupported", "reason_code": "semantic_not_declared", "related_refs": []}, "stratum": "v4/perturb", "episode_id": null} {"id": "v4/combo:routing:5126d79530ba9560", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "내일 배차 계획을 짜려고 합니다. 모든 차량 경로의 총 운행시간과 총 이동거리를 둘 다 줄여 주시기 바랍니다. 그리고 각 경로의 회전마다 정차지를 감싸는 가장 작은 원의 반경은 가능하면 10km 이내로 부탁드립니다."}], "ir": "MINIMIZE( SUM(x0 in routes: duration(x0)) )\nMINIMIZE( SUM(x1 in routes: travel_distance(x1)) )\n[SOFT] EACH(x2 in routes): EACH(x3 in rounds(x2)): sec_radius(x3) <= 10 km", "decision_kind": "execute", "gold_decision": {"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", "value": {"type": "decimal", "value": "10000"}}], "constraint_ref": "constraint:round_enclosing_circle_radius", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:distance_cost", "weight": "1/2"}, {"objective_ref": "objective:duration_cost", "weight": "1/2"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:3559722c1f1b5b10", "domain": "routing", "language": "en", "messages": [{"role": "user", "content": "I'm putting together tomorrow's dispatch plan. Please minimize the total driving time and the total travel distance across all routes, both of them. Also, if possible, keep each round trip within a 10 km radius, meaning the smallest circle that encloses its stops, on every route."}], "ir": "MINIMIZE( SUM(x0 in routes: duration(x0)) )\nMINIMIZE( SUM(x1 in routes: travel_distance(x1)) )\n[SOFT] EACH(x2 in routes): EACH(x3 in rounds(x2)): sec_radius(x3) <= 10 km", "decision_kind": "execute", "gold_decision": {"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", "value": {"type": "decimal", "value": "10000"}}], "constraint_ref": "constraint:round_enclosing_circle_radius", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:distance_cost", "weight": "1/2"}, {"objective_ref": "objective:duration_cost", "weight": "1/2"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:93d40b0aa3dcbe84", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "전체 경로의 총연료비를 최소화해 주시기 바랍니다. 모든 배송 건은 가능하면 해당 배송의 허용된 마지막 시간까지 출발하도록 부탁드립니다."}], "ir": "MINIMIZE( SUM(x0 in routes: fuel_cost(x0)) )\n[SOFT] EACH(x1 in visits): departure_time(x1) <= tw_late(x1)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:time_window.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:time_window", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fuel_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:954574eab1a01ce3", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "모든 경로를 합친 연료비가 최소가 되도록 계획 부탁드립니다. 각 배송은 되도록 그 배송의 허용된 마지막 시간보다 늦지 않게 출발하도록 해 주시기 바랍니다."}], "ir": "MINIMIZE( SUM(x0 in routes: fuel_cost(x0)) )\n[SOFT] EACH(x1 in visits): departure_time(x1) <= tw_late(x1)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:time_window.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:time_window", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fuel_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:776db2dcc25f2568", "domain": "routing", "language": "en", "messages": [{"role": "user", "content": "Minimize total fuel cost across all routes. If possible, have every delivery depart no later than its latest allowed time."}], "ir": "MINIMIZE( SUM(x0 in routes: fuel_cost(x0)) )\n[SOFT] EACH(x1 in visits): departure_time(x1) <= tw_late(x1)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:time_window.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:time_window", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fuel_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:d7a73cb30dc50c57", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "전체 경로 기준 차량 고정비용 합계를 최소화하고 싶습니다. 경로마다 배송지는 무조건 3곳 이하, 이동거리는 되도록 80km 이하, 왕복 횟수는 반드시 해당 기사의 계약 최소 회전 수 이상으로 맞춰 주세요"}], "ir": "MINIMIZE( SUM(x0 in routes: fixed_cost(x0)) )\n[HARD] EACH(x1 in routes): delivery_count(x1) <= 3\n[SOFT] EACH(x2 in routes): travel_distance(x2) <= 80 km\n[HARD] EACH(x3 in routes): round_count(x3) >= base_rounds(x3)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:minimum_round", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [{"slot_ref": "slot:delivery_length.exp_factor", "value": {"type": "decimal", "value": "2"}}, {"slot_ref": "slot:delivery_length.max_size", "value": {"type": "decimal", "value": "3"}}], "constraint_ref": "constraint:delivery_length", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [{"slot_ref": "slot:max_distance.exp_factor", "value": {"type": "decimal", "value": "1"}}, {"slot_ref": "slot:max_distance.max_distance", "value": {"type": "decimal", "value": "80000"}}], "constraint_ref": "constraint:max_distance", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fixed_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:83b36847f67f6ee3", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "전체 경로의 총 이동거리와 차량 고정 운영비 합계를 줄여 주세요. 각 경로의 각 회전에 포함된 배송지들의 서로 다른 배달 구역 수를 세어서, 모든 경로와 회전에 걸쳐 더한 값도 줄여 주세요. 모든 경로에서 매 회전의 배송지를 전부 감싸는 가장 작은 원의 반경은 반드시 8km 이하여야 해요."}], "ir": "MINIMIZE( SUM(x0 in routes: travel_distance(x0)) )\nMINIMIZE( SUM(x1 in routes: fixed_cost(x1)) )\nMINIMIZE( SUM(x2 in routes: SUM(x3 in rounds(x2): COUNT_DISTINCT(x4 in visits(x3): zone(x4)))) )\n[HARD] EACH(x5 in routes): EACH(x6 in rounds(x5)): sec_radius(x6) <= 8 km", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:rider_route_zone.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:rider_route_zone", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:round_enclosing_circle_radius.exp_factor", "value": {"type": "decimal", "value": "2"}}, {"slot_ref": "slot:round_enclosing_circle_radius.max_radius", "value": {"type": "decimal", "value": "8000"}}], "constraint_ref": "constraint:round_enclosing_circle_radius", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:distance_cost", "weight": "1/2"}, {"objective_ref": "objective:fixed_cost", "weight": "1/2"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:063323b6c92d6004", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "전체 경로의 이동거리 합계랑 차량 고정 운영비 합계를 줄이고, 각 경로의 각 회전마다 배송지의 서로 다른 배달 구역 수를 세서 전체 회전에 걸쳐 합한 값도 줄여줘. 모든 경로의 매 회전에서 배송지 전체를 감싸는 최소 원의 반경은 반드시 8km 이하로 해줘"}], "ir": "MINIMIZE( SUM(x0 in routes: travel_distance(x0)) )\nMINIMIZE( SUM(x1 in routes: fixed_cost(x1)) )\nMINIMIZE( SUM(x2 in routes: SUM(x3 in rounds(x2): COUNT_DISTINCT(x4 in visits(x3): zone(x4)))) )\n[HARD] EACH(x5 in routes): EACH(x6 in rounds(x5)): sec_radius(x6) <= 8 km", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:rider_route_zone.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:rider_route_zone", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:round_enclosing_circle_radius.exp_factor", "value": {"type": "decimal", "value": "2"}}, {"slot_ref": "slot:round_enclosing_circle_radius.max_radius", "value": {"type": "decimal", "value": "8000"}}], "constraint_ref": "constraint:round_enclosing_circle_radius", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:distance_cost", "weight": "1/2"}, {"objective_ref": "objective:fixed_cost", "weight": "1/2"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:fbd7cc60620d7bdd", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "전체 경로 총 이동거리, 차량 고정 운영비 총합 줄이기, 경로별 회전별로 배송지의 서로 다른 배달 구역 수를 센 뒤 모든 경로와 회전에 걸쳐 더한 값도 줄이기. 모든 경로의 각 회전 배송지를 전부 포함하는 가장 작은 원의 반경은 반드시 8km 이하로 맞춰줘"}], "ir": "MINIMIZE( SUM(x0 in routes: travel_distance(x0)) )\nMINIMIZE( SUM(x1 in routes: fixed_cost(x1)) )\nMINIMIZE( SUM(x2 in routes: SUM(x3 in rounds(x2): COUNT_DISTINCT(x4 in visits(x3): zone(x4)))) )\n[HARD] EACH(x5 in routes): EACH(x6 in rounds(x5)): sec_radius(x6) <= 8 km", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:rider_route_zone.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:rider_route_zone", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:round_enclosing_circle_radius.exp_factor", "value": {"type": "decimal", "value": "2"}}, {"slot_ref": "slot:round_enclosing_circle_radius.max_radius", "value": {"type": "decimal", "value": "8000"}}], "constraint_ref": "constraint:round_enclosing_circle_radius", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:distance_cost", "weight": "1/2"}, {"objective_ref": "objective:fixed_cost", "weight": "1/2"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:nurse:1394889bccf47487", "domain": "nurse", "language": "ko", "messages": [{"role": "user", "content": "다음 달 근무표 짤 때 전체 간호사의 주당 한도를 넘는 초과근무 시간 합계는 최소로 해 주시고, 근무 배정에 대한 선호도 점수 합계는 최대로 올려 주세요. 연속으로 일하는 날은 간호사 모두 반드시 4일 이하여야 하고, 근무와 근무 사이 간격은 가능하면 11시간 이상 되게 해 주세요."}], "ir": "MINIMIZE( SUM(x0 in workers: overtime_hours(x0)) )\nMAXIMIZE( SUM(x1 in assignments: preference_score(x1)) )\n[HARD] EACH(x2 in workers): RUN_LENGTH(x3 in day_seq(x2): works(x2, x3)) <= 4 day\n[SOFT] EACH(x4 in workers): EACH(x5 in adjacent(assignment_seq(x4))): gap_duration(x5) >= 11 h", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:max_days", "value": {"type": "duration", "unit_ref": "unit:day", "value": "4"}}], "constraint_ref": "constraint:max_consecutive_days", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [{"slot_ref": "slot:min_hours", "value": {"type": "duration", "unit_ref": "unit:hour", "value": "11"}}], "constraint_ref": "constraint:min_rest_hours", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:overtime", "weight": "2/5"}, {"objective_ref": "objective:preference_satisfaction", "weight": "3/5"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:nurse:6e6ea7a488e7fb13", "domain": "nurse", "language": "ko", "messages": [{"role": "user", "content": "전 간호사 주당 한도 넘는 초과근무 시간 총합은 최소로, 배정별 선호도 점수 총합은 최대로 가자. 연속 근무는 무조건 4일까지만, 근무 사이 간격은 되도록 11시간 이상으로 해줘"}], "ir": "MINIMIZE( SUM(x0 in workers: overtime_hours(x0)) )\nMAXIMIZE( SUM(x1 in assignments: preference_score(x1)) )\n[HARD] EACH(x2 in workers): RUN_LENGTH(x3 in day_seq(x2): works(x2, x3)) <= 4 day\n[SOFT] EACH(x4 in workers): EACH(x5 in adjacent(assignment_seq(x4))): gap_duration(x5) >= 11 h", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:max_days", "value": {"type": "duration", "unit_ref": "unit:day", "value": "4"}}], "constraint_ref": "constraint:max_consecutive_days", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [{"slot_ref": "slot:min_hours", "value": {"type": "duration", "unit_ref": "unit:hour", "value": "11"}}], "constraint_ref": "constraint:min_rest_hours", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:overtime", "weight": "2/5"}, {"objective_ref": "objective:preference_satisfaction", "weight": "3/5"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:nurse:0ec94b6577b5214d", "domain": "nurse", "language": "ko", "messages": [{"role": "user", "content": "초과근무 시간 총합은 줄이고 선호도 점수 총합은 높게 가자, 둘 다 중요해. 그리고 모든 간호사 연속근무는 절대 4일 넘으면 안 되고, 근무 간 쉬는 시간은 가능하면 11시간 이상 되게 해줘"}], "ir": "MINIMIZE( SUM(x0 in workers: overtime_hours(x0)) )\nMAXIMIZE( SUM(x1 in assignments: preference_score(x1)) )\n[HARD] EACH(x2 in workers): RUN_LENGTH(x3 in day_seq(x2): works(x2, x3)) <= 4 day\n[SOFT] EACH(x4 in workers): EACH(x5 in adjacent(assignment_seq(x4))): gap_duration(x5) >= 11 h", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:max_days", "value": {"type": "duration", "unit_ref": "unit:day", "value": "4"}}], "constraint_ref": "constraint:max_consecutive_days", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [{"slot_ref": "slot:min_hours", "value": {"type": "duration", "unit_ref": "unit:hour", "value": "11"}}], "constraint_ref": "constraint:min_rest_hours", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:overtime", "weight": "2/5"}, {"objective_ref": "objective:preference_satisfaction", "weight": "3/5"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:retail:802fac6dd69ed028", "domain": "retail", "language": "ko", "messages": [{"role": "user", "content": "계획 기간 동안의 평균 재고 보유비용을 최소화하도록 발주 계획을 부탁드립니다. 모든 발주는 가능하면 해당 품목의 발주 가능 요일에 넣고, 입고일은 되도록 발주일에 해당 품목 공급업체의 배송 소요일을 더한 날짜로 잡아 주시기 바랍니다."}], "ir": "MINIMIZE( MEAN(x0 in days(horizon): holding_cost(x0)) )\n[SOFT] EACH(x1 in orders): day_of_week(x1) IN allowed_order_days(x1)\n[SOFT] EACH(x2 in orders): arrival_day(x2) = offset(order_day(x2), lead_time(x2))", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:lead_time", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [], "constraint_ref": "constraint:order_days", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:minimize_holding_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:retail:b446ac9f04a78450", "domain": "retail", "language": "ko", "messages": [{"role": "user", "content": "계획 기간의 평균 재고 유지비를 최소화해 주세요. 모든 발주는 되도록 품목별 발주 가능 요일에 맞춰 넣고, 입고일은 가능하면 발주일에서 해당 품목 공급업체의 배송 기간만큼 지난 날로 잡아 주세요."}], "ir": "MINIMIZE( MEAN(x0 in days(horizon): holding_cost(x0)) )\n[SOFT] EACH(x1 in orders): day_of_week(x1) IN allowed_order_days(x1)\n[SOFT] EACH(x2 in orders): arrival_day(x2) = offset(order_day(x2), lead_time(x2))", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:lead_time", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [], "constraint_ref": "constraint:order_days", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:minimize_holding_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:retail:08bd75de14187a3b", "domain": "retail", "language": "ko", "messages": [{"role": "user", "content": "계획 기간 동안 평균 재고 보유비용을 최소화해줘. 모든 발주는 가능하면 품목별로 주문 가능한 요일에 넣고, 입고일은 되도록 발주일에 그 품목 공급업체의 배송 소요일을 더한 날짜로 잡아줘"}], "ir": "MINIMIZE( MEAN(x0 in days(horizon): holding_cost(x0)) )\n[SOFT] EACH(x1 in orders): day_of_week(x1) IN allowed_order_days(x1)\n[SOFT] EACH(x2 in orders): arrival_day(x2) = offset(order_day(x2), lead_time(x2))", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:lead_time", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [], "constraint_ref": "constraint:order_days", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:minimize_holding_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:4bc580db5fb2afb8", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "모든 경로의 차량 고정 운영비 합계를 최소화해 주시기 바랍니다. 경로당 배송 건수는 반드시 3건 이하로, 경로당 이동거리는 가능하면 80km 이하로 하고, 경로별 회전 수는 반드시 해당 기사 계약 최소 회전 수 이상이어야 합니다."}], "ir": "MINIMIZE( SUM(x0 in routes: fixed_cost(x0)) )\n[HARD] EACH(x1 in routes): delivery_count(x1) <= 3\n[SOFT] EACH(x2 in routes): travel_distance(x2) <= 80 km\n[HARD] EACH(x3 in routes): round_count(x3) >= base_rounds(x3)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:minimum_round", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [{"slot_ref": "slot:delivery_length.exp_factor", "value": {"type": "decimal", "value": "2"}}, {"slot_ref": "slot:delivery_length.max_size", "value": {"type": "decimal", "value": "3"}}], "constraint_ref": "constraint:delivery_length", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [{"slot_ref": "slot:max_distance.exp_factor", "value": {"type": "decimal", "value": "1"}}, {"slot_ref": "slot:max_distance.max_distance", "value": {"type": "decimal", "value": "80000"}}], "constraint_ref": "constraint:max_distance", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fixed_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:6d75c3103b8b1d5f", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "차량 고정비용 전체 합을 최소로 부탁드립니다 모든 경로는 배송 건수가 반드시 3건 이하여야 하고 이동거리는 되도록 80km 이내로 해 주세요 그리고 각 경로의 회전 수는 무조건 기사 계약 최소 회전 수 이상이어야 합니다"}], "ir": "MINIMIZE( SUM(x0 in routes: fixed_cost(x0)) )\n[HARD] EACH(x1 in routes): delivery_count(x1) <= 3\n[SOFT] EACH(x2 in routes): travel_distance(x2) <= 80 km\n[HARD] EACH(x3 in routes): round_count(x3) >= base_rounds(x3)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:minimum_round", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [{"slot_ref": "slot:delivery_length.exp_factor", "value": {"type": "decimal", "value": "2"}}, {"slot_ref": "slot:delivery_length.max_size", "value": {"type": "decimal", "value": "3"}}], "constraint_ref": "constraint:delivery_length", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [{"slot_ref": "slot:max_distance.exp_factor", "value": {"type": "decimal", "value": "1"}}, {"slot_ref": "slot:max_distance.max_distance", "value": {"type": "decimal", "value": "80000"}}], "constraint_ref": "constraint:max_distance", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fixed_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/base:nurse:70e7e5b9e85a3219", "domain": "nurse", "language": "ko", "messages": [{"role": "user", "content": "다음 달 병동 근무표를 짜려고 해요. 전체 근무 배정의 선호도 만족 점수를 다 더한 값이 가장 커지도록 해 주세요. 그리고 모든 간호사에게 연속된 두 근무 사이 휴식시간이 8시간 이상 되도록 맞춰 주세요"}], "ir": "MAXIMIZE( SUM(x0 in assignments: preference_score(x0)) )\nEACH(x1 in workers): EACH(x2 in adjacent(assignment_seq(x1))): gap_duration(x2) >= 8 h", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:min_hours", "value": {"type": "duration", "unit_ref": "unit:hour", "value": "8"}}], "constraint_ref": "constraint:min_rest_hours", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:preference_satisfaction", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/base", "episode_id": null} {"id": "v4/combo:routing:5dd86f7232d9ed0c", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "전체 경로의 연료비 합계를 최소화해 주시고, 모든 경로에서 배송지를 모두 포함하는 가장 작은 원의 반경은 반드시 8km 이내로 제한해 주시기 바랍니다. 같은 좌표에 있는 배송 건들은 가능하면 같은 경로에 묶어 배정 부탁드립니다."}], "ir": "MINIMIZE( SUM(x0 in routes: fuel_cost(x0)) )\n[HARD] EACH(x1 in routes): sec_radius(x1) <= 8 km\n[SOFT] EACH((x2, x3) in pairs(visits, same_coordinate)): TOGETHER(x2, x3, route)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:enclosing_circle_radius.exp_factor", "value": {"type": "decimal", "value": "2"}}, {"slot_ref": "slot:enclosing_circle_radius.max_radius", "value": {"type": "decimal", "value": "8000"}}], "constraint_ref": "constraint:enclosing_circle_radius", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [{"slot_ref": "slot:same_coordinate_grouping.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:same_coordinate_grouping", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fuel_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:cd6fca1813dd6db1", "domain": "routing", "language": "en", "messages": [{"role": "user", "content": "Minimize the total fuel cost across all routes, and make sure every route must have a smallest circle enclosing all its stops with a radius of at most 8 km. If possible, put deliveries at the same coordinates on the same route."}], "ir": "MINIMIZE( SUM(x0 in routes: fuel_cost(x0)) )\n[HARD] EACH(x1 in routes): sec_radius(x1) <= 8 km\n[SOFT] EACH((x2, x3) in pairs(visits, same_coordinate)): TOGETHER(x2, x3, route)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:enclosing_circle_radius.exp_factor", "value": {"type": "decimal", "value": "2"}}, {"slot_ref": "slot:enclosing_circle_radius.max_radius", "value": {"type": "decimal", "value": "8000"}}], "constraint_ref": "constraint:enclosing_circle_radius", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [{"slot_ref": "slot:same_coordinate_grouping.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:same_coordinate_grouping", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fuel_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:6c03e791ec4327d3", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "전체 경로의 연료비 합계를 최소화해줘. 모든 경로는 배송지를 전부 감싸는 가장 작은 원의 반경이 반드시 8km 이하여야 하고, 같은 좌표의 배송 건들은 되도록 같은 경로에 묶어줘"}], "ir": "MINIMIZE( SUM(x0 in routes: fuel_cost(x0)) )\n[HARD] EACH(x1 in routes): sec_radius(x1) <= 8 km\n[SOFT] EACH((x2, x3) in pairs(visits, same_coordinate)): TOGETHER(x2, x3, route)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:enclosing_circle_radius.exp_factor", "value": {"type": "decimal", "value": "2"}}, {"slot_ref": "slot:enclosing_circle_radius.max_radius", "value": {"type": "decimal", "value": "8000"}}], "constraint_ref": "constraint:enclosing_circle_radius", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [{"slot_ref": "slot:same_coordinate_grouping.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:same_coordinate_grouping", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fuel_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:0dab927fe862251c", "domain": "routing", "language": "mixed", "messages": [{"role": "user", "content": "전체 route의 총 이동거리를 최소화해 주세요. 그리고 모든 route에서 배송 순서는 시간 우선순위가 높은 것부터 내림차순으로 하고, 한 route당 배송 건수는 15건 이하로 해 주세요"}], "ir": "MINIMIZE( SUM(x0 in routes: travel_distance(x0)) )\nEACH(x1 in routes): ORDERED_BY(visit_seq(x1), time_priority, DESC)\nEACH(x2 in routes): delivery_count(x2) <= 15", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:delivery_length.exp_factor", "value": {"type": "decimal", "value": "2"}}, {"slot_ref": "slot:delivery_length.max_size", "value": {"type": "decimal", "value": "15"}}], "constraint_ref": "constraint:delivery_length", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:time_priority_order.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:time_priority_order", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:distance_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:58f983f2f1fa564f", "domain": "routing", "language": "en", "messages": [{"role": "user", "content": "Minimize the total distance traveled across all routes. On every route, deliveries should go in time priority order, highest first, and no route should have more than 15 deliveries"}], "ir": "MINIMIZE( SUM(x0 in routes: travel_distance(x0)) )\nEACH(x1 in routes): ORDERED_BY(visit_seq(x1), time_priority, DESC)\nEACH(x2 in routes): delivery_count(x2) <= 15", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:delivery_length.exp_factor", "value": {"type": "decimal", "value": "2"}}, {"slot_ref": "slot:delivery_length.max_size", "value": {"type": "decimal", "value": "15"}}], "constraint_ref": "constraint:delivery_length", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:time_priority_order.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:time_priority_order", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:distance_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:b7b88ff98739658b", "domain": "routing", "language": "en", "messages": [{"role": "user", "content": "I need total travel distance over all routes kept as low as possible, with each route's stops sequenced by time priority in descending order and each route capped at 15 deliveries"}], "ir": "MINIMIZE( SUM(x0 in routes: travel_distance(x0)) )\nEACH(x1 in routes): ORDERED_BY(visit_seq(x1), time_priority, DESC)\nEACH(x2 in routes): delivery_count(x2) <= 15", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:delivery_length.exp_factor", "value": {"type": "decimal", "value": "2"}}, {"slot_ref": "slot:delivery_length.max_size", "value": {"type": "decimal", "value": "15"}}], "constraint_ref": "constraint:delivery_length", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:time_priority_order.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:time_priority_order", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:distance_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/multi:routing:f3e8a040470a8b46", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "전체 경로의 연료비 합계가 최소가 되게 배차해줘. 각 경로의 배송지를 모두 감싸는 가장 작은 원의 반경은 담당 기사별 반경 한도 이내로 하고, 물류센터 왕복 횟수와 왕복 한 번에 들르는 서로 다른 배송지 수, 경로 전체에서 들르는 서로 다른 배송지 수도 각각 담당 기사에게 정해진 한도 이내로 잡아줘. 각 경로의 총 이동거리와 왕복 한 번의 이동거리, 연속해서 방문하는 두 지점 사이의 이동거리도 각각 담당 기사별 한도 이내로 해줘"}], "ir": "MINIMIZE( SUM(x0 in routes: fuel_cost(x0)) )\nEACH(x1 in routes): sec_radius(x1) <= individual_radius_limit(x1)\nAND( EACH(x2 in routes): round_count(x2) <= max_rounds(x2), EACH(x3 in routes): EACH(x4 in rounds(x3)): stop_count(x4) <= max_stops_per_round(x3), EACH(x5 in routes): stop_count(x5) <= max_stops(x5) )\nAND( EACH(x6 in routes): travel_distance(x6) <= total_limit(x6), EACH(x7 in routes): EACH(x8 in rounds(x7)): travel_distance(x8) <= trip_limit(x7), EACH(x9 in routes): EACH(x10 in adjacent(visit_seq(x9))): travel_distance(x10) <= between_limit(x9) )", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:individual_enclosing_circle_radius.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:individual_enclosing_circle_radius", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:rider_delivery_length.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:rider_delivery_length", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:rider_distance.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:rider_distance", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fuel_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/multi", "episode_id": null} {"id": "v4/multi:routing:8c49d43225b4ebec", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "모든 경로의 연료비를 합쳐서 최소가 되게 짜줘. 경로마다 배송지를 전부 둘러싸는 가장 작은 원의 반경은 그 기사한테 정해진 반경을 넘지 않게 하고, 물류센터를 왕복하는 횟수랑 왕복할 때마다 들르는 서로 다른 배송지 수, 경로 전체의 서로 다른 배송지 수도 각각 그 기사한테 정해진 한도를 넘지 않게 해줘. 경로별 전체 이동거리도, 왕복 한 번마다의 이동거리도, 연달아 방문하는 두 지점 사이의 이동거리도 각각 담당 기사한테 정해진 한도 안으로 잡아줘"}], "ir": "MINIMIZE( SUM(x0 in routes: fuel_cost(x0)) )\nEACH(x1 in routes): sec_radius(x1) <= individual_radius_limit(x1)\nAND( EACH(x2 in routes): round_count(x2) <= max_rounds(x2), EACH(x3 in routes): EACH(x4 in rounds(x3)): stop_count(x4) <= max_stops_per_round(x3), EACH(x5 in routes): stop_count(x5) <= max_stops(x5) )\nAND( EACH(x6 in routes): travel_distance(x6) <= total_limit(x6), EACH(x7 in routes): EACH(x8 in rounds(x7)): travel_distance(x8) <= trip_limit(x7), EACH(x9 in routes): EACH(x10 in adjacent(visit_seq(x9))): travel_distance(x10) <= between_limit(x9) )", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:individual_enclosing_circle_radius.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:individual_enclosing_circle_radius", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:rider_delivery_length.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:rider_delivery_length", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:rider_distance.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:rider_distance", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fuel_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/multi", "episode_id": null} {"id": "v4/multi:routing:b674711acd5c2ce6", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "전체 경로의 연료비 합계를 최소화하고, 각 경로의 모든 배송지를 포함하는 가장 작은 원의 반경은 담당 기사별 반경 한도 이내로 계획 부탁드립니다. 모든 경로에서 물류센터 왕복 횟수, 각 왕복의 서로 다른 배송지 수, 경로 전체의 서로 다른 배송지 수는 각각 담당 기사별 한도 이내로 하고, 경로별 총 이동거리, 각 왕복의 이동거리, 연속 방문 지점 사이의 이동거리 역시 각각 담당 기사별 한도 이내로 배차 부탁드립니다"}], "ir": "MINIMIZE( SUM(x0 in routes: fuel_cost(x0)) )\nEACH(x1 in routes): sec_radius(x1) <= individual_radius_limit(x1)\nAND( EACH(x2 in routes): round_count(x2) <= max_rounds(x2), EACH(x3 in routes): EACH(x4 in rounds(x3)): stop_count(x4) <= max_stops_per_round(x3), EACH(x5 in routes): stop_count(x5) <= max_stops(x5) )\nAND( EACH(x6 in routes): travel_distance(x6) <= total_limit(x6), EACH(x7 in routes): EACH(x8 in rounds(x7)): travel_distance(x8) <= trip_limit(x7), EACH(x9 in routes): EACH(x10 in adjacent(visit_seq(x9))): travel_distance(x10) <= between_limit(x9) )", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:individual_enclosing_circle_radius.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:individual_enclosing_circle_radius", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:rider_delivery_length.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:rider_delivery_length", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:rider_distance.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:rider_distance", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fuel_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/multi", "episode_id": null} {"id": "v4/combo:routing:cf001a7a904575a6", "domain": "routing", "language": "mixed", "messages": [{"role": "user", "content": "차량 고정 비용 총합은 줄여 주시고요, 각 루트의 stop들을 감싸는 최소 원 반경이 가능하면 그 루트 라이더 본인의 반경 제한 이내로 들어오게 해 주세요. 그리고 각 루트의 라운드별 배달들이 걸치는 zone 종류 수 합계도 같이 최소화해 주세요"}], "ir": "MINIMIZE( SUM(x0 in routes: fixed_cost(x0)) )\n[SOFT] EACH(x1 in routes): sec_radius(x1) <= individual_radius_limit(x1)\nMINIMIZE( SUM(x2 in routes: SUM(x3 in rounds(x2): COUNT_DISTINCT(x4 in visits(x3): zone(x4)))) )", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:individual_enclosing_circle_radius.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:individual_enclosing_circle_radius", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:rider_route_zone.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:rider_route_zone", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fixed_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:e08f9f9479b24fb3", "domain": "routing", "language": "mixed", "messages": [{"role": "user", "content": "차량 고정비용 총합 최소화하고, 루트마다 stop 감싸는 최소 원 반경은 되도록 라이더 개인 반경 제한 안에 들어가게 해줘. 라운드별로 배달이 걸치는 zone 수 합계도 같이 줄이자"}], "ir": "MINIMIZE( SUM(x0 in routes: fixed_cost(x0)) )\n[SOFT] EACH(x1 in routes): sec_radius(x1) <= individual_radius_limit(x1)\nMINIMIZE( SUM(x2 in routes: SUM(x3 in rounds(x2): COUNT_DISTINCT(x4 in visits(x3): zone(x4)))) )", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:individual_enclosing_circle_radius.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:individual_enclosing_circle_radius", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:rider_route_zone.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:rider_route_zone", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fixed_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/base:routing:9df5b57c8abc1c0b", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "오늘 배차 계획 짜는 중인데요, 모든 경로의 총 연료비가 가장 적게 나오도록 해 주세요. 그리고 각 경로마다 왕복 한 번 한 번을 기준으로, 그 왕복 동안 지나는 지점들 중 실린 짐이 가장 많을 때의 값이 각 적재 항목별로 그 경로 차량의 용량을 넘지 않게 해 주세요."}], "ir": "MINIMIZE( SUM(x0 in routes: fuel_cost(x0)) )\nEACH(x1 in routes): EACH(x2 in rounds(x1)): EACH(x3 in keys(load)): MAX(x4 in positions(x2): load[x3](x4)) <= capacity[x3](x1)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:capacity.exp_factor", "value": {"type": "decimal", "value": "1"}}], "constraint_ref": "constraint:capacity", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fuel_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/base", "episode_id": null} {"id": "v4/base:routing:e0b96475ecee4f60", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "전체 경로의 연료비 합계를 최소화해 주시기 바랍니다. 아울러 모든 경로의 각 왕복마다, 왕복 중 지나는 지점에서 실린 최대 적재량이 적재 항목별로 해당 경로 차량의 용량 이내가 되도록 부탁드립니다."}], "ir": "MINIMIZE( SUM(x0 in routes: fuel_cost(x0)) )\nEACH(x1 in routes): EACH(x2 in rounds(x1)): EACH(x3 in keys(load)): MAX(x4 in positions(x2): load[x3](x4)) <= capacity[x3](x1)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:capacity.exp_factor", "value": {"type": "decimal", "value": "1"}}], "constraint_ref": "constraint:capacity", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fuel_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/base", "episode_id": null} {"id": "v4/base:routing:7e33977722d89142", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "전 경로 연료비 총합 최소로 짜줘. 그리고 경로별 왕복마다 적재 항목 하나하나 지점들 중 제일 많이 실은 값이 그 차량 용량 안에 들어오게 해줘."}], "ir": "MINIMIZE( SUM(x0 in routes: fuel_cost(x0)) )\nEACH(x1 in routes): EACH(x2 in rounds(x1)): EACH(x3 in keys(load)): MAX(x4 in positions(x2): load[x3](x4)) <= capacity[x3](x1)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:capacity.exp_factor", "value": {"type": "decimal", "value": "1"}}], "constraint_ref": "constraint:capacity", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fuel_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/base", "episode_id": null} {"id": "v4/combo:routing:e82a2b531e6502e5", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "오늘 배차 짜는 중인데요, 전체 경로의 연료비 합계가 가장 적게 나오도록 해 주세요. 각 경로의 정차지를 다 감싸는 가장 작은 원의 반경은 되도록 그 기사님 본인의 서비스 반경 이내로 맞춰 주시고요. 그리고 모든 경로에서 왕복 한 번마다 적재율이 제일 높은 화물 항목이 0.7 이상 되게 해 주세요. 계약된 최소 회전 수는 반드시 채워야 해요."}], "ir": "MINIMIZE( SUM(x0 in routes: fuel_cost(x0)) )\n[SOFT] EACH(x1 in routes): sec_radius(x1) <= individual_radius_limit(x1)\nEACH(x2 in routes): EACH(x3 in rounds(x2)): MAX(x4 in keys(load): utilization[x4](x3)) >= 0.7\n[HARD] EACH(x5 in routes): round_count(x5) >= base_rounds(x5)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:minimum_round", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [{"slot_ref": "slot:individual_enclosing_circle_radius.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:individual_enclosing_circle_radius", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:min_capacity.target_ratio", "value": {"type": "decimal", "value": "0.7"}}], "constraint_ref": "constraint:min_capacity", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fuel_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:2bac525742332e49", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "내일 배차 연료비 총합 최소로 짜줘. 경로마다 정차지 감싸는 최소 원 반경은 가능하면 그 기사 자기 반경 제한 안에 들어오게 해줘. 왕복마다 화물 종류 중 적재율 제일 높은 게 0.7 이상 나와야 하고, 기사별 계약 최소 회전 수는 무조건 채워야 돼"}], "ir": "MINIMIZE( SUM(x0 in routes: fuel_cost(x0)) )\n[SOFT] EACH(x1 in routes): sec_radius(x1) <= individual_radius_limit(x1)\nEACH(x2 in routes): EACH(x3 in rounds(x2)): MAX(x4 in keys(load): utilization[x4](x3)) >= 0.7\n[HARD] EACH(x5 in routes): round_count(x5) >= base_rounds(x5)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:minimum_round", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [{"slot_ref": "slot:individual_enclosing_circle_radius.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:individual_enclosing_circle_radius", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:min_capacity.target_ratio", "value": {"type": "decimal", "value": "0.7"}}], "constraint_ref": "constraint:min_capacity", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fuel_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:befe6a67f7e08dd5", "domain": "routing", "language": "mixed", "messages": [{"role": "user", "content": "전체 route의 총 이동거리와 전체 배송의 priority를 반영해 가중한 도착 시각의 합을 줄이는 배차 계획을 부탁드립니다. 가능하면 모든 route의 각 왕복 운행에서 중량·부피 등 각 적재 항목의 최대 적재량이 해당 차량의 항목별 용량을 넘지 않도록 해주시면 좋겠습니다. 모든 route의 배송 건수는 반드시 15건 이상이어야 합니다"}], "ir": "MINIMIZE( SUM(x0 in routes: travel_distance(x0)) )\nMINIMIZE( SUM(x1 in visits: priority_weighted_arrival(x1)) )\n[SOFT] EACH(x2 in routes): EACH(x3 in rounds(x2)): EACH(x4 in keys(load)): MAX(x5 in positions(x3): load[x4](x5)) <= capacity[x4](x2)\n[HARD] EACH(x6 in routes): delivery_count(x6) >= 15", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:capacity.exp_factor", "value": {"type": "decimal", "value": "1"}}], "constraint_ref": "constraint:capacity", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:delivery_time_priority.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:delivery_time_priority", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:minimum_order.target_order", "value": {"type": "decimal", "value": "15"}}], "constraint_ref": "constraint:minimum_order", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:distance_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:2fbfbe268e53ac91", "domain": "routing", "language": "en", "messages": [{"role": "user", "content": "Minimize both total travel distance across all routes and the sum of arrival times weighted by each delivery’s time priority across all deliveries. If possible, keep the peak load in each cargo dimension during every round trip on every route within that route’s vehicle capacity for that dimension; every route must have at least 15 deliveries."}], "ir": "MINIMIZE( SUM(x0 in routes: travel_distance(x0)) )\nMINIMIZE( SUM(x1 in visits: priority_weighted_arrival(x1)) )\n[SOFT] EACH(x2 in routes): EACH(x3 in rounds(x2)): EACH(x4 in keys(load)): MAX(x5 in positions(x3): load[x4](x5)) <= capacity[x4](x2)\n[HARD] EACH(x6 in routes): delivery_count(x6) >= 15", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:capacity.exp_factor", "value": {"type": "decimal", "value": "1"}}], "constraint_ref": "constraint:capacity", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:delivery_time_priority.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:delivery_time_priority", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:minimum_order.target_order", "value": {"type": "decimal", "value": "15"}}], "constraint_ref": "constraint:minimum_order", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:distance_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:9cdb453c999584d6", "domain": "routing", "language": "en", "messages": [{"role": "user", "content": "Please plan the routes to minimize both the total distance traveled across all routes and the sum of all delivery arrival times weighted by each delivery’s time priority. Ideally, on every round trip of every route, the highest load carried in each cargo dimension would stay within that route’s vehicle capacity for that dimension. Every route must have at least 15 deliveries."}], "ir": "MINIMIZE( SUM(x0 in routes: travel_distance(x0)) )\nMINIMIZE( SUM(x1 in visits: priority_weighted_arrival(x1)) )\n[SOFT] EACH(x2 in routes): EACH(x3 in rounds(x2)): EACH(x4 in keys(load)): MAX(x5 in positions(x3): load[x4](x5)) <= capacity[x4](x2)\n[HARD] EACH(x6 in routes): delivery_count(x6) >= 15", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:capacity.exp_factor", "value": {"type": "decimal", "value": "1"}}], "constraint_ref": "constraint:capacity", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:delivery_time_priority.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:delivery_time_priority", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:minimum_order.target_order", "value": {"type": "decimal", "value": "15"}}], "constraint_ref": "constraint:minimum_order", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:distance_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:56d774e995a63eaf", "domain": "routing", "language": "en", "messages": [{"role": "user", "content": "minimize total distance driven across all routes and total fuel cost across all routes, and any deliveries going to the exact same coordinates should be on the same route"}], "ir": "MINIMIZE( SUM(x0 in routes: travel_distance(x0)) )\nMINIMIZE( SUM(x1 in routes: fuel_cost(x1)) )\nEACH((x2, x3) in pairs(visits, same_coordinate)): TOGETHER(x2, x3, route)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:same_coordinate_grouping.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:same_coordinate_grouping", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:distance_cost", "weight": "1/2"}, {"objective_ref": "objective:fuel_cost", "weight": "1/2"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:462865d7628eed43", "domain": "routing", "language": "en", "messages": [{"role": "user", "content": "We're planning tomorrow's runs and I want to cut down both the total distance across all routes and the total fuel cost across all routes. Also, when two deliveries go to the same coordinates, like the same building, put them on the same route"}], "ir": "MINIMIZE( SUM(x0 in routes: travel_distance(x0)) )\nMINIMIZE( SUM(x1 in routes: fuel_cost(x1)) )\nEACH((x2, x3) in pairs(visits, same_coordinate)): TOGETHER(x2, x3, route)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:same_coordinate_grouping.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:same_coordinate_grouping", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:distance_cost", "weight": "1/2"}, {"objective_ref": "objective:fuel_cost", "weight": "1/2"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/base:retail:138ecac193e45bb5", "domain": "retail", "language": "ko", "messages": [{"role": "user", "content": "재고 폐기율을 줄여줘. 발주는 건마다 해당 품목의 발주 가능 요일에 넣어줘."}], "ir": "MINIMIZE( waste_rate )\nEACH(x0 in orders): day_of_week(x0) IN allowed_order_days(x0)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:order_days", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:minimize_waste", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/base", "episode_id": null} {"id": "v4/base:retail:ec6114d050a703cc", "domain": "retail", "language": "en", "messages": [{"role": "user", "content": "Minimize the share of stock discarded and schedule each replenishment order on one of the item's allowed order days"}], "ir": "MINIMIZE( waste_rate )\nEACH(x0 in orders): day_of_week(x0) IN allowed_order_days(x0)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:order_days", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:minimize_waste", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/base", "episode_id": null} {"id": "v4/base:retail:43748de8e26969d0", "domain": "retail", "language": "ko", "messages": [{"role": "user", "content": "재고 중 폐기되는 비율을 줄여 주세요. 모든 보충 발주는 해당 품목의 발주 가능 요일에 넣어 주세요."}], "ir": "MINIMIZE( waste_rate )\nEACH(x0 in orders): day_of_week(x0) IN allowed_order_days(x0)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:order_days", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:minimize_waste", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/base", "episode_id": null} {"id": "v4/combo:nurse:8b355d02523a3457", "domain": "nurse", "language": "en", "messages": [{"role": "user", "content": "make the roster so total preference satisfaction across all shift assignments is as high as possible, and if possible keep at least 8 hours of rest between consecutive shifts for every nurse"}], "ir": "MAXIMIZE( SUM(x0 in assignments: preference_score(x0)) )\n[SOFT] EACH(x1 in workers): EACH(x2 in adjacent(assignment_seq(x1))): gap_duration(x2) >= 8 h", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:min_hours", "value": {"type": "duration", "unit_ref": "unit:hour", "value": "8"}}], "constraint_ref": "constraint:min_rest_hours", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:preference_satisfaction", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:nurse:8a956e469b494478", "domain": "nurse", "language": "en", "messages": [{"role": "user", "content": "I'm putting together next month's duty roster for the ward. I want to maximize the total preference score over all the shift assignments. Ideally every nurse gets at least 8 hours of rest between one shift and her next one"}], "ir": "MAXIMIZE( SUM(x0 in assignments: preference_score(x0)) )\n[SOFT] EACH(x1 in workers): EACH(x2 in adjacent(assignment_seq(x1))): gap_duration(x2) >= 8 h", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:min_hours", "value": {"type": "duration", "unit_ref": "unit:hour", "value": "8"}}], "constraint_ref": "constraint:min_rest_hours", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:preference_satisfaction", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:nurse:93c19f512d15a279", "domain": "nurse", "language": "en", "messages": [{"role": "user", "content": "maximize overall nurse preference satisfaction on the roster, and where possible make sure each nurse has 8+ hours off between back-to-back shifts"}], "ir": "MAXIMIZE( SUM(x0 in assignments: preference_score(x0)) )\n[SOFT] EACH(x1 in workers): EACH(x2 in adjacent(assignment_seq(x1))): gap_duration(x2) >= 8 h", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:min_hours", "value": {"type": "duration", "unit_ref": "unit:hour", "value": "8"}}], "constraint_ref": "constraint:min_rest_hours", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:preference_satisfaction", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/perturb:routing:75e56d9b4f9e2cea", "domain": "routing", "language": "en", "messages": [{"role": "user", "content": "Minimize total fixed vehicle operating costs across all routes; each route’s smallest circle enclosing its stops has a radius of at least 10 km."}], "ir": "MINIMIZE( SUM(x0 in routes: fixed_cost(x0)) )\nEACH(x1 in routes): sec_radius(x1) >= 10 km", "decision_kind": "unsupported", "gold_decision": {"kind": "unsupported", "reason_code": "semantic_not_declared", "related_refs": []}, "stratum": "v4/perturb", "episode_id": null} {"id": "v4/perturb:routing:43f32281d02b6734", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "전체 경로의 차량 고정 운영비 합계를 최소화해줘. 각 경로의 정차 지점을 모두 감싸는 가장 작은 원의 반지름은 10 km 이상으로 해줘."}], "ir": "MINIMIZE( SUM(x0 in routes: fixed_cost(x0)) )\nEACH(x1 in routes): sec_radius(x1) >= 10 km", "decision_kind": "unsupported", "gold_decision": {"kind": "unsupported", "reason_code": "semantic_not_declared", "related_refs": []}, "stratum": "v4/perturb", "episode_id": null} {"id": "v4/perturb:routing:3329f56ada23c523", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "배차는 전체 경로의 차량 고정 운영비 합계가 최소가 되게 짜줘\n각 경로에서 정차 지점을 모두 감싸는 가장 작은 원의 반지름은 10 km 이상으로 해줘"}], "ir": "MINIMIZE( SUM(x0 in routes: fixed_cost(x0)) )\nEACH(x1 in routes): sec_radius(x1) >= 10 km", "decision_kind": "unsupported", "gold_decision": {"kind": "unsupported", "reason_code": "semantic_not_declared", "related_refs": []}, "stratum": "v4/perturb", "episode_id": null} {"id": "v4/combo:retail:44a45c1452d17c3f", "domain": "retail", "language": "ko", "messages": [{"role": "user", "content": "발주 계획은 계획 기간 내 하루 평균 재고 보유비용을 최소화해줘. 가능하면 모든 품목의 낱개 재고마다 만료일을 입고일에 해당 품목의 소비기한을 더한 날짜로 잡아줘. 매 발주 수량은 해당 품목 최소 발주량의 배수로 맞춰줘."}], "ir": "MINIMIZE( MEAN(x0 in days(horizon): holding_cost(x0)) )\n[SOFT] EACH(x1 in items): EACH(x2 in units(x1)): expiry_day(x2) = offset(arrival_day(x2), product_life(x1))\nEACH(x3 in orders): quantity(x3) MULTIPLE_OF min_order_quantity(x3)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:minimum_order_quantity", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [], "constraint_ref": "constraint:shelf_life", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:minimize_holding_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:retail:861c45680a043175", "domain": "retail", "language": "mixed", "messages": [{"role": "user", "content": "발주 planning은 계획 기간 내 일평균 재고 보유비용을 최소화해 주세요. 가능하면 모든 품목의 개별 재고마다 만료일을 입고일에 해당 품목의 shelf life를 더한 날짜로 설정해 주세요. 각 발주 건의 수량은 해당 품목 MOQ의 배수로 맞춰 주세요"}], "ir": "MINIMIZE( MEAN(x0 in days(horizon): holding_cost(x0)) )\n[SOFT] EACH(x1 in items): EACH(x2 in units(x1)): expiry_day(x2) = offset(arrival_day(x2), product_life(x1))\nEACH(x3 in orders): quantity(x3) MULTIPLE_OF min_order_quantity(x3)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:minimum_order_quantity", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [], "constraint_ref": "constraint:shelf_life", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:minimize_holding_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:retail:69ac479a46b753a5", "domain": "retail", "language": "mixed", "messages": [{"role": "user", "content": "발주 planning에서는 계획 기간 내 하루 평균 재고 보유비용을 최소화하도록 부탁드립니다. 가능하면 모든 품목의 개별 재고에 대해 만료일은 입고일에 해당 품목의 shelf life를 더한 날짜로 설정해 주시기 바랍니다. 각 발주 건의 수량은 해당 품목 MOQ의 배수로 설정해 주시기 바랍니다."}], "ir": "MINIMIZE( MEAN(x0 in days(horizon): holding_cost(x0)) )\n[SOFT] EACH(x1 in items): EACH(x2 in units(x1)): expiry_day(x2) = offset(arrival_day(x2), product_life(x1))\nEACH(x3 in orders): quantity(x3) MULTIPLE_OF min_order_quantity(x3)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:minimum_order_quantity", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [], "constraint_ref": "constraint:shelf_life", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:minimize_holding_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:18c528434f9c69ca", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "전체 경로의 연료비 합계를 최소화하도록 배차 부탁드립니다. 모든 경로의 차고지 왕복 횟수는 반드시 해당 담당 기사의 계약상 최소 왕복 횟수 이상이어야 합니다. 또한 모든 경로에서 각 배송의 서비스 시작 전 대기시간은 반드시 담당 기사별 대기시간 한도 이내여야 하며, 경로 종료는 해당 기사의 근무 종료 시각을, 각 왕복 운행의 종료는 해당 기사에게 정해진 왕복 운행 시간대의 종료 시각을 반드시 넘기지 않아야 합니다."}], "ir": "MINIMIZE( SUM(x0 in routes: fuel_cost(x0)) )\n[HARD] EACH(x1 in routes): round_count(x1) >= base_rounds(x1)\n[HARD] AND( EACH(x2 in routes): EACH(x3 in visits(x2)): wait_duration(x3) <= max_wait(x2), EACH(x4 in routes): end_time(x4) <= work_end(x4), EACH(x5 in routes): EACH(x6 in rounds(x5)): end_time(x6) <= round_window_end(x5) )", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:minimum_round", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [{"slot_ref": "slot:rider_time_window.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:rider_time_window", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fuel_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:9cfe94ac1aa23142", "domain": "routing", "language": "mixed", "messages": [{"role": "user", "content": "전체 route의 총 연료비를 최소화해 주시고, 모든 route의 차고지 왕복 횟수는 반드시 담당 기사에게 계약으로 보장된 최소 왕복 횟수 이상으로 배차 부탁드립니다. 모든 route에서 각 배송의 서비스 시작 전 대기시간은 반드시 담당 기사 본인의 대기시간 한도 이내로, route 종료 시각은 반드시 해당 기사의 work time 종료 시각 이내로, 각 왕복 운행의 종료 시각은 반드시 해당 기사에게 정해진 왕복 운행 time window의 종료 시각 이내로 맞춰 주시기 바랍니다."}], "ir": "MINIMIZE( SUM(x0 in routes: fuel_cost(x0)) )\n[HARD] EACH(x1 in routes): round_count(x1) >= base_rounds(x1)\n[HARD] AND( EACH(x2 in routes): EACH(x3 in visits(x2)): wait_duration(x3) <= max_wait(x2), EACH(x4 in routes): end_time(x4) <= work_end(x4), EACH(x5 in routes): EACH(x6 in rounds(x5)): end_time(x6) <= round_window_end(x5) )", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:minimum_round", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [{"slot_ref": "slot:rider_time_window.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:rider_time_window", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fuel_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:086cdb32db6a7018", "domain": "routing", "language": "en", "messages": [{"role": "user", "content": "Please minimize the total fuel cost across all routes, and make sure every route must include at least the number of depot round trips contracted for its assigned driver. On every route, the wait before service at every delivery must stay within that driver's own waiting-time limit, the route must finish by that driver's end of working hours, and every depot round trip must finish by the end of that driver's round-trip time window."}], "ir": "MINIMIZE( SUM(x0 in routes: fuel_cost(x0)) )\n[HARD] EACH(x1 in routes): round_count(x1) >= base_rounds(x1)\n[HARD] AND( EACH(x2 in routes): EACH(x3 in visits(x2)): wait_duration(x3) <= max_wait(x2), EACH(x4 in routes): end_time(x4) <= work_end(x4), EACH(x5 in routes): EACH(x6 in rounds(x5)): end_time(x6) <= round_window_end(x5) )", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:minimum_round", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [{"slot_ref": "slot:rider_time_window.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:rider_time_window", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fuel_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:e9dbd35e084554b4", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "전체 배송 경로의 이동거리 합계와 출발부터 종료까지 걸리는 시간의 합계를 둘 다 최소화해 주세요. 모든 경로에서 배송 지점들을 전부 포함하는 가장 작은 원의 반경은 반드시 해당 경로 라이더에게 정해진 반경 한도 이하여야 해요"}], "ir": "MINIMIZE( SUM(x0 in routes: travel_distance(x0)) )\nMINIMIZE( SUM(x1 in routes: duration(x1)) )\n[HARD] EACH(x2 in routes): sec_radius(x2) <= individual_radius_limit(x2)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:individual_enclosing_circle_radius.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:individual_enclosing_circle_radius", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:distance_cost", "weight": "1/2"}, {"objective_ref": "objective:duration_cost", "weight": "1/2"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:632a0945e48f3f71", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "전체 경로의 이동거리 합계랑 각 경로의 출발부터 종료까지 걸리는 시간 합계를 둘 다 최소화해줘. 모든 경로는 배송 지점들을 다 감싸는 가장 작은 원의 반경이 반드시 그 경로 담당 라이더의 반경 한도를 넘지 않게 해줘"}], "ir": "MINIMIZE( SUM(x0 in routes: travel_distance(x0)) )\nMINIMIZE( SUM(x1 in routes: duration(x1)) )\n[HARD] EACH(x2 in routes): sec_radius(x2) <= individual_radius_limit(x2)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:individual_enclosing_circle_radius.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:individual_enclosing_circle_radius", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:distance_cost", "weight": "1/2"}, {"objective_ref": "objective:duration_cost", "weight": "1/2"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:f6920b4449b96881", "domain": "routing", "language": "en", "messages": [{"role": "user", "content": "Minimize both the total travel distance across all routes and the sum of each route's elapsed time from start to finish. For every route, the radius of the smallest circle enclosing all its stops must not exceed that route's rider's own radius limit."}], "ir": "MINIMIZE( SUM(x0 in routes: travel_distance(x0)) )\nMINIMIZE( SUM(x1 in routes: duration(x1)) )\n[HARD] EACH(x2 in routes): sec_radius(x2) <= individual_radius_limit(x2)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:individual_enclosing_circle_radius.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:individual_enclosing_circle_radius", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:distance_cost", "weight": "1/2"}, {"objective_ref": "objective:duration_cost", "weight": "1/2"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:0999d35d1adbc109", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "전체 운행시간 최소로, 배달 금지 시간대엔 절대 방문하지 마"}], "ir": "MINIMIZE( SUM(x0 in routes: duration(x0)) )\n[HARD] EACH(x1 in visits): NOT OVERLAPS(service_interval(x1), prohibited_window(x1))", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:prohibited_time_window", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:duration_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:74f047e9723a83f8", "domain": "routing", "language": "en", "messages": [{"role": "user", "content": "I'm putting together tomorrow's routes. Keep the total time from start to finish across all routes as short as possible. Also, no delivery can ever happen during its prohibited time window, that's a must."}], "ir": "MINIMIZE( SUM(x0 in routes: duration(x0)) )\n[HARD] EACH(x1 in visits): NOT OVERLAPS(service_interval(x1), prohibited_window(x1))", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:prohibited_time_window", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:duration_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:43a8d9ed05046f67", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "내일 배차 계획을 짜고 있습니다. 모든 경로를 합친 총 운행시간이 최소가 되도록 부탁드립니다. 그리고 각 배달은 방문 금지 시간대와 겹치지 않도록 반드시 지켜주세요."}], "ir": "MINIMIZE( SUM(x0 in routes: duration(x0)) )\n[HARD] EACH(x1 in visits): NOT OVERLAPS(service_interval(x1), prohibited_window(x1))", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:prohibited_time_window", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:duration_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:87e4ced22cc33bd3", "domain": "routing", "language": "en", "messages": [{"role": "user", "content": "Minimize the total travel distance across all routes. Every route must have at most 8 deliveries, and deliveries at the same coordinates must be assigned to the same route."}], "ir": "MINIMIZE( SUM(x0 in routes: travel_distance(x0)) )\n[HARD] EACH(x1 in routes): delivery_count(x1) <= 8\n[HARD] EACH((x2, x3) in pairs(visits, same_coordinate)): TOGETHER(x2, x3, route)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:delivery_length.exp_factor", "value": {"type": "decimal", "value": "2"}}, {"slot_ref": "slot:delivery_length.max_size", "value": {"type": "decimal", "value": "8"}}], "constraint_ref": "constraint:delivery_length", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [{"slot_ref": "slot:same_coordinate_grouping.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:same_coordinate_grouping", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:distance_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:2e3301c7d074e0ba", "domain": "routing", "language": "mixed", "messages": [{"role": "user", "content": "전체 route의 총 이동거리를 최소화해줘. route마다 배송은 반드시 8건 이하로 잡아줘. 같은 좌표의 배송 건들은 반드시 같은 route로 묶어줘."}], "ir": "MINIMIZE( SUM(x0 in routes: travel_distance(x0)) )\n[HARD] EACH(x1 in routes): delivery_count(x1) <= 8\n[HARD] EACH((x2, x3) in pairs(visits, same_coordinate)): TOGETHER(x2, x3, route)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:delivery_length.exp_factor", "value": {"type": "decimal", "value": "2"}}, {"slot_ref": "slot:delivery_length.max_size", "value": {"type": "decimal", "value": "8"}}], "constraint_ref": "constraint:delivery_length", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [{"slot_ref": "slot:same_coordinate_grouping.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:same_coordinate_grouping", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:distance_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:30717e2596121f97", "domain": "routing", "language": "en", "messages": [{"role": "user", "content": "Plan the routes to minimize the total travel distance across all routes. Each route must have no more than 8 deliveries. Any deliveries at the same coordinates must go on the same route"}], "ir": "MINIMIZE( SUM(x0 in routes: travel_distance(x0)) )\n[HARD] EACH(x1 in routes): delivery_count(x1) <= 8\n[HARD] EACH((x2, x3) in pairs(visits, same_coordinate)): TOGETHER(x2, x3, route)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:delivery_length.exp_factor", "value": {"type": "decimal", "value": "2"}}, {"slot_ref": "slot:delivery_length.max_size", "value": {"type": "decimal", "value": "8"}}], "constraint_ref": "constraint:delivery_length", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [{"slot_ref": "slot:same_coordinate_grouping.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:same_coordinate_grouping", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:distance_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:007852ed8e3bce2d", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "모든 경로의 출발부터 종료까지 걸리는 시간의 합을 최소화하고, 각 경로의 방문 순서는 시간 우선순위가 높은 순으로 배정 부탁드립니다. 가능하면 모든 경로에서 총 이동거리, 왕복 운행별 이동거리, 연속한 두 배송지 사이의 이동거리가 각각 해당 기사에게 정해진 총 거리 한도, 왕복당 거리 한도, 배송지 간 거리 한도를 넘지 않도록 부탁드립니다."}], "ir": "MINIMIZE( SUM(x0 in routes: duration(x0)) )\nEACH(x1 in routes): ORDERED_BY(visit_seq(x1), time_priority, DESC)\n[SOFT] AND( EACH(x2 in routes): travel_distance(x2) <= total_limit(x2), EACH(x3 in routes): EACH(x4 in rounds(x3)): travel_distance(x4) <= trip_limit(x3), EACH(x5 in routes): EACH(x6 in adjacent(visit_seq(x5))): travel_distance(x6) <= between_limit(x5) )", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:rider_distance.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:rider_distance", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:time_priority_order.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:time_priority_order", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:duration_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:caa984f63c18ed82", "domain": "routing", "language": "mixed", "messages": [{"role": "user", "content": "전체 route의 출발부터 종료까지 걸리는 시간을 합쳐 최소화하고, 각 route의 방문 순서는 시간 priority가 높은 순으로 잡아 주세요. 가능하면 모든 route의 총 이동거리와 각 왕복 운행의 이동거리, 연속한 두 stop 사이 이동거리는 각각 담당 기사 본인의 총 거리 한도, 왕복당 거리 한도, 연속 배송지 간 거리 한도 이내로 맞춰 주세요"}], "ir": "MINIMIZE( SUM(x0 in routes: duration(x0)) )\nEACH(x1 in routes): ORDERED_BY(visit_seq(x1), time_priority, DESC)\n[SOFT] AND( EACH(x2 in routes): travel_distance(x2) <= total_limit(x2), EACH(x3 in routes): EACH(x4 in rounds(x3)): travel_distance(x4) <= trip_limit(x3), EACH(x5 in routes): EACH(x6 in adjacent(visit_seq(x5))): travel_distance(x6) <= between_limit(x5) )", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:rider_distance.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:rider_distance", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:time_priority_order.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:time_priority_order", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:duration_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:911e0283d14edb4d", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "배차는 모든 경로의 출발부터 끝까지 걸리는 시간을 합쳐서 최소화해줘. 각 경로는 시간 우선순위가 높은 곳부터 방문하게 해줘. 가능하면 모든 경로에서 총 이동거리는 담당 기사 본인의 총 거리 한도 안으로, 왕복 운행마다 이동거리는 그 기사의 왕복당 거리 한도 안으로, 연속한 두 배송지 사이 이동거리는 그 기사의 배송지 간 거리 한도 안으로 맞춰줘"}], "ir": "MINIMIZE( SUM(x0 in routes: duration(x0)) )\nEACH(x1 in routes): ORDERED_BY(visit_seq(x1), time_priority, DESC)\n[SOFT] AND( EACH(x2 in routes): travel_distance(x2) <= total_limit(x2), EACH(x3 in routes): EACH(x4 in rounds(x3)): travel_distance(x4) <= trip_limit(x3), EACH(x5 in routes): EACH(x6 in adjacent(visit_seq(x5))): travel_distance(x6) <= between_limit(x5) )", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:rider_distance.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:rider_distance", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:time_priority_order.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:time_priority_order", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:duration_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/multi:routing:72c3a4f1b00f8b5e", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "전체 배송 경로의 연료비 합계를 최소화해줘. 각 경로는 배송지들을 모두 감싸는 가장 작은 원의 반경이 담당 기사별 반경 한도 이내가 되게 하고, 경로마다 매 왕복의 화물 항목별 적재율 중 가장 높은 값이 0.7 이상이 되게 하고, 차고지 왕복 횟수는 담당 기사의 계약상 왕복 횟수 이상으로 잡아줘."}], "ir": "MINIMIZE( SUM(x0 in routes: fuel_cost(x0)) )\nEACH(x1 in routes): sec_radius(x1) <= individual_radius_limit(x1)\nEACH(x2 in routes): EACH(x3 in rounds(x2)): MAX(x4 in keys(load): utilization[x4](x3)) >= 0.7\nEACH(x5 in routes): round_count(x5) >= base_rounds(x5)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:minimum_round", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [{"slot_ref": "slot:individual_enclosing_circle_radius.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:individual_enclosing_circle_radius", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:min_capacity.target_ratio", "value": {"type": "decimal", "value": "0.7"}}], "constraint_ref": "constraint:min_capacity", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fuel_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/multi", "episode_id": null} {"id": "v4/multi:routing:a9bd71b36e77e542", "domain": "routing", "language": "mixed", "messages": [{"role": "user", "content": "전체 route의 fuel 비용 합계를 최소화해 주세요. 각 route의 배송지를 모두 포함하는 가장 작은 원의 반경은 담당 기사별 서비스 반경 한도 이내로, 매 왕복의 화물 항목별 적재율 중 최댓값은 0.7 이상으로, 각 route의 차고지 왕복 횟수는 담당 기사의 계약상 왕복 횟수 이상으로 잡아 주세요."}], "ir": "MINIMIZE( SUM(x0 in routes: fuel_cost(x0)) )\nEACH(x1 in routes): sec_radius(x1) <= individual_radius_limit(x1)\nEACH(x2 in routes): EACH(x3 in rounds(x2)): MAX(x4 in keys(load): utilization[x4](x3)) >= 0.7\nEACH(x5 in routes): round_count(x5) >= base_rounds(x5)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:minimum_round", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [{"slot_ref": "slot:individual_enclosing_circle_radius.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:individual_enclosing_circle_radius", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:min_capacity.target_ratio", "value": {"type": "decimal", "value": "0.7"}}], "constraint_ref": "constraint:min_capacity", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fuel_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/multi", "episode_id": null} {"id": "v4/combo:routing:27fa82d92b168afc", "domain": "routing", "language": "en", "messages": [{"role": "user", "content": "Plan the deliveries to minimize both total fuel cost and total travel distance across all routes. If possible, keep every route within 8 km and have every delivery depart no later than the end of its allowed delivery window."}], "ir": "MINIMIZE( SUM(x0 in routes: fuel_cost(x0)) )\nMINIMIZE( SUM(x1 in routes: travel_distance(x1)) )\n[SOFT] EACH(x2 in routes): travel_distance(x2) <= 8 km\n[SOFT] EACH(x3 in visits): departure_time(x3) <= tw_late(x3)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:max_distance.exp_factor", "value": {"type": "decimal", "value": "1"}}, {"slot_ref": "slot:max_distance.max_distance", "value": {"type": "decimal", "value": "8000"}}], "constraint_ref": "constraint:max_distance", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:time_window.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:time_window", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:distance_cost", "weight": "1/2"}, {"objective_ref": "objective:fuel_cost", "weight": "1/2"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:retail:2c6b5420693b5e58", "domain": "retail", "language": "en", "messages": [{"role": "user", "content": "Plan the supplier orders to minimize the average holding cost over the planning days, with every order quantity a multiple of the item's minimum order quantity. If possible, set the expiry day of every stock unit of every item to its arrival day plus that item's shelf life."}], "ir": "MINIMIZE( MEAN(x0 in days(horizon): holding_cost(x0)) )\nEACH(x1 in orders): quantity(x1) MULTIPLE_OF min_order_quantity(x1)\n[SOFT] EACH(x2 in items): EACH(x3 in units(x2)): expiry_day(x3) = offset(arrival_day(x3), product_life(x2))", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:minimum_order_quantity", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [], "constraint_ref": "constraint:shelf_life", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:minimize_holding_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:retail:f9bab561786c4852", "domain": "retail", "language": "en", "messages": [{"role": "user", "content": "Minimize average inventory holding costs across the days in the plan. For each replenishment order, use a quantity that's a multiple of the item's minimum order quantity. Ideally, each stock unit of every item expires on its arrival day plus the item's shelf life."}], "ir": "MINIMIZE( MEAN(x0 in days(horizon): holding_cost(x0)) )\nEACH(x1 in orders): quantity(x1) MULTIPLE_OF min_order_quantity(x1)\n[SOFT] EACH(x2 in items): EACH(x3 in units(x2)): expiry_day(x3) = offset(arrival_day(x3), product_life(x2))", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:minimum_order_quantity", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [], "constraint_ref": "constraint:shelf_life", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:minimize_holding_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:retail:cf516646f50ff350", "domain": "retail", "language": "ko", "messages": [{"role": "user", "content": "계획 기간 동안 하루 평균 재고 보유비용을 최소화하고, 모든 보충 발주는 해당 품목 최소 발주량의 배수로 잡아줘. 가능하면 모든 품목의 재고 낱개마다 만료일을 입고일에 해당 품목의 유통기한을 더한 날로 맞춰줘"}], "ir": "MINIMIZE( MEAN(x0 in days(horizon): holding_cost(x0)) )\nEACH(x1 in orders): quantity(x1) MULTIPLE_OF min_order_quantity(x1)\n[SOFT] EACH(x2 in items): EACH(x3 in units(x2)): expiry_day(x3) = offset(arrival_day(x3), product_life(x2))", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:minimum_order_quantity", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [], "constraint_ref": "constraint:shelf_life", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:minimize_holding_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/multi:retail:a6897e1baaac375a", "domain": "retail", "language": "ko", "messages": [{"role": "user", "content": "재고 중 폐기되는 비율을 최소화하는 발주 계획을 부탁드립니다. 모든 발주의 입고일은 발주일에 해당 품목 공급자의 배송 소요일을 더한 날로, 발주 수량은 해당 품목 최소 발주량의 배수로 잡고, 모든 품목의 개별 재고마다 유통기한 만료일은 그 재고의 입고일에 해당 품목의 유통기한을 더한 날로 계산해 주시기 바랍니다."}], "ir": "MINIMIZE( waste_rate )\nEACH(x0 in orders): arrival_day(x0) = offset(order_day(x0), lead_time(x0))\nEACH(x1 in orders): quantity(x1) MULTIPLE_OF min_order_quantity(x1)\nEACH(x2 in items): EACH(x3 in units(x2)): expiry_day(x3) = offset(arrival_day(x3), product_life(x2))", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:lead_time", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [], "constraint_ref": "constraint:minimum_order_quantity", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [], "constraint_ref": "constraint:shelf_life", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:minimize_waste", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/multi", "episode_id": null} {"id": "v4/multi:retail:bea9389cb975c0d8", "domain": "retail", "language": "ko", "messages": [{"role": "user", "content": "재고에서 폐기되는 비율을 최소화하도록 발주 계획을 짜 주세요. 각 발주의 입고일은 발주일에 해당 품목 공급자의 배송 기간을 더한 날로 잡고, 발주 수량은 해당 품목 최소 주문 수량의 배수로 해 주세요. 모든 품목의 재고는 낱개마다 입고일에 그 품목의 유통기한을 더한 날을 만료일로 계산해 주세요"}], "ir": "MINIMIZE( waste_rate )\nEACH(x0 in orders): arrival_day(x0) = offset(order_day(x0), lead_time(x0))\nEACH(x1 in orders): quantity(x1) MULTIPLE_OF min_order_quantity(x1)\nEACH(x2 in items): EACH(x3 in units(x2)): expiry_day(x3) = offset(arrival_day(x3), product_life(x2))", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:lead_time", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [], "constraint_ref": "constraint:minimum_order_quantity", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [], "constraint_ref": "constraint:shelf_life", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:minimize_waste", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/multi", "episode_id": null} {"id": "v4/multi:retail:e02a150305c7e6e1", "domain": "retail", "language": "en", "messages": [{"role": "user", "content": "Please plan replenishment orders to minimize the share of stock that gets discarded. For every order, set the arrival date to the order date plus the supplier lead time for that item, and make the quantity a multiple of that item's minimum order quantity. For every individual unit of every item, calculate its expiry date as its arrival date plus that item's shelf life."}], "ir": "MINIMIZE( waste_rate )\nEACH(x0 in orders): arrival_day(x0) = offset(order_day(x0), lead_time(x0))\nEACH(x1 in orders): quantity(x1) MULTIPLE_OF min_order_quantity(x1)\nEACH(x2 in items): EACH(x3 in units(x2)): expiry_day(x3) = offset(arrival_day(x3), product_life(x2))", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:lead_time", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [], "constraint_ref": "constraint:minimum_order_quantity", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [], "constraint_ref": "constraint:shelf_life", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:minimize_waste", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/multi", "episode_id": null} {"id": "v4/combo:routing:4c980ecdfc431b7a", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "모든 경로의 출발부터 종료까지 걸리는 시간 합을 최소화하고, 각 경로의 정차지를 감싸는 최소 원 반경은 반드시 5km 이하로 해줘"}], "ir": "MINIMIZE( SUM(x0 in routes: duration(x0)) )\n[HARD] EACH(x1 in routes): sec_radius(x1) <= 5 km", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:enclosing_circle_radius.exp_factor", "value": {"type": "decimal", "value": "2"}}, {"slot_ref": "slot:enclosing_circle_radius.max_radius", "value": {"type": "decimal", "value": "5000"}}], "constraint_ref": "constraint:enclosing_circle_radius", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:duration_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:f12b795341e70669", "domain": "routing", "language": "mixed", "messages": [{"role": "user", "content": "전체 route의 start부터 finish까지 소요시간 합을 최소화해 주시기 바랍니다. 모든 route에서 정차지를 감싸는 최소 원의 반경은 반드시 5km 이하여야 합니다"}], "ir": "MINIMIZE( SUM(x0 in routes: duration(x0)) )\n[HARD] EACH(x1 in routes): sec_radius(x1) <= 5 km", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:enclosing_circle_radius.exp_factor", "value": {"type": "decimal", "value": "2"}}, {"slot_ref": "slot:enclosing_circle_radius.max_radius", "value": {"type": "decimal", "value": "5000"}}], "constraint_ref": "constraint:enclosing_circle_radius", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:duration_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:ee37d5764539fd51", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "모든 경로에서 출발부터 끝날 때까지 걸린 시간을 합쳐서 최소화해줘. 각 경로의 정차지를 전부 감싸는 가장 작은 원의 반경은 반드시 5km 이하로 해줘"}], "ir": "MINIMIZE( SUM(x0 in routes: duration(x0)) )\n[HARD] EACH(x1 in routes): sec_radius(x1) <= 5 km", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:enclosing_circle_radius.exp_factor", "value": {"type": "decimal", "value": "2"}}, {"slot_ref": "slot:enclosing_circle_radius.max_radius", "value": {"type": "decimal", "value": "5000"}}], "constraint_ref": "constraint:enclosing_circle_radius", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:duration_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:8272ab52508668c8", "domain": "routing", "language": "mixed", "messages": [{"role": "user", "content": "모든 route의 총 이동거리를 최소화해 주세요. 그리고 각 route는 배송 순서가 시간 우선순위 높은 것부터 내림차순으로 가게 하고, route당 배송 건수는 최대 15건까지로 해 주세요"}], "ir": "MINIMIZE( SUM(x0 in routes: travel_distance(x0)) )\nEACH(x1 in routes): ORDERED_BY(visit_seq(x1), time_priority, DESC)\nEACH(x2 in routes): delivery_count(x2) <= 15", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:delivery_length.exp_factor", "value": {"type": "decimal", "value": "2"}}, {"slot_ref": "slot:delivery_length.max_size", "value": {"type": "decimal", "value": "15"}}], "constraint_ref": "constraint:delivery_length", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:time_priority_order.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:time_priority_order", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:distance_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:1f684f924e0d34ee", "domain": "routing", "language": "en", "messages": [{"role": "user", "content": "Minimize the total distance traveled across all routes. On every route, deliveries should follow time priority in descending order, and no route can have more than 15 deliveries"}], "ir": "MINIMIZE( SUM(x0 in routes: travel_distance(x0)) )\nEACH(x1 in routes): ORDERED_BY(visit_seq(x1), time_priority, DESC)\nEACH(x2 in routes): delivery_count(x2) <= 15", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:delivery_length.exp_factor", "value": {"type": "decimal", "value": "2"}}, {"slot_ref": "slot:delivery_length.max_size", "value": {"type": "decimal", "value": "15"}}], "constraint_ref": "constraint:delivery_length", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:time_priority_order.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:time_priority_order", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:distance_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:54ba442f153194a8", "domain": "routing", "language": "en", "messages": [{"role": "user", "content": "Can you plan this so the total travel distance over all routes is as small as possible, each route's stop order goes by time priority from highest to lowest, and each route has at most 15 deliveries"}], "ir": "MINIMIZE( SUM(x0 in routes: travel_distance(x0)) )\nEACH(x1 in routes): ORDERED_BY(visit_seq(x1), time_priority, DESC)\nEACH(x2 in routes): delivery_count(x2) <= 15", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:delivery_length.exp_factor", "value": {"type": "decimal", "value": "2"}}, {"slot_ref": "slot:delivery_length.max_size", "value": {"type": "decimal", "value": "15"}}], "constraint_ref": "constraint:delivery_length", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:time_priority_order.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:time_priority_order", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:distance_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/base:routing:76a76d0016854289", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "모든 경로의 전체 소요시간 합이 제일 짧게 나오도록 짜줘. 그리고 경로마다 기사별 총 이동거리 한도, 한 바퀴(왕복)당 거리 한도, 정차지 사이 구간 거리 한도를 각각 넘지 않게 해줘."}], "ir": "MINIMIZE( SUM(x0 in routes: duration(x0)) )\nAND( EACH(x1 in routes): travel_distance(x1) <= total_limit(x1), EACH(x2 in routes): EACH(x3 in rounds(x2)): travel_distance(x3) <= trip_limit(x2), EACH(x4 in routes): EACH(x5 in adjacent(visit_seq(x4))): travel_distance(x5) <= between_limit(x4) )", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:rider_distance.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:rider_distance", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:duration_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/base", "episode_id": null} {"id": "v4/base:routing:a2c860a1f9ff22e8", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "오늘 배차 계획을 짜는 중인데, 모든 경로의 시작부터 끝까지 걸리는 시간을 전부 합해서 최소가 되도록 부탁드립니다. 각 경로는 해당 기사의 총 이동거리 한도를 넘지 않아야 하고, 한 바퀴당 이동거리는 그 기사의 회차별 거리 한도 이내여야 합니다. 또 연속된 두 정차지 사이의 거리도 그 기사의 구간 거리 한도를 넘지 않게 부탁드립니다."}], "ir": "MINIMIZE( SUM(x0 in routes: duration(x0)) )\nAND( EACH(x1 in routes): travel_distance(x1) <= total_limit(x1), EACH(x2 in routes): EACH(x3 in rounds(x2)): travel_distance(x3) <= trip_limit(x2), EACH(x4 in routes): EACH(x5 in adjacent(visit_seq(x4))): travel_distance(x5) <= between_limit(x4) )", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:rider_distance.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:rider_distance", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:duration_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/base", "episode_id": null} {"id": "v4/base:routing:cab0286ca02f569e", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "전체 경로의 총 운행시간이 최소가 되도록 배차 부탁드립니다. 경로별로 이동거리는 담당 기사의 총 거리 한도 이하, 회차별 이동거리는 그 기사의 회차당 거리 한도 이하, 연속하는 정차지 간 거리는 그 기사의 정차지 간 한도 이하로 맞춰 주시기 바랍니다."}], "ir": "MINIMIZE( SUM(x0 in routes: duration(x0)) )\nAND( EACH(x1 in routes): travel_distance(x1) <= total_limit(x1), EACH(x2 in routes): EACH(x3 in rounds(x2)): travel_distance(x3) <= trip_limit(x2), EACH(x4 in routes): EACH(x5 in adjacent(visit_seq(x4))): travel_distance(x5) <= between_limit(x4) )", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:rider_distance.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:rider_distance", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:duration_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/base", "episode_id": null} {"id": "v4/multi:routing:37f45a4674adc1a8", "domain": "routing", "language": "mixed", "messages": [{"role": "user", "content": "전체 route의 연료비 합계를 최소화해 주세요. 각 route의 매 왕복 운행에서 적재 항목별 최대 적재량이 해당 차량의 항목별 capacity를 넘지 않게 하고, route당 배송은 8건 이하로 잡고 각 배송의 작업 시간 전체가 방문 금지 시간대와 겹치지 않게 해 주세요"}], "ir": "MINIMIZE( SUM(x0 in routes: fuel_cost(x0)) )\nEACH(x1 in routes): EACH(x2 in rounds(x1)): EACH(x3 in keys(load)): MAX(x4 in positions(x2): load[x3](x4)) <= capacity[x3](x1)\nEACH(x5 in routes): delivery_count(x5) <= 8\nEACH(x6 in visits): NOT OVERLAPS(service_interval(x6), prohibited_window(x6))", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:prohibited_time_window", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:capacity.exp_factor", "value": {"type": "decimal", "value": "1"}}], "constraint_ref": "constraint:capacity", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [{"slot_ref": "slot:delivery_length.exp_factor", "value": {"type": "decimal", "value": "2"}}, {"slot_ref": "slot:delivery_length.max_size", "value": {"type": "decimal", "value": "8"}}], "constraint_ref": "constraint:delivery_length", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fuel_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/multi", "episode_id": null} {"id": "v4/multi:routing:b9779931f66e089c", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "전체 경로의 총연료비를 최소화하는 배차를 부탁드립니다. 각 경로의 매 왕복 운행 중 적재 항목별 최대 적재량은 해당 경로 차량의 항목별 용량 이하로, 경로별 배송 건수는 8건 이하로 설정하고 모든 배송의 작업 시간은 해당 배송의 방문 금지 시간대와 겹치지 않도록 부탁드립니다."}], "ir": "MINIMIZE( SUM(x0 in routes: fuel_cost(x0)) )\nEACH(x1 in routes): EACH(x2 in rounds(x1)): EACH(x3 in keys(load)): MAX(x4 in positions(x2): load[x3](x4)) <= capacity[x3](x1)\nEACH(x5 in routes): delivery_count(x5) <= 8\nEACH(x6 in visits): NOT OVERLAPS(service_interval(x6), prohibited_window(x6))", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:prohibited_time_window", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:capacity.exp_factor", "value": {"type": "decimal", "value": "1"}}], "constraint_ref": "constraint:capacity", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [{"slot_ref": "slot:delivery_length.exp_factor", "value": {"type": "decimal", "value": "2"}}, {"slot_ref": "slot:delivery_length.max_size", "value": {"type": "decimal", "value": "8"}}], "constraint_ref": "constraint:delivery_length", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fuel_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/multi", "episode_id": null} {"id": "v4/multi:routing:0d692c6b9c3d60b5", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "모든 경로를 합친 연료비가 최소가 되도록 계획 부탁드립니다. 각 경로에서 왕복 운행을 할 때마다 운행 중 적재 항목별로 가장 많이 실린 양이 그 차량의 해당 항목 적재 한도를 넘지 않게 하고, 각 경로의 배송은 8건 이하로 배정하며 모든 배송의 작업 시작부터 종료까지가 해당 배송의 방문 금지 시간대와 겹치지 않도록 부탁드립니다."}], "ir": "MINIMIZE( SUM(x0 in routes: fuel_cost(x0)) )\nEACH(x1 in routes): EACH(x2 in rounds(x1)): EACH(x3 in keys(load)): MAX(x4 in positions(x2): load[x3](x4)) <= capacity[x3](x1)\nEACH(x5 in routes): delivery_count(x5) <= 8\nEACH(x6 in visits): NOT OVERLAPS(service_interval(x6), prohibited_window(x6))", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:prohibited_time_window", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:capacity.exp_factor", "value": {"type": "decimal", "value": "1"}}], "constraint_ref": "constraint:capacity", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [{"slot_ref": "slot:delivery_length.exp_factor", "value": {"type": "decimal", "value": "2"}}, {"slot_ref": "slot:delivery_length.max_size", "value": {"type": "decimal", "value": "8"}}], "constraint_ref": "constraint:delivery_length", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fuel_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/multi", "episode_id": null} {"id": "v4/combo:routing:24890e07552a2b64", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "전체 경로 기준으로 차량 고정 비용 합계를 최소화해 주세요. 그리고 같은 좌표에 있는 배송지는 되도록 같은 경로로 묶고, 한 경로당 배송 건수는 가능하면 3건 이하로 해 주세요."}], "ir": "MINIMIZE( SUM(x0 in routes: fixed_cost(x0)) )\n[SOFT] EACH((x1, x2) in pairs(visits, same_coordinate)): TOGETHER(x1, x2, route)\n[SOFT] EACH(x3 in routes): delivery_count(x3) <= 3", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:delivery_length.exp_factor", "value": {"type": "decimal", "value": "2"}}, {"slot_ref": "slot:delivery_length.max_size", "value": {"type": "decimal", "value": "3"}}], "constraint_ref": "constraint:delivery_length", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:same_coordinate_grouping.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:same_coordinate_grouping", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fixed_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:6b6d2339b52a21b4", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "오늘 배차 짜는데 차량 운영비, 그러니까 차량 고정비용 총합이 최소가 되게 해 주세요. 같은 아파트처럼 동일 좌표인 배송지끼리는 가능하면 한 경로에 같이 배정해 주시고, 경로마다 배송 건수는 되도록 3건 넘지 않게 부탁드려요"}], "ir": "MINIMIZE( SUM(x0 in routes: fixed_cost(x0)) )\n[SOFT] EACH((x1, x2) in pairs(visits, same_coordinate)): TOGETHER(x1, x2, route)\n[SOFT] EACH(x3 in routes): delivery_count(x3) <= 3", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:delivery_length.exp_factor", "value": {"type": "decimal", "value": "2"}}, {"slot_ref": "slot:delivery_length.max_size", "value": {"type": "decimal", "value": "3"}}], "constraint_ref": "constraint:delivery_length", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:same_coordinate_grouping.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:same_coordinate_grouping", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fixed_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:4ba11d7a7a882adb", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "차량 고정비용 전체 합을 줄이는 게 목표예요. 동일 주소 배송지들은 이상적으로는 같은 경로에 묶어 주시고, 모든 경로에서 배송지 수가 가능하면 3개 이하였으면 좋겠어요"}], "ir": "MINIMIZE( SUM(x0 in routes: fixed_cost(x0)) )\n[SOFT] EACH((x1, x2) in pairs(visits, same_coordinate)): TOGETHER(x1, x2, route)\n[SOFT] EACH(x3 in routes): delivery_count(x3) <= 3", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:delivery_length.exp_factor", "value": {"type": "decimal", "value": "2"}}, {"slot_ref": "slot:delivery_length.max_size", "value": {"type": "decimal", "value": "3"}}], "constraint_ref": "constraint:delivery_length", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:same_coordinate_grouping.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:same_coordinate_grouping", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fixed_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/multi:retail:1129024c3904abe3", "domain": "retail", "language": "ko", "messages": [{"role": "user", "content": "상품이 재고 있는 날의 비율을 최대화하도록 발주를 계획해 주세요. 모든 발주의 수량은 해당 상품의 최소 발주량의 배수로 잡고, 입고일은 발주일에 해당 상품 공급자의 리드타임을 더한 날로, 모든 상품의 낱개별 소비기한 만료일은 그 낱개의 입고일에 해당 상품의 보관 가능 기간을 더한 날로 계산해 주세요."}], "ir": "MAXIMIZE( in_stock_rate )\nEACH(x0 in orders): quantity(x0) MULTIPLE_OF min_order_quantity(x0)\nEACH(x1 in orders): arrival_day(x1) = offset(order_day(x1), lead_time(x1))\nEACH(x2 in items): EACH(x3 in units(x2)): expiry_day(x3) = offset(arrival_day(x3), product_life(x2))", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:lead_time", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [], "constraint_ref": "constraint:minimum_order_quantity", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [], "constraint_ref": "constraint:shelf_life", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:minimize_stockout", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/multi", "episode_id": null} {"id": "v4/multi:retail:923fe2b7e48aaf21", "domain": "retail", "language": "ko", "messages": [{"role": "user", "content": "상품이 품절 없이 재고가 있는 날의 비율을 최대화하는 발주 계획을 짜 주세요. 발주할 때마다 수량은 해당 상품 최소 주문 수량의 배수로 잡고, 입고일은 발주일에 그 상품 공급자의 배송 소요일을 더한 날짜로 계산해 주세요. 모든 상품은 낱개마다 입고된 날에 해당 상품의 유통기한 기간을 더한 날짜를 유통기한 만료일로 잡아 주세요."}], "ir": "MAXIMIZE( in_stock_rate )\nEACH(x0 in orders): quantity(x0) MULTIPLE_OF min_order_quantity(x0)\nEACH(x1 in orders): arrival_day(x1) = offset(order_day(x1), lead_time(x1))\nEACH(x2 in items): EACH(x3 in units(x2)): expiry_day(x3) = offset(arrival_day(x3), product_life(x2))", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:lead_time", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [], "constraint_ref": "constraint:minimum_order_quantity", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [], "constraint_ref": "constraint:shelf_life", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:minimize_stockout", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/multi", "episode_id": null} {"id": "v4/multi:retail:4ba0adbdef87d479", "domain": "retail", "language": "ko", "messages": [{"role": "user", "content": "상품 재고가 있는 날의 비율을 최대화하도록 발주 계획 짜줘. 발주마다 수량은 해당 상품 최소 발주량의 배수로 하고, 입고일은 발주일에 해당 상품 공급자의 리드타임을 더한 날로, 모든 상품의 낱개별 소비기한 만료일은 각 낱개의 입고일에 해당 상품의 보관 가능 기간을 더한 날로 잡아줘"}], "ir": "MAXIMIZE( in_stock_rate )\nEACH(x0 in orders): quantity(x0) MULTIPLE_OF min_order_quantity(x0)\nEACH(x1 in orders): arrival_day(x1) = offset(order_day(x1), lead_time(x1))\nEACH(x2 in items): EACH(x3 in units(x2)): expiry_day(x3) = offset(arrival_day(x3), product_life(x2))", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:lead_time", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [], "constraint_ref": "constraint:minimum_order_quantity", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [], "constraint_ref": "constraint:shelf_life", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:minimize_stockout", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/multi", "episode_id": null} {"id": "v4/combo:routing:b8ae7128be8ca805", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "전체 경로의 연료비 합계를 최소화하도록 배차 부탁드립니다. 모든 경로의 매 왕복 운행에서 중량·부피 등 각 적재 항목의 지점별 최대 적재량은 반드시 해당 경로 차량의 항목별 용량 이하여야 합니다."}], "ir": "MINIMIZE( SUM(x0 in routes: fuel_cost(x0)) )\n[HARD] EACH(x1 in routes): EACH(x2 in rounds(x1)): EACH(x3 in keys(load)): MAX(x4 in positions(x2): load[x3](x4)) <= capacity[x3](x1)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:capacity.exp_factor", "value": {"type": "decimal", "value": "1"}}], "constraint_ref": "constraint:capacity", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fuel_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:d6f33f826b1dceeb", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "모든 경로의 연료비를 합쳐서 최소로 줄여줘. 모든 경로에서 왕복할 때마다 중량이나 부피 같은 적재 항목 각각의 지점별 최대 적재량이 반드시 그 경로 차량의 해당 항목 용량을 넘지 않게 해줘."}], "ir": "MINIMIZE( SUM(x0 in routes: fuel_cost(x0)) )\n[HARD] EACH(x1 in routes): EACH(x2 in rounds(x1)): EACH(x3 in keys(load)): MAX(x4 in positions(x2): load[x3](x4)) <= capacity[x3](x1)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:capacity.exp_factor", "value": {"type": "decimal", "value": "1"}}], "constraint_ref": "constraint:capacity", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fuel_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:827ddd3d67b17a8b", "domain": "routing", "language": "mixed", "messages": [{"role": "user", "content": "전체 route의 연료비 합계를 최소화하고, 모든 route의 매 왕복에서 각 적재 항목의 지점별 최대 적재량은 반드시 해당 차량의 항목별 capacity 이하로 해 주세요."}], "ir": "MINIMIZE( SUM(x0 in routes: fuel_cost(x0)) )\n[HARD] EACH(x1 in routes): EACH(x2 in rounds(x1)): EACH(x3 in keys(load)): MAX(x4 in positions(x2): load[x3](x4)) <= capacity[x3](x1)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:capacity.exp_factor", "value": {"type": "decimal", "value": "1"}}], "constraint_ref": "constraint:capacity", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fuel_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/base:routing:95a01abf6a6ffaac", "domain": "routing", "language": "en", "messages": [{"role": "user", "content": "Minimize total start-to-finish time across all routes; keep each round’s stops within a smallest enclosing circle of radius at most 3 km"}], "ir": "MINIMIZE( SUM(x0 in routes: duration(x0)) )\nEACH(x1 in routes): EACH(x2 in rounds(x1)): sec_radius(x2) <= 3 km", "decision_kind": "execute", "gold_decision": {"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", "value": {"type": "decimal", "value": "3000"}}], "constraint_ref": "constraint:round_enclosing_circle_radius", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:duration_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/base", "episode_id": null} {"id": "v4/base:routing:cef8b5179102c967", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "모든 경로의 시작부터 종료까지 걸린 시간 합계를 최소화하고, 각 경로의 매 회전 정차지를 둘러싸는 최소 원의 반경은 3km 이하로 해 주세요."}], "ir": "MINIMIZE( SUM(x0 in routes: duration(x0)) )\nEACH(x1 in routes): EACH(x2 in rounds(x1)): sec_radius(x2) <= 3 km", "decision_kind": "execute", "gold_decision": {"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", "value": {"type": "decimal", "value": "3000"}}], "constraint_ref": "constraint:round_enclosing_circle_radius", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:duration_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/base", "episode_id": null} {"id": "v4/base:routing:9edd2fbc8042863c", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "전체 루트의 시작부터 종료까지 걸린 시간 합계를 최소화해줘. 각 루트의 매 라운드 정차지를 감싸는 최소 원의 반경은 3km 이하로 해줘."}], "ir": "MINIMIZE( SUM(x0 in routes: duration(x0)) )\nEACH(x1 in routes): EACH(x2 in rounds(x1)): sec_radius(x2) <= 3 km", "decision_kind": "execute", "gold_decision": {"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", "value": {"type": "decimal", "value": "3000"}}], "constraint_ref": "constraint:round_enclosing_circle_radius", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:duration_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/base", "episode_id": null} {"id": "v4/fragment:routing:903abe9b8e3eb9dd", "domain": "routing", "language": "en", "messages": [{"role": "user", "content": "If possible, keep every route within its rider’s own limits for depot round trips, distinct stops per round trip, and distinct stops across the route"}], "ir": "[SOFT] AND( EACH(x0 in routes): round_count(x0) <= max_rounds(x0), EACH(x1 in routes): EACH(x2 in rounds(x1)): stop_count(x2) <= max_stops_per_round(x1), EACH(x3 in routes): stop_count(x3) <= max_stops(x3) )", "decision_kind": "clarify", "gold_decision": {"candidate_refs": [], "kind": "clarify", "missing_field_refs": [], "reason_code": "missing_value", "required_inputs": [{"field": "objectives", "kind": "decision_field"}]}, "stratum": "v4/fragment", "episode_id": null} {"id": "v4/fragment:routing:1666da8986087073", "domain": "routing", "language": "en", "messages": [{"role": "user", "content": "Ideally, every route should stay within its rider’s own depot round-trip limit. Each round trip should stay within that rider’s distinct-stop limit per round trip, and the route overall within that rider’s distinct-stop limit per route."}], "ir": "[SOFT] AND( EACH(x0 in routes): round_count(x0) <= max_rounds(x0), EACH(x1 in routes): EACH(x2 in rounds(x1)): stop_count(x2) <= max_stops_per_round(x1), EACH(x3 in routes): stop_count(x3) <= max_stops(x3) )", "decision_kind": "clarify", "gold_decision": {"candidate_refs": [], "kind": "clarify", "missing_field_refs": [], "reason_code": "missing_value", "required_inputs": [{"field": "objectives", "kind": "decision_field"}]}, "stratum": "v4/fragment", "episode_id": null} {"id": "v4/fragment:routing:3a05725ad377c83c", "domain": "routing", "language": "en", "messages": [{"role": "user", "content": "Preferably, for every route: depot round trips, distinct stops per round trip, and distinct stops per route within the assigned rider’s respective limits"}], "ir": "[SOFT] AND( EACH(x0 in routes): round_count(x0) <= max_rounds(x0), EACH(x1 in routes): EACH(x2 in rounds(x1)): stop_count(x2) <= max_stops_per_round(x1), EACH(x3 in routes): stop_count(x3) <= max_stops(x3) )", "decision_kind": "clarify", "gold_decision": {"candidate_refs": [], "kind": "clarify", "missing_field_refs": [], "reason_code": "missing_value", "required_inputs": [{"field": "objectives", "kind": "decision_field"}]}, "stratum": "v4/fragment", "episode_id": null} {"id": "v4/combo:routing:d42026433aa97867", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "모든 경로의 출발부터 종료까지 걸리는 시간을 합친 값이랑, 모든 배송의 도착 시각에 각 배송의 시간 우선순위를 반영해서 합친 값을 둘 다 줄여줘. 모든 경로에서 배송 건마다 서비스 시작 전 대기시간은 담당 기사별 대기 한도 이내로 잡고, 경로 종료는 담당 기사 근무 종료 시각 이내로, 각 왕복 운행 종료는 담당 기사에게 정해진 왕복 운행 시간대의 종료 시각 이내로 잡아줘."}], "ir": "MINIMIZE( SUM(x0 in routes: duration(x0)) )\nMINIMIZE( SUM(x1 in visits: priority_weighted_arrival(x1)) )\nAND( EACH(x2 in routes): EACH(x3 in visits(x2)): wait_duration(x3) <= max_wait(x2), EACH(x4 in routes): end_time(x4) <= work_end(x4), EACH(x5 in routes): EACH(x6 in rounds(x5)): end_time(x6) <= round_window_end(x5) )", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:delivery_time_priority.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:delivery_time_priority", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:rider_time_window.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:rider_time_window", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:duration_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:ddd111b207e44899", "domain": "routing", "language": "en", "messages": [{"role": "user", "content": "Minimize both the sum of elapsed times from start to finish across all routes and the sum of delivery arrival times weighted by each delivery's time priority across all deliveries. For every route, keep each delivery's wait before service within that rider's own waiting-time limit, finish the route by that rider's working-hours end, and finish every round trip by that rider's round-trip window end"}], "ir": "MINIMIZE( SUM(x0 in routes: duration(x0)) )\nMINIMIZE( SUM(x1 in visits: priority_weighted_arrival(x1)) )\nAND( EACH(x2 in routes): EACH(x3 in visits(x2)): wait_duration(x3) <= max_wait(x2), EACH(x4 in routes): end_time(x4) <= work_end(x4), EACH(x5 in routes): EACH(x6 in rounds(x5)): end_time(x6) <= round_window_end(x5) )", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:delivery_time_priority.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:delivery_time_priority", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:rider_time_window.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:rider_time_window", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:duration_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:cadd4d8dbc0fd7cf", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "배차 계획에서 모든 경로의 출발부터 종료까지 걸리는 시간의 합을 줄여 주세요. 모든 배송의 도착 시각에 각 배송의 시간 우선순위를 반영한 합도 줄여 주세요. 모든 경로에서 각 배송의 서비스 시작 전 대기시간은 담당 기사별 대기 한도 이내로 잡고, 경로는 담당 기사의 근무 종료 시각까지, 각 왕복 운행은 담당 기사에게 정해진 왕복 운행 시간대의 종료 시각까지 끝나도록 해 주세요"}], "ir": "MINIMIZE( SUM(x0 in routes: duration(x0)) )\nMINIMIZE( SUM(x1 in visits: priority_weighted_arrival(x1)) )\nAND( EACH(x2 in routes): EACH(x3 in visits(x2)): wait_duration(x3) <= max_wait(x2), EACH(x4 in routes): end_time(x4) <= work_end(x4), EACH(x5 in routes): EACH(x6 in rounds(x5)): end_time(x6) <= round_window_end(x5) )", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:delivery_time_priority.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:delivery_time_priority", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:rider_time_window.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:rider_time_window", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:duration_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:2a168e0f9cb9379e", "domain": "routing", "language": "en", "messages": [{"role": "user", "content": "Minimize total fuel cost across all routes and the sum of the distinct delivery zone counts for each round trip on each route. If possible, keep the radius of the smallest circle enclosing all stops on each route to at most 5 km"}], "ir": "MINIMIZE( SUM(x0 in routes: fuel_cost(x0)) )\nMINIMIZE( SUM(x1 in routes: SUM(x2 in rounds(x1): COUNT_DISTINCT(x3 in visits(x2): zone(x3)))) )\n[SOFT] EACH(x4 in routes): sec_radius(x4) <= 5 km", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:enclosing_circle_radius.exp_factor", "value": {"type": "decimal", "value": "2"}}, {"slot_ref": "slot:enclosing_circle_radius.max_radius", "value": {"type": "decimal", "value": "5000"}}], "constraint_ref": "constraint:enclosing_circle_radius", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:rider_route_zone.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:rider_route_zone", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fuel_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:48b890320aafae64", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "전체 경로의 연료비 합계와, 각 경로의 왕복 운행마다 배송지의 서로 다른 배달 구역 수를 세어 모두 더한 값을 줄여 주세요. 가능하면 모든 경로에서 정차 지점을 전부 포함하는 가장 작은 원의 반경이 5km 이내가 되도록 해 주세요."}], "ir": "MINIMIZE( SUM(x0 in routes: fuel_cost(x0)) )\nMINIMIZE( SUM(x1 in routes: SUM(x2 in rounds(x1): COUNT_DISTINCT(x3 in visits(x2): zone(x3)))) )\n[SOFT] EACH(x4 in routes): sec_radius(x4) <= 5 km", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:enclosing_circle_radius.exp_factor", "value": {"type": "decimal", "value": "2"}}, {"slot_ref": "slot:enclosing_circle_radius.max_radius", "value": {"type": "decimal", "value": "5000"}}], "constraint_ref": "constraint:enclosing_circle_radius", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:rider_route_zone.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:rider_route_zone", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fuel_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:da246e62aa7716b5", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "모든 경로의 연료비 총합을 줄이고, 경로별로 매 왕복 운행의 배송지가 속한 배달 구역을 중복 없이 센 뒤 전체 왕복 운행에 걸쳐 합한 값도 줄여 주세요. 되도록 각 경로의 정차 지점을 모두 감싸는 가장 작은 원의 반경은 5km 이하로 해 주세요"}], "ir": "MINIMIZE( SUM(x0 in routes: fuel_cost(x0)) )\nMINIMIZE( SUM(x1 in routes: SUM(x2 in rounds(x1): COUNT_DISTINCT(x3 in visits(x2): zone(x3)))) )\n[SOFT] EACH(x4 in routes): sec_radius(x4) <= 5 km", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:enclosing_circle_radius.exp_factor", "value": {"type": "decimal", "value": "2"}}, {"slot_ref": "slot:enclosing_circle_radius.max_radius", "value": {"type": "decimal", "value": "5000"}}], "constraint_ref": "constraint:enclosing_circle_radius", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:rider_route_zone.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:rider_route_zone", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fuel_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:b3a380b74f7fbeb2", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "내일 배차 계획 짜는 중인데요, 모든 경로를 합쳐서 차량 고정 비용 총합이 가장 적게 나오도록 해 주세요. 그리고 가능하면 각 경로마다 배송 건수가 최소 12건은 되게 맞춰 주세요"}], "ir": "MINIMIZE( SUM(x0 in routes: fixed_cost(x0)) )\n[SOFT] EACH(x1 in routes): delivery_count(x1) >= 12", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:minimum_order.target_order", "value": {"type": "decimal", "value": "12"}}], "constraint_ref": "constraint:minimum_order", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fixed_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:49b89e7ee7b8e8f9", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "차량 고정비용 총합 최소로, 되도록 경로마다 12건 이상"}], "ir": "MINIMIZE( SUM(x0 in routes: fixed_cost(x0)) )\n[SOFT] EACH(x1 in routes): delivery_count(x1) >= 12", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:minimum_order.target_order", "value": {"type": "decimal", "value": "12"}}], "constraint_ref": "constraint:minimum_order", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fixed_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:9c9f540b477b22a3", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "전체 경로 기준으로 차량 고정비용 합계를 최소화해줘. 되도록이면 모든 경로가 배송 12건 이상은 되게 해줘"}], "ir": "MINIMIZE( SUM(x0 in routes: fixed_cost(x0)) )\n[SOFT] EACH(x1 in routes): delivery_count(x1) >= 12", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:minimum_order.target_order", "value": {"type": "decimal", "value": "12"}}], "constraint_ref": "constraint:minimum_order", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fixed_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/multi:retail:3eb5192e285f973c", "domain": "retail", "language": "ko", "messages": [{"role": "user", "content": "재고 중 폐기되는 비율을 최소화하도록 발주를 계획해 주세요. 모든 보충 발주 수량은 해당 품목의 최소 발주량의 배수로 잡고, 입고일은 발주일에 해당 품목 공급업체의 배송 소요일을 더한 날로 잡아 주세요. 모든 품목의 재고 낱개마다 유통기한 만료일은 그 낱개가 입고된 날에 해당 품목의 유통기한 기간을 더한 날로 계산해 주세요"}], "ir": "MINIMIZE( waste_rate )\nEACH(x0 in orders): quantity(x0) MULTIPLE_OF min_order_quantity(x0)\nEACH(x1 in orders): arrival_day(x1) = offset(order_day(x1), lead_time(x1))\nEACH(x2 in items): EACH(x3 in units(x2)): expiry_day(x3) = offset(arrival_day(x3), product_life(x2))", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:lead_time", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [], "constraint_ref": "constraint:minimum_order_quantity", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [], "constraint_ref": "constraint:shelf_life", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:minimize_waste", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/multi", "episode_id": null} {"id": "v4/multi:retail:46b6d8271ae65a9a", "domain": "retail", "language": "ko", "messages": [{"role": "user", "content": "재고에서 버리게 되는 비율을 최소화하는 쪽으로 발주 계획을 짜 주세요. 보충 발주마다 수량은 그 품목 최소 주문 수량의 배수로 하고, 도착하는 날은 주문한 날에 그 품목 공급업체의 입고 소요일을 더한 날로 잡아 주세요. 각 품목의 재고는 낱개마다 입고된 날에 그 품목의 유통기한 기간을 더한 날이 만료일이 되게 계산해 주세요."}], "ir": "MINIMIZE( waste_rate )\nEACH(x0 in orders): quantity(x0) MULTIPLE_OF min_order_quantity(x0)\nEACH(x1 in orders): arrival_day(x1) = offset(order_day(x1), lead_time(x1))\nEACH(x2 in items): EACH(x3 in units(x2)): expiry_day(x3) = offset(arrival_day(x3), product_life(x2))", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:lead_time", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [], "constraint_ref": "constraint:minimum_order_quantity", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [], "constraint_ref": "constraint:shelf_life", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:minimize_waste", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/multi", "episode_id": null} {"id": "v4/multi:retail:f98655914e3f1ece", "domain": "retail", "language": "en", "messages": [{"role": "user", "content": "Please plan replenishment orders to minimize the share of stock that gets discarded. For each replenishment order, set the quantity to a multiple of the item's minimum order quantity and the arrival date to the order date plus that item's supplier lead time. For every unit of every item in stock, set its expiry date to its arrival date plus the item's shelf life."}], "ir": "MINIMIZE( waste_rate )\nEACH(x0 in orders): quantity(x0) MULTIPLE_OF min_order_quantity(x0)\nEACH(x1 in orders): arrival_day(x1) = offset(order_day(x1), lead_time(x1))\nEACH(x2 in items): EACH(x3 in units(x2)): expiry_day(x3) = offset(arrival_day(x3), product_life(x2))", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:lead_time", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [], "constraint_ref": "constraint:minimum_order_quantity", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [], "constraint_ref": "constraint:shelf_life", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:minimize_waste", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/multi", "episode_id": null} {"id": "v4/plain:routing:9a2f53ecb45cc52f", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "전체 경로의 차량 운행 고정비 합계를 최소화하고 매 회차 적재율을 0.6 이상으로 유지해 주시기 바랍니다"}], "ir": "MINIMIZE( SUM(x0 in routes: fixed_cost(x0)) )\nEACH(x1 in routes): EACH(x2 in rounds(x1)): UNSPECIFIED(x3 in keys(load): utilization[x3](x2)) >= 0.6", "decision_kind": "clarify", "gold_decision": {"candidate_refs": ["constraint:min_capacity"], "kind": "clarify", "missing_field_refs": [], "reason_code": "ambiguous_capability", "required_inputs": []}, "stratum": "v4/plain", "episode_id": null} {"id": "v4/plain:routing:783240bc04942536", "domain": "routing", "language": "en", "messages": [{"role": "user", "content": "Minimize total fixed vehicle operating cost across all routes; keep every round trip’s load ratio at or above 0.6"}], "ir": "MINIMIZE( SUM(x0 in routes: fixed_cost(x0)) )\nEACH(x1 in routes): EACH(x2 in rounds(x1)): UNSPECIFIED(x3 in keys(load): utilization[x3](x2)) >= 0.6", "decision_kind": "clarify", "gold_decision": {"candidate_refs": ["constraint:min_capacity"], "kind": "clarify", "missing_field_refs": [], "reason_code": "ambiguous_capability", "required_inputs": []}, "stratum": "v4/plain", "episode_id": null} {"id": "v4/plain:routing:51801b711d7b090a", "domain": "routing", "language": "mixed", "messages": [{"role": "user", "content": "전체 route의 차량 운행 고정비 합계를 줄이는 쪽으로 배차해줘. 매 round trip 적재율은 0.6 이상으로 유지해줘"}], "ir": "MINIMIZE( SUM(x0 in routes: fixed_cost(x0)) )\nEACH(x1 in routes): EACH(x2 in rounds(x1)): UNSPECIFIED(x3 in keys(load): utilization[x3](x2)) >= 0.6", "decision_kind": "clarify", "gold_decision": {"candidate_refs": ["constraint:min_capacity"], "kind": "clarify", "missing_field_refs": [], "reason_code": "ambiguous_capability", "required_inputs": []}, "stratum": "v4/plain", "episode_id": null} {"id": "v4/combo:routing:f1c6699a961bce03", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "전체 경로의 연료비 총액을 줄여 주시고, 각 경로의 모든 정차 지점을 감싸는 최소 크기 원의 반경은 10km 이내로 잡아 주세요. 가능하면 경로별로 매 왕복 운행의 배송지에 포함된 배달 구역이 몇 종류인지 세고, 그 수를 모든 경로의 모든 왕복 운행에 걸쳐 더한 총합도 줄여 주세요"}], "ir": "MINIMIZE( SUM(x0 in routes: fuel_cost(x0)) )\nEACH(x1 in routes): sec_radius(x1) <= 10 km\n[SOFT] MINIMIZE( SUM(x2 in routes: SUM(x3 in rounds(x2): COUNT_DISTINCT(x4 in visits(x3): zone(x4)))) )", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:enclosing_circle_radius.exp_factor", "value": {"type": "decimal", "value": "2"}}, {"slot_ref": "slot:enclosing_circle_radius.max_radius", "value": {"type": "decimal", "value": "10000"}}], "constraint_ref": "constraint:enclosing_circle_radius", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:rider_route_zone.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:rider_route_zone", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fuel_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/multi:routing:0267941954df2e06", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "전체 경로의 연료비 합계와 전체 배송의 우선순위를 반영한 도착 시각의 합계를 줄이도록 배차해 주세요. 모든 경로에서 매 왕복 운행 중 지점별 적재량의 최댓값이 중량·부피 등 각 적재 항목별로 해당 차량의 용량 이내가 되게 하고, 각 경로의 배송 지점을 모두 감싸는 가장 작은 원의 반경은 해당 담당 기사의 개별 반경 한도 이내로 잡아 주세요"}], "ir": "MINIMIZE( SUM(x0 in routes: fuel_cost(x0)) )\nMINIMIZE( SUM(x1 in visits: priority_weighted_arrival(x1)) )\nEACH(x2 in routes): EACH(x3 in rounds(x2)): EACH(x4 in keys(load)): MAX(x5 in positions(x3): load[x4](x5)) <= capacity[x4](x2)\nEACH(x6 in routes): sec_radius(x6) <= individual_radius_limit(x6)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:capacity.exp_factor", "value": {"type": "decimal", "value": "1"}}], "constraint_ref": "constraint:capacity", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [{"slot_ref": "slot:delivery_time_priority.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:delivery_time_priority", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:individual_enclosing_circle_radius.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:individual_enclosing_circle_radius", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fuel_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/multi", "episode_id": null} {"id": "v4/multi:routing:bfdf69b667bca8d0", "domain": "routing", "language": "mixed", "messages": [{"role": "user", "content": "전체 route의 연료비 합계와 전체 배송의 priority를 반영한 도착 시각 합계를 줄이도록 계획해 주세요. 모든 경로의 매 왕복 운행에서 중량·부피 등 각 적재 항목의 지점별 최대 적재량이 해당 차량의 capacity를 넘지 않게 해 주세요. 각 경로의 배송 지점을 모두 포함하는 가장 작은 원의 반경도 해당 담당 기사별 반경 한도를 넘지 않게 해 주세요"}], "ir": "MINIMIZE( SUM(x0 in routes: fuel_cost(x0)) )\nMINIMIZE( SUM(x1 in visits: priority_weighted_arrival(x1)) )\nEACH(x2 in routes): EACH(x3 in rounds(x2)): EACH(x4 in keys(load)): MAX(x5 in positions(x3): load[x4](x5)) <= capacity[x4](x2)\nEACH(x6 in routes): sec_radius(x6) <= individual_radius_limit(x6)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:capacity.exp_factor", "value": {"type": "decimal", "value": "1"}}], "constraint_ref": "constraint:capacity", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [{"slot_ref": "slot:delivery_time_priority.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:delivery_time_priority", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:individual_enclosing_circle_radius.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:individual_enclosing_circle_radius", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fuel_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/multi", "episode_id": null} {"id": "v4/multi:routing:de9ef9f3084b3e3e", "domain": "routing", "language": "mixed", "messages": [{"role": "user", "content": "전체 경로의 fuel 비용 합계와 전체 배송의 priority를 반영한 도착 시각 합계를 줄여 주세요. 모든 route의 매 왕복 운행에서 중량·부피 등 적재 항목별 지점 간 최대 적재량은 해당 차량의 capacity 이내로, 각 경로의 배송 지점을 모두 감싸는 가장 작은 원의 반경은 해당 담당 기사 개인의 반경 한도 이내로 잡아 주세요"}], "ir": "MINIMIZE( SUM(x0 in routes: fuel_cost(x0)) )\nMINIMIZE( SUM(x1 in visits: priority_weighted_arrival(x1)) )\nEACH(x2 in routes): EACH(x3 in rounds(x2)): EACH(x4 in keys(load)): MAX(x5 in positions(x3): load[x4](x5)) <= capacity[x4](x2)\nEACH(x6 in routes): sec_radius(x6) <= individual_radius_limit(x6)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:capacity.exp_factor", "value": {"type": "decimal", "value": "1"}}], "constraint_ref": "constraint:capacity", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [{"slot_ref": "slot:delivery_time_priority.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:delivery_time_priority", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:individual_enclosing_circle_radius.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:individual_enclosing_circle_radius", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fuel_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/multi", "episode_id": null} {"id": "v4/combo:routing:710fd2a44c6b3996", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "전체 배송 경로의 총연료비를 최소화해줘. 각 경로는 배송 15건 이상으로 잡아줘."}], "ir": "MINIMIZE( SUM(x0 in routes: fuel_cost(x0)) )\nEACH(x1 in routes): delivery_count(x1) >= 15", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:minimum_order.target_order", "value": {"type": "decimal", "value": "15"}}], "constraint_ref": "constraint:minimum_order", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fuel_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:4d42f0f5d6e541a2", "domain": "routing", "language": "en", "messages": [{"role": "user", "content": "Minimize the total fuel cost across all routes. Set each route to have at least 15 deliveries."}], "ir": "MINIMIZE( SUM(x0 in routes: fuel_cost(x0)) )\nEACH(x1 in routes): delivery_count(x1) >= 15", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:minimum_order.target_order", "value": {"type": "decimal", "value": "15"}}], "constraint_ref": "constraint:minimum_order", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fuel_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:88accb6a1916d2c9", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "모든 배송 경로를 합친 연료비가 최소가 되게 짜줘. 경로마다 배송은 15건 이상으로 해줘"}], "ir": "MINIMIZE( SUM(x0 in routes: fuel_cost(x0)) )\nEACH(x1 in routes): delivery_count(x1) >= 15", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:minimum_order.target_order", "value": {"type": "decimal", "value": "15"}}], "constraint_ref": "constraint:minimum_order", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fuel_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:3ef8ab4e1daaa94a", "domain": "routing", "language": "en", "messages": [{"role": "user", "content": "Minimize the total travel distance across all routes, and make sure every round trip on every route has its fullest cargo dimension loaded to at least 80% of capacity"}], "ir": "MINIMIZE( SUM(x0 in routes: travel_distance(x0)) )\nEACH(x1 in routes): EACH(x2 in rounds(x1)): MAX(x3 in keys(load): utilization[x3](x2)) >= 0.8", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:min_capacity.target_ratio", "value": {"type": "decimal", "value": "0.8"}}], "constraint_ref": "constraint:min_capacity", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:distance_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:93f398cbf3668341", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "이번 배차 계획을 부탁드립니다. 모든 경로의 총 이동거리를 최소화해 주시고, 각 경로의 모든 회차에서 적재율이 가장 높은 화물 항목이 용량의 80% 이상 차도록 해 주시기 바랍니다."}], "ir": "MINIMIZE( SUM(x0 in routes: travel_distance(x0)) )\nEACH(x1 in routes): EACH(x2 in rounds(x1)): MAX(x3 in keys(load): utilization[x3](x2)) >= 0.8", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:min_capacity.target_ratio", "value": {"type": "decimal", "value": "0.8"}}], "constraint_ref": "constraint:min_capacity", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:distance_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:5cf9526ad0a08547", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "모든 경로 총 이동거리 줄이는 쪽으로 짜줘. 그리고 각 경로의 회차마다 제일 많이 찬 화물 기준 적재율이 80% 이상은 되게 해줘"}], "ir": "MINIMIZE( SUM(x0 in routes: travel_distance(x0)) )\nEACH(x1 in routes): EACH(x2 in rounds(x1)): MAX(x3 in keys(load): utilization[x3](x2)) >= 0.8", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:min_capacity.target_ratio", "value": {"type": "decimal", "value": "0.8"}}], "constraint_ref": "constraint:min_capacity", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:distance_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:5554f95c0f358ae8", "domain": "routing", "language": "mixed", "messages": [{"role": "user", "content": "이번 배차는 전체 route 연료비 합이 최소가 되게 짜줘. 그리고 가능하면 각 route의 stop들을 감싸는 최소 외접원 반경이 3km 안에 들어오게 해줘."}], "ir": "MINIMIZE( SUM(x0 in routes: fuel_cost(x0)) )\n[SOFT] EACH(x1 in routes): sec_radius(x1) <= 3 km", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:enclosing_circle_radius.exp_factor", "value": {"type": "decimal", "value": "2"}}, {"slot_ref": "slot:enclosing_circle_radius.max_radius", "value": {"type": "decimal", "value": "3000"}}], "constraint_ref": "constraint:enclosing_circle_radius", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fuel_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:d7f7757e32190d2f", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "오늘 배차 계획 다시 돌려보자. 모든 경로 연료비 총합이 제일 적게 나오도록 해줘. 되도록 경로마다 정차지들을 다 포함하는 가장 작은 원 반경이 3km 이하로 유지되면 좋겠어"}], "ir": "MINIMIZE( SUM(x0 in routes: fuel_cost(x0)) )\n[SOFT] EACH(x1 in routes): sec_radius(x1) <= 3 km", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:enclosing_circle_radius.exp_factor", "value": {"type": "decimal", "value": "2"}}, {"slot_ref": "slot:enclosing_circle_radius.max_radius", "value": {"type": "decimal", "value": "3000"}}], "constraint_ref": "constraint:enclosing_circle_radius", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fuel_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:23ae695a21d9823c", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "전체 경로 연료비 총합 최소로 가자, 가능하면 경로별 외접원 반경은 3km 넘지 않게 해줘"}], "ir": "MINIMIZE( SUM(x0 in routes: fuel_cost(x0)) )\n[SOFT] EACH(x1 in routes): sec_radius(x1) <= 3 km", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:enclosing_circle_radius.exp_factor", "value": {"type": "decimal", "value": "2"}}, {"slot_ref": "slot:enclosing_circle_radius.max_radius", "value": {"type": "decimal", "value": "3000"}}], "constraint_ref": "constraint:enclosing_circle_radius", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fuel_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/base:retail:bdf6192e9a85b046", "domain": "retail", "language": "ko", "messages": [{"role": "user", "content": "계획 기간 일평균 재고 보유비용을 최소화하고, 발주는 각각 해당 품목의 발주 가능 요일에 넣어줘"}], "ir": "MINIMIZE( MEAN(x0 in days(horizon): holding_cost(x0)) )\nEACH(x1 in orders): day_of_week(x1) IN allowed_order_days(x1)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:order_days", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:minimize_holding_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/base", "episode_id": null} {"id": "v4/base:retail:059dda82ade4659b", "domain": "retail", "language": "mixed", "messages": [{"role": "user", "content": "계획 기간의 일평균 재고 보유비용을 최소화해 주세요. 모든 발주 order는 해당 품목의 발주 가능 요일 schedule에 맞춰 주세요"}], "ir": "MINIMIZE( MEAN(x0 in days(horizon): holding_cost(x0)) )\nEACH(x1 in orders): day_of_week(x1) IN allowed_order_days(x1)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:order_days", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:minimize_holding_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/base", "episode_id": null} {"id": "v4/base:retail:cf3e29533aaa5b46", "domain": "retail", "language": "en", "messages": [{"role": "user", "content": "Minimize the average daily holding cost over the planning period, and place each replenishment order on one of the item's allowed order weekdays."}], "ir": "MINIMIZE( MEAN(x0 in days(horizon): holding_cost(x0)) )\nEACH(x1 in orders): day_of_week(x1) IN allowed_order_days(x1)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:order_days", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:minimize_holding_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/base", "episode_id": null} {"id": "v4/combo:routing:2fb02bf9ec08b15d", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "전체 루트의 시작부터 종료까지 걸리는 시간 합계를 최소화하고, 모든 루트의 매 회전 배송지를 감싸는 최소 원의 반경은 3km 이하로 해 주세요."}], "ir": "MINIMIZE( SUM(x0 in routes: duration(x0)) )\nEACH(x1 in routes): EACH(x2 in rounds(x1)): sec_radius(x2) <= 3 km", "decision_kind": "execute", "gold_decision": {"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", "value": {"type": "decimal", "value": "3000"}}], "constraint_ref": "constraint:round_enclosing_circle_radius", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:duration_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:1a63dc6f7029d892", "domain": "routing", "language": "en", "messages": [{"role": "user", "content": "Minimize total start-to-finish time across all routes, with the smallest circle enclosing each round trip’s stops on every route having a radius of at most 3 km"}], "ir": "MINIMIZE( SUM(x0 in routes: duration(x0)) )\nEACH(x1 in routes): EACH(x2 in rounds(x1)): sec_radius(x2) <= 3 km", "decision_kind": "execute", "gold_decision": {"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", "value": {"type": "decimal", "value": "3000"}}], "constraint_ref": "constraint:round_enclosing_circle_radius", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:duration_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:ced21d78aac20a53", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "전체 경로의 시작부터 종료까지 소요시간 합계를 최소화하고, 모든 경로의 매 회전 배송지를 감싸는 최소 원의 반경은 3km 이하로 설정 부탁드립니다"}], "ir": "MINIMIZE( SUM(x0 in routes: duration(x0)) )\nEACH(x1 in routes): EACH(x2 in rounds(x1)): sec_radius(x2) <= 3 km", "decision_kind": "execute", "gold_decision": {"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", "value": {"type": "decimal", "value": "3000"}}], "constraint_ref": "constraint:round_enclosing_circle_radius", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:duration_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:e4ebaa492d1cec51", "domain": "routing", "language": "mixed", "messages": [{"role": "user", "content": "전체 route의 연료비 합계를 최소화해줘. 서로 300m 이내인 배송지 쌍은 반드시 같은 route로 묶고, 모든 배송지의 실제 작업 시간은 해당 배송지의 배달 금지 시간대와 절대 겹치지 않게 해줘"}], "ir": "MINIMIZE( SUM(x0 in routes: fuel_cost(x0)) )\n[HARD] EACH((x1, x2) in pairs(visits, nearby(300 m))): TOGETHER(x1, x2, route)\n[HARD] EACH(x3 in visits): NOT OVERLAPS(service_interval(x3), prohibited_window(x3))", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:prohibited_time_window", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [{"slot_ref": "slot:nearby_delivery_grouping.distance_threshold", "value": {"type": "decimal", "value": "300"}}, {"slot_ref": "slot:nearby_delivery_grouping.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:nearby_delivery_grouping", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fuel_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:c6cb4f31f447264a", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "전체 경로의 총연료비를 최소화해 주세요. 서로 300m 이내에 있는 배송지 두 곳은 반드시 같은 경로에 배정하고, 모든 배송지에서 배송 작업을 하는 시간은 각 배송지의 방문 금지 시간대와 절대 겹치지 않게 해 주세요."}], "ir": "MINIMIZE( SUM(x0 in routes: fuel_cost(x0)) )\n[HARD] EACH((x1, x2) in pairs(visits, nearby(300 m))): TOGETHER(x1, x2, route)\n[HARD] EACH(x3 in visits): NOT OVERLAPS(service_interval(x3), prohibited_window(x3))", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:prohibited_time_window", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [{"slot_ref": "slot:nearby_delivery_grouping.distance_threshold", "value": {"type": "decimal", "value": "300"}}, {"slot_ref": "slot:nearby_delivery_grouping.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:nearby_delivery_grouping", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fuel_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:4672c1dbdbd1c590", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "모든 경로의 연료비를 합친 총액을 최소화해 주세요. 서로 300m 이내인 배송지 쌍은 반드시 같은 경로로 묶어 주시고, 모든 배송지의 배송 작업 시간은 해당 배송지의 배달 금지 시간대와 절대 겹치지 않게 해 주세요"}], "ir": "MINIMIZE( SUM(x0 in routes: fuel_cost(x0)) )\n[HARD] EACH((x1, x2) in pairs(visits, nearby(300 m))): TOGETHER(x1, x2, route)\n[HARD] EACH(x3 in visits): NOT OVERLAPS(service_interval(x3), prohibited_window(x3))", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:prohibited_time_window", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [{"slot_ref": "slot:nearby_delivery_grouping.distance_threshold", "value": {"type": "decimal", "value": "300"}}, {"slot_ref": "slot:nearby_delivery_grouping.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:nearby_delivery_grouping", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fuel_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:86d480f0dee5f38a", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "전체 경로의 총 연료비를 최소화하는 배차안을 부탁드립니다. 배달 건마다 서비스 시간이 그 건의 배달 금지 시간대와 절대 겹치면 안 됩니다. 그리고 경로마다 각 배달의 대기시간은 반드시 해당 기사의 대기 한도 이내여야 하고, 경로 종료 시각은 기사의 근무 종료 시각을, 각 회차 종료 시각은 기사의 회차 마감 시각을 무조건 넘지 않아야 합니다"}], "ir": "MINIMIZE( SUM(x0 in routes: fuel_cost(x0)) )\n[HARD] EACH(x1 in visits): NOT OVERLAPS(service_interval(x1), prohibited_window(x1))\n[HARD] AND( EACH(x2 in routes): EACH(x3 in visits(x2)): wait_duration(x3) <= max_wait(x2), EACH(x4 in routes): end_time(x4) <= work_end(x4), EACH(x5 in routes): EACH(x6 in rounds(x5)): end_time(x6) <= round_window_end(x5) )", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:prohibited_time_window", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [{"slot_ref": "slot:rider_time_window.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:rider_time_window", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fuel_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:9ae6ad6b75cdf278", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "모든 경로를 합친 연료비가 가장 적게 나오도록 계획을 짜 주십시오. 배달 건마다 배달 금지 시간대에는 절대 서비스가 걸치면 안 됩니다. 또 기사별로 배달 전 대기시간은 그 기사의 대기 한도를 반드시 지켜야 하고, 경로가 끝나는 시각은 기사 근무 종료 시각 안에, 회차가 끝나는 시각은 기사의 회차 마감 시각 안에 무조건 들어와야 합니다."}], "ir": "MINIMIZE( SUM(x0 in routes: fuel_cost(x0)) )\n[HARD] EACH(x1 in visits): NOT OVERLAPS(service_interval(x1), prohibited_window(x1))\n[HARD] AND( EACH(x2 in routes): EACH(x3 in visits(x2)): wait_duration(x3) <= max_wait(x2), EACH(x4 in routes): end_time(x4) <= work_end(x4), EACH(x5 in routes): EACH(x6 in rounds(x5)): end_time(x6) <= round_window_end(x5) )", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:prohibited_time_window", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [{"slot_ref": "slot:rider_time_window.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:rider_time_window", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fuel_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:caef774b32dc529c", "domain": "routing", "language": "en", "messages": [{"role": "user", "content": "Please plan the routes to minimize total fuel cost across all routes. Service for each delivery must never overlap that delivery's prohibited time window. Also, on every route, each delivery's wait before service must stay within that rider's own wait limit, the route must finish by the rider's end of working hours, and every round trip must finish by the rider's round window end."}], "ir": "MINIMIZE( SUM(x0 in routes: fuel_cost(x0)) )\n[HARD] EACH(x1 in visits): NOT OVERLAPS(service_interval(x1), prohibited_window(x1))\n[HARD] AND( EACH(x2 in routes): EACH(x3 in visits(x2)): wait_duration(x3) <= max_wait(x2), EACH(x4 in routes): end_time(x4) <= work_end(x4), EACH(x5 in routes): EACH(x6 in rounds(x5)): end_time(x6) <= round_window_end(x5) )", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:prohibited_time_window", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [{"slot_ref": "slot:rider_time_window.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:rider_time_window", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fuel_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/fragment:nurse:1e0a5b624a7a6533", "domain": "nurse", "language": "ko", "messages": [{"role": "user", "content": "간호사 전원 주당 총 근무시간 반드시 40시간 안 넘게 해줘"}], "ir": "[HARD] EACH(x0 in workers): EACH(x1 in windows(WEEK, 1)): SUM(x2 in assignments(x0) WHERE DURING(interval(x2), x1): work_hours(x2)) <= 40 h", "decision_kind": "clarify", "gold_decision": {"candidate_refs": [], "kind": "clarify", "missing_field_refs": [], "reason_code": "missing_value", "required_inputs": [{"field": "objectives", "kind": "decision_field"}]}, "stratum": "v4/fragment", "episode_id": null} {"id": "v4/fragment:nurse:af8063776a36f933", "domain": "nurse", "language": "ko", "messages": [{"role": "user", "content": "근무표 짤 때 부탁드릴게요. 모든 간호사는 한 주 동안 배정된 근무시간을 전부 합쳐서 반드시 40시간을 넘지 않게 해 주세요. 이건 절대 어기면 안 되는 조건이에요."}], "ir": "[HARD] EACH(x0 in workers): EACH(x1 in windows(WEEK, 1)): SUM(x2 in assignments(x0) WHERE DURING(interval(x2), x1): work_hours(x2)) <= 40 h", "decision_kind": "clarify", "gold_decision": {"candidate_refs": [], "kind": "clarify", "missing_field_refs": [], "reason_code": "missing_value", "required_inputs": [{"field": "objectives", "kind": "decision_field"}]}, "stratum": "v4/fragment", "episode_id": null} {"id": "v4/fragment:nurse:d0c569abe4a165d8", "domain": "nurse", "language": "ko", "messages": [{"role": "user", "content": "전 간호사 주별 총 근무시간 40시간 이하 필수 부탁드립니다"}], "ir": "[HARD] EACH(x0 in workers): EACH(x1 in windows(WEEK, 1)): SUM(x2 in assignments(x0) WHERE DURING(interval(x2), x1): work_hours(x2)) <= 40 h", "decision_kind": "clarify", "gold_decision": {"candidate_refs": [], "kind": "clarify", "missing_field_refs": [], "reason_code": "missing_value", "required_inputs": [{"field": "objectives", "kind": "decision_field"}]}, "stratum": "v4/fragment", "episode_id": null} {"id": "v4/combo:nurse:cd4c20cc0c510aed", "domain": "nurse", "language": "en", "messages": [{"role": "user", "content": "For the duty roster, I want to maximize the total preference score across all the shift assignments. Also, no nurse should work more than 4 days in a row, and every nurse needs at least 10 hours of rest between one shift and the next."}], "ir": "MAXIMIZE( SUM(x0 in assignments: preference_score(x0)) )\nEACH(x1 in workers): RUN_LENGTH(x2 in day_seq(x1): works(x1, x2)) <= 4 day\nEACH(x3 in workers): EACH(x4 in adjacent(assignment_seq(x3))): gap_duration(x4) >= 10 h", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:max_days", "value": {"type": "duration", "unit_ref": "unit:day", "value": "4"}}], "constraint_ref": "constraint:max_consecutive_days", "scope": null, "strength": {"kind": "soft", "weight": "100"}}, {"arguments": [{"slot_ref": "slot:min_hours", "value": {"type": "duration", "unit_ref": "unit:hour", "value": "10"}}], "constraint_ref": "constraint:min_rest_hours", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:preference_satisfaction", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:nurse:254e4d6b6293989f", "domain": "nurse", "language": "ko", "messages": [{"role": "user", "content": "근무표 짤 때 모든 근무 배정의 선호도 점수 합계를 최대로 해 주세요. 그리고 간호사마다 연속 근무는 4일까지만, 근무와 다음 근무 사이 휴식은 10시간 이상 있게 해 주세요"}], "ir": "MAXIMIZE( SUM(x0 in assignments: preference_score(x0)) )\nEACH(x1 in workers): RUN_LENGTH(x2 in day_seq(x1): works(x1, x2)) <= 4 day\nEACH(x3 in workers): EACH(x4 in adjacent(assignment_seq(x3))): gap_duration(x4) >= 10 h", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:max_days", "value": {"type": "duration", "unit_ref": "unit:day", "value": "4"}}], "constraint_ref": "constraint:max_consecutive_days", "scope": null, "strength": {"kind": "soft", "weight": "100"}}, {"arguments": [{"slot_ref": "slot:min_hours", "value": {"type": "duration", "unit_ref": "unit:hour", "value": "10"}}], "constraint_ref": "constraint:min_rest_hours", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:preference_satisfaction", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:nurse:5f22b63fd01404a9", "domain": "nurse", "language": "ko", "messages": [{"role": "user", "content": "이번 달 근무표 새로 짜자. 전체 근무 배정의 선호도 점수 총합이 최대로 나오게 해줘. 간호사 모두 연속으로 일하는 날은 최대 4일, 근무 사이 간격은 10시간 이상으로 가자."}], "ir": "MAXIMIZE( SUM(x0 in assignments: preference_score(x0)) )\nEACH(x1 in workers): RUN_LENGTH(x2 in day_seq(x1): works(x1, x2)) <= 4 day\nEACH(x3 in workers): EACH(x4 in adjacent(assignment_seq(x3))): gap_duration(x4) >= 10 h", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:max_days", "value": {"type": "duration", "unit_ref": "unit:day", "value": "4"}}], "constraint_ref": "constraint:max_consecutive_days", "scope": null, "strength": {"kind": "soft", "weight": "100"}}, {"arguments": [{"slot_ref": "slot:min_hours", "value": {"type": "duration", "unit_ref": "unit:hour", "value": "10"}}], "constraint_ref": "constraint:min_rest_hours", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:preference_satisfaction", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:3644073f9e126503", "domain": "routing", "language": "mixed", "messages": [{"role": "user", "content": "전체 route의 차량 고정 운영비 합계를 최소화해 주시기 바랍니다. 가능하면 모든 경로에서 배송 지점을 전부 감싸는 가장 작은 원의 반경이 3km 이하가 되도록 부탁드립니다."}], "ir": "MINIMIZE( SUM(x0 in routes: fixed_cost(x0)) )\n[SOFT] EACH(x1 in routes): sec_radius(x1) <= 3 km", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:enclosing_circle_radius.exp_factor", "value": {"type": "decimal", "value": "2"}}, {"slot_ref": "slot:enclosing_circle_radius.max_radius", "value": {"type": "decimal", "value": "3000"}}], "constraint_ref": "constraint:enclosing_circle_radius", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fixed_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:51e880a26ea9765f", "domain": "routing", "language": "en", "messages": [{"role": "user", "content": "Minimize total vehicle fixed operating cost across all routes; ideally, each route’s stops fit in a circle of radius at most 3 km"}], "ir": "MINIMIZE( SUM(x0 in routes: fixed_cost(x0)) )\n[SOFT] EACH(x1 in routes): sec_radius(x1) <= 3 km", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:enclosing_circle_radius.exp_factor", "value": {"type": "decimal", "value": "2"}}, {"slot_ref": "slot:enclosing_circle_radius.max_radius", "value": {"type": "decimal", "value": "3000"}}], "constraint_ref": "constraint:enclosing_circle_radius", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fixed_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:b61b313435716dec", "domain": "routing", "language": "en", "messages": [{"role": "user", "content": "Please minimize the total fixed vehicle operating cost across all routes. If possible, keep the radius of the smallest circle enclosing each route’s stops to at most 3 km."}], "ir": "MINIMIZE( SUM(x0 in routes: fixed_cost(x0)) )\n[SOFT] EACH(x1 in routes): sec_radius(x1) <= 3 km", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:enclosing_circle_radius.exp_factor", "value": {"type": "decimal", "value": "2"}}, {"slot_ref": "slot:enclosing_circle_radius.max_radius", "value": {"type": "decimal", "value": "3000"}}], "constraint_ref": "constraint:enclosing_circle_radius", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fixed_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/residual:retail:f5fa3cc62c346d49", "domain": "retail", "language": "en", "messages": [{"role": "user", "content": "Maximize profit after subtracting the cost of goods and discards from sales revenue. Every delivery is to arrive before 5 in the morning."}], "ir": "MAXIMIZE( profit )\nUNEXPRESSED(literal, constraint)", "decision_kind": "unsupported", "gold_decision": {"kind": "unsupported", "reason_code": "semantic_not_declared", "related_refs": []}, "stratum": "v4/residual", "episode_id": null} {"id": "v4/residual:retail:78d921fcfbf979c4", "domain": "retail", "language": "en", "messages": [{"role": "user", "content": "Maximize profit (sales revenue minus goods and discard costs); every delivery arrives before 5 in the morning"}], "ir": "MAXIMIZE( profit )\nUNEXPRESSED(literal, constraint)", "decision_kind": "unsupported", "gold_decision": {"kind": "unsupported", "reason_code": "semantic_not_declared", "related_refs": []}, "stratum": "v4/residual", "episode_id": null} {"id": "v4/residual:retail:a20876c2cec6c172", "domain": "retail", "language": "ko", "messages": [{"role": "user", "content": "매출에서 상품 원가와 폐기 비용을 뺀 이익을 최대화해 주세요. 모든 납품은 오전 5시 전에 도착하는 것으로 부탁드립니다."}], "ir": "MAXIMIZE( profit )\nUNEXPRESSED(literal, constraint)", "decision_kind": "unsupported", "gold_decision": {"kind": "unsupported", "reason_code": "semantic_not_declared", "related_refs": []}, "stratum": "v4/residual", "episode_id": null} {"id": "v4/fragment:routing:6ad3a583980413a3", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "모든 배송 경로의 방문 순서는 반드시 시간 우선순위가 높은 순으로 정해 주시기 바랍니다"}], "ir": "[HARD] EACH(x0 in routes): ORDERED_BY(visit_seq(x0), time_priority, DESC)", "decision_kind": "clarify", "gold_decision": {"candidate_refs": [], "kind": "clarify", "missing_field_refs": [], "reason_code": "missing_value", "required_inputs": [{"field": "objectives", "kind": "decision_field"}]}, "stratum": "v4/fragment", "episode_id": null} {"id": "v4/fragment:routing:2fd244ffbd9c81b7", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "모든 경로는 반드시 시간 우선순위 높은 순으로 방문하게 해줘"}], "ir": "[HARD] EACH(x0 in routes): ORDERED_BY(visit_seq(x0), time_priority, DESC)", "decision_kind": "clarify", "gold_decision": {"candidate_refs": [], "kind": "clarify", "missing_field_refs": [], "reason_code": "missing_value", "required_inputs": [{"field": "objectives", "kind": "decision_field"}]}, "stratum": "v4/fragment", "episode_id": null} {"id": "v4/fragment:routing:c76e547702b25f64", "domain": "routing", "language": "en", "messages": [{"role": "user", "content": "Every route must visit stops in descending time priority."}], "ir": "[HARD] EACH(x0 in routes): ORDERED_BY(visit_seq(x0), time_priority, DESC)", "decision_kind": "clarify", "gold_decision": {"candidate_refs": [], "kind": "clarify", "missing_field_refs": [], "reason_code": "missing_value", "required_inputs": [{"field": "objectives", "kind": "decision_field"}]}, "stratum": "v4/fragment", "episode_id": null} {"id": "v4/residual:routing:2338ba6fcaa8d204", "domain": "routing", "language": "en", "messages": [{"role": "user", "content": "Minimize the total fixed vehicle operating cost across all routes. On weekends only, no route may exceed 60 km."}], "ir": "MINIMIZE( SUM(x0 in routes: fixed_cost(x0)) )\nUNEXPRESSED(other, constraint)", "decision_kind": "unsupported", "gold_decision": {"kind": "unsupported", "reason_code": "semantic_not_declared", "related_refs": []}, "stratum": "v4/residual", "episode_id": null} {"id": "v4/residual:routing:ce217a97cfd606ff", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "전체 루트의 차량 운행 고정비 총액 최소화, 주말에만 루트별 60km 이하로 배차 플랜 부탁드립니다."}], "ir": "MINIMIZE( SUM(x0 in routes: fixed_cost(x0)) )\nUNEXPRESSED(other, constraint)", "decision_kind": "unsupported", "gold_decision": {"kind": "unsupported", "reason_code": "semantic_not_declared", "related_refs": []}, "stratum": "v4/residual", "episode_id": null} {"id": "v4/residual:routing:cd34f1a079108b87", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "전체 경로의 차량 운행 고정비 총액을 최소화하고, 주말에만 각 경로가 60km를 넘지 않도록 배차 부탁드립니다"}], "ir": "MINIMIZE( SUM(x0 in routes: fixed_cost(x0)) )\nUNEXPRESSED(other, constraint)", "decision_kind": "unsupported", "gold_decision": {"kind": "unsupported", "reason_code": "semantic_not_declared", "related_refs": []}, "stratum": "v4/residual", "episode_id": null} {"id": "v4/combo:retail:1b0d73d0bd02bee3", "domain": "retail", "language": "mixed", "messages": [{"role": "user", "content": "발주 계획은 재고 중 폐기되는 비율을 줄이는 쪽으로 잡아 주세요. 매번 보충 발주 수량은 반드시 해당 품목 MOQ의 배수로 맞추고, 각 품목의 재고는 개별 입고분마다 입고일에 그 품목의 shelf life를 더한 날을 유통기한 만료일로 잡아 주세요. 발주 요일은 가능하면 매번 해당 품목의 발주 가능 요일에 맞춰 주세요"}], "ir": "MINIMIZE( waste_rate )\n[HARD] EACH(x0 in orders): quantity(x0) MULTIPLE_OF min_order_quantity(x0)\nEACH(x1 in items): EACH(x2 in units(x1)): expiry_day(x2) = offset(arrival_day(x2), product_life(x1))\n[SOFT] EACH(x3 in orders): day_of_week(x3) IN allowed_order_days(x3)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:minimum_order_quantity", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [], "constraint_ref": "constraint:order_days", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [], "constraint_ref": "constraint:shelf_life", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:minimize_waste", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:retail:52dd974b122fe8b3", "domain": "retail", "language": "ko", "messages": [{"role": "user", "content": "재고 중 폐기되는 비율을 최소화하는 발주 계획을 부탁드립니다. 모든 보충 발주의 수량은 반드시 해당 품목의 최소 발주량의 배수로 맞추고, 모든 품목의 재고 낱개마다 입고일에 해당 품목의 유통기한 일수를 더한 날을 만료일로 산정해 주시기 바랍니다. 각 발주는 되도록 해당 품목의 발주 가능 요일에 진행해 주시기 바랍니다."}], "ir": "MINIMIZE( waste_rate )\n[HARD] EACH(x0 in orders): quantity(x0) MULTIPLE_OF min_order_quantity(x0)\nEACH(x1 in items): EACH(x2 in units(x1)): expiry_day(x2) = offset(arrival_day(x2), product_life(x1))\n[SOFT] EACH(x3 in orders): day_of_week(x3) IN allowed_order_days(x3)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:minimum_order_quantity", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [], "constraint_ref": "constraint:order_days", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [], "constraint_ref": "constraint:shelf_life", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:minimize_waste", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:retail:965e4ab400d271b3", "domain": "retail", "language": "en", "messages": [{"role": "user", "content": "Please plan replenishment to minimize the share of stock that gets discarded. Every replenishment order must be a multiple of the item's minimum order quantity, and each individual stock unit's expiry date should be set to its arrival date plus that item's shelf life. If possible, place each replenishment order on one of the item's allowed order weekdays"}], "ir": "MINIMIZE( waste_rate )\n[HARD] EACH(x0 in orders): quantity(x0) MULTIPLE_OF min_order_quantity(x0)\nEACH(x1 in items): EACH(x2 in units(x1)): expiry_day(x2) = offset(arrival_day(x2), product_life(x1))\n[SOFT] EACH(x3 in orders): day_of_week(x3) IN allowed_order_days(x3)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:minimum_order_quantity", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [], "constraint_ref": "constraint:order_days", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [], "constraint_ref": "constraint:shelf_life", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:minimize_waste", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/multi:routing:8edaf3123fe3b3a2", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "전체 경로의 총 이동거리 최소화로 짜줘. 한 경로당 배송지는 가능하면 5곳 이하로, 각 경로 배송지들을 감싸는 최소 원 반경도 되도록 그 경로 기사별 반경 제한 안에 들어오게 해줘."}], "ir": "MINIMIZE( SUM(x0 in routes: travel_distance(x0)) )\n[SOFT] EACH(x1 in routes): delivery_count(x1) <= 5\n[SOFT] EACH(x2 in routes): sec_radius(x2) <= individual_radius_limit(x2)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:delivery_length.exp_factor", "value": {"type": "decimal", "value": "2"}}, {"slot_ref": "slot:delivery_length.max_size", "value": {"type": "decimal", "value": "5"}}], "constraint_ref": "constraint:delivery_length", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:individual_enclosing_circle_radius.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:individual_enclosing_circle_radius", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:distance_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/multi", "episode_id": null} {"id": "v4/multi:routing:b9ecd209a2d53fc6", "domain": "routing", "language": "en", "messages": [{"role": "user", "content": "Please plan the routes so the total travel distance across all routes is as low as possible. If possible, keep each route to 5 deliveries or fewer. Ideally the smallest circle that encloses each route's stops should also stay within that route's rider's own radius limit"}], "ir": "MINIMIZE( SUM(x0 in routes: travel_distance(x0)) )\n[SOFT] EACH(x1 in routes): delivery_count(x1) <= 5\n[SOFT] EACH(x2 in routes): sec_radius(x2) <= individual_radius_limit(x2)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:delivery_length.exp_factor", "value": {"type": "decimal", "value": "2"}}, {"slot_ref": "slot:delivery_length.max_size", "value": {"type": "decimal", "value": "5"}}], "constraint_ref": "constraint:delivery_length", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:individual_enclosing_circle_radius.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:individual_enclosing_circle_radius", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:distance_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/multi", "episode_id": null} {"id": "v4/multi:routing:ee6f25ba838d2a12", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "모든 경로 합친 이동거리가 제일 짧게 나오게 짜줘. 그리고 되도록 경로마다 배송지는 5개 넘지 않게 하고, 경로 하나하나 배송지를 다 감싸는 가장 작은 원 반경이 가능하면 담당 기사 본인 반경 제한 안에 들어오게 해줘."}], "ir": "MINIMIZE( SUM(x0 in routes: travel_distance(x0)) )\n[SOFT] EACH(x1 in routes): delivery_count(x1) <= 5\n[SOFT] EACH(x2 in routes): sec_radius(x2) <= individual_radius_limit(x2)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:delivery_length.exp_factor", "value": {"type": "decimal", "value": "2"}}, {"slot_ref": "slot:delivery_length.max_size", "value": {"type": "decimal", "value": "5"}}], "constraint_ref": "constraint:delivery_length", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:individual_enclosing_circle_radius.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:individual_enclosing_circle_radius", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:distance_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/multi", "episode_id": null} {"id": "v4/combo:routing:d1934a08508a8677", "domain": "routing", "language": "en", "messages": [{"role": "user", "content": "Minimize the time from start to finish for each route, totaled across all routes. Also, you must count the different delivery zones served on each round trip and minimize that count summed over all round trips on all routes."}], "ir": "MINIMIZE( SUM(x0 in routes: duration(x0)) )\n[HARD] MINIMIZE( SUM(x1 in routes: SUM(x2 in rounds(x1): COUNT_DISTINCT(x3 in visits(x2): zone(x3)))) )", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:rider_route_zone.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:rider_route_zone", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:duration_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:5f8af387983fb500", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "모든 경로의 출발부터 종료까지 걸리는 시간을 합쳐서 최소화해줘. 모든 경로는 반드시 시간 우선순위가 높은 순서대로 방문하고, 각 경로의 매 왕복 운행에서는 중량·부피 등 각 적재 항목별로 운행 중 최대 적재량이 반드시 해당 차량의 항목별 용량 이하여야 해"}], "ir": "MINIMIZE( SUM(x0 in routes: duration(x0)) )\n[HARD] EACH(x1 in routes): ORDERED_BY(visit_seq(x1), time_priority, DESC)\n[HARD] EACH(x2 in routes): EACH(x3 in rounds(x2)): EACH(x4 in keys(load)): MAX(x5 in positions(x3): load[x4](x5)) <= capacity[x4](x2)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:capacity.exp_factor", "value": {"type": "decimal", "value": "1"}}], "constraint_ref": "constraint:capacity", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [{"slot_ref": "slot:time_priority_order.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:time_priority_order", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:duration_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:aba3f60db28bcbb1", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "전체 경로에서 출발부터 종료까지 걸리는 시간의 합을 최소화해 주세요. 모든 경로의 방문 순서는 반드시 시간 우선순위가 높은 순으로 정해 주세요. 각 경로의 매 왕복 운행마다 중량·부피 등 모든 적재 항목에서 운행 중 최대 적재량이 반드시 해당 차량의 항목별 용량을 넘지 않게 해 주세요"}], "ir": "MINIMIZE( SUM(x0 in routes: duration(x0)) )\n[HARD] EACH(x1 in routes): ORDERED_BY(visit_seq(x1), time_priority, DESC)\n[HARD] EACH(x2 in routes): EACH(x3 in rounds(x2)): EACH(x4 in keys(load)): MAX(x5 in positions(x3): load[x4](x5)) <= capacity[x4](x2)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:capacity.exp_factor", "value": {"type": "decimal", "value": "1"}}], "constraint_ref": "constraint:capacity", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [{"slot_ref": "slot:time_priority_order.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:time_priority_order", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:duration_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:d0470f4217b6fef8", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "모든 경로의 시작부터 끝까지 걸리는 시간의 합을 최소화해 주세요. 모든 경로는 반드시 시간 우선순위 내림차순으로 방문하고, 각 경로의 매 왕복 운행에서 중량·부피 등 각 적재 항목의 최대 적재량은 반드시 해당 차량의 항목별 용량 이내로 유지해 주세요"}], "ir": "MINIMIZE( SUM(x0 in routes: duration(x0)) )\n[HARD] EACH(x1 in routes): ORDERED_BY(visit_seq(x1), time_priority, DESC)\n[HARD] EACH(x2 in routes): EACH(x3 in rounds(x2)): EACH(x4 in keys(load)): MAX(x5 in positions(x3): load[x4](x5)) <= capacity[x4](x2)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:capacity.exp_factor", "value": {"type": "decimal", "value": "1"}}], "constraint_ref": "constraint:capacity", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [{"slot_ref": "slot:time_priority_order.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:time_priority_order", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:duration_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:5da1487386f4ee1a", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "모든 경로의 운행시간 합을 최소화하고, 경로별 총거리·회차별 거리·정차지 간 거리는 각 기사 한도 이내로 부탁드립니다."}], "ir": "MINIMIZE( SUM(x0 in routes: duration(x0)) )\nAND( EACH(x1 in routes): travel_distance(x1) <= total_limit(x1), EACH(x2 in routes): EACH(x3 in rounds(x2)): travel_distance(x3) <= trip_limit(x2), EACH(x4 in routes): EACH(x5 in adjacent(visit_seq(x4))): travel_distance(x5) <= between_limit(x4) )", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:rider_distance.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:rider_distance", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:duration_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:e893cdca52e18f98", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "모든 경로의 총 운행시간을 최소화하는 배차를 부탁드립니다. 각 경로의 총 이동거리, 회차별 이동거리, 연속된 정차지 간 이동거리는 해당 기사에게 정해진 각각의 한도 이내로 부탁드립니다."}], "ir": "MINIMIZE( SUM(x0 in routes: duration(x0)) )\nAND( EACH(x1 in routes): travel_distance(x1) <= total_limit(x1), EACH(x2 in routes): EACH(x3 in rounds(x2)): travel_distance(x3) <= trip_limit(x2), EACH(x4 in routes): EACH(x5 in adjacent(visit_seq(x4))): travel_distance(x5) <= between_limit(x4) )", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:rider_distance.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:rider_distance", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:duration_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:2ba937c9004669a0", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "전체 이동거리 최소화해 주세요. 경로마다 외접원 반경은 반드시 10km 이하로요."}], "ir": "MINIMIZE( SUM(x0 in routes: travel_distance(x0)) )\n[HARD] EACH(x1 in routes): sec_radius(x1) <= 10 km", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:enclosing_circle_radius.exp_factor", "value": {"type": "decimal", "value": "2"}}, {"slot_ref": "slot:enclosing_circle_radius.max_radius", "value": {"type": "decimal", "value": "10000"}}], "constraint_ref": "constraint:enclosing_circle_radius", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:distance_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:67594344355e0f36", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "모든 경로의 총 이동거리를 최소화해 주세요 그리고 각 경로 정류장을 감싸는 가장 작은 원의 반경은 무조건 10km 이하여야 해요"}], "ir": "MINIMIZE( SUM(x0 in routes: travel_distance(x0)) )\n[HARD] EACH(x1 in routes): sec_radius(x1) <= 10 km", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:enclosing_circle_radius.exp_factor", "value": {"type": "decimal", "value": "2"}}, {"slot_ref": "slot:enclosing_circle_radius.max_radius", "value": {"type": "decimal", "value": "10000"}}], "constraint_ref": "constraint:enclosing_circle_radius", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:distance_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:203c3ce984fad5c5", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "전체 경로의 이동거리 합계를 가장 짧게 해 주세요. 그리고 경로마다 정차지를 다 포함하는 최소 외접원 반경이 10km를 절대 넘으면 안 돼요."}], "ir": "MINIMIZE( SUM(x0 in routes: travel_distance(x0)) )\n[HARD] EACH(x1 in routes): sec_radius(x1) <= 10 km", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:enclosing_circle_radius.exp_factor", "value": {"type": "decimal", "value": "2"}}, {"slot_ref": "slot:enclosing_circle_radius.max_radius", "value": {"type": "decimal", "value": "10000"}}], "constraint_ref": "constraint:enclosing_circle_radius", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:distance_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/base:nurse:66ccc54032022392", "domain": "nurse", "language": "ko", "messages": [{"role": "user", "content": "전체 근무의 수요 대비 부족 인원 합계를 최소화해줘. 모든 간호사는 본인 근무가 끝나고 다음 근무를 시작할 때까지 휴식시간을 12시간 이상으로 잡아줘"}], "ir": "MINIMIZE( SUM(x0 in shift_instances: unmet_demand(x0)) )\nEACH(x1 in workers): EACH(x2 in adjacent(assignment_seq(x1))): gap_duration(x2) >= 12 h", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:min_hours", "value": {"type": "duration", "unit_ref": "unit:hour", "value": "12"}}], "constraint_ref": "constraint:min_rest_hours", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:unmet_demand", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/base", "episode_id": null} {"id": "v4/base:nurse:a7f0e374e26291ab", "domain": "nurse", "language": "mixed", "messages": [{"role": "user", "content": "전체 shift의 수요 대비 부족 인원 총합을 최소화해 주세요. 모든 간호사의 연속된 두 근무 사이 rest period는 앞 근무 종료부터 다음 근무 시작까지 12시간 이상으로 잡아 주세요"}], "ir": "MINIMIZE( SUM(x0 in shift_instances: unmet_demand(x0)) )\nEACH(x1 in workers): EACH(x2 in adjacent(assignment_seq(x1))): gap_duration(x2) >= 12 h", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:min_hours", "value": {"type": "duration", "unit_ref": "unit:hour", "value": "12"}}], "constraint_ref": "constraint:min_rest_hours", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:unmet_demand", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/base", "episode_id": null} {"id": "v4/base:nurse:1d2ea39e28491ac5", "domain": "nurse", "language": "en", "messages": [{"role": "user", "content": "For the roster, minimize the total staffing shortfall against demand across all shifts. For every nurse, leave at least 12 hours between the end of each shift and the start of their next shift."}], "ir": "MINIMIZE( SUM(x0 in shift_instances: unmet_demand(x0)) )\nEACH(x1 in workers): EACH(x2 in adjacent(assignment_seq(x1))): gap_duration(x2) >= 12 h", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:min_hours", "value": {"type": "duration", "unit_ref": "unit:hour", "value": "12"}}], "constraint_ref": "constraint:min_rest_hours", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:unmet_demand", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/base", "episode_id": null} {"id": "v4/combo:nurse:1fbec57bba488dca", "domain": "nurse", "language": "ko", "messages": [{"role": "user", "content": "간호사별 근무 횟수가 가장 많은 사람과 가장 적은 사람의 차이를 줄여 주세요. 모든 간호사의 매주 근무시간은 그 주 안에 시작하고 끝나는 근무를 모두 합쳐 가능하면 44시간 이하로 해 주시고, 연속해서 배정된 두 근무 사이에는 반드시 8시간 이상 쉬도록 해 주세요"}], "ir": "MINIMIZE( RANGE(x0 in workers: workload(x0)) )\n[SOFT] EACH(x1 in workers): EACH(x2 in windows(WEEK, 1)): SUM(x3 in assignments(x1) WHERE DURING(interval(x3), x2): work_hours(x3)) <= 44 h\n[HARD] EACH(x4 in workers): EACH(x5 in adjacent(assignment_seq(x4))): gap_duration(x5) >= 8 h", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:max_hours", "value": {"type": "duration", "unit_ref": "unit:hour", "value": "44"}}], "constraint_ref": "constraint:max_hours_per_week", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:min_hours", "value": {"type": "duration", "unit_ref": "unit:hour", "value": "8"}}], "constraint_ref": "constraint:min_rest_hours", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:workload_balance", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:nurse:778d132483a2e9e1", "domain": "nurse", "language": "en", "messages": [{"role": "user", "content": "Please minimize the difference between the highest and lowest number of shifts worked across the nurses. For every nurse each week, ideally keep the total hours from all shifts that start and end within that week at or below 44 hours. Every nurse must have at least 8 hours off between consecutive shifts."}], "ir": "MINIMIZE( RANGE(x0 in workers: workload(x0)) )\n[SOFT] EACH(x1 in workers): EACH(x2 in windows(WEEK, 1)): SUM(x3 in assignments(x1) WHERE DURING(interval(x3), x2): work_hours(x3)) <= 44 h\n[HARD] EACH(x4 in workers): EACH(x5 in adjacent(assignment_seq(x4))): gap_duration(x5) >= 8 h", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:max_hours", "value": {"type": "duration", "unit_ref": "unit:hour", "value": "44"}}], "constraint_ref": "constraint:max_hours_per_week", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:min_hours", "value": {"type": "duration", "unit_ref": "unit:hour", "value": "8"}}], "constraint_ref": "constraint:min_rest_hours", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:workload_balance", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:nurse:6ac7176e4d1b762e", "domain": "nurse", "language": "ko", "messages": [{"role": "user", "content": "간호사들 중 근무 횟수가 제일 많은 사람과 제일 적은 사람의 차이를 최소화해줘. 모든 간호사는 매주 그 주 안에 시작하고 끝나는 근무의 시간을 다 합쳐 되도록 44시간 이하로 잡고, 연이어 배정된 근무 사이에는 반드시 8시간 이상 쉬게 해줘"}], "ir": "MINIMIZE( RANGE(x0 in workers: workload(x0)) )\n[SOFT] EACH(x1 in workers): EACH(x2 in windows(WEEK, 1)): SUM(x3 in assignments(x1) WHERE DURING(interval(x3), x2): work_hours(x3)) <= 44 h\n[HARD] EACH(x4 in workers): EACH(x5 in adjacent(assignment_seq(x4))): gap_duration(x5) >= 8 h", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:max_hours", "value": {"type": "duration", "unit_ref": "unit:hour", "value": "44"}}], "constraint_ref": "constraint:max_hours_per_week", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:min_hours", "value": {"type": "duration", "unit_ref": "unit:hour", "value": "8"}}], "constraint_ref": "constraint:min_rest_hours", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:workload_balance", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:eecb3ed6b35a8aa4", "domain": "routing", "language": "mixed", "messages": [{"role": "user", "content": "총 연료비 minimize, 모든 route의 회전별 반경은 반드시 3km 이내로 해 주세요"}], "ir": "MINIMIZE( SUM(x0 in routes: fuel_cost(x0)) )\n[HARD] EACH(x1 in routes): EACH(x2 in rounds(x1)): sec_radius(x2) <= 3 km", "decision_kind": "execute", "gold_decision": {"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", "value": {"type": "decimal", "value": "3000"}}], "constraint_ref": "constraint:round_enclosing_circle_radius", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fuel_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:70904fd5005c9ac5", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "모든 차량 경로의 연료비 합계가 가장 낮게 짜 주세요. 그리고 각 경로의 회전마다 그 회전 배송지를 다 포함하는 가장 작은 원의 반경이 반드시 3km 이하여야 해요."}], "ir": "MINIMIZE( SUM(x0 in routes: fuel_cost(x0)) )\n[HARD] EACH(x1 in routes): EACH(x2 in rounds(x1)): sec_radius(x2) <= 3 km", "decision_kind": "execute", "gold_decision": {"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", "value": {"type": "decimal", "value": "3000"}}], "constraint_ref": "constraint:round_enclosing_circle_radius", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fuel_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:2d4501f1e17cfb32", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "모든 차량 경로의 총 이동거리를 최소화해 주시기 바랍니다. 각 경로의 회전마다 방문지를 모두 감싸는 가장 작은 원의 반경은 반드시 8km 이하여야 하고, 서로 2km 이내에 있는 배송지끼리는 같은 경로로 배정 부탁드립니다"}], "ir": "MINIMIZE( SUM(x0 in routes: travel_distance(x0)) )\n[HARD] EACH(x1 in routes): EACH(x2 in rounds(x1)): sec_radius(x2) <= 8 km\nEACH((x3, x4) in pairs(visits, nearby(2 km))): TOGETHER(x3, x4, route)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:nearby_delivery_grouping.distance_threshold", "value": {"type": "decimal", "value": "2000"}}, {"slot_ref": "slot:nearby_delivery_grouping.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:nearby_delivery_grouping", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [{"slot_ref": "slot:round_enclosing_circle_radius.exp_factor", "value": {"type": "decimal", "value": "2"}}, {"slot_ref": "slot:round_enclosing_circle_radius.max_radius", "value": {"type": "decimal", "value": "8000"}}], "constraint_ref": "constraint:round_enclosing_circle_radius", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:distance_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/residual:nurse:eb46746875b3aabd", "domain": "nurse", "language": "ko", "messages": [{"role": "user", "content": "모든 근무 시간대에서 수요 대비 부족 인원의 총합이 최소가 되도록 근무표를 짜 주세요. 그리고 4시 이전에 시작하는 근무는 없어야 해요"}], "ir": "MINIMIZE( SUM(x0 in shift_instances: unmet_demand(x0)) )\nUNEXPRESSED(literal, constraint)", "decision_kind": "unsupported", "gold_decision": {"kind": "unsupported", "reason_code": "semantic_not_declared", "related_refs": []}, "stratum": "v4/residual", "episode_id": null} {"id": "v4/residual:nurse:c00741d8abfddec3", "domain": "nurse", "language": "ko", "messages": [{"role": "user", "content": "전체 근무에 걸쳐 수요 대비 인력 부족분의 총합을 최소화해 주시기 바랍니다. 근무는 새벽 4시 전에 시작할 수 없습니다"}], "ir": "MINIMIZE( SUM(x0 in shift_instances: unmet_demand(x0)) )\nUNEXPRESSED(literal, constraint)", "decision_kind": "unsupported", "gold_decision": {"kind": "unsupported", "reason_code": "semantic_not_declared", "related_refs": []}, "stratum": "v4/residual", "episode_id": null} {"id": "v4/residual:nurse:a891fdc9b1c1e821", "domain": "nurse", "language": "ko", "messages": [{"role": "user", "content": "전체 근무 인력 부족 총합 최소화, 4시 이전 시작 근무 불가 부탁드립니다"}], "ir": "MINIMIZE( SUM(x0 in shift_instances: unmet_demand(x0)) )\nUNEXPRESSED(literal, constraint)", "decision_kind": "unsupported", "gold_decision": {"kind": "unsupported", "reason_code": "semantic_not_declared", "related_refs": []}, "stratum": "v4/residual", "episode_id": null} {"id": "v4/fragment:routing:6526dc74320f5e70", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "가능하면 모든 경로에서 차고지 왕복 횟수는 해당 경로 담당 기사의 개인별 왕복 횟수 한도 이내로, 각 왕복에서 방문하는 서로 다른 배송지 수는 해당 기사의 개인별 왕복당 배송지 수 한도 이내로 맞춰 주시기 바랍니다. 각 경로 전체에서 방문하는 서로 다른 배송지 수도 해당 기사의 개인별 배송지 수 한도 이내로 맞춰 주시면 감사하겠습니다."}], "ir": "[SOFT] AND( EACH(x0 in routes): round_count(x0) <= max_rounds(x0), EACH(x1 in routes): EACH(x2 in rounds(x1)): stop_count(x2) <= max_stops_per_round(x1), EACH(x3 in routes): stop_count(x3) <= max_stops(x3) )", "decision_kind": "clarify", "gold_decision": {"candidate_refs": [], "kind": "clarify", "missing_field_refs": [], "reason_code": "missing_value", "required_inputs": [{"field": "objectives", "kind": "decision_field"}]}, "stratum": "v4/fragment", "episode_id": null} {"id": "v4/multi:routing:2d6e10358c414e97", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "전체 경로의 출발부터 종료까지 걸리는 시간을 합해서 최소화해 주세요. 모든 경로에서 차고지 왕복 횟수, 왕복 한 번당 서로 다른 정차 지점 수, 경로 전체의 서로 다른 정차 지점 수는 각각 담당 기사에게 정해진 왕복 횟수 한도, 왕복당 정차 지점 수 한도, 전체 정차 지점 수 한도 이내로 잡고, 모든 배송지에서의 출발 시각은 해당 배송의 허용 마감 시각을 넘지 않게 해 주세요"}], "ir": "MINIMIZE( SUM(x0 in routes: duration(x0)) )\nAND( EACH(x1 in routes): round_count(x1) <= max_rounds(x1), EACH(x2 in routes): EACH(x3 in rounds(x2)): stop_count(x3) <= max_stops_per_round(x2), EACH(x4 in routes): stop_count(x4) <= max_stops(x4) )\nEACH(x5 in visits): departure_time(x5) <= tw_late(x5)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:rider_delivery_length.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:rider_delivery_length", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:time_window.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:time_window", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:duration_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/multi", "episode_id": null} {"id": "v4/multi:routing:93df005c7880b3c4", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "모든 경로의 시작부터 끝까지 소요되는 시간의 합을 최소화하는 배차를 부탁드립니다. 각 경로의 차고지 왕복 횟수와 왕복별 서로 다른 정차 지점 수, 경로 전체의 서로 다른 정차 지점 수는 담당 기사별로 정해진 각 한도 이내로 설정하고, 모든 배송지에서 출발하는 시각은 해당 배송에 허용된 마지막 시각 이내로 설정해 주시기 바랍니다."}], "ir": "MINIMIZE( SUM(x0 in routes: duration(x0)) )\nAND( EACH(x1 in routes): round_count(x1) <= max_rounds(x1), EACH(x2 in routes): EACH(x3 in rounds(x2)): stop_count(x3) <= max_stops_per_round(x2), EACH(x4 in routes): stop_count(x4) <= max_stops(x4) )\nEACH(x5 in visits): departure_time(x5) <= tw_late(x5)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:rider_delivery_length.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:rider_delivery_length", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:time_window.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:time_window", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:duration_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/multi", "episode_id": null} {"id": "v4/multi:routing:8a7182bced0b0be9", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "각 경로를 시작해서 마칠 때까지 걸리는 시간의 총합을 최소화해 주세요. 모든 경로는 담당 기사의 차고지 왕복 횟수 한도와 왕복당 서로 다른 정차 지점 수 한도, 경로 전체의 서로 다른 정차 지점 수 한도 안에서 짜고, 모든 배송은 배송지 출발 시각이 해당 배송의 허용 종료 시각보다 늦지 않게 해 주세요"}], "ir": "MINIMIZE( SUM(x0 in routes: duration(x0)) )\nAND( EACH(x1 in routes): round_count(x1) <= max_rounds(x1), EACH(x2 in routes): EACH(x3 in rounds(x2)): stop_count(x3) <= max_stops_per_round(x2), EACH(x4 in routes): stop_count(x4) <= max_stops(x4) )\nEACH(x5 in visits): departure_time(x5) <= tw_late(x5)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:rider_delivery_length.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:rider_delivery_length", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:time_window.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:time_window", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:duration_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/multi", "episode_id": null} {"id": "v4/combo:routing:b928988e640219ff", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "전체 경로에서 차량 사용에 드는 고정 운영비 합계를 최소화해 주세요. 모든 경로의 배송 건수는 반드시 12건 이하로 하고, 각 경로의 총 이동거리는 담당 기사별 총 거리 한도, 각 경로 내 매 회차의 왕복 이동거리는 담당 기사별 회차당 거리 한도, 연속한 두 배송지 사이 이동거리는 담당 기사별 배송지 간 거리 한도를 반드시 넘지 않게 해 주세요"}], "ir": "MINIMIZE( SUM(x0 in routes: fixed_cost(x0)) )\n[HARD] EACH(x1 in routes): delivery_count(x1) <= 12\n[HARD] AND( EACH(x2 in routes): travel_distance(x2) <= total_limit(x2), EACH(x3 in routes): EACH(x4 in rounds(x3)): travel_distance(x4) <= trip_limit(x3), EACH(x5 in routes): EACH(x6 in adjacent(visit_seq(x5))): travel_distance(x6) <= between_limit(x5) )", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:delivery_length.exp_factor", "value": {"type": "decimal", "value": "2"}}, {"slot_ref": "slot:delivery_length.max_size", "value": {"type": "decimal", "value": "12"}}], "constraint_ref": "constraint:delivery_length", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [{"slot_ref": "slot:rider_distance.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:rider_distance", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fixed_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:b81becddce6ddf5c", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "전체 경로에 걸쳐 차량 사용 고정 운영비의 합계를 최소화해줘. 경로마다 배송은 반드시 12건 이하로 잡아줘. 모든 경로에서 총 이동거리는 해당 기사에게 정해진 총 거리 한도 이내로, 매 회차 왕복 이동거리는 해당 기사의 회차당 거리 한도 이내로, 연속해서 방문하는 두 배송지 간 이동거리는 해당 기사의 배송지 간 거리 한도 이내로 반드시 맞춰줘"}], "ir": "MINIMIZE( SUM(x0 in routes: fixed_cost(x0)) )\n[HARD] EACH(x1 in routes): delivery_count(x1) <= 12\n[HARD] AND( EACH(x2 in routes): travel_distance(x2) <= total_limit(x2), EACH(x3 in routes): EACH(x4 in rounds(x3)): travel_distance(x4) <= trip_limit(x3), EACH(x5 in routes): EACH(x6 in adjacent(visit_seq(x5))): travel_distance(x6) <= between_limit(x5) )", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:delivery_length.exp_factor", "value": {"type": "decimal", "value": "2"}}, {"slot_ref": "slot:delivery_length.max_size", "value": {"type": "decimal", "value": "12"}}], "constraint_ref": "constraint:delivery_length", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [{"slot_ref": "slot:rider_distance.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:rider_distance", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fixed_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:e34b4bc41b3b6928", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "모든 경로의 차량 사용 고정 운영비를 합한 금액을 최소화해 주세요. 각 경로의 배송 건수는 반드시 12건을 넘지 않게 해 주세요. 모든 경로의 총 이동거리와 경로 내 매 회차의 왕복 이동거리, 연속 방문하는 두 배송지 사이 이동거리는 각각 그 경로 담당 기사에게 정해진 총 거리 한도와 회차당 거리 한도, 배송지 간 거리 한도를 반드시 지켜 주세요"}], "ir": "MINIMIZE( SUM(x0 in routes: fixed_cost(x0)) )\n[HARD] EACH(x1 in routes): delivery_count(x1) <= 12\n[HARD] AND( EACH(x2 in routes): travel_distance(x2) <= total_limit(x2), EACH(x3 in routes): EACH(x4 in rounds(x3)): travel_distance(x4) <= trip_limit(x3), EACH(x5 in routes): EACH(x6 in adjacent(visit_seq(x5))): travel_distance(x6) <= between_limit(x5) )", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:delivery_length.exp_factor", "value": {"type": "decimal", "value": "2"}}, {"slot_ref": "slot:delivery_length.max_size", "value": {"type": "decimal", "value": "12"}}], "constraint_ref": "constraint:delivery_length", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [{"slot_ref": "slot:rider_distance.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:rider_distance", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fixed_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:retail:2d4e6d0427dc9e26", "domain": "retail", "language": "ko", "messages": [{"role": "user", "content": "이익을 최대화해 주세요. 발주는 가능하면 각 상품의 발주 가능 요일에 넣어 주시고, 모든 상품의 재고는 반드시 입고일에 유통기한만큼 더한 날이 소비 마감일이 되게 해 주세요."}], "ir": "MAXIMIZE( profit )\n[SOFT] EACH(x0 in orders): day_of_week(x0) IN allowed_order_days(x0)\n[HARD] EACH(x1 in items): EACH(x2 in units(x1)): expiry_day(x2) = offset(arrival_day(x2), product_life(x1))", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:order_days", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [], "constraint_ref": "constraint:shelf_life", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:maximize_profit", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:020730a1c5433024", "domain": "routing", "language": "mixed", "messages": [{"role": "user", "content": "전체 route의 총 이동거리와 총 연료비를 모두 줄이도록 배차해 주세요 각 route의 방문 순서는 가능하면 시간 priority가 높은 곳부터 낮은 곳 순으로 잡아 주세요"}], "ir": "MINIMIZE( SUM(x0 in routes: travel_distance(x0)) )\nMINIMIZE( SUM(x1 in routes: fuel_cost(x1)) )\n[SOFT] EACH(x2 in routes): ORDERED_BY(visit_seq(x2), time_priority, DESC)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:time_priority_order.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:time_priority_order", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:distance_cost", "weight": "1/2"}, {"objective_ref": "objective:fuel_cost", "weight": "1/2"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:dee59c51f841bbb5", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "전체 경로를 합친 총 이동거리랑 총 연료비를 둘 다 줄여줘. 각 경로에서는 가능하면 시간 우선순위가 높은 곳부터 낮은 곳 순서로 방문하게 해줘."}], "ir": "MINIMIZE( SUM(x0 in routes: travel_distance(x0)) )\nMINIMIZE( SUM(x1 in routes: fuel_cost(x1)) )\n[SOFT] EACH(x2 in routes): ORDERED_BY(visit_seq(x2), time_priority, DESC)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:time_priority_order.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:time_priority_order", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:distance_cost", "weight": "1/2"}, {"objective_ref": "objective:fuel_cost", "weight": "1/2"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:a741a8fa72c01f14", "domain": "routing", "language": "en", "messages": [{"role": "user", "content": "Plan the routes to minimize both total travel distance and total fuel cost across all routes. If possible, arrange the visits on every route from highest to lowest time priority."}], "ir": "MINIMIZE( SUM(x0 in routes: travel_distance(x0)) )\nMINIMIZE( SUM(x1 in routes: fuel_cost(x1)) )\n[SOFT] EACH(x2 in routes): ORDERED_BY(visit_seq(x2), time_priority, DESC)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:time_priority_order.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:time_priority_order", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:distance_cost", "weight": "1/2"}, {"objective_ref": "objective:fuel_cost", "weight": "1/2"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:5e57a5635dacfc9a", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "전체 경로의 차량 고정 운영비 합계를 최소화해 주세요. 서로 2km 이내인 배송지는 각 쌍을 같은 경로에 배정해 주세요. 모든 경로에서 매 왕복 운행 중 지점별 적재량의 최댓값이 중량이나 부피 등 각 적재 항목별로 해당 차량의 용량을 넘지 않게 해 주세요."}], "ir": "MINIMIZE( SUM(x0 in routes: fixed_cost(x0)) )\nEACH((x1, x2) in pairs(visits, nearby(2 km))): TOGETHER(x1, x2, route)\nEACH(x3 in routes): EACH(x4 in rounds(x3)): EACH(x5 in keys(load)): MAX(x6 in positions(x4): load[x5](x6)) <= capacity[x5](x3)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:capacity.exp_factor", "value": {"type": "decimal", "value": "1"}}], "constraint_ref": "constraint:capacity", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [{"slot_ref": "slot:nearby_delivery_grouping.distance_threshold", "value": {"type": "decimal", "value": "2000"}}, {"slot_ref": "slot:nearby_delivery_grouping.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:nearby_delivery_grouping", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fixed_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:7c23ebe181179ce9", "domain": "routing", "language": "mixed", "messages": [{"role": "user", "content": "전체 route의 차량 고정 운영비 총액을 최소화해 주세요. 서로 2km 이내인 배송지는 각 쌍을 같은 route로 묶어 주세요. 모든 route의 매 왕복 운행에서 중량, 부피 등 각 적재 항목별로 지점별 적재량의 최댓값이 해당 차량의 capacity 이내가 되게 해 주세요"}], "ir": "MINIMIZE( SUM(x0 in routes: fixed_cost(x0)) )\nEACH((x1, x2) in pairs(visits, nearby(2 km))): TOGETHER(x1, x2, route)\nEACH(x3 in routes): EACH(x4 in rounds(x3)): EACH(x5 in keys(load)): MAX(x6 in positions(x4): load[x5](x6)) <= capacity[x5](x3)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:capacity.exp_factor", "value": {"type": "decimal", "value": "1"}}], "constraint_ref": "constraint:capacity", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [{"slot_ref": "slot:nearby_delivery_grouping.distance_threshold", "value": {"type": "decimal", "value": "2000"}}, {"slot_ref": "slot:nearby_delivery_grouping.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:nearby_delivery_grouping", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fixed_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:6de56d82ac83fe2a", "domain": "routing", "language": "en", "messages": [{"role": "user", "content": "Minimize the total fixed vehicle operating cost across all routes. Assign every pair of deliveries within 2 km of each other to the same route. For every round trip on every route, keep the highest load across the points along that round trip within the route's vehicle capacity for each cargo dimension"}], "ir": "MINIMIZE( SUM(x0 in routes: fixed_cost(x0)) )\nEACH((x1, x2) in pairs(visits, nearby(2 km))): TOGETHER(x1, x2, route)\nEACH(x3 in routes): EACH(x4 in rounds(x3)): EACH(x5 in keys(load)): MAX(x6 in positions(x4): load[x5](x6)) <= capacity[x5](x3)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:capacity.exp_factor", "value": {"type": "decimal", "value": "1"}}], "constraint_ref": "constraint:capacity", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [{"slot_ref": "slot:nearby_delivery_grouping.distance_threshold", "value": {"type": "decimal", "value": "2000"}}, {"slot_ref": "slot:nearby_delivery_grouping.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:nearby_delivery_grouping", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fixed_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/multi:routing:17f526faa58f970c", "domain": "routing", "language": "en", "messages": [{"role": "user", "content": "Minimize the total fixed vehicle operating cost across all routes and the sum of arrival times across all deliveries, with each arrival time weighted by that delivery's time priority. Put every pair of deliveries within 300 m of each other on the same route."}], "ir": "MINIMIZE( SUM(x0 in routes: fixed_cost(x0)) )\nMINIMIZE( SUM(x1 in visits: priority_weighted_arrival(x1)) )\nEACH((x2, x3) in pairs(visits, nearby(300 m))): TOGETHER(x2, x3, route)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:delivery_time_priority.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:delivery_time_priority", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:nearby_delivery_grouping.distance_threshold", "value": {"type": "decimal", "value": "300"}}, {"slot_ref": "slot:nearby_delivery_grouping.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:nearby_delivery_grouping", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fixed_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/multi", "episode_id": null} {"id": "v4/multi:routing:0225390ec8a9351b", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "전체 경로의 차량 고정 운영비 합계랑, 각 배송의 도착 시간에 해당 배송의 시간 우선순위를 반영한 값의 합계를 줄여줘. 서로 300m 이내인 배송지는 모든 쌍을 같은 경로로 묶어줘"}], "ir": "MINIMIZE( SUM(x0 in routes: fixed_cost(x0)) )\nMINIMIZE( SUM(x1 in visits: priority_weighted_arrival(x1)) )\nEACH((x2, x3) in pairs(visits, nearby(300 m))): TOGETHER(x2, x3, route)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:delivery_time_priority.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:delivery_time_priority", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:nearby_delivery_grouping.distance_threshold", "value": {"type": "decimal", "value": "300"}}, {"slot_ref": "slot:nearby_delivery_grouping.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:nearby_delivery_grouping", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fixed_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/multi", "episode_id": null} {"id": "v4/multi:routing:29a1d1ba35e95eba", "domain": "routing", "language": "en", "messages": [{"role": "user", "content": "For this delivery plan, minimize the total fixed vehicle operating cost across all routes. Also minimize the sum of arrival times across all deliveries, weighting each arrival time by that delivery's time priority. Assign every pair of deliveries within 300 m of each other to the same route."}], "ir": "MINIMIZE( SUM(x0 in routes: fixed_cost(x0)) )\nMINIMIZE( SUM(x1 in visits: priority_weighted_arrival(x1)) )\nEACH((x2, x3) in pairs(visits, nearby(300 m))): TOGETHER(x2, x3, route)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:delivery_time_priority.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:delivery_time_priority", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:nearby_delivery_grouping.distance_threshold", "value": {"type": "decimal", "value": "300"}}, {"slot_ref": "slot:nearby_delivery_grouping.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:nearby_delivery_grouping", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fixed_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/multi", "episode_id": null} {"id": "v4/combo:routing:ee7d223c7d65898d", "domain": "routing", "language": "en", "messages": [{"role": "user", "content": "Minimize total fuel cost and total travel distance across all routes; both matter. If possible, keep every route within 8 km."}], "ir": "MINIMIZE( SUM(x0 in routes: fuel_cost(x0)) )\nMINIMIZE( SUM(x1 in routes: travel_distance(x1)) )\n[SOFT] EACH(x2 in routes): travel_distance(x2) <= 8 km", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:max_distance.exp_factor", "value": {"type": "decimal", "value": "1"}}, {"slot_ref": "slot:max_distance.max_distance", "value": {"type": "decimal", "value": "8000"}}], "constraint_ref": "constraint:max_distance", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:distance_cost", "weight": "1/2"}, {"objective_ref": "objective:fuel_cost", "weight": "1/2"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:d65b70d2133f37d4", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "전체 운행 경로의 연료비 합계와 이동거리 합계를 모두 최소화하는 배차 계획을 부탁드립니다. 가능하면 각 경로의 이동거리는 8km 이내로 잡아 주시기 바랍니다."}], "ir": "MINIMIZE( SUM(x0 in routes: fuel_cost(x0)) )\nMINIMIZE( SUM(x1 in routes: travel_distance(x1)) )\n[SOFT] EACH(x2 in routes): travel_distance(x2) <= 8 km", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:max_distance.exp_factor", "value": {"type": "decimal", "value": "1"}}, {"slot_ref": "slot:max_distance.max_distance", "value": {"type": "decimal", "value": "8000"}}], "constraint_ref": "constraint:max_distance", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:distance_cost", "weight": "1/2"}, {"objective_ref": "objective:fuel_cost", "weight": "1/2"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:fead54ae34f6d319", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "모든 경로를 합친 총연료비와 총이동거리를 모두 최소화해 주시기 바랍니다. 각 경로는 가능하면 이동거리가 8km를 넘지 않도록 배차 부탁드립니다"}], "ir": "MINIMIZE( SUM(x0 in routes: fuel_cost(x0)) )\nMINIMIZE( SUM(x1 in routes: travel_distance(x1)) )\n[SOFT] EACH(x2 in routes): travel_distance(x2) <= 8 km", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:max_distance.exp_factor", "value": {"type": "decimal", "value": "1"}}, {"slot_ref": "slot:max_distance.max_distance", "value": {"type": "decimal", "value": "8000"}}], "constraint_ref": "constraint:max_distance", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:distance_cost", "weight": "1/2"}, {"objective_ref": "objective:fuel_cost", "weight": "1/2"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/base:retail:51a6c757d1ed91f1", "domain": "retail", "language": "ko", "messages": [{"role": "user", "content": "재고 폐기율을 최소화해 주세요. 모든 보충 발주는 해당 품목의 발주 가능 요일에 넣어 주세요."}], "ir": "MINIMIZE( waste_rate )\nEACH(x0 in orders): day_of_week(x0) IN allowed_order_days(x0)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:order_days", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:minimize_waste", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/base", "episode_id": null} {"id": "v4/base:retail:8008511b7067ebcc", "domain": "retail", "language": "en", "messages": [{"role": "user", "content": "Minimize the stock discard rate; place each replenishment order on an allowed order day for that item."}], "ir": "MINIMIZE( waste_rate )\nEACH(x0 in orders): day_of_week(x0) IN allowed_order_days(x0)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:order_days", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:minimize_waste", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/base", "episode_id": null} {"id": "v4/base:retail:f5e1716222805422", "domain": "retail", "language": "mixed", "messages": [{"role": "user", "content": "재고 폐기율 최소화하고, 보충 order마다 해당 품목 order days에 맞춰 발주해줘."}], "ir": "MINIMIZE( waste_rate )\nEACH(x0 in orders): day_of_week(x0) IN allowed_order_days(x0)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:order_days", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:minimize_waste", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/base", "episode_id": null} {"id": "v4/perturb:routing:2fd77cff44a8829e", "domain": "routing", "language": "en", "messages": [{"role": "user", "content": "Minimize the sum of the start-to-finish times of all routes. For every route, keep the number of deliveries on each round trip at 3 or more."}], "ir": "MINIMIZE( SUM(x0 in routes: duration(x0)) )\nEACH(x1 in routes): EACH(x2 in rounds(x1)): delivery_count(x2) >= 3", "decision_kind": "unsupported", "gold_decision": {"kind": "unsupported", "reason_code": "semantic_not_declared", "related_refs": []}, "stratum": "v4/perturb", "episode_id": null} {"id": "v4/perturb:routing:74637f521b1a16e5", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "모든 배송 경로의 시작부터 끝까지 걸리는 시간을 합쳐서 최소화해줘 각 경로에서 매번 왕복할 때마다 배송은 3건 이상으로 해줘"}], "ir": "MINIMIZE( SUM(x0 in routes: duration(x0)) )\nEACH(x1 in routes): EACH(x2 in rounds(x1)): delivery_count(x2) >= 3", "decision_kind": "unsupported", "gold_decision": {"kind": "unsupported", "reason_code": "semantic_not_declared", "related_refs": []}, "stratum": "v4/perturb", "episode_id": null} {"id": "v4/perturb:routing:3f1344462cb139bd", "domain": "routing", "language": "en", "messages": [{"role": "user", "content": "Minimize the total time across all routes, adding up each route's time from start to finish. Each round trip on every route is to have at least 3 deliveries"}], "ir": "MINIMIZE( SUM(x0 in routes: duration(x0)) )\nEACH(x1 in routes): EACH(x2 in rounds(x1)): delivery_count(x2) >= 3", "decision_kind": "unsupported", "gold_decision": {"kind": "unsupported", "reason_code": "semantic_not_declared", "related_refs": []}, "stratum": "v4/perturb", "episode_id": null} {"id": "v4/combo:routing:5f7b96df702b6ac0", "domain": "routing", "language": "en", "messages": [{"role": "user", "content": "Keep the total fixed cost of the vehicles used across all routes as low as possible. Each route must never have more than 12 deliveries. Ideally no delivery's service time overlaps its no-delivery window, and if possible every rider's waiting time at each stop stays within their own wait limit, and every route and every round trip finishes by that rider's end of work hours and round window end"}], "ir": "MINIMIZE( SUM(x0 in routes: fixed_cost(x0)) )\n[HARD] EACH(x1 in routes): delivery_count(x1) <= 12\n[SOFT] EACH(x2 in visits): NOT OVERLAPS(service_interval(x2), prohibited_window(x2))\n[SOFT] AND( EACH(x3 in routes): EACH(x4 in visits(x3)): wait_duration(x4) <= max_wait(x3), EACH(x5 in routes): end_time(x5) <= work_end(x5), EACH(x6 in routes): EACH(x7 in rounds(x6)): end_time(x7) <= round_window_end(x6) )", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:prohibited_time_window", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:delivery_length.exp_factor", "value": {"type": "decimal", "value": "2"}}, {"slot_ref": "slot:delivery_length.max_size", "value": {"type": "decimal", "value": "12"}}], "constraint_ref": "constraint:delivery_length", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [{"slot_ref": "slot:rider_time_window.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:rider_time_window", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fixed_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:5bd231f98f8cbea1", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "전체 경로에서 차량 고정 비용 총합을 최소화하는 방향으로 배차 부탁드립니다. 한 경로당 배송 건수는 반드시 12건 이하여야 합니다. 그리고 가능하면 각 배송의 서비스 시간이 배달 금지 시간대와 겹치지 않도록 하고, 되도록 기사별 대기 시간 한도, 근무 종료 시각, 라운드 종료 시각도 각 기사 기준 안에서 지켜지게 부탁드립니다."}], "ir": "MINIMIZE( SUM(x0 in routes: fixed_cost(x0)) )\n[HARD] EACH(x1 in routes): delivery_count(x1) <= 12\n[SOFT] EACH(x2 in visits): NOT OVERLAPS(service_interval(x2), prohibited_window(x2))\n[SOFT] AND( EACH(x3 in routes): EACH(x4 in visits(x3)): wait_duration(x4) <= max_wait(x3), EACH(x5 in routes): end_time(x5) <= work_end(x5), EACH(x6 in routes): EACH(x7 in rounds(x6)): end_time(x7) <= round_window_end(x6) )", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:prohibited_time_window", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:delivery_length.exp_factor", "value": {"type": "decimal", "value": "2"}}, {"slot_ref": "slot:delivery_length.max_size", "value": {"type": "decimal", "value": "12"}}], "constraint_ref": "constraint:delivery_length", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [{"slot_ref": "slot:rider_time_window.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:rider_time_window", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fixed_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:15c927dc7556078f", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "차량 고정비용 전체 합 최소로 가자. 경로마다 배송 12건 넘는 건 무조건 안 돼. 가능하면 금지 시간대 안 겹치게 하고, 되도록 기사별 대기시간 한도랑 근무 종료, 라운드 종료 시간도 다 지켜줘."}], "ir": "MINIMIZE( SUM(x0 in routes: fixed_cost(x0)) )\n[HARD] EACH(x1 in routes): delivery_count(x1) <= 12\n[SOFT] EACH(x2 in visits): NOT OVERLAPS(service_interval(x2), prohibited_window(x2))\n[SOFT] AND( EACH(x3 in routes): EACH(x4 in visits(x3)): wait_duration(x4) <= max_wait(x3), EACH(x5 in routes): end_time(x5) <= work_end(x5), EACH(x6 in routes): EACH(x7 in rounds(x6)): end_time(x7) <= round_window_end(x6) )", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:prohibited_time_window", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:delivery_length.exp_factor", "value": {"type": "decimal", "value": "2"}}, {"slot_ref": "slot:delivery_length.max_size", "value": {"type": "decimal", "value": "12"}}], "constraint_ref": "constraint:delivery_length", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [{"slot_ref": "slot:rider_time_window.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:rider_time_window", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fixed_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:d7b08be0f21bc29d", "domain": "routing", "language": "en", "messages": [{"role": "user", "content": "Planning tomorrow's routes now. Keep the total fixed operating cost of the vehicles used across all routes as low as possible. Also, if possible, keep each route's enclosing circle radius within 10 km, and ideally within that rider's own radius limit too"}], "ir": "MINIMIZE( SUM(x0 in routes: fixed_cost(x0)) )\n[SOFT] EACH(x1 in routes): sec_radius(x1) <= 10 km\n[SOFT] EACH(x2 in routes): sec_radius(x2) <= individual_radius_limit(x2)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:enclosing_circle_radius.exp_factor", "value": {"type": "decimal", "value": "2"}}, {"slot_ref": "slot:enclosing_circle_radius.max_radius", "value": {"type": "decimal", "value": "10000"}}], "constraint_ref": "constraint:enclosing_circle_radius", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:individual_enclosing_circle_radius.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:individual_enclosing_circle_radius", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fixed_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:18d5779000126807", "domain": "routing", "language": "en", "messages": [{"role": "user", "content": "Minimize the total fixed cost of the vehicles across all routes, and if possible keep every route's enclosing circle within 10 km radius and within each rider's own radius limit."}], "ir": "MINIMIZE( SUM(x0 in routes: fixed_cost(x0)) )\n[SOFT] EACH(x1 in routes): sec_radius(x1) <= 10 km\n[SOFT] EACH(x2 in routes): sec_radius(x2) <= individual_radius_limit(x2)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:enclosing_circle_radius.exp_factor", "value": {"type": "decimal", "value": "2"}}, {"slot_ref": "slot:enclosing_circle_radius.max_radius", "value": {"type": "decimal", "value": "10000"}}], "constraint_ref": "constraint:enclosing_circle_radius", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:individual_enclosing_circle_radius.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:individual_enclosing_circle_radius", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fixed_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:54129203362024e3", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "내일 배차 짜려고 해요. 모든 경로에서 쓰는 차량의 고정 비용 합계가 최소가 되게 해 주세요. 그리고 가능하면 각 경로의 외접원 반경은 10km 이하로, 또 되도록 기사님별 반경 제한 안에서 나오게 해 주세요."}], "ir": "MINIMIZE( SUM(x0 in routes: fixed_cost(x0)) )\n[SOFT] EACH(x1 in routes): sec_radius(x1) <= 10 km\n[SOFT] EACH(x2 in routes): sec_radius(x2) <= individual_radius_limit(x2)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:enclosing_circle_radius.exp_factor", "value": {"type": "decimal", "value": "2"}}, {"slot_ref": "slot:enclosing_circle_radius.max_radius", "value": {"type": "decimal", "value": "10000"}}], "constraint_ref": "constraint:enclosing_circle_radius", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:individual_enclosing_circle_radius.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:individual_enclosing_circle_radius", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fixed_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:fa8b0d0a5710bb92", "domain": "routing", "language": "en", "messages": [{"role": "user", "content": "Can you plan today's routes so the total distance driven across all routes is as short as possible? Also, no delivery can ever be serviced during its prohibited time window, that's a must"}], "ir": "MINIMIZE( SUM(x0 in routes: travel_distance(x0)) )\n[HARD] EACH(x1 in visits): NOT OVERLAPS(service_interval(x1), prohibited_window(x1))", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:prohibited_time_window", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:distance_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:631534055da74114", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "전체 경로 총 이동거리 최소화로 짜줘, 배달 금지 시간대엔 절대 방문하면 안 돼"}], "ir": "MINIMIZE( SUM(x0 in routes: travel_distance(x0)) )\n[HARD] EACH(x1 in visits): NOT OVERLAPS(service_interval(x1), prohibited_window(x1))", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:prohibited_time_window", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:distance_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:53b1a95510214807", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "모든 경로의 총 이동거리를 최소로 해 주세요. 각 배달은 금지 시간대와 겹치면 안 되고 반드시 지켜 주세요"}], "ir": "MINIMIZE( SUM(x0 in routes: travel_distance(x0)) )\n[HARD] EACH(x1 in visits): NOT OVERLAPS(service_interval(x1), prohibited_window(x1))", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:prohibited_time_window", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:distance_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:0897d19c8956cb53", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "전체 경로 이동거리 총합 최소화로 짜줘. 경로마다 배송 건수는 3건 이하로 하고, 가능하면 경로별 외접원 반경은 8km 이내로 되도록 해줘. 그리고 각 경로 회전 수는 기사 계약 회전 수 이상이어야 해, 이건 반드시 지켜"}], "ir": "MINIMIZE( SUM(x0 in routes: travel_distance(x0)) )\nEACH(x1 in routes): delivery_count(x1) <= 3\n[SOFT] EACH(x2 in routes): sec_radius(x2) <= 8 km\n[HARD] EACH(x3 in routes): round_count(x3) >= base_rounds(x3)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:minimum_round", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [{"slot_ref": "slot:delivery_length.exp_factor", "value": {"type": "decimal", "value": "2"}}, {"slot_ref": "slot:delivery_length.max_size", "value": {"type": "decimal", "value": "3"}}], "constraint_ref": "constraint:delivery_length", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:enclosing_circle_radius.exp_factor", "value": {"type": "decimal", "value": "2"}}, {"slot_ref": "slot:enclosing_circle_radius.max_radius", "value": {"type": "decimal", "value": "8000"}}], "constraint_ref": "constraint:enclosing_circle_radius", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:distance_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:bdaf95d13d7f5eaa", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "전체 배송 경로의 이동거리 합계를 최소화하고, 가능하면 모든 배송의 작업 시간이 각 배송의 방문 금지 시간대와 겹치지 않게 해 주세요. 모든 경로는 방문 지점을 전부 포함하는 가장 작은 원의 반경이 반드시 해당 경로 담당 기사님의 개별 반경 한도 이하여야 해요."}], "ir": "MINIMIZE( SUM(x0 in routes: travel_distance(x0)) )\n[SOFT] EACH(x1 in visits): NOT OVERLAPS(service_interval(x1), prohibited_window(x1))\n[HARD] EACH(x2 in routes): sec_radius(x2) <= individual_radius_limit(x2)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:prohibited_time_window", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:individual_enclosing_circle_radius.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:individual_enclosing_circle_radius", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:distance_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:8e0b239632411e1a", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "전체 경로 이동거리 합계를 최소화하고, 배송마다 작업 시간이 그 배송의 방문 금지 시간대랑 되도록 겹치지 않게 해줘. 각 경로의 방문 지점을 모두 감싸는 가장 작은 원의 반경은 반드시 그 경로 담당 기사한테 정해진 반경 한도를 넘지 않게 해줘"}], "ir": "MINIMIZE( SUM(x0 in routes: travel_distance(x0)) )\n[SOFT] EACH(x1 in visits): NOT OVERLAPS(service_interval(x1), prohibited_window(x1))\n[HARD] EACH(x2 in routes): sec_radius(x2) <= individual_radius_limit(x2)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:prohibited_time_window", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:individual_enclosing_circle_radius.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:individual_enclosing_circle_radius", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:distance_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:9db7489f8a72bd81", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "배차할 때 전체 배송 경로의 이동거리 합계를 최소화해 주세요. 모든 배송은 가능하면 작업 시간이 해당 배송의 방문 금지 시간대와 겹치지 않게 해 주세요. 각 경로의 방문 지점을 모두 포함하는 가장 작은 원의 반경은 반드시 해당 경로 담당 기사님의 개별 반경 한도 이내로 잡아 주세요."}], "ir": "MINIMIZE( SUM(x0 in routes: travel_distance(x0)) )\n[SOFT] EACH(x1 in visits): NOT OVERLAPS(service_interval(x1), prohibited_window(x1))\n[HARD] EACH(x2 in routes): sec_radius(x2) <= individual_radius_limit(x2)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:prohibited_time_window", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:individual_enclosing_circle_radius.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:individual_enclosing_circle_radius", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:distance_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:fa2310d490ef211a", "domain": "routing", "language": "mixed", "messages": [{"role": "user", "content": "전체 route의 총 이동거리 최소화 부탁드립니다 각 route의 depot 왕복 횟수, 왕복별 중복 제외 정차지 수, route 전체 중복 제외 정차지 수는 각각 담당 기사별 해당 한도 이내로 설정 부탁드립니다"}], "ir": "MINIMIZE( SUM(x0 in routes: travel_distance(x0)) )\nAND( EACH(x1 in routes): round_count(x1) <= max_rounds(x1), EACH(x2 in routes): EACH(x3 in rounds(x2)): stop_count(x3) <= max_stops_per_round(x2), EACH(x4 in routes): stop_count(x4) <= max_stops(x4) )", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:rider_delivery_length.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:rider_delivery_length", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:distance_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:5413cecc7c738f57", "domain": "routing", "language": "en", "messages": [{"role": "user", "content": "Minimize the total travel distance across all routes. For each route, keep depot round trips within its assigned rider’s own round-trip limit, distinct stops on each round trip within that rider’s own per-round-trip stop limit, and distinct stops across the whole route within that rider’s own route stop limit."}], "ir": "MINIMIZE( SUM(x0 in routes: travel_distance(x0)) )\nAND( EACH(x1 in routes): round_count(x1) <= max_rounds(x1), EACH(x2 in routes): EACH(x3 in rounds(x2)): stop_count(x3) <= max_stops_per_round(x2), EACH(x4 in routes): stop_count(x4) <= max_stops(x4) )", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:rider_delivery_length.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:rider_delivery_length", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:distance_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:77aaeccf5fa97dc8", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "각 배송 경로의 출발부터 종료까지 걸리는 시간을 모두 합한 값이 최소가 되도록 배차 부탁드립니다. 모든 경로의 배송 건수는 15건 이상으로 부탁드립니다."}], "ir": "MINIMIZE( SUM(x0 in routes: duration(x0)) )\nEACH(x1 in routes): delivery_count(x1) >= 15", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:minimum_order.target_order", "value": {"type": "decimal", "value": "15"}}], "constraint_ref": "constraint:minimum_order", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:duration_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:f7c494a71992d596", "domain": "routing", "language": "en", "messages": [{"role": "user", "content": "Minimize the sum of the times from start to finish for all routes. Set at least 15 deliveries for every route."}], "ir": "MINIMIZE( SUM(x0 in routes: duration(x0)) )\nEACH(x1 in routes): delivery_count(x1) >= 15", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:minimum_order.target_order", "value": {"type": "decimal", "value": "15"}}], "constraint_ref": "constraint:minimum_order", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:duration_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:a5b1652236ed9868", "domain": "routing", "language": "en", "messages": [{"role": "user", "content": "Minimize the total time across all routes, counting each route from start to finish, with at least 15 deliveries per route"}], "ir": "MINIMIZE( SUM(x0 in routes: duration(x0)) )\nEACH(x1 in routes): delivery_count(x1) >= 15", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:minimum_order.target_order", "value": {"type": "decimal", "value": "15"}}], "constraint_ref": "constraint:minimum_order", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:duration_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/residual:routing:7fa7086bbbd4a5de", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "모든 경로에 들어가는 차량 고정 운영비 총합이 제일 적게 나오게 짜줘. 그리고 주말에는 어떤 경로도 100km 넘으면 안 돼"}], "ir": "MINIMIZE( SUM(x0 in routes: fixed_cost(x0)) )\nUNEXPRESSED(other, constraint)", "decision_kind": "unsupported", "gold_decision": {"kind": "unsupported", "reason_code": "semantic_not_declared", "related_refs": []}, "stratum": "v4/residual", "episode_id": null} {"id": "v4/residual:routing:d7be2b013b735b90", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "이번 배차 계획을 부탁드립니다. 전체 경로에 대해 차량 고정 운영비의 합계를 최소화해 주시기 바랍니다. 그리고 주말에는 어느 경로도 100km를 초과하지 않도록 해 주세요."}], "ir": "MINIMIZE( SUM(x0 in routes: fixed_cost(x0)) )\nUNEXPRESSED(other, constraint)", "decision_kind": "unsupported", "gold_decision": {"kind": "unsupported", "reason_code": "semantic_not_declared", "related_refs": []}, "stratum": "v4/residual", "episode_id": null} {"id": "v4/residual:routing:a387e027d58662f0", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "전 경로 차량 고정 운영비 합계 최소로 가자. 주말엔 경로마다 100km 이하여야 함"}], "ir": "MINIMIZE( SUM(x0 in routes: fixed_cost(x0)) )\nUNEXPRESSED(other, constraint)", "decision_kind": "unsupported", "gold_decision": {"kind": "unsupported", "reason_code": "semantic_not_declared", "related_refs": []}, "stratum": "v4/residual", "episode_id": null} {"id": "v4/combo:routing:10e9dd16cc008490", "domain": "routing", "language": "mixed", "messages": [{"role": "user", "content": "내일 배차 최적화 돌릴 때 모든 route의 총 이동거리를 최소화해 주세요. 그리고 가능하면 각 route의 정류장을 다 덮는 가장 작은 원(외접원) 반경이 10km 이내로 유지되면 좋겠어요."}], "ir": "MINIMIZE( SUM(x0 in routes: travel_distance(x0)) )\n[SOFT] EACH(x1 in routes): sec_radius(x1) <= 10 km", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:enclosing_circle_radius.exp_factor", "value": {"type": "decimal", "value": "2"}}, {"slot_ref": "slot:enclosing_circle_radius.max_radius", "value": {"type": "decimal", "value": "10000"}}], "constraint_ref": "constraint:enclosing_circle_radius", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:distance_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:2c753edab5b92664", "domain": "routing", "language": "en", "messages": [{"role": "user", "content": "minimize total travel distance across all routes, and if possible keep each route's enclosing circle radius within 10 km"}], "ir": "MINIMIZE( SUM(x0 in routes: travel_distance(x0)) )\n[SOFT] EACH(x1 in routes): sec_radius(x1) <= 10 km", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:enclosing_circle_radius.exp_factor", "value": {"type": "decimal", "value": "2"}}, {"slot_ref": "slot:enclosing_circle_radius.max_radius", "value": {"type": "decimal", "value": "10000"}}], "constraint_ref": "constraint:enclosing_circle_radius", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:distance_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:f3b4f46ae0176a3a", "domain": "routing", "language": "en", "messages": [{"role": "user", "content": "Can you plan the routes so the total distance driven over all routes is as low as possible? Ideally each route's stops would fit inside a circle of radius 10 km, so the smallest circle that encloses a route's stops should be 10 km or less if possible"}], "ir": "MINIMIZE( SUM(x0 in routes: travel_distance(x0)) )\n[SOFT] EACH(x1 in routes): sec_radius(x1) <= 10 km", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:enclosing_circle_radius.exp_factor", "value": {"type": "decimal", "value": "2"}}, {"slot_ref": "slot:enclosing_circle_radius.max_radius", "value": {"type": "decimal", "value": "10000"}}], "constraint_ref": "constraint:enclosing_circle_radius", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:distance_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/multi:nurse:23712fb15809dfd0", "domain": "nurse", "language": "en", "messages": [{"role": "user", "content": "Minimize the difference between the highest and lowest number of shifts worked across nurses. For every nurse, keep total hours from shifts that start and end within each week at 56 hours or less, consecutive working days at 3 days or less, and the rest between each shift and their next shift at 12 hours or more."}], "ir": "MINIMIZE( RANGE(x0 in workers: workload(x0)) )\nEACH(x1 in workers): EACH(x2 in windows(WEEK, 1)): SUM(x3 in assignments(x1) WHERE DURING(interval(x3), x2): work_hours(x3)) <= 56 h\nEACH(x4 in workers): RUN_LENGTH(x5 in day_seq(x4): works(x4, x5)) <= 3 day\nEACH(x6 in workers): EACH(x7 in adjacent(assignment_seq(x6))): gap_duration(x7) >= 12 h", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:max_days", "value": {"type": "duration", "unit_ref": "unit:day", "value": "3"}}], "constraint_ref": "constraint:max_consecutive_days", "scope": null, "strength": {"kind": "soft", "weight": "100"}}, {"arguments": [{"slot_ref": "slot:max_hours", "value": {"type": "duration", "unit_ref": "unit:hour", "value": "56"}}], "constraint_ref": "constraint:max_hours_per_week", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [{"slot_ref": "slot:min_hours", "value": {"type": "duration", "unit_ref": "unit:hour", "value": "12"}}], "constraint_ref": "constraint:min_rest_hours", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:workload_balance", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/multi", "episode_id": null} {"id": "v4/multi:nurse:909f883680aed0c6", "domain": "nurse", "language": "en", "messages": [{"role": "user", "content": "For the roster, minimize the gap between the nurses with the most and fewest shifts worked. For every nurse, keep the total hours for shifts starting and ending within each week at 56 hours or less, and limit runs of working days to 3 days. Leave at least 12 hours between the end of each nurse's shift and the start of their next one"}], "ir": "MINIMIZE( RANGE(x0 in workers: workload(x0)) )\nEACH(x1 in workers): EACH(x2 in windows(WEEK, 1)): SUM(x3 in assignments(x1) WHERE DURING(interval(x3), x2): work_hours(x3)) <= 56 h\nEACH(x4 in workers): RUN_LENGTH(x5 in day_seq(x4): works(x4, x5)) <= 3 day\nEACH(x6 in workers): EACH(x7 in adjacent(assignment_seq(x6))): gap_duration(x7) >= 12 h", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:max_days", "value": {"type": "duration", "unit_ref": "unit:day", "value": "3"}}], "constraint_ref": "constraint:max_consecutive_days", "scope": null, "strength": {"kind": "soft", "weight": "100"}}, {"arguments": [{"slot_ref": "slot:max_hours", "value": {"type": "duration", "unit_ref": "unit:hour", "value": "56"}}], "constraint_ref": "constraint:max_hours_per_week", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [{"slot_ref": "slot:min_hours", "value": {"type": "duration", "unit_ref": "unit:hour", "value": "12"}}], "constraint_ref": "constraint:min_rest_hours", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:workload_balance", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/multi", "episode_id": null} {"id": "v4/combo:routing:29c211a08036505e", "domain": "routing", "language": "en", "messages": [{"role": "user", "content": "Can you plan the routes so the total fuel cost and the total travel distance across all routes are both as low as possible? And if you can, have each route visit its stops in order of time priority, highest first."}], "ir": "MINIMIZE( SUM(x0 in routes: fuel_cost(x0)) )\nMINIMIZE( SUM(x1 in routes: travel_distance(x1)) )\n[SOFT] EACH(x2 in routes): ORDERED_BY(visit_seq(x2), time_priority, DESC)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:time_priority_order.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:time_priority_order", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:distance_cost", "weight": "1/2"}, {"objective_ref": "objective:fuel_cost", "weight": "1/2"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:743657bd05dbb54e", "domain": "routing", "language": "en", "messages": [{"role": "user", "content": "minimize total fuel cost and total travel distance across all routes, both matter. ideally each route visits stops by time priority, highest priority first"}], "ir": "MINIMIZE( SUM(x0 in routes: fuel_cost(x0)) )\nMINIMIZE( SUM(x1 in routes: travel_distance(x1)) )\n[SOFT] EACH(x2 in routes): ORDERED_BY(visit_seq(x2), time_priority, DESC)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:time_priority_order.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:time_priority_order", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:distance_cost", "weight": "1/2"}, {"objective_ref": "objective:fuel_cost", "weight": "1/2"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:37cfdfe5c7327454", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "모든 경로의 총 연료비와 총 이동거리를 둘 다 최소화해 주세요. 그리고 가능하면 각 경로마다 시간 우선순위가 높은 곳부터 순서대로 배송하게 해 주세요."}], "ir": "MINIMIZE( SUM(x0 in routes: fuel_cost(x0)) )\nMINIMIZE( SUM(x1 in routes: travel_distance(x1)) )\n[SOFT] EACH(x2 in routes): ORDERED_BY(visit_seq(x2), time_priority, DESC)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:time_priority_order.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:time_priority_order", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:distance_cost", "weight": "1/2"}, {"objective_ref": "objective:fuel_cost", "weight": "1/2"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:nurse:e04fcf2d589d0b19", "domain": "nurse", "language": "ko", "messages": [{"role": "user", "content": "근무표 짤 때 간호사별 근무 횟수 차이(제일 많이 서는 사람과 제일 적게 서는 사람 차이)가 최소가 되게 해 주세요. 연속 근무는 가능하면 6일까지만 하게 하고, 주당 근무시간은 반드시 44시간 이하로 맞춰 주세요."}], "ir": "MINIMIZE( RANGE(x0 in workers: workload(x0)) )\n[SOFT] EACH(x1 in workers): RUN_LENGTH(x2 in day_seq(x1): works(x1, x2)) <= 6 day\n[HARD] EACH(x3 in workers): EACH(x4 in windows(WEEK, 1)): SUM(x5 in assignments(x3) WHERE DURING(interval(x5), x4): work_hours(x5)) <= 44 h", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:max_days", "value": {"type": "duration", "unit_ref": "unit:day", "value": "6"}}], "constraint_ref": "constraint:max_consecutive_days", "scope": null, "strength": {"kind": "soft", "weight": "100"}}, {"arguments": [{"slot_ref": "slot:max_hours", "value": {"type": "duration", "unit_ref": "unit:hour", "value": "44"}}], "constraint_ref": "constraint:max_hours_per_week", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:workload_balance", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:nurse:5e3848bccb24dbba", "domain": "nurse", "language": "mixed", "messages": [{"role": "user", "content": "이번 달 duty roster 작성 관련해서 부탁드립니다. 간호사들 사이의 shift 수 차이, 즉 가장 많이 근무하는 사람과 가장 적게 근무하는 사람의 차이를 최소화해 주시고, consecutive 근무는 가능하면 6일을 넘지 않도록 해 주십시오. 그리고 모든 간호사의 주당 근무시간 합계는 반드시 44시간 이하여야 합니다."}], "ir": "MINIMIZE( RANGE(x0 in workers: workload(x0)) )\n[SOFT] EACH(x1 in workers): RUN_LENGTH(x2 in day_seq(x1): works(x1, x2)) <= 6 day\n[HARD] EACH(x3 in workers): EACH(x4 in windows(WEEK, 1)): SUM(x5 in assignments(x3) WHERE DURING(interval(x5), x4): work_hours(x5)) <= 44 h", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:max_days", "value": {"type": "duration", "unit_ref": "unit:day", "value": "6"}}], "constraint_ref": "constraint:max_consecutive_days", "scope": null, "strength": {"kind": "soft", "weight": "100"}}, {"arguments": [{"slot_ref": "slot:max_hours", "value": {"type": "duration", "unit_ref": "unit:hour", "value": "44"}}], "constraint_ref": "constraint:max_hours_per_week", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:workload_balance", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:nurse:cc61a17aff19f847", "domain": "nurse", "language": "ko", "messages": [{"role": "user", "content": "간호사 모두 근무 횟수가 최대한 고르게, 많이 하는 사람과 적게 하는 사람 차이가 최소가 되도록 짜 주세요. 연속으로 일하는 건 되도록 6일 이내로 해 주시고, 일주일에 일하는 시간 합은 누구든 반드시 44시간을 넘기지 않게 해 주세요."}], "ir": "MINIMIZE( RANGE(x0 in workers: workload(x0)) )\n[SOFT] EACH(x1 in workers): RUN_LENGTH(x2 in day_seq(x1): works(x1, x2)) <= 6 day\n[HARD] EACH(x3 in workers): EACH(x4 in windows(WEEK, 1)): SUM(x5 in assignments(x3) WHERE DURING(interval(x5), x4): work_hours(x5)) <= 44 h", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:max_days", "value": {"type": "duration", "unit_ref": "unit:day", "value": "6"}}], "constraint_ref": "constraint:max_consecutive_days", "scope": null, "strength": {"kind": "soft", "weight": "100"}}, {"arguments": [{"slot_ref": "slot:max_hours", "value": {"type": "duration", "unit_ref": "unit:hour", "value": "44"}}], "constraint_ref": "constraint:max_hours_per_week", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:workload_balance", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:1cf493d0364c4baf", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "모든 경로의 출발부터 종료까지 걸리는 시간을 합쳐서 최소화해줘. 서로 2km 이내인 배송지는 어느 쌍이든 가능하면 같은 경로에 묶어줘"}], "ir": "MINIMIZE( SUM(x0 in routes: duration(x0)) )\n[SOFT] EACH((x1, x2) in pairs(visits, nearby(2 km))): TOGETHER(x1, x2, route)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:nearby_delivery_grouping.distance_threshold", "value": {"type": "decimal", "value": "2000"}}, {"slot_ref": "slot:nearby_delivery_grouping.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:nearby_delivery_grouping", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:duration_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:168e18709ffe3177", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "전체 경로의 출발부터 종료까지 소요되는 시간의 합을 최소화해 주시기 바랍니다. 서로 2km 이내에 있는 배송지는 모든 쌍에 대해 가능하면 같은 경로로 배정 부탁드립니다."}], "ir": "MINIMIZE( SUM(x0 in routes: duration(x0)) )\n[SOFT] EACH((x1, x2) in pairs(visits, nearby(2 km))): TOGETHER(x1, x2, route)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:nearby_delivery_grouping.distance_threshold", "value": {"type": "decimal", "value": "2000"}}, {"slot_ref": "slot:nearby_delivery_grouping.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:nearby_delivery_grouping", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:duration_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:61ab34e3528b36d4", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "전체 경로의 출발부터 종료까지 시간 합을 최소화하고, 서로 2km 이내인 배송지 쌍은 모두 가능하면 같은 경로에 배정 부탁드립니다."}], "ir": "MINIMIZE( SUM(x0 in routes: duration(x0)) )\n[SOFT] EACH((x1, x2) in pairs(visits, nearby(2 km))): TOGETHER(x1, x2, route)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:nearby_delivery_grouping.distance_threshold", "value": {"type": "decimal", "value": "2000"}}, {"slot_ref": "slot:nearby_delivery_grouping.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:nearby_delivery_grouping", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:duration_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:20a313c0a211e06c", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "차량 고정비용 총합 최소화하고, 가능하면 모든 경로를 우선순위 높은 순서대로 배송해 주세요."}], "ir": "MINIMIZE( SUM(x0 in routes: fixed_cost(x0)) )\n[SOFT] EACH(x1 in routes): ORDERED_BY(visit_seq(x1), time_priority, DESC)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:time_priority_order.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:time_priority_order", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fixed_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:1aba676033241d20", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "전체 경로에서 쓰는 차량 고정 비용 합계를 최소로 해줘. 그리고 되도록 각 경로마다 시간 우선순위 높은 순으로 배송 순서 잡아줘"}], "ir": "MINIMIZE( SUM(x0 in routes: fixed_cost(x0)) )\n[SOFT] EACH(x1 in routes): ORDERED_BY(visit_seq(x1), time_priority, DESC)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:time_priority_order.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:time_priority_order", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fixed_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:0d28abffcd43f943", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "오늘 배차 짤 건데 차량 고정비용 총합이 제일 적게 나오게 해줘. 가능하면 모든 경로에서 시간 우선순위가 높은 주문부터 순서대로 방문하게 해주면 좋겠어"}], "ir": "MINIMIZE( SUM(x0 in routes: fixed_cost(x0)) )\n[SOFT] EACH(x1 in routes): ORDERED_BY(visit_seq(x1), time_priority, DESC)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:time_priority_order.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:time_priority_order", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fixed_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/base:nurse:d0cce04ccb3ebdd2", "domain": "nurse", "language": "en", "messages": [{"role": "user", "content": "Minimize the gap between the most and fewest shifts worked across nurses; limit each nurse to 52 hours total for shifts falling within each week"}], "ir": "MINIMIZE( RANGE(x0 in workers: workload(x0)) )\nEACH(x1 in workers): EACH(x2 in windows(WEEK, 1)): SUM(x3 in assignments(x1) WHERE DURING(interval(x3), x2): work_hours(x3)) <= 52 h", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:max_hours", "value": {"type": "duration", "unit_ref": "unit:hour", "value": "52"}}], "constraint_ref": "constraint:max_hours_per_week", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:workload_balance", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/base", "episode_id": null} {"id": "v4/base:nurse:de63fca3ddc6cccb", "domain": "nurse", "language": "en", "messages": [{"role": "user", "content": "Minimize the difference between the highest and lowest shift counts across nurses. For each nurse, keep total working hours for shifts falling within each week at or below 52 hours."}], "ir": "MINIMIZE( RANGE(x0 in workers: workload(x0)) )\nEACH(x1 in workers): EACH(x2 in windows(WEEK, 1)): SUM(x3 in assignments(x1) WHERE DURING(interval(x3), x2): work_hours(x3)) <= 52 h", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:max_hours", "value": {"type": "duration", "unit_ref": "unit:hour", "value": "52"}}], "constraint_ref": "constraint:max_hours_per_week", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:workload_balance", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/base", "episode_id": null} {"id": "v4/base:nurse:10fd51753f8541ea", "domain": "nurse", "language": "mixed", "messages": [{"role": "user", "content": "간호사별 근무 횟수가 가장 많은 사람과 가장 적은 사람의 차이를 최소화해줘. 모든 간호사는 매주 그 주 안에 들어가는 shift의 총 근로시간을 52시간 이하로 잡아줘"}], "ir": "MINIMIZE( RANGE(x0 in workers: workload(x0)) )\nEACH(x1 in workers): EACH(x2 in windows(WEEK, 1)): SUM(x3 in assignments(x1) WHERE DURING(interval(x3), x2): work_hours(x3)) <= 52 h", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:max_hours", "value": {"type": "duration", "unit_ref": "unit:hour", "value": "52"}}], "constraint_ref": "constraint:max_hours_per_week", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:workload_balance", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/base", "episode_id": null} {"id": "v4/combo:routing:172ba06b2f3e5bc0", "domain": "routing", "language": "mixed", "messages": [{"role": "user", "content": "모든 route의 fuel 비용 총합도 줄이고, 각 route의 왕복 운행마다 배달할 곳의 서로 다른 구역 수를 센 뒤 전체 왕복 운행에 걸쳐 합한 값도 줄여 주세요. 가능하면 모든 route의 각 배달에서 서비스 전 대기시간이 담당 기사 본인의 대기 한도를 넘지 않고, route 종료는 그 기사 근무 종료 시각을 넘지 않으며, 매 왕복 운행도 그 기사에게 정해진 왕복 운행 시간대의 종료 시각을 넘기지 않게 해 주세요."}], "ir": "MINIMIZE( SUM(x0 in routes: fuel_cost(x0)) )\nMINIMIZE( SUM(x1 in routes: SUM(x2 in rounds(x1): COUNT_DISTINCT(x3 in visits(x2): zone(x3)))) )\n[SOFT] AND( EACH(x4 in routes): EACH(x5 in visits(x4)): wait_duration(x5) <= max_wait(x4), EACH(x6 in routes): end_time(x6) <= work_end(x6), EACH(x7 in routes): EACH(x8 in rounds(x7)): end_time(x8) <= round_window_end(x7) )", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:rider_route_zone.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:rider_route_zone", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:rider_time_window.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:rider_time_window", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fuel_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:3a863611e0abebf9", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "전체 경로의 총 이동거리를 최소화하고, 가능하면 모든 경로에서 방문지를 모두 감싸는 가장 작은 원의 반경은 5km 이하로 해 주세요"}], "ir": "MINIMIZE( SUM(x0 in routes: travel_distance(x0)) )\n[SOFT] EACH(x1 in routes): sec_radius(x1) <= 5 km", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:enclosing_circle_radius.exp_factor", "value": {"type": "decimal", "value": "2"}}, {"slot_ref": "slot:enclosing_circle_radius.max_radius", "value": {"type": "decimal", "value": "5000"}}], "constraint_ref": "constraint:enclosing_circle_radius", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:distance_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:32f305f1c95e3453", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "전체 경로의 이동거리 합계를 최소화해 주시기 바랍니다. 가능하면 모든 경로에서 방문지를 모두 포함하는 가장 작은 원의 반경이 5km 이하가 되도록 부탁드립니다."}], "ir": "MINIMIZE( SUM(x0 in routes: travel_distance(x0)) )\n[SOFT] EACH(x1 in routes): sec_radius(x1) <= 5 km", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:enclosing_circle_radius.exp_factor", "value": {"type": "decimal", "value": "2"}}, {"slot_ref": "slot:enclosing_circle_radius.max_radius", "value": {"type": "decimal", "value": "5000"}}], "constraint_ref": "constraint:enclosing_circle_radius", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:distance_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:retail:6d36ee420d54b417", "domain": "retail", "language": "en", "messages": [{"role": "user", "content": "Plan orders to reduce the share of stock discarded and increase the share of days each item is in stock; both goals matter. Every replenishment order must be for a multiple of the item's minimum order quantity."}], "ir": "MINIMIZE( waste_rate )\nMAXIMIZE( in_stock_rate )\n[HARD] EACH(x0 in orders): quantity(x0) MULTIPLE_OF min_order_quantity(x0)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:minimum_order_quantity", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:minimize_stockout", "weight": "1/2"}, {"objective_ref": "objective:minimize_waste", "weight": "1/2"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:retail:753e7d1c732a33c7", "domain": "retail", "language": "ko", "messages": [{"role": "user", "content": "재고 중 폐기되는 비율은 줄이고 품목별로 재고가 있는 날의 비율은 높이도록 발주를 계획해 주세요. 두 목표 모두 중요하고, 모든 보충 발주 수량은 반드시 해당 품목의 최소 발주량의 배수로 맞춰 주세요."}], "ir": "MINIMIZE( waste_rate )\nMAXIMIZE( in_stock_rate )\n[HARD] EACH(x0 in orders): quantity(x0) MULTIPLE_OF min_order_quantity(x0)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:minimum_order_quantity", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:minimize_stockout", "weight": "1/2"}, {"objective_ref": "objective:minimize_waste", "weight": "1/2"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:retail:fedc46f651788219", "domain": "retail", "language": "ko", "messages": [{"role": "user", "content": "재고 중 버리는 비율은 줄이고 품목별로 재고가 있는 날의 비율은 높이게 발주 계획 짜줘. 두 목표 다 중요하고, 모든 보충 발주 수량은 반드시 해당 품목의 최소 발주량의 배수로 맞춰줘."}], "ir": "MINIMIZE( waste_rate )\nMAXIMIZE( in_stock_rate )\n[HARD] EACH(x0 in orders): quantity(x0) MULTIPLE_OF min_order_quantity(x0)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:minimum_order_quantity", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:minimize_stockout", "weight": "1/2"}, {"objective_ref": "objective:minimize_waste", "weight": "1/2"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:ba380a5bb9016935", "domain": "routing", "language": "en", "messages": [{"role": "user", "content": "Plan the routes to minimize the total distance traveled across all routes. For every route, the smallest circle covering all its stops must have a radius no greater than that rider’s own radius limit. If possible, keep each delivery’s entire service time from overlapping its prohibited delivery window."}], "ir": "MINIMIZE( SUM(x0 in routes: travel_distance(x0)) )\n[HARD] EACH(x1 in routes): sec_radius(x1) <= individual_radius_limit(x1)\n[SOFT] EACH(x2 in visits): NOT OVERLAPS(service_interval(x2), prohibited_window(x2))", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:prohibited_time_window", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:individual_enclosing_circle_radius.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:individual_enclosing_circle_radius", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:distance_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:bea2efcce4f0bf76", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "전체 배송 경로의 총 이동거리를 최소화하도록 배차 부탁드립니다. 모든 경로는 방문지를 전부 포함하는 가장 작은 원의 반경이 반드시 해당 경로 담당 라이더의 개별 반경 한도 이하여야 합니다. 각 배송의 작업 시간 전체가 해당 배송의 방문 금지 시간대와 겹치지 않도록 가능하면 조정 부탁드립니다"}], "ir": "MINIMIZE( SUM(x0 in routes: travel_distance(x0)) )\n[HARD] EACH(x1 in routes): sec_radius(x1) <= individual_radius_limit(x1)\n[SOFT] EACH(x2 in visits): NOT OVERLAPS(service_interval(x2), prohibited_window(x2))", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:prohibited_time_window", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:individual_enclosing_circle_radius.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:individual_enclosing_circle_radius", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:distance_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/base:routing:3d8b9a2cb0212ec6", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "전체 경로에서 차량 고정비용 총합을 최소화해줘. 그리고 모든 경로에서 각 배송의 서비스 전 대기시간은 그 기사 본인의 대기 한도 이내, 경로 종료는 그 기사 근무 종료 시각 이전, 각 왕복 운행은 그 기사의 왕복 시간대 종료 전에 끝나게 해줘."}], "ir": "MINIMIZE( SUM(x0 in routes: fixed_cost(x0)) )\nAND( EACH(x1 in routes): EACH(x2 in visits(x1)): wait_duration(x2) <= max_wait(x1), EACH(x3 in routes): end_time(x3) <= work_end(x3), EACH(x4 in routes): EACH(x5 in rounds(x4)): end_time(x5) <= round_window_end(x4) )", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:rider_time_window.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:rider_time_window", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fixed_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/base", "episode_id": null} {"id": "v4/combo:routing:bac0fbbe1806eaf1", "domain": "routing", "language": "en", "messages": [{"role": "user", "content": "Plan the routes to minimize the total time from start to finish summed across all routes. Keep the travel distance for each route at 8 km or less."}], "ir": "MINIMIZE( SUM(x0 in routes: duration(x0)) )\nEACH(x1 in routes): travel_distance(x1) <= 8 km", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:max_distance.exp_factor", "value": {"type": "decimal", "value": "1"}}, {"slot_ref": "slot:max_distance.max_distance", "value": {"type": "decimal", "value": "8000"}}], "constraint_ref": "constraint:max_distance", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:duration_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:21a085f9eccbb6c5", "domain": "routing", "language": "mixed", "messages": [{"role": "user", "content": "전체 route의 출발부터 종료까지 걸리는 시간을 합쳐서 최소화해줘. 각 route의 운행 거리는 8 km 이하로 잡아줘."}], "ir": "MINIMIZE( SUM(x0 in routes: duration(x0)) )\nEACH(x1 in routes): travel_distance(x1) <= 8 km", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:max_distance.exp_factor", "value": {"type": "decimal", "value": "1"}}, {"slot_ref": "slot:max_distance.max_distance", "value": {"type": "decimal", "value": "8000"}}], "constraint_ref": "constraint:max_distance", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:duration_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:7517ff15529d97c8", "domain": "routing", "language": "en", "messages": [{"role": "user", "content": "Minimize the combined start-to-finish time of all routes, and limit the travel distance of every route to 8 km or less."}], "ir": "MINIMIZE( SUM(x0 in routes: duration(x0)) )\nEACH(x1 in routes): travel_distance(x1) <= 8 km", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:max_distance.exp_factor", "value": {"type": "decimal", "value": "1"}}, {"slot_ref": "slot:max_distance.max_distance", "value": {"type": "decimal", "value": "8000"}}], "constraint_ref": "constraint:max_distance", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:duration_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:b73ffd2a5971b096", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "전체 경로 총 이동거리 최소화로 짜줘. 그리고 모든 경로의 각 회차는 적재율이 가장 높은 항목 기준으로 반드시 0.7 이상이어야 해. 또 기사별 회차 수, 회차당 정차 수, 전체 정차 수는 각 기사 본인 한도를 절대 넘으면 안 돼"}], "ir": "MINIMIZE( SUM(x0 in routes: travel_distance(x0)) )\n[HARD] EACH(x1 in routes): EACH(x2 in rounds(x1)): MAX(x3 in keys(load): utilization[x3](x2)) >= 0.7\n[HARD] AND( EACH(x4 in routes): round_count(x4) <= max_rounds(x4), EACH(x5 in routes): EACH(x6 in rounds(x5)): stop_count(x6) <= max_stops_per_round(x5), EACH(x7 in routes): stop_count(x7) <= max_stops(x7) )", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:min_capacity.target_ratio", "value": {"type": "decimal", "value": "0.7"}}], "constraint_ref": "constraint:min_capacity", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [{"slot_ref": "slot:rider_delivery_length.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:rider_delivery_length", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:distance_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:0be8058067a9efb1", "domain": "routing", "language": "mixed", "messages": [{"role": "user", "content": "모든 route의 총 distance가 최소가 되도록 배차해 주세요. 각 route의 round trip마다 cargo 항목 중 가장 높은 적재율이 반드시 0.7 이상이어야 하고, 회차 수와 회차당 정차 수, route 전체 정차 수는 반드시 기사별 본인 한도를 넘지 않게 해 주세요."}], "ir": "MINIMIZE( SUM(x0 in routes: travel_distance(x0)) )\n[HARD] EACH(x1 in routes): EACH(x2 in rounds(x1)): MAX(x3 in keys(load): utilization[x3](x2)) >= 0.7\n[HARD] AND( EACH(x4 in routes): round_count(x4) <= max_rounds(x4), EACH(x5 in routes): EACH(x6 in rounds(x5)): stop_count(x6) <= max_stops_per_round(x5), EACH(x7 in routes): stop_count(x7) <= max_stops(x7) )", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:min_capacity.target_ratio", "value": {"type": "decimal", "value": "0.7"}}], "constraint_ref": "constraint:min_capacity", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [{"slot_ref": "slot:rider_delivery_length.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:rider_delivery_length", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:distance_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:5bf28767d54a4ad5", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "전체 차량 이동거리 총합이 제일 적게 나오게 짜줘. 배달마다 서비스 시간이 금지 시간대랑 안 겹치게 하고, 차량별로 회차마다 가장 높은 적재율은 무조건 0.8 이상으로 가자"}], "ir": "MINIMIZE( SUM(x0 in routes: travel_distance(x0)) )\nEACH(x1 in visits): NOT OVERLAPS(service_interval(x1), prohibited_window(x1))\n[HARD] EACH(x2 in routes): EACH(x3 in rounds(x2)): MAX(x4 in keys(load): utilization[x4](x3)) >= 0.8", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:prohibited_time_window", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:min_capacity.target_ratio", "value": {"type": "decimal", "value": "0.8"}}], "constraint_ref": "constraint:min_capacity", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:distance_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:9332bd8c00e0f78f", "domain": "routing", "language": "en", "messages": [{"role": "user", "content": "Minimize the total travel distance across all routes, and if possible, keep the highest load reached anywhere during each round trip within that route’s vehicle capacity for every cargo dimension. On every route, each delivery’s wait before service must stay within that rider’s own waiting-time limit, the route must finish by that rider’s working-hours end, and every round trip must finish by that rider’s round-trip window end."}], "ir": "MINIMIZE( SUM(x0 in routes: travel_distance(x0)) )\n[SOFT] EACH(x1 in routes): EACH(x2 in rounds(x1)): EACH(x3 in keys(load)): MAX(x4 in positions(x2): load[x3](x4)) <= capacity[x3](x1)\n[HARD] AND( EACH(x5 in routes): EACH(x6 in visits(x5)): wait_duration(x6) <= max_wait(x5), EACH(x7 in routes): end_time(x7) <= work_end(x7), EACH(x8 in routes): EACH(x9 in rounds(x8)): end_time(x9) <= round_window_end(x8) )", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:capacity.exp_factor", "value": {"type": "decimal", "value": "1"}}], "constraint_ref": "constraint:capacity", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:rider_time_window.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:rider_time_window", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:distance_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:nurse:63f84bbcde4f57b1", "domain": "nurse", "language": "ko", "messages": [{"role": "user", "content": "전체 간호사 초과근무 시간을 주간 한도 넘는 것 기준으로 다 합쳐서 최소로 만들어줘. 그리고 가능하면 연속 근무는 3일 넘지 않게, 근무 사이 휴식은 8시간 이상 되도록 해줘."}], "ir": "MINIMIZE( SUM(x0 in workers: overtime_hours(x0)) )\n[SOFT] EACH(x1 in workers): RUN_LENGTH(x2 in day_seq(x1): works(x1, x2)) <= 3 day\n[SOFT] EACH(x3 in workers): EACH(x4 in adjacent(assignment_seq(x3))): gap_duration(x4) >= 8 h", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:max_days", "value": {"type": "duration", "unit_ref": "unit:day", "value": "3"}}], "constraint_ref": "constraint:max_consecutive_days", "scope": null, "strength": {"kind": "soft", "weight": "100"}}, {"arguments": [{"slot_ref": "slot:min_hours", "value": {"type": "duration", "unit_ref": "unit:hour", "value": "8"}}], "constraint_ref": "constraint:min_rest_hours", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:overtime", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:nurse:22da85a83f5eae2d", "domain": "nurse", "language": "ko", "messages": [{"role": "user", "content": "전체 간호사의 주간 한도 초과 근무 시간 총합을 최소화하는 근무표를 부탁드립니다. 또한 가능하면 각 간호사의 연속 근무일은 3일 이하로, 근무 간 휴식시간은 8시간 이상 확보되도록 부탁드립니다."}], "ir": "MINIMIZE( SUM(x0 in workers: overtime_hours(x0)) )\n[SOFT] EACH(x1 in workers): RUN_LENGTH(x2 in day_seq(x1): works(x1, x2)) <= 3 day\n[SOFT] EACH(x3 in workers): EACH(x4 in adjacent(assignment_seq(x3))): gap_duration(x4) >= 8 h", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:max_days", "value": {"type": "duration", "unit_ref": "unit:day", "value": "3"}}], "constraint_ref": "constraint:max_consecutive_days", "scope": null, "strength": {"kind": "soft", "weight": "100"}}, {"arguments": [{"slot_ref": "slot:min_hours", "value": {"type": "duration", "unit_ref": "unit:hour", "value": "8"}}], "constraint_ref": "constraint:min_rest_hours", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:overtime", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:b5c4a43b38e54a94", "domain": "routing", "language": "en", "messages": [{"role": "user", "content": "Minimize total distance across all routes; every route must be at most 80 km."}], "ir": "MINIMIZE( SUM(x0 in routes: travel_distance(x0)) )\n[HARD] EACH(x1 in routes): travel_distance(x1) <= 80 km", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:max_distance.exp_factor", "value": {"type": "decimal", "value": "1"}}, {"slot_ref": "slot:max_distance.max_distance", "value": {"type": "decimal", "value": "80000"}}], "constraint_ref": "constraint:max_distance", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:distance_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:eed4a0bcce3c77fb", "domain": "routing", "language": "mixed", "messages": [{"role": "user", "content": "전체 route의 총 이동거리를 최소화해줘. route별 이동거리는 무조건 80km 이하로 맞춰줘"}], "ir": "MINIMIZE( SUM(x0 in routes: travel_distance(x0)) )\n[HARD] EACH(x1 in routes): travel_distance(x1) <= 80 km", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:max_distance.exp_factor", "value": {"type": "decimal", "value": "1"}}, {"slot_ref": "slot:max_distance.max_distance", "value": {"type": "decimal", "value": "80000"}}], "constraint_ref": "constraint:max_distance", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:distance_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:da8d63f703183415", "domain": "routing", "language": "en", "messages": [{"role": "user", "content": "Please plan the delivery routes to minimize both the combined start-to-finish time across all routes and their total travel distance. If possible, also minimize the sum of arrival times across all deliveries, with each arrival time weighted by that delivery’s time priority."}], "ir": "MINIMIZE( SUM(x0 in routes: duration(x0)) )\nMINIMIZE( SUM(x1 in routes: travel_distance(x1)) )\n[SOFT] MINIMIZE( SUM(x2 in visits: priority_weighted_arrival(x2)) )", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:delivery_time_priority.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:delivery_time_priority", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:distance_cost", "weight": "1/2"}, {"objective_ref": "objective:duration_cost", "weight": "1/2"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:3f68ebd882a67aee", "domain": "routing", "language": "mixed", "messages": [{"role": "user", "content": "배송 route 전체의 출발부터 종료까지 걸리는 시간의 합과 총 이동거리를 모두 줄이는 배차 계획을 부탁드립니다. 가능하면 각 배송의 도착 시간에 해당 배송의 priority를 반영한 값의 합도 줄여 주시기 바랍니다."}], "ir": "MINIMIZE( SUM(x0 in routes: duration(x0)) )\nMINIMIZE( SUM(x1 in routes: travel_distance(x1)) )\n[SOFT] MINIMIZE( SUM(x2 in visits: priority_weighted_arrival(x2)) )", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:delivery_time_priority.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:delivery_time_priority", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:distance_cost", "weight": "1/2"}, {"objective_ref": "objective:duration_cost", "weight": "1/2"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:c84b1c6fbdafbdb6", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "전체 배송 경로의 출발부터 종료까지 걸리는 시간을 합한 값과 전체 이동거리를 모두 최소화하도록 배차 부탁드립니다. 가능하면 배송별 도착 시간에 해당 배송의 시간 우선순위를 반영해서, 그 값의 전체 합도 최소화해 주셨으면 합니다."}], "ir": "MINIMIZE( SUM(x0 in routes: duration(x0)) )\nMINIMIZE( SUM(x1 in routes: travel_distance(x1)) )\n[SOFT] MINIMIZE( SUM(x2 in visits: priority_weighted_arrival(x2)) )", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:delivery_time_priority.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:delivery_time_priority", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:distance_cost", "weight": "1/2"}, {"objective_ref": "objective:duration_cost", "weight": "1/2"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:185a65c51060bf46", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "전체 경로의 차량 고정 운영비 합계를 최소화해줘. 각 경로의 차고지 왕복 횟수, 왕복마다 들르는 서로 다른 정차지 수, 경로 전체에서 들르는 서로 다른 정차지 수는 반드시 담당 기사별로 정해진 각각의 한도를 지켜줘. 경로당 배송 건수는 3건 이하로 잡고, 각 경로의 매 왕복에서 중량이나 부피 등 적재 항목별 최대 적재량은 이동 중 어느 지점에서든 해당 차량의 항목별 용량을 넘지 않게 해줘."}], "ir": "MINIMIZE( SUM(x0 in routes: fixed_cost(x0)) )\n[HARD] AND( EACH(x1 in routes): round_count(x1) <= max_rounds(x1), EACH(x2 in routes): EACH(x3 in rounds(x2)): stop_count(x3) <= max_stops_per_round(x2), EACH(x4 in routes): stop_count(x4) <= max_stops(x4) )\nEACH(x5 in routes): delivery_count(x5) <= 3\nEACH(x6 in routes): EACH(x7 in rounds(x6)): EACH(x8 in keys(load)): MAX(x9 in positions(x7): load[x8](x9)) <= capacity[x8](x6)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:capacity.exp_factor", "value": {"type": "decimal", "value": "1"}}], "constraint_ref": "constraint:capacity", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [{"slot_ref": "slot:delivery_length.exp_factor", "value": {"type": "decimal", "value": "2"}}, {"slot_ref": "slot:delivery_length.max_size", "value": {"type": "decimal", "value": "3"}}], "constraint_ref": "constraint:delivery_length", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:rider_delivery_length.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:rider_delivery_length", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fixed_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:07aca86ba860b945", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "전체 경로에서 사용하는 차량의 고정 운영비 합계를 최소화해 주시고, 경로당 배송 건수는 3건 이하로 하며 각 경로의 매 왕복 중 모든 지점에서 중량·부피 등 적재 항목별 최대 적재량이 해당 차량의 항목별 용량 이내가 되도록 부탁드립니다. 각 경로의 차고지 왕복 횟수와 왕복당 서로 다른 정차지 수, 경로 전체의 서로 다른 정차지 수는 반드시 해당 경로 담당 기사에게 정해진 각각의 한도 이내로 계획해 주시기 바랍니다"}], "ir": "MINIMIZE( SUM(x0 in routes: fixed_cost(x0)) )\nEACH(x1 in routes): delivery_count(x1) <= 3\nEACH(x2 in routes): EACH(x3 in rounds(x2)): EACH(x4 in keys(load)): MAX(x5 in positions(x3): load[x4](x5)) <= capacity[x4](x2)\n[HARD] AND( EACH(x6 in routes): round_count(x6) <= max_rounds(x6), EACH(x7 in routes): EACH(x8 in rounds(x7)): stop_count(x8) <= max_stops_per_round(x7), EACH(x9 in routes): stop_count(x9) <= max_stops(x9) )", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:capacity.exp_factor", "value": {"type": "decimal", "value": "1"}}], "constraint_ref": "constraint:capacity", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [{"slot_ref": "slot:delivery_length.exp_factor", "value": {"type": "decimal", "value": "2"}}, {"slot_ref": "slot:delivery_length.max_size", "value": {"type": "decimal", "value": "3"}}], "constraint_ref": "constraint:delivery_length", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:rider_delivery_length.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:rider_delivery_length", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fixed_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:b961ab3cf1cdbf85", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "전체 경로의 차량 고정 운영비 합계를 최소화하고, 각 경로의 배송 건수는 3건 이하로 계획해 주시며, 경로마다 매 왕복 중 어느 지점에서든 중량이나 부피 등 각 적재 항목의 최대 적재량이 해당 차량의 항목별 용량을 넘지 않도록 부탁드립니다. 그리고 모든 경로에서 차고지 왕복 횟수, 왕복당 방문하는 서로 다른 정차지 수, 경로 전체에서 방문하는 서로 다른 정차지 수는 반드시 담당 기사별로 정해진 각각의 한도를 지켜 주시기 바랍니다."}], "ir": "MINIMIZE( SUM(x0 in routes: fixed_cost(x0)) )\nEACH(x1 in routes): delivery_count(x1) <= 3\nEACH(x2 in routes): EACH(x3 in rounds(x2)): EACH(x4 in keys(load)): MAX(x5 in positions(x3): load[x4](x5)) <= capacity[x4](x2)\n[HARD] AND( EACH(x6 in routes): round_count(x6) <= max_rounds(x6), EACH(x7 in routes): EACH(x8 in rounds(x7)): stop_count(x8) <= max_stops_per_round(x7), EACH(x9 in routes): stop_count(x9) <= max_stops(x9) )", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:capacity.exp_factor", "value": {"type": "decimal", "value": "1"}}], "constraint_ref": "constraint:capacity", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [{"slot_ref": "slot:delivery_length.exp_factor", "value": {"type": "decimal", "value": "2"}}, {"slot_ref": "slot:delivery_length.max_size", "value": {"type": "decimal", "value": "3"}}], "constraint_ref": "constraint:delivery_length", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:rider_delivery_length.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:rider_delivery_length", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fixed_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:9e9c928586eda9ff", "domain": "routing", "language": "en", "messages": [{"role": "user", "content": "Please minimize the total time from start to finish summed over all routes. Ideally, the wait before each delivery stays within that rider's own waiting limit, every route finishes before the rider's end of working hours, and every round trip ends before the rider's round window end. Also, each route's distance stays within the rider's own total distance limit, each round trip within their per-round distance limit, and each leg between consecutive stops within their stop-to-stop limit"}], "ir": "MINIMIZE( SUM(x0 in routes: duration(x0)) )\n[SOFT] AND( EACH(x1 in routes): EACH(x2 in visits(x1)): wait_duration(x2) <= max_wait(x1), EACH(x3 in routes): end_time(x3) <= work_end(x3), EACH(x4 in routes): EACH(x5 in rounds(x4)): end_time(x5) <= round_window_end(x4) )\nAND( EACH(x6 in routes): travel_distance(x6) <= total_limit(x6), EACH(x7 in routes): EACH(x8 in rounds(x7)): travel_distance(x8) <= trip_limit(x7), EACH(x9 in routes): EACH(x10 in adjacent(visit_seq(x9))): travel_distance(x10) <= between_limit(x9) )", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:rider_distance.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:rider_distance", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:rider_time_window.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:rider_time_window", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:duration_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:17df1e28524e15aa", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "모든 루트의 시작부터 끝까지 걸리는 시간 합계를 최소화해 주세요. 그리고 가능하면 배송 전 대기시간은 기사별 대기 한도 이내, 루트 종료는 기사 근무 종료 시각 이내, 회차 종료는 기사별 회차 종료 시각 이내로 맞춰 주시고, 거리는 기사별 총 거리 한도, 회차당 거리 한도, 정차지 간 거리 한도 안에서 짜 주세요."}], "ir": "MINIMIZE( SUM(x0 in routes: duration(x0)) )\n[SOFT] AND( EACH(x1 in routes): EACH(x2 in visits(x1)): wait_duration(x2) <= max_wait(x1), EACH(x3 in routes): end_time(x3) <= work_end(x3), EACH(x4 in routes): EACH(x5 in rounds(x4)): end_time(x5) <= round_window_end(x4) )\nAND( EACH(x6 in routes): travel_distance(x6) <= total_limit(x6), EACH(x7 in routes): EACH(x8 in rounds(x7)): travel_distance(x8) <= trip_limit(x7), EACH(x9 in routes): EACH(x10 in adjacent(visit_seq(x9))): travel_distance(x10) <= between_limit(x9) )", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:rider_distance.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:rider_distance", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:rider_time_window.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:rider_time_window", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:duration_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/multi:routing:f973de774a1b4655", "domain": "routing", "language": "mixed", "messages": [{"role": "user", "content": "전체 route 이동거리 합 최소화로 가고, 한 route당 배송지는 12개까지만 해줘. 그리고 route·회전·연속 두 정류장 사이 거리는 각각 그 route 기사 본인의 총거리 한도, 회전별 한도, 정류장 간 한도 안에 들어가야 하고, 회전마다 stop 다 감싸는 최소 원 반경은 3km 이하로 하자"}], "ir": "MINIMIZE( SUM(x0 in routes: travel_distance(x0)) )\nEACH(x1 in routes): delivery_count(x1) <= 12\nAND( EACH(x2 in routes): travel_distance(x2) <= total_limit(x2), EACH(x3 in routes): EACH(x4 in rounds(x3)): travel_distance(x4) <= trip_limit(x3), EACH(x5 in routes): EACH(x6 in adjacent(visit_seq(x5))): travel_distance(x6) <= between_limit(x5) )\nEACH(x7 in routes): EACH(x8 in rounds(x7)): sec_radius(x8) <= 3 km", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:delivery_length.exp_factor", "value": {"type": "decimal", "value": "2"}}, {"slot_ref": "slot:delivery_length.max_size", "value": {"type": "decimal", "value": "12"}}], "constraint_ref": "constraint:delivery_length", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:rider_distance.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:rider_distance", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:round_enclosing_circle_radius.exp_factor", "value": {"type": "decimal", "value": "2"}}, {"slot_ref": "slot:round_enclosing_circle_radius.max_radius", "value": {"type": "decimal", "value": "3000"}}], "constraint_ref": "constraint:round_enclosing_circle_radius", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:distance_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/multi", "episode_id": null} {"id": "v4/multi:routing:fcc4b5a768305d8a", "domain": "routing", "language": "en", "messages": [{"role": "user", "content": "Please minimize the total travel distance across all routes. Each route can have at most 12 deliveries, and every route's distance, each round trip's distance, and each leg between consecutive stops has to stay within that route's rider's own limits (total, per-round, and between-stops). Also, for every round trip the smallest circle enclosing its stops should have a radius of 3 km or less"}], "ir": "MINIMIZE( SUM(x0 in routes: travel_distance(x0)) )\nEACH(x1 in routes): delivery_count(x1) <= 12\nAND( EACH(x2 in routes): travel_distance(x2) <= total_limit(x2), EACH(x3 in routes): EACH(x4 in rounds(x3)): travel_distance(x4) <= trip_limit(x3), EACH(x5 in routes): EACH(x6 in adjacent(visit_seq(x5))): travel_distance(x6) <= between_limit(x5) )\nEACH(x7 in routes): EACH(x8 in rounds(x7)): sec_radius(x8) <= 3 km", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:delivery_length.exp_factor", "value": {"type": "decimal", "value": "2"}}, {"slot_ref": "slot:delivery_length.max_size", "value": {"type": "decimal", "value": "12"}}], "constraint_ref": "constraint:delivery_length", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:rider_distance.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:rider_distance", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:round_enclosing_circle_radius.exp_factor", "value": {"type": "decimal", "value": "2"}}, {"slot_ref": "slot:round_enclosing_circle_radius.max_radius", "value": {"type": "decimal", "value": "3000"}}], "constraint_ref": "constraint:round_enclosing_circle_radius", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:distance_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/multi", "episode_id": null} {"id": "v4/multi:routing:2e082c39b90ea808", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "전체 경로의 총 이동거리를 최소화해 주시기 바랍니다. 각 경로의 배송지는 12개 이하여야 하며, 경로 전체 거리, 회전별 거리, 연속된 두 배송지 사이 거리는 각각 해당 경로 기사님의 총 거리 한도, 회전별 거리 한도, 배송지 간 거리 한도 이내여야 합니다. 또한 모든 경로의 각 회전에서 배송지를 모두 포함하는 최소 외접원의 반경은 3km 이하로 부탁드립니다"}], "ir": "MINIMIZE( SUM(x0 in routes: travel_distance(x0)) )\nEACH(x1 in routes): delivery_count(x1) <= 12\nAND( EACH(x2 in routes): travel_distance(x2) <= total_limit(x2), EACH(x3 in routes): EACH(x4 in rounds(x3)): travel_distance(x4) <= trip_limit(x3), EACH(x5 in routes): EACH(x6 in adjacent(visit_seq(x5))): travel_distance(x6) <= between_limit(x5) )\nEACH(x7 in routes): EACH(x8 in rounds(x7)): sec_radius(x8) <= 3 km", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:delivery_length.exp_factor", "value": {"type": "decimal", "value": "2"}}, {"slot_ref": "slot:delivery_length.max_size", "value": {"type": "decimal", "value": "12"}}], "constraint_ref": "constraint:delivery_length", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:rider_distance.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:rider_distance", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:round_enclosing_circle_radius.exp_factor", "value": {"type": "decimal", "value": "2"}}, {"slot_ref": "slot:round_enclosing_circle_radius.max_radius", "value": {"type": "decimal", "value": "3000"}}], "constraint_ref": "constraint:round_enclosing_circle_radius", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:distance_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/multi", "episode_id": null} {"id": "v4/combo:routing:9feba08c4f33e6dd", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "전체 경로 이동거리 합계 최소화하고 차량 고정비용 합계도 최소화해 주세요. 경로마다 회전 수는 계약된 최소 회전 수 이상이어야 하고 무조건 지켜야 해요, 배송 건수는 경로당 최대 12건이에요"}], "ir": "MINIMIZE( SUM(x0 in routes: travel_distance(x0)) )\nMINIMIZE( SUM(x1 in routes: fixed_cost(x1)) )\n[HARD] EACH(x2 in routes): round_count(x2) >= base_rounds(x2)\nEACH(x3 in routes): delivery_count(x3) <= 12", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:minimum_round", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [{"slot_ref": "slot:delivery_length.exp_factor", "value": {"type": "decimal", "value": "2"}}, {"slot_ref": "slot:delivery_length.max_size", "value": {"type": "decimal", "value": "12"}}], "constraint_ref": "constraint:delivery_length", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:distance_cost", "weight": "1/2"}, {"objective_ref": "objective:fixed_cost", "weight": "1/2"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:c45b626b40e8e3c7", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "이동거리 총합이랑 차량 운영 고정비용 총합 둘 다 줄이는 방향으로 짜 주세요. 모든 경로는 기사 계약 최소 회전 수를 절대 밑돌면 안 되고, 한 경로 배송지 수는 12개 이하로 해 주세요"}], "ir": "MINIMIZE( SUM(x0 in routes: travel_distance(x0)) )\nMINIMIZE( SUM(x1 in routes: fixed_cost(x1)) )\n[HARD] EACH(x2 in routes): round_count(x2) >= base_rounds(x2)\nEACH(x3 in routes): delivery_count(x3) <= 12", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:minimum_round", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [{"slot_ref": "slot:delivery_length.exp_factor", "value": {"type": "decimal", "value": "2"}}, {"slot_ref": "slot:delivery_length.max_size", "value": {"type": "decimal", "value": "12"}}], "constraint_ref": "constraint:delivery_length", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:distance_cost", "weight": "1/2"}, {"objective_ref": "objective:fixed_cost", "weight": "1/2"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/multi:retail:639f9b414da8effc", "domain": "retail", "language": "ko", "messages": [{"role": "user", "content": "저희 매장 발주 계획을 짜고 있는데요, 계획 기간 동안 하루 평균 재고 보유비용이 가장 낮아지도록 해 주세요. 그리고 가능하면 모든 발주는 입고일이 발주일에 해당 품목 공급자의 리드타임을 더한 날이 되게 해 주시고, 되도록 발주 요일도 그 품목에 허용된 발주 가능 요일 안에서 잡아 주세요"}], "ir": "MINIMIZE( MEAN(x0 in days(horizon): holding_cost(x0)) )\n[SOFT] EACH(x1 in orders): arrival_day(x1) = offset(order_day(x1), lead_time(x1))\n[SOFT] EACH(x2 in orders): day_of_week(x2) IN allowed_order_days(x2)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:lead_time", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [], "constraint_ref": "constraint:order_days", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:minimize_holding_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/multi", "episode_id": null} {"id": "v4/multi:retail:6f5d7247d61bb2cf", "domain": "retail", "language": "en", "messages": [{"role": "user", "content": "Quick request for the supplier order plan: minimize the average holding cost across the planning days. If possible, every order should arrive on its order day plus that item's supplier lead time, and ideally each order should be placed on one of the item's allowed order weekdays."}], "ir": "MINIMIZE( MEAN(x0 in days(horizon): holding_cost(x0)) )\n[SOFT] EACH(x1 in orders): arrival_day(x1) = offset(order_day(x1), lead_time(x1))\n[SOFT] EACH(x2 in orders): day_of_week(x2) IN allowed_order_days(x2)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:lead_time", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [], "constraint_ref": "constraint:order_days", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:minimize_holding_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/multi", "episode_id": null} {"id": "v4/multi:retail:e8a4cca15f11bd36", "domain": "retail", "language": "ko", "messages": [{"role": "user", "content": "계획 기간 하루 평균 재고 보유비용 최소로 가자. 가능하면 발주마다 입고일은 발주일+공급자 리드타임으로 맞추고, 되도록 발주 요일도 품목별 발주 가능 요일 안에서 잡아줘"}], "ir": "MINIMIZE( MEAN(x0 in days(horizon): holding_cost(x0)) )\n[SOFT] EACH(x1 in orders): arrival_day(x1) = offset(order_day(x1), lead_time(x1))\n[SOFT] EACH(x2 in orders): day_of_week(x2) IN allowed_order_days(x2)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:lead_time", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [], "constraint_ref": "constraint:order_days", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:minimize_holding_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/multi", "episode_id": null} {"id": "v4/combo:routing:60b0bc2df6a6bc2b", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "내일 배차 계획 짜는 중인데요, 모든 경로를 합친 전체 운행시간이 최소가 되게 해 주세요. 그리고 가능하면 각 경로의 정류장을 감싸는 가장 작은 원 반경이 5km 이내로 유지되면 좋겠어요"}], "ir": "MINIMIZE( SUM(x0 in routes: duration(x0)) )\n[SOFT] EACH(x1 in routes): sec_radius(x1) <= 5 km", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:enclosing_circle_radius.exp_factor", "value": {"type": "decimal", "value": "2"}}, {"slot_ref": "slot:enclosing_circle_radius.max_radius", "value": {"type": "decimal", "value": "5000"}}], "constraint_ref": "constraint:enclosing_circle_radius", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:duration_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:660c8252071dd482", "domain": "routing", "language": "mixed", "messages": [{"role": "user", "content": "전체 route의 total duration이 최소가 되도록 배차 부탁드립니다. 가능하면 각 route의 stop을 감싸는 최소 외접원 반경은 5km 이하로 맞춰 주시기 바랍니다"}], "ir": "MINIMIZE( SUM(x0 in routes: duration(x0)) )\n[SOFT] EACH(x1 in routes): sec_radius(x1) <= 5 km", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:enclosing_circle_radius.exp_factor", "value": {"type": "decimal", "value": "2"}}, {"slot_ref": "slot:enclosing_circle_radius.max_radius", "value": {"type": "decimal", "value": "5000"}}], "constraint_ref": "constraint:enclosing_circle_radius", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:duration_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:7f6114eff9cb5ae1", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "총 운행시간 최소화 부탁드립니다. 가능하면 경로별 외접원 반경 5km 이하로 해 주십시오"}], "ir": "MINIMIZE( SUM(x0 in routes: duration(x0)) )\n[SOFT] EACH(x1 in routes): sec_radius(x1) <= 5 km", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:enclosing_circle_radius.exp_factor", "value": {"type": "decimal", "value": "2"}}, {"slot_ref": "slot:enclosing_circle_radius.max_radius", "value": {"type": "decimal", "value": "5000"}}], "constraint_ref": "constraint:enclosing_circle_radius", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:duration_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:040a4a670600ebb7", "domain": "routing", "language": "en", "messages": [{"role": "user", "content": "Cut total fuel cost across all routes, and no round trip's peak load in any dimension goes over its vehicle's capacity."}], "ir": "MINIMIZE( SUM(x0 in routes: fuel_cost(x0)) )\nEACH(x1 in routes): EACH(x2 in rounds(x1)): EACH(x3 in keys(load)): MAX(x4 in positions(x2): load[x3](x4)) <= capacity[x3](x1)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:capacity.exp_factor", "value": {"type": "decimal", "value": "1"}}], "constraint_ref": "constraint:capacity", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fuel_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:aec168ae485a8e30", "domain": "routing", "language": "en", "messages": [{"role": "user", "content": "Minimize the total fuel cost over all routes. On every route, for each round trip, the largest load carried at any point along it has to stay within the vehicle's capacity in every cargo dimension"}], "ir": "MINIMIZE( SUM(x0 in routes: fuel_cost(x0)) )\nEACH(x1 in routes): EACH(x2 in rounds(x1)): EACH(x3 in keys(load)): MAX(x4 in positions(x2): load[x3](x4)) <= capacity[x3](x1)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:capacity.exp_factor", "value": {"type": "decimal", "value": "1"}}], "constraint_ref": "constraint:capacity", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fuel_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:c28b3382b91ffd52", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "전체 경로 연료비 총합이 최소가 되게 짜줘. 그리고 각 경로의 왕복마다 중량, 부피 같은 적재 항목별로 구간 중 가장 많이 실은 값이 그 경로 차량의 용량 이하여야 해"}], "ir": "MINIMIZE( SUM(x0 in routes: fuel_cost(x0)) )\nEACH(x1 in routes): EACH(x2 in rounds(x1)): EACH(x3 in keys(load)): MAX(x4 in positions(x2): load[x3](x4)) <= capacity[x3](x1)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:capacity.exp_factor", "value": {"type": "decimal", "value": "1"}}], "constraint_ref": "constraint:capacity", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fuel_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:da4fe17941615ac8", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "전체 경로의 총 이동거리를 최소화하는 배차안을 부탁드립니다. 모든 경로의 회차마다 중량, 부피 같은 적재 항목별로 회차 중 가장 큰 적재량이 해당 차량 용량 이하로 부탁드립니다. 가능하면 각 배송의 서비스 전 대기시간은 기사별 대기 한도 이하로, 경로 종료 시각은 기사 근무 종료 시각 이하로, 회차 종료 시각은 기사별 회차 종료 시각 이하로 맞춰 주시고, 동일 좌표 배송지는 반드시 같은 경로에 배정해 주십시오."}], "ir": "MINIMIZE( SUM(x0 in routes: travel_distance(x0)) )\nEACH(x1 in routes): EACH(x2 in rounds(x1)): EACH(x3 in keys(load)): MAX(x4 in positions(x2): load[x3](x4)) <= capacity[x3](x1)\n[SOFT] AND( EACH(x5 in routes): EACH(x6 in visits(x5)): wait_duration(x6) <= max_wait(x5), EACH(x7 in routes): end_time(x7) <= work_end(x7), EACH(x8 in routes): EACH(x9 in rounds(x8)): end_time(x9) <= round_window_end(x8) )\n[HARD] EACH((x10, x11) in pairs(visits, same_coordinate)): TOGETHER(x10, x11, route)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:capacity.exp_factor", "value": {"type": "decimal", "value": "1"}}], "constraint_ref": "constraint:capacity", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [{"slot_ref": "slot:rider_time_window.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:rider_time_window", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:same_coordinate_grouping.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:same_coordinate_grouping", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:distance_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:c6d41ece20f62083", "domain": "routing", "language": "mixed", "messages": [{"role": "user", "content": "전체 route 운행시간 합계 최소화, 각 배송은 time window 마감시간 이전 출발 부탁드립니다"}], "ir": "MINIMIZE( SUM(x0 in routes: duration(x0)) )\nEACH(x1 in visits): departure_time(x1) <= tw_late(x1)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:time_window.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:time_window", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:duration_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:ac39194e4a1e0912", "domain": "routing", "language": "mixed", "messages": [{"role": "user", "content": "모든 route의 총 운행시간을 최소화해 주시고, 각 배송 건은 허용된 마지막 시간 이전에 출발하도록 time window를 맞춰 부탁드립니다."}], "ir": "MINIMIZE( SUM(x0 in routes: duration(x0)) )\nEACH(x1 in visits): departure_time(x1) <= tw_late(x1)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:time_window.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:time_window", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:duration_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:379a19e05a091e0e", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "전체 경로의 시작부터 끝까지 총 소요시간을 최소로 해 주세요. 그리고 모든 배송은 배송 가능 시간대의 마감 시각을 넘기지 않고 출발해야 합니다."}], "ir": "MINIMIZE( SUM(x0 in routes: duration(x0)) )\nEACH(x1 in visits): departure_time(x1) <= tw_late(x1)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:time_window.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:time_window", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:duration_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:e5d4ec537823f615", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "전체 경로의 출발부터 종료까지 걸리는 시간을 합쳐서 최소화해 주세요. 모든 배송은 작업 시작부터 끝까지 해당 배송의 방문 금지 시간대와 겹치지 않게 해 주세요. 모든 경로에서 매 왕복 운행 중 지점별 적재량의 최댓값이 중량, 부피 등 각 적재 항목별로 해당 차량의 용량을 반드시 넘지 않게 해 주세요"}], "ir": "MINIMIZE( SUM(x0 in routes: duration(x0)) )\nEACH(x1 in visits): NOT OVERLAPS(service_interval(x1), prohibited_window(x1))\n[HARD] EACH(x2 in routes): EACH(x3 in rounds(x2)): EACH(x4 in keys(load)): MAX(x5 in positions(x3): load[x4](x5)) <= capacity[x4](x2)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:prohibited_time_window", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:capacity.exp_factor", "value": {"type": "decimal", "value": "1"}}], "constraint_ref": "constraint:capacity", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:duration_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:d181215873ce92fa", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "모든 경로의 출발부터 종료까지 걸리는 시간을 합쳐 최소화하고, 모든 배송의 작업 시간은 해당 배송의 방문 금지 시간대랑 겹치지 않게 해줘. 모든 경로에서 매 왕복 운행마다 중량, 부피 등 적재 항목별로 지점별 적재량 중 가장 큰 값이 해당 차량의 용량을 반드시 넘지 않게 해줘"}], "ir": "MINIMIZE( SUM(x0 in routes: duration(x0)) )\nEACH(x1 in visits): NOT OVERLAPS(service_interval(x1), prohibited_window(x1))\n[HARD] EACH(x2 in routes): EACH(x3 in rounds(x2)): EACH(x4 in keys(load)): MAX(x5 in positions(x3): load[x4](x5)) <= capacity[x4](x2)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:prohibited_time_window", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:capacity.exp_factor", "value": {"type": "decimal", "value": "1"}}], "constraint_ref": "constraint:capacity", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:duration_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:f8897ea83e63b6e7", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "전체 경로의 시작부터 끝까지 소요되는 시간의 합을 최소화해 주세요. 모든 배송의 작업 시작부터 종료까지가 해당 배송의 방문 금지 시간대와 겹치지 않도록 해 주세요. 모든 경로의 매 왕복 운행에서 중량, 부피 등 각 적재 항목의 지점별 최대 적재량은 반드시 해당 차량의 항목별 용량 이내로 맞춰 주세요"}], "ir": "MINIMIZE( SUM(x0 in routes: duration(x0)) )\nEACH(x1 in visits): NOT OVERLAPS(service_interval(x1), prohibited_window(x1))\n[HARD] EACH(x2 in routes): EACH(x3 in rounds(x2)): EACH(x4 in keys(load)): MAX(x5 in positions(x3): load[x4](x5)) <= capacity[x4](x2)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:prohibited_time_window", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:capacity.exp_factor", "value": {"type": "decimal", "value": "1"}}], "constraint_ref": "constraint:capacity", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:duration_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:1e2e1d72043d7c29", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "모든 경로의 출발부터 종료까지 걸리는 시간을 합쳐서 최소화해줘. 경로마다 배송 건수는 가능하면 15건 이하로 하고, 서로 1km 이내인 배송지는 같은 경로로 묶어줘"}], "ir": "MINIMIZE( SUM(x0 in routes: duration(x0)) )\n[SOFT] EACH(x1 in routes): delivery_count(x1) <= 15\nEACH((x2, x3) in pairs(visits, nearby(1 km))): TOGETHER(x2, x3, route)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:delivery_length.exp_factor", "value": {"type": "decimal", "value": "2"}}, {"slot_ref": "slot:delivery_length.max_size", "value": {"type": "decimal", "value": "15"}}], "constraint_ref": "constraint:delivery_length", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:nearby_delivery_grouping.distance_threshold", "value": {"type": "decimal", "value": "1000"}}, {"slot_ref": "slot:nearby_delivery_grouping.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:nearby_delivery_grouping", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:duration_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:b20fa500e7d86fcd", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "모든 경로의 출발부터 종료까지 소요되는 시간의 합을 최소화해 주시기 바랍니다. 각 경로의 배송 건수는 되도록 15건 이하로 배정하고, 서로 1km 이내에 있는 배송지는 같은 경로에 배정해 주시기 바랍니다"}], "ir": "MINIMIZE( SUM(x0 in routes: duration(x0)) )\n[SOFT] EACH(x1 in routes): delivery_count(x1) <= 15\nEACH((x2, x3) in pairs(visits, nearby(1 km))): TOGETHER(x2, x3, route)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:delivery_length.exp_factor", "value": {"type": "decimal", "value": "2"}}, {"slot_ref": "slot:delivery_length.max_size", "value": {"type": "decimal", "value": "15"}}], "constraint_ref": "constraint:delivery_length", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:nearby_delivery_grouping.distance_threshold", "value": {"type": "decimal", "value": "1000"}}, {"slot_ref": "slot:nearby_delivery_grouping.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:nearby_delivery_grouping", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:duration_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:fe735b5c3c2c6106", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "배차는 모든 경로의 출발부터 종료까지 걸리는 시간을 합쳐서 최소화하는 걸로 해줘. 경로별 배송 건수는 가능하면 15건 이하로 잡아줘. 서로 1km 이내에 있는 배송지들은 같은 경로로 묶어줘"}], "ir": "MINIMIZE( SUM(x0 in routes: duration(x0)) )\n[SOFT] EACH(x1 in routes): delivery_count(x1) <= 15\nEACH((x2, x3) in pairs(visits, nearby(1 km))): TOGETHER(x2, x3, route)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:delivery_length.exp_factor", "value": {"type": "decimal", "value": "2"}}, {"slot_ref": "slot:delivery_length.max_size", "value": {"type": "decimal", "value": "15"}}], "constraint_ref": "constraint:delivery_length", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:nearby_delivery_grouping.distance_threshold", "value": {"type": "decimal", "value": "1000"}}, {"slot_ref": "slot:nearby_delivery_grouping.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:nearby_delivery_grouping", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:duration_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/base:routing:237dd48e3ac1da12", "domain": "routing", "language": "mixed", "messages": [{"role": "user", "content": "전체 route의 시작부터 종료까지 걸리는 시간을 합쳐서 최소화해 주세요. 모든 배송지에서 출발하는 시간이 해당 배송지의 time window 종료 시각을 넘지 않게 해 주세요."}], "ir": "MINIMIZE( SUM(x0 in routes: duration(x0)) )\nEACH(x1 in visits): departure_time(x1) <= tw_late(x1)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:time_window.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:time_window", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:duration_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/base", "episode_id": null} {"id": "v4/base:routing:0ac8e532575e7c8f", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "모든 경로의 시작부터 끝까지 걸리는 시간 합계를 최소화해줘. 각 배송지에서는 배송 허용 시간대가 끝나는 시각까지 출발하게 해줘."}], "ir": "MINIMIZE( SUM(x0 in routes: duration(x0)) )\nEACH(x1 in visits): departure_time(x1) <= tw_late(x1)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:time_window.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:time_window", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:duration_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/base", "episode_id": null} {"id": "v4/base:routing:d9fd08e9d60e277b", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "전체 배송 경로마다 시작해서 끝날 때까지 걸리는 시간을 다 더해서 최소화해줘. 배송지마다 정해진 배송 가능 시간대가 끝나기 전이나 끝나는 시각에 출발하도록 잡아줘."}], "ir": "MINIMIZE( SUM(x0 in routes: duration(x0)) )\nEACH(x1 in visits): departure_time(x1) <= tw_late(x1)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:time_window.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:time_window", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:duration_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/base", "episode_id": null} {"id": "v4/combo:routing:b0aebb6b5f5c099a", "domain": "routing", "language": "en", "messages": [{"role": "user", "content": "Plan the routes to minimize the sum of their elapsed times from start to finish. Every route must have at most 5 deliveries. On each route, arrange the stops from highest to lowest time priority and keep the travel distance at or below 100 km."}], "ir": "MINIMIZE( SUM(x0 in routes: duration(x0)) )\n[HARD] EACH(x1 in routes): delivery_count(x1) <= 5\nEACH(x2 in routes): ORDERED_BY(visit_seq(x2), time_priority, DESC)\nEACH(x3 in routes): travel_distance(x3) <= 100 km", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:delivery_length.exp_factor", "value": {"type": "decimal", "value": "2"}}, {"slot_ref": "slot:delivery_length.max_size", "value": {"type": "decimal", "value": "5"}}], "constraint_ref": "constraint:delivery_length", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [{"slot_ref": "slot:max_distance.exp_factor", "value": {"type": "decimal", "value": "1"}}, {"slot_ref": "slot:max_distance.max_distance", "value": {"type": "decimal", "value": "100000"}}], "constraint_ref": "constraint:max_distance", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:time_priority_order.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:time_priority_order", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:duration_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:0468042a079ff0b5", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "전체 경로마다 출발해서 끝날 때까지 걸리는 시간을 다 합쳐서 최소화해줘. 각 경로의 배송은 반드시 5건 이하로 잡아줘. 경로마다 시간 우선순위가 높은 곳부터 방문하고, 이동거리는 100km 이하로 해줘."}], "ir": "MINIMIZE( SUM(x0 in routes: duration(x0)) )\n[HARD] EACH(x1 in routes): delivery_count(x1) <= 5\nEACH(x2 in routes): ORDERED_BY(visit_seq(x2), time_priority, DESC)\nEACH(x3 in routes): travel_distance(x3) <= 100 km", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:delivery_length.exp_factor", "value": {"type": "decimal", "value": "2"}}, {"slot_ref": "slot:delivery_length.max_size", "value": {"type": "decimal", "value": "5"}}], "constraint_ref": "constraint:delivery_length", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [{"slot_ref": "slot:max_distance.exp_factor", "value": {"type": "decimal", "value": "1"}}, {"slot_ref": "slot:max_distance.max_distance", "value": {"type": "decimal", "value": "100000"}}], "constraint_ref": "constraint:max_distance", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:time_priority_order.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:time_priority_order", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:duration_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/residual:retail:147fa7e2a17958a3", "domain": "retail", "language": "ko", "messages": [{"role": "user", "content": "발주 플랜은 매출에서 상품 원가와 폐기 비용을 뺀 이익이 최대가 되게 잡아 주세요. 모든 배송은 새벽 4시 전에 도착하는 스케줄로 잡아 주세요."}], "ir": "MAXIMIZE( profit )\nUNEXPRESSED(literal, constraint)", "decision_kind": "unsupported", "gold_decision": {"kind": "unsupported", "reason_code": "semantic_not_declared", "related_refs": []}, "stratum": "v4/residual", "episode_id": null} {"id": "v4/residual:retail:f7f21f17715c4a4c", "domain": "retail", "language": "ko", "messages": [{"role": "user", "content": "발주는 매출에서 상품 원가와 폐기 비용을 뺀 이익이 최대가 되도록 짜 주세요. 모든 납품은 새벽 4시 전에 도착해야 해요."}], "ir": "MAXIMIZE( profit )\nUNEXPRESSED(literal, constraint)", "decision_kind": "unsupported", "gold_decision": {"kind": "unsupported", "reason_code": "semantic_not_declared", "related_refs": []}, "stratum": "v4/residual", "episode_id": null} {"id": "v4/residual:retail:24bc714e7739e77d", "domain": "retail", "language": "ko", "messages": [{"role": "user", "content": "매출에서 상품 원가랑 폐기 비용 뺀 이익을 최대화해줘. 모든 납품은 새벽 4시 전에 도착하게 해줘."}], "ir": "MAXIMIZE( profit )\nUNEXPRESSED(literal, constraint)", "decision_kind": "unsupported", "gold_decision": {"kind": "unsupported", "reason_code": "semantic_not_declared", "related_refs": []}, "stratum": "v4/residual", "episode_id": null} {"id": "v4/fragment:routing:56b2ac3707c029f3", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "모든 경로의 방문 순서는 반드시 시간 우선순위가 높은 순으로 정해 주세요."}], "ir": "[HARD] EACH(x0 in routes): ORDERED_BY(visit_seq(x0), time_priority, DESC)", "decision_kind": "clarify", "gold_decision": {"candidate_refs": [], "kind": "clarify", "missing_field_refs": [], "reason_code": "missing_value", "required_inputs": [{"field": "objectives", "kind": "decision_field"}]}, "stratum": "v4/fragment", "episode_id": null} {"id": "v4/fragment:routing:4ac7da04ead9cdbe", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "각 경로에서 시간 우선순위가 높은 곳부터 방문하도록 반드시 순서를 잡아 주세요"}], "ir": "[HARD] EACH(x0 in routes): ORDERED_BY(visit_seq(x0), time_priority, DESC)", "decision_kind": "clarify", "gold_decision": {"candidate_refs": [], "kind": "clarify", "missing_field_refs": [], "reason_code": "missing_value", "required_inputs": [{"field": "objectives", "kind": "decision_field"}]}, "stratum": "v4/fragment", "episode_id": null} {"id": "v4/fragment:routing:1d2811d0015d762d", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "모든 경로는 반드시 시간 우선순위 높은 순으로 방문하게 해 주세요."}], "ir": "[HARD] EACH(x0 in routes): ORDERED_BY(visit_seq(x0), time_priority, DESC)", "decision_kind": "clarify", "gold_decision": {"candidate_refs": [], "kind": "clarify", "missing_field_refs": [], "reason_code": "missing_value", "required_inputs": [{"field": "objectives", "kind": "decision_field"}]}, "stratum": "v4/fragment", "episode_id": null} {"id": "v4/vehicle:routing:a89cf09c517b2adf", "domain": "routing", "language": "en", "messages": [{"role": "user", "content": "Please build tomorrow's dispatch plan so the total time from start to finish across all routes is as short as possible. We can use 2 vehicles at most."}], "ir": "MINIMIZE( SUM(x0 in routes: duration(x0)) )\nCOUNT(x1 in routes) <= 2", "decision_kind": "execute", "gold_decision": {"constraints": [], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:duration_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/vehicle", "episode_id": null} {"id": "v4/vehicle:routing:4084f43ed0e0f1ef", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "전체 경로 운행시간 다 합친 게 제일 적게 나오게 짜줘. 차는 2대까지만 쓰자"}], "ir": "MINIMIZE( SUM(x0 in routes: duration(x0)) )\nCOUNT(x1 in routes) <= 2", "decision_kind": "execute", "gold_decision": {"constraints": [], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:duration_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/vehicle", "episode_id": null} {"id": "v4/combo:routing:2990875a046fdc4f", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "모든 경로의 총 이동거리를 최소화해 주세요. 가능하면 각 경로의 정류지를 모두 감싸는 가장 작은 원의 반경이 해당 기사님의 서비스 반경 이내가 되도록 하고, 동일 좌표에 있는 배송건은 반드시 같은 경로에서 처리해 주시기 바랍니다."}], "ir": "MINIMIZE( SUM(x0 in routes: travel_distance(x0)) )\n[SOFT] EACH(x1 in routes): sec_radius(x1) <= individual_radius_limit(x1)\n[HARD] EACH((x2, x3) in pairs(visits, same_coordinate)): TOGETHER(x2, x3, route)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:individual_enclosing_circle_radius.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:individual_enclosing_circle_radius", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:same_coordinate_grouping.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:same_coordinate_grouping", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:distance_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:3d4efce12e1fd687", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "오늘 배차는 전체 경로의 총 이동거리가 제일 짧게 나오도록 짜줘. 되도록이면 경로마다 방문지를 다 감싸는 최소 원 반경이 그 기사 개인 반경 제한 안에 들어오게 해줘. 그리고 같은 좌표에 있는 배송은 무조건 한 경로에 같이 들어가야 해."}], "ir": "MINIMIZE( SUM(x0 in routes: travel_distance(x0)) )\n[SOFT] EACH(x1 in routes): sec_radius(x1) <= individual_radius_limit(x1)\n[HARD] EACH((x2, x3) in pairs(visits, same_coordinate)): TOGETHER(x2, x3, route)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:individual_enclosing_circle_radius.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:individual_enclosing_circle_radius", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:same_coordinate_grouping.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:same_coordinate_grouping", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:distance_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:d6a5e6fa98c6c2d3", "domain": "routing", "language": "en", "messages": [{"role": "user", "content": "Please plan the routes so the total travel distance across all routes is as small as possible. If possible, keep each route's smallest enclosing circle within that rider's own radius limit. Deliveries at the same coordinate must always be on the same route."}], "ir": "MINIMIZE( SUM(x0 in routes: travel_distance(x0)) )\n[SOFT] EACH(x1 in routes): sec_radius(x1) <= individual_radius_limit(x1)\n[HARD] EACH((x2, x3) in pairs(visits, same_coordinate)): TOGETHER(x2, x3, route)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:individual_enclosing_circle_radius.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:individual_enclosing_circle_radius", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:same_coordinate_grouping.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:same_coordinate_grouping", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:distance_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:nurse:f7aea479feac2956", "domain": "nurse", "language": "en", "messages": [{"role": "user", "content": "minimize total overtime across all nurses, and ideally keep each nurse under 52 hours every week"}], "ir": "MINIMIZE( SUM(x0 in workers: overtime_hours(x0)) )\n[SOFT] EACH(x1 in workers): EACH(x2 in windows(WEEK, 1)): SUM(x3 in assignments(x1) WHERE DURING(interval(x3), x2): work_hours(x3)) <= 52 h", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:max_hours", "value": {"type": "duration", "unit_ref": "unit:hour", "value": "52"}}], "constraint_ref": "constraint:max_hours_per_week", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:overtime", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:nurse:54f1d8f11e86c36e", "domain": "nurse", "language": "ko", "messages": [{"role": "user", "content": "전체 간호사의 초과근무 시간 총합을 최소화하고, 가능하면 모든 간호사가 매주 52시간 이하로 근무하게 해 주세요"}], "ir": "MINIMIZE( SUM(x0 in workers: overtime_hours(x0)) )\n[SOFT] EACH(x1 in workers): EACH(x2 in windows(WEEK, 1)): SUM(x3 in assignments(x1) WHERE DURING(interval(x3), x2): work_hours(x3)) <= 52 h", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:max_hours", "value": {"type": "duration", "unit_ref": "unit:hour", "value": "52"}}], "constraint_ref": "constraint:max_hours_per_week", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:overtime", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:nurse:2cd596335cf435a5", "domain": "nurse", "language": "en", "messages": [{"role": "user", "content": "Can you cut total overtime for all the nurses, and if possible keep everyone at 52 hours or less each week?"}], "ir": "MINIMIZE( SUM(x0 in workers: overtime_hours(x0)) )\n[SOFT] EACH(x1 in workers): EACH(x2 in windows(WEEK, 1)): SUM(x3 in assignments(x1) WHERE DURING(interval(x3), x2): work_hours(x3)) <= 52 h", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:max_hours", "value": {"type": "duration", "unit_ref": "unit:hour", "value": "52"}}], "constraint_ref": "constraint:max_hours_per_week", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:overtime", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:7cae102603ef5495", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "오늘 배차 짜는 중인데요, 전체 경로의 연료비 합계가 최소가 되도록 계획해 주세요. 각 배송은 가능하면 배달 금지 시간대를 피해서 방문해 주시고, 같은 좌표에 있는 배송지끼리는 반드시 같은 경로에 묶어서 배정해 주세요."}], "ir": "MINIMIZE( SUM(x0 in routes: fuel_cost(x0)) )\n[SOFT] EACH(x1 in visits): NOT OVERLAPS(service_interval(x1), prohibited_window(x1))\n[HARD] EACH((x2, x3) in pairs(visits, same_coordinate)): TOGETHER(x2, x3, route)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:prohibited_time_window", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:same_coordinate_grouping.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:same_coordinate_grouping", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fuel_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:f6ea7ada7dfafc0a", "domain": "routing", "language": "mixed", "messages": [{"role": "user", "content": "모든 route의 fuel 비용 총합을 최소화해 주시고, 각 배송은 되도록 배달 금지 시간대랑 겹치지 않게 해 주세요. 그리고 same coordinate에 있는 배송지는 무조건 같은 route로 묶어 주세요."}], "ir": "MINIMIZE( SUM(x0 in routes: fuel_cost(x0)) )\n[SOFT] EACH(x1 in visits): NOT OVERLAPS(service_interval(x1), prohibited_window(x1))\n[HARD] EACH((x2, x3) in pairs(visits, same_coordinate)): TOGETHER(x2, x3, route)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:prohibited_time_window", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:same_coordinate_grouping.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:same_coordinate_grouping", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fuel_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:757130c849d48ad6", "domain": "routing", "language": "en", "messages": [{"role": "user", "content": "Minimize the total fuel cost across all routes. If possible, keep each delivery from overlapping its prohibited time window, and deliveries at the same coordinate must always be on the same route"}], "ir": "MINIMIZE( SUM(x0 in routes: fuel_cost(x0)) )\n[SOFT] EACH(x1 in visits): NOT OVERLAPS(service_interval(x1), prohibited_window(x1))\n[HARD] EACH((x2, x3) in pairs(visits, same_coordinate)): TOGETHER(x2, x3, route)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:prohibited_time_window", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:same_coordinate_grouping.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:same_coordinate_grouping", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fuel_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:dcb8dcc8fcd89300", "domain": "routing", "language": "mixed", "messages": [{"role": "user", "content": "내일 배차 짜야 되는데 전체 루트 기준으로 연료비 총합도 줄이고 총 운행시간도 줄이는 쪽으로 가자. 둘 다 중요하니까 같이 봐줘. 그리고 모든 route는 배송 건수 최소 15건 이상 되게 해줘."}], "ir": "MINIMIZE( SUM(x0 in routes: fuel_cost(x0)) )\nMINIMIZE( SUM(x1 in routes: duration(x1)) )\nEACH(x2 in routes): delivery_count(x2) >= 15", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:minimum_order.target_order", "value": {"type": "decimal", "value": "15"}}], "constraint_ref": "constraint:minimum_order", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:duration_cost", "weight": "1/2"}, {"objective_ref": "objective:fuel_cost", "weight": "1/2"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:8db494f7adb010cd", "domain": "routing", "language": "mixed", "messages": [{"role": "user", "content": "이번 주 배차 짤 때 전체 route의 연료비 총합이랑 운행시간 총합을 둘 다 최소화해 주세요. 그리고 각 route마다 최소 배송 건수는 15건 이상으로 맞춰 주세요"}], "ir": "MINIMIZE( SUM(x0 in routes: fuel_cost(x0)) )\nMINIMIZE( SUM(x1 in routes: duration(x1)) )\nEACH(x2 in routes): delivery_count(x2) >= 15", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:minimum_order.target_order", "value": {"type": "decimal", "value": "15"}}], "constraint_ref": "constraint:minimum_order", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:duration_cost", "weight": "1/2"}, {"objective_ref": "objective:fuel_cost", "weight": "1/2"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/perturb:routing:c34b714b0a99fb89", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "모든 경로 합쳐서 총 이동거리 최소로 가고, 경로마다 배송 건수는 최소 8건 이상으로 해줘"}], "ir": "MINIMIZE( SUM(x0 in routes: travel_distance(x0)) )\nEACH(x1 in routes): delivery_count(x1) >= 8", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:minimum_order.target_order", "value": {"type": "decimal", "value": "8"}}], "constraint_ref": "constraint:minimum_order", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:distance_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/perturb", "episode_id": null} {"id": "v4/perturb:routing:de7dc5f1ea8dc54f", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "이번 배차는 이동거리 합계를 줄이는 쪽으로 가자. 대신 차량 경로 하나하나가 최소 8건은 배송하게 맞춰줘"}], "ir": "MINIMIZE( SUM(x0 in routes: travel_distance(x0)) )\nEACH(x1 in routes): delivery_count(x1) >= 8", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:minimum_order.target_order", "value": {"type": "decimal", "value": "8"}}], "constraint_ref": "constraint:minimum_order", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:distance_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/perturb", "episode_id": null} {"id": "v4/combo:routing:5f4671c984201dcc", "domain": "routing", "language": "en", "messages": [{"role": "user", "content": "Plan the delivery routes to minimize the total travel distance across all routes. Keep each route at 5 km or less, and arrange the stops on each route from highest to lowest time priority."}], "ir": "MINIMIZE( SUM(x0 in routes: travel_distance(x0)) )\nEACH(x1 in routes): travel_distance(x1) <= 5 km\nEACH(x2 in routes): ORDERED_BY(visit_seq(x2), time_priority, DESC)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:max_distance.exp_factor", "value": {"type": "decimal", "value": "1"}}, {"slot_ref": "slot:max_distance.max_distance", "value": {"type": "decimal", "value": "5000"}}], "constraint_ref": "constraint:max_distance", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:time_priority_order.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:time_priority_order", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:distance_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:a7c3b6c86c1fa6b1", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "전체 배송 경로의 이동거리 합계를 최소화해 주세요. 각 경로의 이동거리는 5km 이하로 하고, 모든 경로에서 시간 우선순위가 높은 곳부터 낮은 곳 순으로 방문하게 해 주세요."}], "ir": "MINIMIZE( SUM(x0 in routes: travel_distance(x0)) )\nEACH(x1 in routes): travel_distance(x1) <= 5 km\nEACH(x2 in routes): ORDERED_BY(visit_seq(x2), time_priority, DESC)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:max_distance.exp_factor", "value": {"type": "decimal", "value": "1"}}, {"slot_ref": "slot:max_distance.max_distance", "value": {"type": "decimal", "value": "5000"}}], "constraint_ref": "constraint:max_distance", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:time_priority_order.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:time_priority_order", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:distance_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:70f8072cfbb7cc70", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "모든 경로를 합친 총 이동거리가 최소가 되도록 배차해 주세요. 경로마다 이동거리는 5km 이하로 잡고 방문 순서는 시간 우선순위가 높은 순으로 정해 주세요"}], "ir": "MINIMIZE( SUM(x0 in routes: travel_distance(x0)) )\nEACH(x1 in routes): travel_distance(x1) <= 5 km\nEACH(x2 in routes): ORDERED_BY(visit_seq(x2), time_priority, DESC)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:max_distance.exp_factor", "value": {"type": "decimal", "value": "1"}}, {"slot_ref": "slot:max_distance.max_distance", "value": {"type": "decimal", "value": "5000"}}], "constraint_ref": "constraint:max_distance", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:time_priority_order.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:time_priority_order", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:distance_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/multi:routing:2e9aa7163b67046f", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "전체 경로의 총 운행시간을 최소화해 주시고, 각 배송의 출발 시각은 해당 배송의 가장 늦은 허용 시간 이내로 부탁드립니다. 그리고 경로마다 배차 센터 왕복 횟수, 회차별 정차 수, 경로 전체 정차 수는 각각 그 경로 기사의 한도 이내로 부탁드립니다"}], "ir": "MINIMIZE( SUM(x0 in routes: duration(x0)) )\nEACH(x1 in visits): departure_time(x1) <= tw_late(x1)\nAND( EACH(x2 in routes): round_count(x2) <= max_rounds(x2), EACH(x3 in routes): EACH(x4 in rounds(x3)): stop_count(x4) <= max_stops_per_round(x3), EACH(x5 in routes): stop_count(x5) <= max_stops(x5) )", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:rider_delivery_length.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:rider_delivery_length", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:time_window.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:time_window", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:duration_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/multi", "episode_id": null} {"id": "v4/multi:routing:c01c3d0457bbd7dd", "domain": "routing", "language": "en", "messages": [{"role": "user", "content": "Minimize the total time from start to finish across all routes. Every delivery departs by its latest allowed time, and each route stays within its rider's own limits on depot round trips, stops per round trip, and total stops"}], "ir": "MINIMIZE( SUM(x0 in routes: duration(x0)) )\nEACH(x1 in visits): departure_time(x1) <= tw_late(x1)\nAND( EACH(x2 in routes): round_count(x2) <= max_rounds(x2), EACH(x3 in routes): EACH(x4 in rounds(x3)): stop_count(x4) <= max_stops_per_round(x3), EACH(x5 in routes): stop_count(x5) <= max_stops(x5) )", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:rider_delivery_length.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:rider_delivery_length", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:time_window.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:time_window", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:duration_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/multi", "episode_id": null} {"id": "v4/multi:routing:7883cea18f8e4a2b", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "모든 경로를 합친 총 운행시간이 가장 짧게 나오도록 계획 부탁드립니다. 배송마다 출발 시간은 그 배송의 가장 늦은 허용 시간 이내여야 하고, 경로별로 왕복 횟수와 회차당 정차 수와 전체 정차 수는 각 기사에게 정해진 한도 이내로 부탁드립니다"}], "ir": "MINIMIZE( SUM(x0 in routes: duration(x0)) )\nEACH(x1 in visits): departure_time(x1) <= tw_late(x1)\nAND( EACH(x2 in routes): round_count(x2) <= max_rounds(x2), EACH(x3 in routes): EACH(x4 in rounds(x3)): stop_count(x4) <= max_stops_per_round(x3), EACH(x5 in routes): stop_count(x5) <= max_stops(x5) )", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:rider_delivery_length.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:rider_delivery_length", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:time_window.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:time_window", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:duration_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/multi", "episode_id": null} {"id": "v4/multi:routing:3e9cce467551f04c", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "전체 경로의 총연료비를 최소화하는 배차 계획 부탁드립니다. 모든 경로의 배송 건수는 5건 이상, 3건 이하로 설정 부탁드립니다."}], "ir": "MINIMIZE( SUM(x0 in routes: fuel_cost(x0)) )\nEACH(x1 in routes): delivery_count(x1) >= 5\nEACH(x2 in routes): delivery_count(x2) <= 3", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:delivery_length.exp_factor", "value": {"type": "decimal", "value": "2"}}, {"slot_ref": "slot:delivery_length.max_size", "value": {"type": "decimal", "value": "3"}}], "constraint_ref": "constraint:delivery_length", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:minimum_order.target_order", "value": {"type": "decimal", "value": "5"}}], "constraint_ref": "constraint:minimum_order", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fuel_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/multi", "episode_id": null} {"id": "v4/multi:routing:3579867f12239e81", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "전체 경로에서 드는 연료비 합계를 최소화해 주세요. 각 경로의 배송 건수는 5건 이상으로 잡아 주세요. 각 경로의 배송 건수는 3건 이하로 잡아 주세요."}], "ir": "MINIMIZE( SUM(x0 in routes: fuel_cost(x0)) )\nEACH(x1 in routes): delivery_count(x1) >= 5\nEACH(x2 in routes): delivery_count(x2) <= 3", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:delivery_length.exp_factor", "value": {"type": "decimal", "value": "2"}}, {"slot_ref": "slot:delivery_length.max_size", "value": {"type": "decimal", "value": "3"}}], "constraint_ref": "constraint:delivery_length", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:minimum_order.target_order", "value": {"type": "decimal", "value": "5"}}], "constraint_ref": "constraint:minimum_order", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fuel_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/multi", "episode_id": null} {"id": "v4/multi:routing:b95fdf0034b0da10", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "전체 경로의 연료비 합계가 최소가 되게 짜줘. 모든 경로는 배송 5건 이상, 3건 이하로 잡아줘"}], "ir": "MINIMIZE( SUM(x0 in routes: fuel_cost(x0)) )\nEACH(x1 in routes): delivery_count(x1) >= 5\nEACH(x2 in routes): delivery_count(x2) <= 3", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:delivery_length.exp_factor", "value": {"type": "decimal", "value": "2"}}, {"slot_ref": "slot:delivery_length.max_size", "value": {"type": "decimal", "value": "3"}}], "constraint_ref": "constraint:delivery_length", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:minimum_order.target_order", "value": {"type": "decimal", "value": "5"}}], "constraint_ref": "constraint:minimum_order", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fuel_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/multi", "episode_id": null} {"id": "v4/residual:nurse:f9fd5f5244960694", "domain": "nurse", "language": "ko", "messages": [{"role": "user", "content": "전체 근무의 필요 인원 대비 부족 인원 합계를 최소화해 주세요. 근무 시작은 오전 6시 이전으로 잡지 마세요."}], "ir": "MINIMIZE( SUM(x0 in shift_instances: unmet_demand(x0)) )\nUNEXPRESSED(literal, constraint)", "decision_kind": "unsupported", "gold_decision": {"kind": "unsupported", "reason_code": "semantic_not_declared", "related_refs": []}, "stratum": "v4/residual", "episode_id": null} {"id": "v4/residual:nurse:7c892396922c3a10", "domain": "nurse", "language": "ko", "messages": [{"role": "user", "content": "전체 근무에서 필요 인원보다 부족한 인원의 합계를 최소화해줘. 근무는 오전 6시 전에 시작하지 않게 잡아줘."}], "ir": "MINIMIZE( SUM(x0 in shift_instances: unmet_demand(x0)) )\nUNEXPRESSED(literal, constraint)", "decision_kind": "unsupported", "gold_decision": {"kind": "unsupported", "reason_code": "semantic_not_declared", "related_refs": []}, "stratum": "v4/residual", "episode_id": null} {"id": "v4/residual:nurse:6e65cc8cdf7e4a8e", "domain": "nurse", "language": "en", "messages": [{"role": "user", "content": "For the roster, minimize the total staffing shortfall against demand across all shifts. No shift may start before 6 in the morning."}], "ir": "MINIMIZE( SUM(x0 in shift_instances: unmet_demand(x0)) )\nUNEXPRESSED(literal, constraint)", "decision_kind": "unsupported", "gold_decision": {"kind": "unsupported", "reason_code": "semantic_not_declared", "related_refs": []}, "stratum": "v4/residual", "episode_id": null} {"id": "v4/base:routing:9f2703b5688c27f3", "domain": "routing", "language": "mixed", "messages": [{"role": "user", "content": "오늘 배차 돌릴 건데, 전체 route의 총 이동거리 최소화로 가자. 그리고 모든 route의 round trip마다 화물 기준 중 제일 높은 적재율이 0.8 이상 되게 해줘."}], "ir": "MINIMIZE( SUM(x0 in routes: travel_distance(x0)) )\nEACH(x1 in routes): EACH(x2 in rounds(x1)): MAX(x3 in keys(load): utilization[x3](x2)) >= 0.8", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:min_capacity.target_ratio", "value": {"type": "decimal", "value": "0.8"}}], "constraint_ref": "constraint:min_capacity", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:distance_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/base", "episode_id": null} {"id": "v4/base:routing:fd1135b075e7295c", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "금일 배차 계획 요청드립니다. 전체 경로의 총 이동거리를 최소화해 주시고, 모든 경로의 각 회차마다 화물 항목 중 가장 높은 적재율이 0.8 이상이 되도록 부탁드립니다."}], "ir": "MINIMIZE( SUM(x0 in routes: travel_distance(x0)) )\nEACH(x1 in routes): EACH(x2 in rounds(x1)): MAX(x3 in keys(load): utilization[x3](x2)) >= 0.8", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:min_capacity.target_ratio", "value": {"type": "decimal", "value": "0.8"}}], "constraint_ref": "constraint:min_capacity", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:distance_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/base", "episode_id": null} {"id": "v4/base:routing:248326d8e4295c3d", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "모든 경로를 합친 총 이동거리를 줄이는 방향으로 짜 주세요. 그리고 각 경로의 회차마다 화물 항목 중 가장 높은 적재율이 0.8 이상이어야 해요."}], "ir": "MINIMIZE( SUM(x0 in routes: travel_distance(x0)) )\nEACH(x1 in routes): EACH(x2 in rounds(x1)): MAX(x3 in keys(load): utilization[x3](x2)) >= 0.8", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:min_capacity.target_ratio", "value": {"type": "decimal", "value": "0.8"}}], "constraint_ref": "constraint:min_capacity", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:distance_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/base", "episode_id": null} {"id": "v4/combo:routing:ff90df14533196b9", "domain": "routing", "language": "en", "messages": [{"role": "user", "content": "Plan the routes to minimize total fuel cost across all routes. For every route, the smallest circle covering all its stops must stay within the assigned rider’s own radius limit, and the number of depot round trips must meet or exceed that rider’s contracted number. Deliveries at the same coordinates must be assigned to the same route."}], "ir": "MINIMIZE( SUM(x0 in routes: fuel_cost(x0)) )\n[HARD] EACH(x1 in routes): sec_radius(x1) <= individual_radius_limit(x1)\n[HARD] EACH(x2 in routes): round_count(x2) >= base_rounds(x2)\n[HARD] EACH((x3, x4) in pairs(visits, same_coordinate)): TOGETHER(x3, x4, route)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:minimum_round", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [{"slot_ref": "slot:individual_enclosing_circle_radius.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:individual_enclosing_circle_radius", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [{"slot_ref": "slot:same_coordinate_grouping.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:same_coordinate_grouping", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fuel_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:4f53db2c9a5dd43f", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "전체 경로의 연료비 합계를 최소화하는 배차를 부탁드립니다. 모든 경로는 방문지를 전부 감싸는 가장 작은 원의 반경이 반드시 담당 기사별 반경 한도 이하여야 하며, 차고지 왕복 횟수도 반드시 해당 기사의 계약상 최소 회전 수 이상이어야 합니다. 좌표가 같은 배송 건은 반드시 같은 경로에 묶어 배정해 주시기 바랍니다."}], "ir": "MINIMIZE( SUM(x0 in routes: fuel_cost(x0)) )\n[HARD] EACH(x1 in routes): sec_radius(x1) <= individual_radius_limit(x1)\n[HARD] EACH(x2 in routes): round_count(x2) >= base_rounds(x2)\n[HARD] EACH((x3, x4) in pairs(visits, same_coordinate)): TOGETHER(x3, x4, route)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:minimum_round", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [{"slot_ref": "slot:individual_enclosing_circle_radius.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:individual_enclosing_circle_radius", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [{"slot_ref": "slot:same_coordinate_grouping.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:same_coordinate_grouping", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fuel_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:6cf22a6adf61c3c9", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "전체 경로의 총 연료비를 최소화해 주세요. 모든 경로에서 방문지를 전부 감싸는 가장 작은 원의 반경은 반드시 담당 기사별 반경 한도 이하로, 차고지 왕복 횟수는 반드시 해당 기사의 계약상 최소 회전 수 이상으로 맞추고, 좌표가 같은 배송 건들은 반드시 같은 경로로 묶어 주세요."}], "ir": "MINIMIZE( SUM(x0 in routes: fuel_cost(x0)) )\n[HARD] EACH(x1 in routes): sec_radius(x1) <= individual_radius_limit(x1)\n[HARD] EACH(x2 in routes): round_count(x2) >= base_rounds(x2)\n[HARD] EACH((x3, x4) in pairs(visits, same_coordinate)): TOGETHER(x3, x4, route)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:minimum_round", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [{"slot_ref": "slot:individual_enclosing_circle_radius.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:individual_enclosing_circle_radius", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [{"slot_ref": "slot:same_coordinate_grouping.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:same_coordinate_grouping", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fuel_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:b8f798971c54b8c7", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "전체 경로의 총 이동거리를 최소화하고, 각 경로의 배송지를 모두 감싸는 가장 작은 원의 반경은 반드시 담당 라이더별 반경 한도 이내로 해 주세요"}], "ir": "MINIMIZE( SUM(x0 in routes: travel_distance(x0)) )\n[HARD] EACH(x1 in routes): sec_radius(x1) <= individual_radius_limit(x1)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:individual_enclosing_circle_radius.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:individual_enclosing_circle_radius", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:distance_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:a7d2c0fa457b741a", "domain": "routing", "language": "en", "messages": [{"role": "user", "content": "Minimize the total travel distance across all routes. For every route, the smallest circle enclosing its stops must have a radius no greater than that rider’s own radius limit."}], "ir": "MINIMIZE( SUM(x0 in routes: travel_distance(x0)) )\n[HARD] EACH(x1 in routes): sec_radius(x1) <= individual_radius_limit(x1)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:individual_enclosing_circle_radius.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:individual_enclosing_circle_radius", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:distance_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:2d262aa7e8b54c90", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "모든 배송 경로의 이동거리 합계를 최소화해 주세요. 각 경로의 배송지를 전부 포함하는 가장 작은 원의 반경은 반드시 해당 라이더에게 정해진 반경 한도를 넘지 않게 해 주세요"}], "ir": "MINIMIZE( SUM(x0 in routes: travel_distance(x0)) )\n[HARD] EACH(x1 in routes): sec_radius(x1) <= individual_radius_limit(x1)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:individual_enclosing_circle_radius.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:individual_enclosing_circle_radius", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:distance_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:437ddb823a0f25a1", "domain": "routing", "language": "mixed", "messages": [{"role": "user", "content": "전체 route의 출발부터 종료까지 걸리는 시간을 합한 값과, 각 route의 depot 왕복 운행마다 방문 배송지의 서로 다른 zone 수를 세어 전체 왕복 운행에 걸쳐 합한 값을 줄여 주세요. 모든 route의 배송지를 둘러싸는 가장 작은 원의 반경은 반드시 5km 이내로 하고, 각 route의 차고지 왕복 횟수는 담당 기사별 왕복 횟수 한도 이내로, 각 왕복 운행의 서로 다른 배송지 수는 해당 기사의 왕복당 배송지 수 한도 이내로, route 전체의 서로 다른 배송지 수는 해당 기사의 전체 배송지 수 한도 이내로 잡아 주세요"}], "ir": "MINIMIZE( SUM(x0 in routes: duration(x0)) )\nMINIMIZE( SUM(x1 in routes: SUM(x2 in rounds(x1): COUNT_DISTINCT(x3 in visits(x2): zone(x3)))) )\n[HARD] EACH(x4 in routes): sec_radius(x4) <= 5 km\nAND( EACH(x5 in routes): round_count(x5) <= max_rounds(x5), EACH(x6 in routes): EACH(x7 in rounds(x6)): stop_count(x7) <= max_stops_per_round(x6), EACH(x8 in routes): stop_count(x8) <= max_stops(x8) )", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:enclosing_circle_radius.exp_factor", "value": {"type": "decimal", "value": "2"}}, {"slot_ref": "slot:enclosing_circle_radius.max_radius", "value": {"type": "decimal", "value": "5000"}}], "constraint_ref": "constraint:enclosing_circle_radius", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [{"slot_ref": "slot:rider_delivery_length.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:rider_delivery_length", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:rider_route_zone.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:rider_route_zone", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:duration_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:72470b9fd8275468", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "배차할 때 모든 경로의 출발부터 종료까지 걸리는 시간을 합한 값을 줄여줘. 각 경로의 차고지 왕복 운행마다 배송지들이 속한 서로 다른 구역 수를 세고, 그걸 전체 경로의 모든 왕복 운행에 걸쳐 합한 값도 줄여줘. 모든 경로의 배송지를 둘러싸는 가장 작은 원의 반경은 반드시 5km 이내로 하고, 각 경로의 차고지 왕복 횟수는 담당 기사의 왕복 횟수 한도 이내로, 왕복 운행마다 서로 다른 배송지 수는 그 기사의 왕복당 배송지 수 한도 이내로, 경로 전체의 서로 다른 배송지 수는 그 기사의 전체 배송지 수 한도 이내로 잡아줘"}], "ir": "MINIMIZE( SUM(x0 in routes: duration(x0)) )\nMINIMIZE( SUM(x1 in routes: SUM(x2 in rounds(x1): COUNT_DISTINCT(x3 in visits(x2): zone(x3)))) )\n[HARD] EACH(x4 in routes): sec_radius(x4) <= 5 km\nAND( EACH(x5 in routes): round_count(x5) <= max_rounds(x5), EACH(x6 in routes): EACH(x7 in rounds(x6)): stop_count(x7) <= max_stops_per_round(x6), EACH(x8 in routes): stop_count(x8) <= max_stops(x8) )", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:enclosing_circle_radius.exp_factor", "value": {"type": "decimal", "value": "2"}}, {"slot_ref": "slot:enclosing_circle_radius.max_radius", "value": {"type": "decimal", "value": "5000"}}], "constraint_ref": "constraint:enclosing_circle_radius", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [{"slot_ref": "slot:rider_delivery_length.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:rider_delivery_length", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:rider_route_zone.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:rider_route_zone", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:duration_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:retail:684912635d41c9fc", "domain": "retail", "language": "ko", "messages": [{"role": "user", "content": "계획 기간의 일평균 재고 보유비용을 최소화하는 발주 계획을 부탁드립니다. 각 보충 발주는 가능하면 해당 품목의 발주 가능 요일에 넣도록 부탁드립니다. 각 보충 발주의 입고일은 되도록 발주일에 해당 품목 공급업체의 입고 소요일을 더한 날짜로 잡아 주시기 바랍니다."}], "ir": "MINIMIZE( MEAN(x0 in days(horizon): holding_cost(x0)) )\n[SOFT] EACH(x1 in orders): day_of_week(x1) IN allowed_order_days(x1)\n[SOFT] EACH(x2 in orders): arrival_day(x2) = offset(order_day(x2), lead_time(x2))", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:lead_time", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [], "constraint_ref": "constraint:order_days", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:minimize_holding_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:retail:6ecaf7a736d28e67", "domain": "retail", "language": "ko", "messages": [{"role": "user", "content": "계획 기간의 일평균 재고 보유비용을 최소화해 주세요. 모든 보충 발주는 가능하면 품목별 발주 가능 요일에 넣고, 입고일은 되도록 발주일에 해당 품목 공급업체의 배송 기간을 더한 날짜로 잡아 주세요."}], "ir": "MINIMIZE( MEAN(x0 in days(horizon): holding_cost(x0)) )\n[SOFT] EACH(x1 in orders): day_of_week(x1) IN allowed_order_days(x1)\n[SOFT] EACH(x2 in orders): arrival_day(x2) = offset(order_day(x2), lead_time(x2))", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:lead_time", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [], "constraint_ref": "constraint:order_days", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:minimize_holding_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:retail:7cf2f7dd7ee4f8d3", "domain": "retail", "language": "ko", "messages": [{"role": "user", "content": "계획 기간 동안 하루 평균 재고 보유비용을 최소화해줘. 보충 발주는 건마다 되도록 그 품목의 발주 가능 요일에 넣고, 입고일은 가능하면 발주일에 해당 품목 공급업체의 입고 소요일을 더한 날로 잡아줘"}], "ir": "MINIMIZE( MEAN(x0 in days(horizon): holding_cost(x0)) )\n[SOFT] EACH(x1 in orders): day_of_week(x1) IN allowed_order_days(x1)\n[SOFT] EACH(x2 in orders): arrival_day(x2) = offset(order_day(x2), lead_time(x2))", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:lead_time", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [], "constraint_ref": "constraint:order_days", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:minimize_holding_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:702ce3f9d719a9bd", "domain": "routing", "language": "en", "messages": [{"role": "user", "content": "Plan the routes to minimize the total fixed vehicle operating cost across all routes. Leave each delivery stop no later than its latest allowed time, and if possible, put deliveries at the same coordinates on the same route."}], "ir": "MINIMIZE( SUM(x0 in routes: fixed_cost(x0)) )\nEACH(x1 in visits): departure_time(x1) <= tw_late(x1)\n[SOFT] EACH((x2, x3) in pairs(visits, same_coordinate)): TOGETHER(x2, x3, route)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:same_coordinate_grouping.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:same_coordinate_grouping", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:time_window.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:time_window", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fixed_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:4ba0b24961df0e5b", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "전체 경로의 차량 고정 운영비 합계가 최소가 되도록 배차해 주세요. 각 배송지에서는 배송 허용 종료 시각까지 출발하고, 좌표가 같은 배송지들은 가능하면 같은 경로에 묶어 주세요."}], "ir": "MINIMIZE( SUM(x0 in routes: fixed_cost(x0)) )\nEACH(x1 in visits): departure_time(x1) <= tw_late(x1)\n[SOFT] EACH((x2, x3) in pairs(visits, same_coordinate)): TOGETHER(x2, x3, route)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:same_coordinate_grouping.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:same_coordinate_grouping", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:time_window.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:time_window", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fixed_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:e48b035a3713356a", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "모든 경로에 드는 차량 고정 운영비 총액을 최소화해 주세요. 배송지마다 허용된 마지막 시간까지는 출발하도록 잡아 주시고, 좌표가 같은 배송지들은 되도록 같은 경로로 배정해 주세요."}], "ir": "MINIMIZE( SUM(x0 in routes: fixed_cost(x0)) )\nEACH(x1 in visits): departure_time(x1) <= tw_late(x1)\n[SOFT] EACH((x2, x3) in pairs(visits, same_coordinate)): TOGETHER(x2, x3, route)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:same_coordinate_grouping.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:same_coordinate_grouping", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:time_window.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:time_window", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fixed_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/base:routing:8233d9de964c5eb7", "domain": "routing", "language": "mixed", "messages": [{"role": "user", "content": "전체 route의 총 이동거리를 최소화해 주세요. 각 route는 담당 rider별로 정해진 차고지 왕복 횟수 한도, 왕복마다의 중복 제외 배송지 수 한도, route 전체의 중복 제외 배송지 수 한도를 넘지 않게 해 주세요"}], "ir": "MINIMIZE( SUM(x0 in routes: travel_distance(x0)) )\nAND( EACH(x1 in routes): round_count(x1) <= max_rounds(x1), EACH(x2 in routes): EACH(x3 in rounds(x2)): stop_count(x3) <= max_stops_per_round(x2), EACH(x4 in routes): stop_count(x4) <= max_stops(x4) )", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:rider_delivery_length.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:rider_delivery_length", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:distance_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/base", "episode_id": null} {"id": "v4/base:routing:8089f055d4752507", "domain": "routing", "language": "en", "messages": [{"role": "user", "content": "Minimize total distance across all routes; keep each route within its rider’s depot round-trip limit, distinct-stop limit per round trip, and distinct-stop limit for the whole route"}], "ir": "MINIMIZE( SUM(x0 in routes: travel_distance(x0)) )\nAND( EACH(x1 in routes): round_count(x1) <= max_rounds(x1), EACH(x2 in routes): EACH(x3 in rounds(x2)): stop_count(x3) <= max_stops_per_round(x2), EACH(x4 in routes): stop_count(x4) <= max_stops(x4) )", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:rider_delivery_length.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:rider_delivery_length", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:distance_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/base", "episode_id": null} {"id": "v4/base:routing:a8e88c26be4c5ea4", "domain": "routing", "language": "mixed", "messages": [{"role": "user", "content": "전체 route 총 이동거리를 최소화해줘. 각 route의 차고지 왕복 횟수랑 왕복별 중복 제외 배송지 수, route 전체 중복 제외 배송지 수는 각각 담당 rider한테 정해진 한도 안으로 잡아줘"}], "ir": "MINIMIZE( SUM(x0 in routes: travel_distance(x0)) )\nAND( EACH(x1 in routes): round_count(x1) <= max_rounds(x1), EACH(x2 in routes): EACH(x3 in rounds(x2)): stop_count(x3) <= max_stops_per_round(x2), EACH(x4 in routes): stop_count(x4) <= max_stops(x4) )", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:rider_delivery_length.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:rider_delivery_length", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:distance_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/base", "episode_id": null} {"id": "v4/base:routing:1b71435fb27e2b52", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "전체 경로의 차량 고정 운영비 총합을 최소화해줘. 모든 경로에서 배송마다 서비스 전 대기는 담당 기사 본인의 대기 한도 이내로, 경로 종료는 담당 기사 근무 종료 시각 이내로, 각 왕복 운행 종료는 담당 기사의 왕복 운행 시간대 종료 시각 이내로 잡아줘"}], "ir": "MINIMIZE( SUM(x0 in routes: fixed_cost(x0)) )\nAND( EACH(x1 in routes): EACH(x2 in visits(x1)): wait_duration(x2) <= max_wait(x1), EACH(x3 in routes): end_time(x3) <= work_end(x3), EACH(x4 in routes): EACH(x5 in rounds(x4)): end_time(x5) <= round_window_end(x4) )", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:rider_time_window.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:rider_time_window", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fixed_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/base", "episode_id": null} {"id": "v4/combo:routing:93b79b8d93d5b722", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "전체 경로의 총 이동거리를 최소화해 주세요. 한 경로당 배송 건수는 가능하면 12건 이하로 하고, 경로별 이동거리는 반드시 8km 이하여야 해요. 그리고 가능하면 각 기사님의 경로가 그 기사 본인의 총 거리 한도, 왕복 한 번당 거리 한도, 연속된 두 정차지 사이 거리 한도도 넘지 않게 해 주세요"}], "ir": "MINIMIZE( SUM(x0 in routes: travel_distance(x0)) )\n[SOFT] EACH(x1 in routes): delivery_count(x1) <= 12\n[HARD] EACH(x2 in routes): travel_distance(x2) <= 8 km\n[SOFT] AND( EACH(x3 in routes): travel_distance(x3) <= total_limit(x3), EACH(x4 in routes): EACH(x5 in rounds(x4)): travel_distance(x5) <= trip_limit(x4), EACH(x6 in routes): EACH(x7 in adjacent(visit_seq(x6))): travel_distance(x7) <= between_limit(x6) )", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:delivery_length.exp_factor", "value": {"type": "decimal", "value": "2"}}, {"slot_ref": "slot:delivery_length.max_size", "value": {"type": "decimal", "value": "12"}}], "constraint_ref": "constraint:delivery_length", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:max_distance.exp_factor", "value": {"type": "decimal", "value": "1"}}, {"slot_ref": "slot:max_distance.max_distance", "value": {"type": "decimal", "value": "8000"}}], "constraint_ref": "constraint:max_distance", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [{"slot_ref": "slot:rider_distance.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:rider_distance", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:distance_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:4d02ce0a70ab1f91", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "오늘 배차 계획을 부탁드립니다. 모든 경로를 합친 총 이동거리를 최소화해 주시고, 각 경로의 배송 건수는 되도록 12건 이하로 맞춰 주십시오. 각 경로의 이동거리는 반드시 8km를 넘지 않아야 하며, 가능하면 각 경로가 담당 기사 본인의 총 이동거리 한도, 왕복 한 번당 거리 한도, 연속 정차지 간 거리 한도를 초과하지 않도록 부탁드립니다."}], "ir": "MINIMIZE( SUM(x0 in routes: travel_distance(x0)) )\n[SOFT] EACH(x1 in routes): delivery_count(x1) <= 12\n[HARD] EACH(x2 in routes): travel_distance(x2) <= 8 km\n[SOFT] AND( EACH(x3 in routes): travel_distance(x3) <= total_limit(x3), EACH(x4 in routes): EACH(x5 in rounds(x4)): travel_distance(x5) <= trip_limit(x4), EACH(x6 in routes): EACH(x7 in adjacent(visit_seq(x6))): travel_distance(x7) <= between_limit(x6) )", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:delivery_length.exp_factor", "value": {"type": "decimal", "value": "2"}}, {"slot_ref": "slot:delivery_length.max_size", "value": {"type": "decimal", "value": "12"}}], "constraint_ref": "constraint:delivery_length", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:max_distance.exp_factor", "value": {"type": "decimal", "value": "1"}}, {"slot_ref": "slot:max_distance.max_distance", "value": {"type": "decimal", "value": "8000"}}], "constraint_ref": "constraint:max_distance", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [{"slot_ref": "slot:rider_distance.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:rider_distance", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:distance_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:d0b668966bbd293a", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "전체 경로 이동거리 총합이 최소가 되게 짜줘. 경로마다 배송 건수는 되도록 12건 이하로 하고, 경로별 이동거리는 무조건 8km 안으로 해줘. 가능하면 경로마다 담당 기사 본인의 총 거리 한도랑 왕복 한 번당 한도, 연속된 정차지 사이 거리 한도도 안 넘게 해줘"}], "ir": "MINIMIZE( SUM(x0 in routes: travel_distance(x0)) )\n[SOFT] EACH(x1 in routes): delivery_count(x1) <= 12\n[HARD] EACH(x2 in routes): travel_distance(x2) <= 8 km\n[SOFT] AND( EACH(x3 in routes): travel_distance(x3) <= total_limit(x3), EACH(x4 in routes): EACH(x5 in rounds(x4)): travel_distance(x5) <= trip_limit(x4), EACH(x6 in routes): EACH(x7 in adjacent(visit_seq(x6))): travel_distance(x7) <= between_limit(x6) )", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:delivery_length.exp_factor", "value": {"type": "decimal", "value": "2"}}, {"slot_ref": "slot:delivery_length.max_size", "value": {"type": "decimal", "value": "12"}}], "constraint_ref": "constraint:delivery_length", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:max_distance.exp_factor", "value": {"type": "decimal", "value": "1"}}, {"slot_ref": "slot:max_distance.max_distance", "value": {"type": "decimal", "value": "8000"}}], "constraint_ref": "constraint:max_distance", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [{"slot_ref": "slot:rider_distance.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:rider_distance", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:distance_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:e437e17f78f8ac85", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "전체 경로에서 출발부터 종료까지 걸리는 시간의 합과 전체 이동거리를 줄여 주세요. 가능하면 모든 경로에서 담당 기사님의 총 거리 한도를 넘지 않게 하고, 각 왕복 운행의 이동거리도 그 기사님의 왕복당 거리 한도를, 연속한 두 배송지 사이 이동거리도 그 기사님의 배송지 간 거리 한도를 넘지 않게 해 주세요."}], "ir": "MINIMIZE( SUM(x0 in routes: duration(x0)) )\nMINIMIZE( SUM(x1 in routes: travel_distance(x1)) )\n[SOFT] AND( EACH(x2 in routes): travel_distance(x2) <= total_limit(x2), EACH(x3 in routes): EACH(x4 in rounds(x3)): travel_distance(x4) <= trip_limit(x3), EACH(x5 in routes): EACH(x6 in adjacent(visit_seq(x5))): travel_distance(x6) <= between_limit(x5) )", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:rider_distance.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:rider_distance", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:distance_cost", "weight": "1/2"}, {"objective_ref": "objective:duration_cost", "weight": "1/2"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/base:routing:d10c67a0bbce4055", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "전체 루트의 시작부터 종료까지 걸리는 시간 합계를 최소화하고, 루트별 이동거리는 100km 이하로 해 주세요."}], "ir": "MINIMIZE( SUM(x0 in routes: duration(x0)) )\nEACH(x1 in routes): travel_distance(x1) <= 100 km", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:max_distance.exp_factor", "value": {"type": "decimal", "value": "1"}}, {"slot_ref": "slot:max_distance.max_distance", "value": {"type": "decimal", "value": "100000"}}], "constraint_ref": "constraint:max_distance", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:duration_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/base", "episode_id": null} {"id": "v4/base:routing:37a52e15e39e6fb0", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "모든 배송 경로의 시작부터 끝까지 걸리는 시간을 합쳐서 최소화해줘. 각 경로의 이동거리는 100km 이하로 해줘."}], "ir": "MINIMIZE( SUM(x0 in routes: duration(x0)) )\nEACH(x1 in routes): travel_distance(x1) <= 100 km", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:max_distance.exp_factor", "value": {"type": "decimal", "value": "1"}}, {"slot_ref": "slot:max_distance.max_distance", "value": {"type": "decimal", "value": "100000"}}], "constraint_ref": "constraint:max_distance", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:duration_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/base", "episode_id": null} {"id": "v4/base:routing:f63fdbe517dab787", "domain": "routing", "language": "en", "messages": [{"role": "user", "content": "Minimize the total start-to-finish time across all routes, with each route’s travel distance at most 100 km."}], "ir": "MINIMIZE( SUM(x0 in routes: duration(x0)) )\nEACH(x1 in routes): travel_distance(x1) <= 100 km", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:max_distance.exp_factor", "value": {"type": "decimal", "value": "1"}}, {"slot_ref": "slot:max_distance.max_distance", "value": {"type": "decimal", "value": "100000"}}], "constraint_ref": "constraint:max_distance", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:duration_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/base", "episode_id": null} {"id": "v4/combo:routing:6490da8ebda75b66", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "이번 배차 계획에서는 모든 경로의 연료비 총합과 총 이동거리를 함께 최소화하고 싶습니다. 각 경로의 배송 건수는 3건 이하로 설정해 주시고, 가능하면 모든 경로의 회차별로 방문하는 서로 다른 구역 수를 전부 합한 값도 줄여 주세요. 또한 각 경로의 이동거리는 해당 기사의 총 거리 한도 이내, 각 회차의 이동거리는 해당 기사의 회차당 거리 한도 이내, 연속된 두 배송지 사이 거리는 해당 기사의 정류지 간 한도 이내여야 하며 이 조건은 반드시 지켜 주시기 바랍니다."}], "ir": "MINIMIZE( SUM(x0 in routes: fuel_cost(x0)) )\nMINIMIZE( SUM(x1 in routes: travel_distance(x1)) )\nEACH(x2 in routes): delivery_count(x2) <= 3\n[SOFT] MINIMIZE( SUM(x3 in routes: SUM(x4 in rounds(x3): COUNT_DISTINCT(x5 in visits(x4): zone(x5)))) )\n[HARD] AND( EACH(x6 in routes): travel_distance(x6) <= total_limit(x6), EACH(x7 in routes): EACH(x8 in rounds(x7)): travel_distance(x8) <= trip_limit(x7), EACH(x9 in routes): EACH(x10 in adjacent(visit_seq(x9))): travel_distance(x10) <= between_limit(x9) )", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:delivery_length.exp_factor", "value": {"type": "decimal", "value": "2"}}, {"slot_ref": "slot:delivery_length.max_size", "value": {"type": "decimal", "value": "3"}}], "constraint_ref": "constraint:delivery_length", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:rider_distance.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:rider_distance", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [{"slot_ref": "slot:rider_route_zone.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:rider_route_zone", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:distance_cost", "weight": "1/2"}, {"objective_ref": "objective:fuel_cost", "weight": "1/2"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:6ef920fdc4d928ef", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "전체 경로의 이동거리 합계와 출발부터 종료까지 걸리는 시간의 합계를 모두 줄이고, 각 경로의 각 왕복 운행에서 배송지 구역을 중복 없이 센 개수도 모든 경로와 왕복 운행에 걸쳐 합산해 줄여 주세요. 모든 경로의 이동거리는 반드시 8km 이하여야 해요"}], "ir": "MINIMIZE( SUM(x0 in routes: travel_distance(x0)) )\nMINIMIZE( SUM(x1 in routes: duration(x1)) )\nMINIMIZE( SUM(x2 in routes: SUM(x3 in rounds(x2): COUNT_DISTINCT(x4 in visits(x3): zone(x4)))) )\n[HARD] EACH(x5 in HOLE(scope)): travel_distance(x5) <= 8 km", "decision_kind": "clarify", "gold_decision": {"candidate_refs": ["constraint:max_distance"], "kind": "clarify", "missing_field_refs": [], "reason_code": "ambiguous_capability", "required_inputs": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:e459e91391959e88", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "전체 경로의 총 이동거리를 최소화하고, 모든 경로에서 각 배송지의 서비스 시작 전 대기시간은 담당 기사별 대기시간 한도 이내로, 경로 종료는 담당 기사의 근무 종료 시각 이내로, 각 차고지 왕복 운행의 종료는 담당 기사에게 정해진 회차 종료 시각 이내로 계획해 주시기 바랍니다. 가능하면 모든 경로의 차고지 왕복 횟수는 담당 기사별 왕복 횟수 한도 이내로, 매 왕복 운행에서 들르는 서로 다른 정차지 수는 담당 기사별 회차당 정차지 수 한도 이내로, 경로 전체에서 들르는 서로 다른 정차지 수는 담당 기사별 전체 정차지 수 한도 이내로 맞춰 주시기 바랍니다"}], "ir": "MINIMIZE( SUM(x0 in routes: travel_distance(x0)) )\nAND( EACH(x1 in routes): EACH(x2 in visits(x1)): wait_duration(x2) <= max_wait(x1), EACH(x3 in routes): end_time(x3) <= work_end(x3), EACH(x4 in routes): EACH(x5 in rounds(x4)): end_time(x5) <= round_window_end(x4) )\n[SOFT] AND( EACH(x6 in routes): round_count(x6) <= max_rounds(x6), EACH(x7 in routes): EACH(x8 in rounds(x7)): stop_count(x8) <= max_stops_per_round(x7), EACH(x9 in routes): stop_count(x9) <= max_stops(x9) )", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:rider_delivery_length.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:rider_delivery_length", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:rider_time_window.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:rider_time_window", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:distance_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:950af7a2eee59dc6", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "전체 경로를 합친 이동거리가 최소가 되게 짜줘. 모든 경로에서 배송지마다 배송 시작 전 기다리는 시간은 그 기사에게 정해진 대기시간 한도를 넘지 않게 하고, 경로는 담당 기사 근무 종료 시각까지 끝내고, 차고지를 다녀오는 각 회차도 담당 기사에게 정해진 회차 종료 시각까지 끝내도록 해줘. 가능하면 모든 경로에서 차고지 왕복 횟수는 담당 기사별 왕복 한도 안으로, 한 번 왕복할 때 들르는 서로 다른 정차지 수는 그 기사의 회차당 한도 안으로, 경로 전체의 서로 다른 정차지 수는 그 기사의 전체 정차지 수 한도 안으로 맞춰줘"}], "ir": "MINIMIZE( SUM(x0 in routes: travel_distance(x0)) )\nAND( EACH(x1 in routes): EACH(x2 in visits(x1)): wait_duration(x2) <= max_wait(x1), EACH(x3 in routes): end_time(x3) <= work_end(x3), EACH(x4 in routes): EACH(x5 in rounds(x4)): end_time(x5) <= round_window_end(x4) )\n[SOFT] AND( EACH(x6 in routes): round_count(x6) <= max_rounds(x6), EACH(x7 in routes): EACH(x8 in rounds(x7)): stop_count(x8) <= max_stops_per_round(x7), EACH(x9 in routes): stop_count(x9) <= max_stops(x9) )", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:rider_delivery_length.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:rider_delivery_length", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:rider_time_window.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:rider_time_window", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:distance_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:ec78032473017e30", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "모든 경로의 총 이동거리를 최소화해 주시고, 각 경로의 배송지별 서비스 전 대기시간은 담당 기사의 대기 한도를 넘지 않게, 경로 종료 시각은 담당 기사의 근무 종료 시각을 넘지 않게, 차고지 왕복 운행마다 종료 시각은 담당 기사에게 정해진 회차 종료 시각을 넘지 않게 해 주세요. 가능하면 모든 경로에서 차고지 왕복 횟수, 왕복 운행별 서로 다른 정차지 수, 경로 전체의 서로 다른 정차지 수를 각각 담당 기사에게 정해진 왕복 횟수 한도, 회차당 정차지 수 한도, 전체 정차지 수 한도 이내로 맞춰 주세요"}], "ir": "MINIMIZE( SUM(x0 in routes: travel_distance(x0)) )\nAND( EACH(x1 in routes): EACH(x2 in visits(x1)): wait_duration(x2) <= max_wait(x1), EACH(x3 in routes): end_time(x3) <= work_end(x3), EACH(x4 in routes): EACH(x5 in rounds(x4)): end_time(x5) <= round_window_end(x4) )\n[SOFT] AND( EACH(x6 in routes): round_count(x6) <= max_rounds(x6), EACH(x7 in routes): EACH(x8 in rounds(x7)): stop_count(x8) <= max_stops_per_round(x7), EACH(x9 in routes): stop_count(x9) <= max_stops(x9) )", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:rider_delivery_length.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:rider_delivery_length", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:rider_time_window.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:rider_time_window", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:distance_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:ff987a8684e70c60", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "오늘 배차는 모든 경로 연료비 합계가 최소가 되게 짜줘. 각 경로의 회차마다 무게, 부피 같은 적재 항목별로 그 회차 중 가장 많이 실은 양이 그 차량 용량을 넘지 않게 해줘. 경로 하나당 이동거리는 반드시 8km 이하여야 하고, 되도록이면 기사별 전체 거리 한도, 회차별 거리 한도, 연속된 두 정차지 사이 거리 한도도 각자 정해진 대로 지키도록 해줘."}], "ir": "MINIMIZE( SUM(x0 in routes: fuel_cost(x0)) )\nEACH(x1 in routes): EACH(x2 in rounds(x1)): EACH(x3 in keys(load)): MAX(x4 in positions(x2): load[x3](x4)) <= capacity[x3](x1)\n[HARD] EACH(x5 in routes): travel_distance(x5) <= 8 km\n[SOFT] AND( EACH(x6 in routes): travel_distance(x6) <= total_limit(x6), EACH(x7 in routes): EACH(x8 in rounds(x7)): travel_distance(x8) <= trip_limit(x7), EACH(x9 in routes): EACH(x10 in adjacent(visit_seq(x9))): travel_distance(x10) <= between_limit(x9) )", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:capacity.exp_factor", "value": {"type": "decimal", "value": "1"}}], "constraint_ref": "constraint:capacity", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [{"slot_ref": "slot:max_distance.exp_factor", "value": {"type": "decimal", "value": "1"}}, {"slot_ref": "slot:max_distance.max_distance", "value": {"type": "decimal", "value": "8000"}}], "constraint_ref": "constraint:max_distance", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [{"slot_ref": "slot:rider_distance.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:rider_distance", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fuel_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:11d08389e9cb4fac", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "전체 경로의 연료비 합계를 최소화하고, 회차별 적재 항목마다 최대 적재량이 차량 용량 이하가 되도록 부탁드립니다. 경로별 이동거리는 반드시 8km 이하로 하며, 가능하면 기사별 총 거리, 회차별 거리, 연속 정차지 간 거리 한도도 각 기사 기준으로 지켜 주시기 바랍니다."}], "ir": "MINIMIZE( SUM(x0 in routes: fuel_cost(x0)) )\nEACH(x1 in routes): EACH(x2 in rounds(x1)): EACH(x3 in keys(load)): MAX(x4 in positions(x2): load[x3](x4)) <= capacity[x3](x1)\n[HARD] EACH(x5 in routes): travel_distance(x5) <= 8 km\n[SOFT] AND( EACH(x6 in routes): travel_distance(x6) <= total_limit(x6), EACH(x7 in routes): EACH(x8 in rounds(x7)): travel_distance(x8) <= trip_limit(x7), EACH(x9 in routes): EACH(x10 in adjacent(visit_seq(x9))): travel_distance(x10) <= between_limit(x9) )", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:capacity.exp_factor", "value": {"type": "decimal", "value": "1"}}], "constraint_ref": "constraint:capacity", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [{"slot_ref": "slot:max_distance.exp_factor", "value": {"type": "decimal", "value": "1"}}, {"slot_ref": "slot:max_distance.max_distance", "value": {"type": "decimal", "value": "8000"}}], "constraint_ref": "constraint:max_distance", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [{"slot_ref": "slot:rider_distance.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:rider_distance", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fuel_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:6e09de01402bbe43", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "내일 배차 계획 짜고 있는데요, 전체 경로의 시작부터 끝까지 걸리는 총 시간을 최소로 해 주세요. 서로 500m 이내인 배송지끼리는 같은 경로에 배정해 주세요. 각 경로의 창고 왕복 횟수는 반드시 그 경로 기사님의 계약 왕복 횟수 이상이어야 하고, 가능하면 배송지마다 배달 금지 시간대는 피해서 방문해 주세요"}], "ir": "MINIMIZE( SUM(x0 in routes: duration(x0)) )\nEACH((x1, x2) in pairs(visits, nearby(500 m))): TOGETHER(x1, x2, route)\n[HARD] EACH(x3 in routes): round_count(x3) >= base_rounds(x3)\n[SOFT] EACH(x4 in visits): NOT OVERLAPS(service_interval(x4), prohibited_window(x4))", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:minimum_round", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [], "constraint_ref": "constraint:prohibited_time_window", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:nearby_delivery_grouping.distance_threshold", "value": {"type": "decimal", "value": "500"}}, {"slot_ref": "slot:nearby_delivery_grouping.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:nearby_delivery_grouping", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:duration_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:d1657ce855787ea5", "domain": "routing", "language": "en", "messages": [{"role": "user", "content": "planning the routes for the afternoon batch. minimize the total elapsed time from start to finish over all routes, and put deliveries that are within 500 m of each other on the same route. every route must have at least as many depot round trips as its rider's contracted round trips, and ideally no delivery gets served during its prohibited time window"}], "ir": "MINIMIZE( SUM(x0 in routes: duration(x0)) )\nEACH((x1, x2) in pairs(visits, nearby(500 m))): TOGETHER(x1, x2, route)\n[HARD] EACH(x3 in routes): round_count(x3) >= base_rounds(x3)\n[SOFT] EACH(x4 in visits): NOT OVERLAPS(service_interval(x4), prohibited_window(x4))", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:minimum_round", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [], "constraint_ref": "constraint:prohibited_time_window", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:nearby_delivery_grouping.distance_threshold", "value": {"type": "decimal", "value": "500"}}, {"slot_ref": "slot:nearby_delivery_grouping.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:nearby_delivery_grouping", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:duration_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:3a5eae9165dabf14", "domain": "routing", "language": "en", "messages": [{"role": "user", "content": "minimize the total fixed cost of the vehicles we use across all routes. each route must have no more than 3 deliveries, and no delivery can ever happen during its prohibited time window. if possible, keep each round trip within a 10 km radius circle around its stops"}], "ir": "MINIMIZE( SUM(x0 in routes: fixed_cost(x0)) )\n[HARD] EACH(x1 in routes): delivery_count(x1) <= 3\n[HARD] EACH(x2 in visits): NOT OVERLAPS(service_interval(x2), prohibited_window(x2))\n[SOFT] EACH(x3 in routes): EACH(x4 in rounds(x3)): sec_radius(x4) <= 10 km", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:prohibited_time_window", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [{"slot_ref": "slot:delivery_length.exp_factor", "value": {"type": "decimal", "value": "2"}}, {"slot_ref": "slot:delivery_length.max_size", "value": {"type": "decimal", "value": "3"}}], "constraint_ref": "constraint:delivery_length", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [{"slot_ref": "slot:round_enclosing_circle_radius.exp_factor", "value": {"type": "decimal", "value": "2"}}, {"slot_ref": "slot:round_enclosing_circle_radius.max_radius", "value": {"type": "decimal", "value": "10000"}}], "constraint_ref": "constraint:round_enclosing_circle_radius", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fixed_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:446b00aa89f3001c", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "전체 경로 차량 고정비용 합계 최소화로 가자. 한 경로당 배송 건수는 반드시 3건 이하, 배달 금지 시간대에는 절대 방문 안 되게 하고, 가능하면 각 회전은 정류지를 감싸는 가장 작은 원 반경이 10km 이하로 해줘."}], "ir": "MINIMIZE( SUM(x0 in routes: fixed_cost(x0)) )\n[HARD] EACH(x1 in routes): delivery_count(x1) <= 3\n[HARD] EACH(x2 in visits): NOT OVERLAPS(service_interval(x2), prohibited_window(x2))\n[SOFT] EACH(x3 in routes): EACH(x4 in rounds(x3)): sec_radius(x4) <= 10 km", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:prohibited_time_window", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [{"slot_ref": "slot:delivery_length.exp_factor", "value": {"type": "decimal", "value": "2"}}, {"slot_ref": "slot:delivery_length.max_size", "value": {"type": "decimal", "value": "3"}}], "constraint_ref": "constraint:delivery_length", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [{"slot_ref": "slot:round_enclosing_circle_radius.exp_factor", "value": {"type": "decimal", "value": "2"}}, {"slot_ref": "slot:round_enclosing_circle_radius.max_radius", "value": {"type": "decimal", "value": "10000"}}], "constraint_ref": "constraint:round_enclosing_circle_radius", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fixed_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:b31a77658b3a67de", "domain": "routing", "language": "en", "messages": [{"role": "user", "content": "I want to keep the total fixed operating cost of the vehicles as low as possible. Every route must have at most 3 deliveries, we can never deliver during a stop's prohibited time, and ideally each round trip's stops fit inside a circle with a 10 km radius."}], "ir": "MINIMIZE( SUM(x0 in routes: fixed_cost(x0)) )\n[HARD] EACH(x1 in routes): delivery_count(x1) <= 3\n[HARD] EACH(x2 in visits): NOT OVERLAPS(service_interval(x2), prohibited_window(x2))\n[SOFT] EACH(x3 in routes): EACH(x4 in rounds(x3)): sec_radius(x4) <= 10 km", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:prohibited_time_window", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [{"slot_ref": "slot:delivery_length.exp_factor", "value": {"type": "decimal", "value": "2"}}, {"slot_ref": "slot:delivery_length.max_size", "value": {"type": "decimal", "value": "3"}}], "constraint_ref": "constraint:delivery_length", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [{"slot_ref": "slot:round_enclosing_circle_radius.exp_factor", "value": {"type": "decimal", "value": "2"}}, {"slot_ref": "slot:round_enclosing_circle_radius.max_radius", "value": {"type": "decimal", "value": "10000"}}], "constraint_ref": "constraint:round_enclosing_circle_radius", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fixed_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:fafd8e6342c16918", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "전체 경로의 총 이동거리를 최소화해 주시고, 모든 배송은 반드시 허용된 마지막 시간까지 출발하게 해 주세요. 가능하면 모든 경로에서 각 배송의 서비스 시작 전 대기시간은 해당 기사님의 대기시간 한도 이내로, 경로 종료는 해당 기사님의 근무 종료 시각까지로, 각 왕복 운행 종료는 해당 기사님의 왕복 운행 가능 시간대 종료 시각까지로 맞춰 주세요."}], "ir": "MINIMIZE( SUM(x0 in routes: travel_distance(x0)) )\n[HARD] EACH(x1 in visits): departure_time(x1) <= tw_late(x1)\n[SOFT] AND( EACH(x2 in routes): EACH(x3 in visits(x2)): wait_duration(x3) <= max_wait(x2), EACH(x4 in routes): end_time(x4) <= work_end(x4), EACH(x5 in routes): EACH(x6 in rounds(x5)): end_time(x6) <= round_window_end(x5) )", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:rider_time_window.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:rider_time_window", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:time_window.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:time_window", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:distance_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:c6192b40e9c4c558", "domain": "routing", "language": "en", "messages": [{"role": "user", "content": "Minimize the total travel distance across all routes, and make sure every delivery must depart no later than its latest allowed time. If possible, keep the waiting time before service at every delivery on every route within that route’s rider’s own waiting limit, finish every route by its rider’s end of working hours, and finish every round trip on every route by its rider’s round-trip window end."}], "ir": "MINIMIZE( SUM(x0 in routes: travel_distance(x0)) )\n[HARD] EACH(x1 in visits): departure_time(x1) <= tw_late(x1)\n[SOFT] AND( EACH(x2 in routes): EACH(x3 in visits(x2)): wait_duration(x3) <= max_wait(x2), EACH(x4 in routes): end_time(x4) <= work_end(x4), EACH(x5 in routes): EACH(x6 in rounds(x5)): end_time(x6) <= round_window_end(x5) )", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:rider_time_window.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:rider_time_window", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:time_window.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:time_window", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:distance_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:e5c9f826afd5960b", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "전체 경로의 총 이동거리를 최소화해줘. 모든 배송은 반드시 허용된 마지막 시간까지 출발해야 해. 가능하면 모든 경로에서 배송마다 서비스 시작 전 대기는 그 경로 담당 기사 본인의 대기시간 한도 안으로 맞추고, 경로는 담당 기사 근무 종료 시각까지 끝내고, 각 왕복 운행도 담당 기사의 왕복 운행 가능 시간대가 끝나기 전까지 마쳐줘"}], "ir": "MINIMIZE( SUM(x0 in routes: travel_distance(x0)) )\n[HARD] EACH(x1 in visits): departure_time(x1) <= tw_late(x1)\n[SOFT] AND( EACH(x2 in routes): EACH(x3 in visits(x2)): wait_duration(x3) <= max_wait(x2), EACH(x4 in routes): end_time(x4) <= work_end(x4), EACH(x5 in routes): EACH(x6 in rounds(x5)): end_time(x6) <= round_window_end(x5) )", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:rider_time_window.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:rider_time_window", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:time_window.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:time_window", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:distance_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:b7c9856e90e8bf25", "domain": "routing", "language": "en", "messages": [{"role": "user", "content": "Minimize total travel distance across all routes, keep deliveries at the same coordinate on the same route, and ideally keep each route within a 3 km enclosing circle. Also each rider's waiting time at a delivery, finish time, and round trip finish time must stay within their own limits."}], "ir": "MINIMIZE( SUM(x0 in routes: travel_distance(x0)) )\nEACH((x1, x2) in pairs(visits, same_coordinate)): TOGETHER(x1, x2, route)\n[SOFT] EACH(x3 in routes): sec_radius(x3) <= 3 km\nAND( EACH(x4 in routes): EACH(x5 in visits(x4)): wait_duration(x5) <= max_wait(x4), EACH(x6 in routes): end_time(x6) <= work_end(x6), EACH(x7 in routes): EACH(x8 in rounds(x7)): end_time(x8) <= round_window_end(x7) )", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:enclosing_circle_radius.exp_factor", "value": {"type": "decimal", "value": "2"}}, {"slot_ref": "slot:enclosing_circle_radius.max_radius", "value": {"type": "decimal", "value": "3000"}}], "constraint_ref": "constraint:enclosing_circle_radius", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:rider_time_window.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:rider_time_window", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:same_coordinate_grouping.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:same_coordinate_grouping", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:distance_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:ed1091fa16481dab", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "전체 경로 이동거리 합계 최소로 짜줘. 동일 좌표 배송지는 같은 경로에 같이 넣고, 경로마다 외접원 반경은 가능하면 3km 이하로 하자. 그리고 기사별 대기시간 한도, 근무 종료 시각, 회차별 종료 시각도 각자 기준에 맞게 해줘."}], "ir": "MINIMIZE( SUM(x0 in routes: travel_distance(x0)) )\nEACH((x1, x2) in pairs(visits, same_coordinate)): TOGETHER(x1, x2, route)\n[SOFT] EACH(x3 in routes): sec_radius(x3) <= 3 km\nAND( EACH(x4 in routes): EACH(x5 in visits(x4)): wait_duration(x5) <= max_wait(x4), EACH(x6 in routes): end_time(x6) <= work_end(x6), EACH(x7 in routes): EACH(x8 in rounds(x7)): end_time(x8) <= round_window_end(x7) )", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:enclosing_circle_radius.exp_factor", "value": {"type": "decimal", "value": "2"}}, {"slot_ref": "slot:enclosing_circle_radius.max_radius", "value": {"type": "decimal", "value": "3000"}}], "constraint_ref": "constraint:enclosing_circle_radius", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:rider_time_window.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:rider_time_window", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:same_coordinate_grouping.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:same_coordinate_grouping", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:distance_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:a1f2e98da88f538c", "domain": "routing", "language": "en", "messages": [{"role": "user", "content": "Can you plan the routes so the total distance over all routes is as low as possible? Deliveries to the same coordinate should go on the same route, and if possible each route should fit inside a 3 km radius enclosing circle. Also make sure waiting time per delivery, route finish time, and each round trip's finish time stay within that route's rider limits"}], "ir": "MINIMIZE( SUM(x0 in routes: travel_distance(x0)) )\nEACH((x1, x2) in pairs(visits, same_coordinate)): TOGETHER(x1, x2, route)\n[SOFT] EACH(x3 in routes): sec_radius(x3) <= 3 km\nAND( EACH(x4 in routes): EACH(x5 in visits(x4)): wait_duration(x5) <= max_wait(x4), EACH(x6 in routes): end_time(x6) <= work_end(x6), EACH(x7 in routes): EACH(x8 in rounds(x7)): end_time(x8) <= round_window_end(x7) )", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:enclosing_circle_radius.exp_factor", "value": {"type": "decimal", "value": "2"}}, {"slot_ref": "slot:enclosing_circle_radius.max_radius", "value": {"type": "decimal", "value": "3000"}}], "constraint_ref": "constraint:enclosing_circle_radius", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:rider_time_window.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:rider_time_window", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:same_coordinate_grouping.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:same_coordinate_grouping", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:distance_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:cd265ee63e56ae14", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "전체 배송 경로에 걸쳐 차량 사용에 드는 고정 운영비 합계를 최소화해 주시기 바랍니다. 모든 경로는 배송지 전체를 감싸는 가장 작은 원의 반경이 해당 기사별 반경 한도를 반드시 넘지 않도록 부탁드립니다. 가능하면 모든 경로에서 각 배송지의 서비스 시작 전 대기시간은 해당 기사의 대기시간 한도 이내로, 경로 종료는 해당 기사의 근무 종료 시각 이내로, 각 왕복 운행 종료는 해당 기사의 왕복 운행 시간대 종료 시각 이내로 맞춰 주시기 바랍니다."}], "ir": "MINIMIZE( SUM(x0 in routes: fixed_cost(x0)) )\n[HARD] EACH(x1 in routes): sec_radius(x1) <= individual_radius_limit(x1)\n[SOFT] AND( EACH(x2 in routes): EACH(x3 in visits(x2)): wait_duration(x3) <= max_wait(x2), EACH(x4 in routes): end_time(x4) <= work_end(x4), EACH(x5 in routes): EACH(x6 in rounds(x5)): end_time(x6) <= round_window_end(x5) )", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:individual_enclosing_circle_radius.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:individual_enclosing_circle_radius", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [{"slot_ref": "slot:rider_time_window.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:rider_time_window", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fixed_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:bdc083bb20244732", "domain": "routing", "language": "en", "messages": [{"role": "user", "content": "Minimize the total fixed vehicle operating cost across all routes, and every route must have the radius of the smallest circle enclosing all its stops within its assigned rider’s own radius limit. If possible, on every route keep the wait before service at every delivery within that rider’s own waiting-time limit, finish the route by that rider’s end of working hours, and finish every round trip by that rider’s round-trip window end"}], "ir": "MINIMIZE( SUM(x0 in routes: fixed_cost(x0)) )\n[HARD] EACH(x1 in routes): sec_radius(x1) <= individual_radius_limit(x1)\n[SOFT] AND( EACH(x2 in routes): EACH(x3 in visits(x2)): wait_duration(x3) <= max_wait(x2), EACH(x4 in routes): end_time(x4) <= work_end(x4), EACH(x5 in routes): EACH(x6 in rounds(x5)): end_time(x6) <= round_window_end(x5) )", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:individual_enclosing_circle_radius.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:individual_enclosing_circle_radius", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [{"slot_ref": "slot:rider_time_window.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:rider_time_window", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fixed_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:efd4449a24d8e3f9", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "전체 배송 경로의 차량 고정 운영비 합계를 최소화해 주세요. 모든 경로에서 배송지를 전부 감싸는 가장 작은 원의 반경은 반드시 해당 기사에게 정해진 반경 한도 이내여야 해요. 가능하면 모든 경로의 각 배송지에서 서비스 시작 전 대기시간은 해당 기사별 대기시간 한도 이내로 맞추고, 경로는 해당 기사의 근무 종료 시각까지, 각 왕복 운행은 해당 기사의 왕복 운행 시간대 종료 시각까지 마치도록 해 주세요"}], "ir": "MINIMIZE( SUM(x0 in routes: fixed_cost(x0)) )\n[HARD] EACH(x1 in routes): sec_radius(x1) <= individual_radius_limit(x1)\n[SOFT] AND( EACH(x2 in routes): EACH(x3 in visits(x2)): wait_duration(x3) <= max_wait(x2), EACH(x4 in routes): end_time(x4) <= work_end(x4), EACH(x5 in routes): EACH(x6 in rounds(x5)): end_time(x6) <= round_window_end(x5) )", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:individual_enclosing_circle_radius.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:individual_enclosing_circle_radius", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [{"slot_ref": "slot:rider_time_window.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:rider_time_window", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fixed_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:782dd4fb5037ddcf", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "전체 경로의 이동거리 합계와, 각 경로의 각 회전에서 방문하는 서로 다른 배달 구역 수를 세어 모두 더한 값을 줄여 주세요. 가능하면 모든 경로에서 매 회전의 방문 지점들을 감싸는 가장 작은 원의 반경이 8km 이내가 되게 해 주세요."}], "ir": "MINIMIZE( SUM(x0 in routes: travel_distance(x0)) )\nMINIMIZE( SUM(x1 in routes: SUM(x2 in rounds(x1): COUNT_DISTINCT(x3 in visits(x2): zone(x3)))) )\n[SOFT] EACH(x4 in routes): EACH(x5 in rounds(x4)): sec_radius(x5) <= 8 km", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:rider_route_zone.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:rider_route_zone", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:round_enclosing_circle_radius.exp_factor", "value": {"type": "decimal", "value": "2"}}, {"slot_ref": "slot:round_enclosing_circle_radius.max_radius", "value": {"type": "decimal", "value": "8000"}}], "constraint_ref": "constraint:round_enclosing_circle_radius", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:distance_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:291209e9897d6951", "domain": "routing", "language": "en", "messages": [{"role": "user", "content": "Please minimize both the total travel distance across all routes and the sum of the distinct delivery zone counts for each round trip on each route. If possible, keep the radius of the smallest circle enclosing all stops in every round trip on every route at or below 8 km."}], "ir": "MINIMIZE( SUM(x0 in routes: travel_distance(x0)) )\nMINIMIZE( SUM(x1 in routes: SUM(x2 in rounds(x1): COUNT_DISTINCT(x3 in visits(x2): zone(x3)))) )\n[SOFT] EACH(x4 in routes): EACH(x5 in rounds(x4)): sec_radius(x5) <= 8 km", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:rider_route_zone.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:rider_route_zone", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:round_enclosing_circle_radius.exp_factor", "value": {"type": "decimal", "value": "2"}}, {"slot_ref": "slot:round_enclosing_circle_radius.max_radius", "value": {"type": "decimal", "value": "8000"}}], "constraint_ref": "constraint:round_enclosing_circle_radius", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:distance_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:c9252c18e7b28c7d", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "전체 경로 이동거리 합계도 줄이고, 각 경로의 매 회전마다 들르는 배달 구역이 몇 종류인지 세서 전부 합친 값도 줄여줘. 가능하면 모든 경로의 매 회전에서 방문 지점들을 감싸는 가장 작은 원의 반경을 8km 이내로 해줘."}], "ir": "MINIMIZE( SUM(x0 in routes: travel_distance(x0)) )\nMINIMIZE( SUM(x1 in routes: SUM(x2 in rounds(x1): COUNT_DISTINCT(x3 in visits(x2): zone(x3)))) )\n[SOFT] EACH(x4 in routes): EACH(x5 in rounds(x4)): sec_radius(x5) <= 8 km", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:rider_route_zone.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:rider_route_zone", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:round_enclosing_circle_radius.exp_factor", "value": {"type": "decimal", "value": "2"}}, {"slot_ref": "slot:round_enclosing_circle_radius.max_radius", "value": {"type": "decimal", "value": "8000"}}], "constraint_ref": "constraint:round_enclosing_circle_radius", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:distance_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:467d3735ab6042dc", "domain": "routing", "language": "en", "messages": [{"role": "user", "content": "Plan the routes so the total fuel cost across all routes is as low as possible, and if possible keep each route's stops within its rider's own service radius limit"}], "ir": "MINIMIZE( SUM(x0 in routes: fuel_cost(x0)) )\n[SOFT] EACH(x1 in routes): sec_radius(x1) <= individual_radius_limit(x1)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:individual_enclosing_circle_radius.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:individual_enclosing_circle_radius", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fuel_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:c2c8fea913eee149", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "전체 연료비 최소로 해 주세요, 각 경로는 가능하면 기사별 서비스 반경 안에서요"}], "ir": "MINIMIZE( SUM(x0 in routes: fuel_cost(x0)) )\n[SOFT] EACH(x1 in routes): sec_radius(x1) <= individual_radius_limit(x1)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:individual_enclosing_circle_radius.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:individual_enclosing_circle_radius", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fuel_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:2fe6823fc82e4364", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "모든 경로의 연료비 합계가 최소가 되도록 배차 부탁드립니다. 또한 각 경로의 정류지는 되도록 해당 기사의 개별 반경 제한 안에 들어오도록 해 주시기 바랍니다."}], "ir": "MINIMIZE( SUM(x0 in routes: fuel_cost(x0)) )\n[SOFT] EACH(x1 in routes): sec_radius(x1) <= individual_radius_limit(x1)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:individual_enclosing_circle_radius.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:individual_enclosing_circle_radius", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fuel_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:3be0a486e8f35d04", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "전체 경로의 총 이동거리와 차량 사용에 드는 고정 운영비 총액을 줄이는 배차를 부탁드립니다. 가능하면 모든 경로의 각 왕복 운행에서 중량이나 부피 등 각 적재 항목별로 운행 지점 중 가장 많이 실린 양이 해당 경로 차량의 항목별 용량을 넘지 않도록 부탁드립니다."}], "ir": "MINIMIZE( SUM(x0 in routes: travel_distance(x0)) )\nMINIMIZE( SUM(x1 in routes: fixed_cost(x1)) )\n[SOFT] EACH(x2 in routes): EACH(x3 in rounds(x2)): EACH(x4 in keys(load)): MAX(x5 in positions(x3): load[x4](x5)) <= capacity[x4](x2)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:capacity.exp_factor", "value": {"type": "decimal", "value": "1"}}], "constraint_ref": "constraint:capacity", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:distance_cost", "weight": "1/2"}, {"objective_ref": "objective:fixed_cost", "weight": "1/2"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:05122ed231fe5a89", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "전체 경로의 이동거리 합계와 차량 고정 운영비 합계를 줄여 주시기 바랍니다. 되도록 모든 경로에서 각 왕복 운행 중 지점별 적재량의 최댓값이 중량, 부피 등 각 적재 항목마다 해당 경로 차량의 용량 이하가 되도록 부탁드립니다"}], "ir": "MINIMIZE( SUM(x0 in routes: travel_distance(x0)) )\nMINIMIZE( SUM(x1 in routes: fixed_cost(x1)) )\n[SOFT] EACH(x2 in routes): EACH(x3 in rounds(x2)): EACH(x4 in keys(load)): MAX(x5 in positions(x3): load[x4](x5)) <= capacity[x4](x2)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:capacity.exp_factor", "value": {"type": "decimal", "value": "1"}}], "constraint_ref": "constraint:capacity", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:distance_cost", "weight": "1/2"}, {"objective_ref": "objective:fixed_cost", "weight": "1/2"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:82e2baec5d281ab1", "domain": "routing", "language": "en", "messages": [{"role": "user", "content": "Minimize the total travel distance across all routes and the total fixed operating cost of the vehicles used across all routes. If possible, on every round trip of every route, keep the highest load carried at any point within that route's vehicle capacity for each load dimension, such as weight and volume"}], "ir": "MINIMIZE( SUM(x0 in routes: travel_distance(x0)) )\nMINIMIZE( SUM(x1 in routes: fixed_cost(x1)) )\n[SOFT] EACH(x2 in routes): EACH(x3 in rounds(x2)): EACH(x4 in keys(load)): MAX(x5 in positions(x3): load[x4](x5)) <= capacity[x4](x2)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:capacity.exp_factor", "value": {"type": "decimal", "value": "1"}}], "constraint_ref": "constraint:capacity", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:distance_cost", "weight": "1/2"}, {"objective_ref": "objective:fixed_cost", "weight": "1/2"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:3c15a931848f77f2", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "전체 경로의 총 연료비와 시작부터 끝까지 총 운행시간을 둘 다 최소화해 주세요. 각 경로의 회전마다 그 회전 방문지를 감싸는 가장 작은 원의 반경은 반드시 10km 이하여야 하고, 경로당 배송은 최소 5건, 같은 좌표 배송지는 같은 경로로 묶어 주세요."}], "ir": "MINIMIZE( SUM(x0 in routes: fuel_cost(x0)) )\nMINIMIZE( SUM(x1 in routes: duration(x1)) )\n[HARD] EACH(x2 in routes): EACH(x3 in rounds(x2)): sec_radius(x3) <= 10 km\nEACH(x4 in routes): delivery_count(x4) >= 5\nEACH((x5, x6) in pairs(visits, same_coordinate)): TOGETHER(x5, x6, route)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:minimum_order.target_order", "value": {"type": "decimal", "value": "5"}}], "constraint_ref": "constraint:minimum_order", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:round_enclosing_circle_radius.exp_factor", "value": {"type": "decimal", "value": "2"}}, {"slot_ref": "slot:round_enclosing_circle_radius.max_radius", "value": {"type": "decimal", "value": "10000"}}], "constraint_ref": "constraint:round_enclosing_circle_radius", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [{"slot_ref": "slot:same_coordinate_grouping.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:same_coordinate_grouping", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:duration_cost", "weight": "1/2"}, {"objective_ref": "objective:fuel_cost", "weight": "1/2"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:68ee8959c6f6e256", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "오늘 배차 짤 건데 전체 경로 연료비 합이랑 처음부터 끝까지 걸리는 총 시간 둘 다 줄여줘. 각 경로의 회전마다 방문지를 다 감싸는 최소 원 반경은 무조건 10km 이하로 해줘. 그리고 경로마다 배송 5건 이상으로 하고, 같은 좌표에 있는 배송지끼리는 한 경로에 같이 넣어줘"}], "ir": "MINIMIZE( SUM(x0 in routes: fuel_cost(x0)) )\nMINIMIZE( SUM(x1 in routes: duration(x1)) )\n[HARD] EACH(x2 in routes): EACH(x3 in rounds(x2)): sec_radius(x3) <= 10 km\nEACH(x4 in routes): delivery_count(x4) >= 5\nEACH((x5, x6) in pairs(visits, same_coordinate)): TOGETHER(x5, x6, route)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:minimum_order.target_order", "value": {"type": "decimal", "value": "5"}}], "constraint_ref": "constraint:minimum_order", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:round_enclosing_circle_radius.exp_factor", "value": {"type": "decimal", "value": "2"}}, {"slot_ref": "slot:round_enclosing_circle_radius.max_radius", "value": {"type": "decimal", "value": "10000"}}], "constraint_ref": "constraint:round_enclosing_circle_radius", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [{"slot_ref": "slot:same_coordinate_grouping.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:same_coordinate_grouping", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:duration_cost", "weight": "1/2"}, {"objective_ref": "objective:fuel_cost", "weight": "1/2"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:b8b1cebe9e186056", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "전체 경로의 총 연료비를 최소화해 주시고, 각 배송의 출발 시각은 가능하면 해당 배송의 최종 허용 시간 이내로 맞춰 주시기 바랍니다."}], "ir": "MINIMIZE( SUM(x0 in routes: fuel_cost(x0)) )\n[SOFT] EACH(x1 in visits): departure_time(x1) <= tw_late(x1)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:time_window.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:time_window", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fuel_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:d57902fba5cac2f0", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "모든 경로를 합친 연료비 총액이 가장 적게 나오도록 계획해 주시고요, 되도록 모든 배송이 늦어도 허용된 마지막 시간 전에는 출발하도록 부탁드립니다."}], "ir": "MINIMIZE( SUM(x0 in routes: fuel_cost(x0)) )\n[SOFT] EACH(x1 in visits): departure_time(x1) <= tw_late(x1)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:time_window.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:time_window", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fuel_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:474bd69b3092e088", "domain": "routing", "language": "en", "messages": [{"role": "user", "content": "Please minimize total fuel cost across all routes, and if possible, have every delivery depart no later than its latest allowed time."}], "ir": "MINIMIZE( SUM(x0 in routes: fuel_cost(x0)) )\n[SOFT] EACH(x1 in visits): departure_time(x1) <= tw_late(x1)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:time_window.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:time_window", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fuel_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/multi:routing:d234eaaaed8bef15", "domain": "routing", "language": "en", "messages": [{"role": "user", "content": "minimize total fuel cost for all routes, keep each route's stops within its rider's own radius limit, and every route max 8 km travel distance"}], "ir": "MINIMIZE( SUM(x0 in routes: fuel_cost(x0)) )\nEACH(x1 in routes): sec_radius(x1) <= individual_radius_limit(x1)\nEACH(x2 in routes): travel_distance(x2) <= 8 km", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:individual_enclosing_circle_radius.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:individual_enclosing_circle_radius", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:max_distance.exp_factor", "value": {"type": "decimal", "value": "1"}}, {"slot_ref": "slot:max_distance.max_distance", "value": {"type": "decimal", "value": "8000"}}], "constraint_ref": "constraint:max_distance", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fuel_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/multi", "episode_id": null} {"id": "v4/multi:routing:a31ce793bcc62f10", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "전체 경로의 총 연료비가 최소가 되도록 배차를 부탁드립니다. 각 경로의 정류장을 모두 포함하는 가장 작은 원의 반경이 해당 기사님 개인의 서비스 반경 제한 이하여야 하며, 경로별 이동거리는 8km 이하로 해 주시기 바랍니다"}], "ir": "MINIMIZE( SUM(x0 in routes: fuel_cost(x0)) )\nEACH(x1 in routes): sec_radius(x1) <= individual_radius_limit(x1)\nEACH(x2 in routes): travel_distance(x2) <= 8 km", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:individual_enclosing_circle_radius.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:individual_enclosing_circle_radius", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:max_distance.exp_factor", "value": {"type": "decimal", "value": "1"}}, {"slot_ref": "slot:max_distance.max_distance", "value": {"type": "decimal", "value": "8000"}}], "constraint_ref": "constraint:max_distance", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fuel_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/multi", "episode_id": null} {"id": "v4/combo:routing:3d3eaf87b2a01b31", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "전체 경로에서 차량을 쓰는 데 드는 고정 운영비 합계를 최소화해줘. 모든 경로의 방문 순서는 반드시 시간 우선순위가 높은 순으로 잡아줘. 가능하면 모든 경로에서 각 배송의 서비스 시작 전 대기는 담당 기사별 대기시간 한도 이내로, 경로 종료는 담당 기사 근무 종료시간 이내로, 매 회차 운행 종료는 담당 기사에게 정해진 회차 운행 마감시간 이내로 맞춰줘"}], "ir": "MINIMIZE( SUM(x0 in routes: fixed_cost(x0)) )\n[HARD] EACH(x1 in routes): ORDERED_BY(visit_seq(x1), time_priority, DESC)\n[SOFT] AND( EACH(x2 in routes): EACH(x3 in visits(x2)): wait_duration(x3) <= max_wait(x2), EACH(x4 in routes): end_time(x4) <= work_end(x4), EACH(x5 in routes): EACH(x6 in rounds(x5)): end_time(x6) <= round_window_end(x5) )", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:rider_time_window.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:rider_time_window", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:time_priority_order.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:time_priority_order", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fixed_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:41efd455c3a27d9e", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "전체 경로의 차량 사용 고정 운영비 합계를 최소화하고, 모든 경로의 방문 순서는 반드시 시간 우선순위가 높은 순으로 배치해 주시기 바랍니다. 가능하면 모든 경로에서 각 배송의 서비스 시작 전 대기시간이 담당 기사 본인의 대기시간 한도를 넘지 않고, 경로 종료시간이 담당 기사의 근무 종료시간을 넘지 않으며, 각 회차 운행 종료시간도 담당 기사에게 정해진 회차 운행 마감시간을 넘지 않도록 부탁드립니다"}], "ir": "MINIMIZE( SUM(x0 in routes: fixed_cost(x0)) )\n[HARD] EACH(x1 in routes): ORDERED_BY(visit_seq(x1), time_priority, DESC)\n[SOFT] AND( EACH(x2 in routes): EACH(x3 in visits(x2)): wait_duration(x3) <= max_wait(x2), EACH(x4 in routes): end_time(x4) <= work_end(x4), EACH(x5 in routes): EACH(x6 in rounds(x5)): end_time(x6) <= round_window_end(x5) )", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:rider_time_window.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:rider_time_window", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:time_priority_order.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:time_priority_order", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fixed_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:5a31a68194a295ea", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "차량 사용 고정 운영비는 전체 경로 합계로 최소화해줘. 모든 경로는 반드시 시간 우선순위 높은 순으로 방문하게 해줘. 되도록 모든 경로에서 배송마다 서비스 시작 전 대기는 담당 기사 본인의 대기시간 한도 안에, 경로 종료는 담당 기사 근무 종료시간 안에, 매 회차 운행 종료는 담당 기사에게 정해진 회차 운행 마감시간 안에 맞춰줘"}], "ir": "MINIMIZE( SUM(x0 in routes: fixed_cost(x0)) )\n[HARD] EACH(x1 in routes): ORDERED_BY(visit_seq(x1), time_priority, DESC)\n[SOFT] AND( EACH(x2 in routes): EACH(x3 in visits(x2)): wait_duration(x3) <= max_wait(x2), EACH(x4 in routes): end_time(x4) <= work_end(x4), EACH(x5 in routes): EACH(x6 in rounds(x5)): end_time(x6) <= round_window_end(x5) )", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:rider_time_window.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:rider_time_window", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:time_priority_order.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:time_priority_order", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fixed_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:nurse:c8ff2767496f5101", "domain": "nurse", "language": "ko", "messages": [{"role": "user", "content": "전체 근무조의 필요 인원 대비 부족 인원 합계를 최소화하고, 모든 간호사의 연속 근무는 6일 이하, 각 주 안에 근무 시작과 종료가 모두 들어가는 근무의 총 근로시간은 간호사마다 주별로 44시간 이하로 해 주세요. 모든 간호사가 한 근무를 마치고 다음 근무를 시작하기까지의 휴식시간은 반드시 10시간 이상 보장해 주세요"}], "ir": "MINIMIZE( SUM(x0 in shift_instances: unmet_demand(x0)) )\nEACH(x1 in workers): RUN_LENGTH(x2 in day_seq(x1): works(x1, x2)) <= 6 day\nEACH(x3 in workers): EACH(x4 in windows(WEEK, 1)): SUM(x5 in assignments(x3) WHERE DURING(interval(x5), x4): work_hours(x5)) <= 44 h\n[HARD] EACH(x6 in workers): EACH(x7 in adjacent(assignment_seq(x6))): gap_duration(x7) >= 10 h", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:max_days", "value": {"type": "duration", "unit_ref": "unit:day", "value": "6"}}], "constraint_ref": "constraint:max_consecutive_days", "scope": null, "strength": {"kind": "soft", "weight": "100"}}, {"arguments": [{"slot_ref": "slot:max_hours", "value": {"type": "duration", "unit_ref": "unit:hour", "value": "44"}}], "constraint_ref": "constraint:max_hours_per_week", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [{"slot_ref": "slot:min_hours", "value": {"type": "duration", "unit_ref": "unit:hour", "value": "10"}}], "constraint_ref": "constraint:min_rest_hours", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:unmet_demand", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:nurse:0ce3b7a955dec693", "domain": "nurse", "language": "ko", "messages": [{"role": "user", "content": "전체 근무조의 수요 대비 부족 인원 합계는 최소화하고, 모든 간호사의 연속 근무는 6일 이하로, 각 주 안에 시작과 종료가 모두 포함되는 근무의 총시간은 간호사별 매주 44시간 이하로 잡아줘. 모든 간호사가 근무를 끝내고 바로 다음 근무에 들어가기 전에는 반드시 10시간 이상 쉬도록 해줘"}], "ir": "MINIMIZE( SUM(x0 in shift_instances: unmet_demand(x0)) )\nEACH(x1 in workers): RUN_LENGTH(x2 in day_seq(x1): works(x1, x2)) <= 6 day\nEACH(x3 in workers): EACH(x4 in windows(WEEK, 1)): SUM(x5 in assignments(x3) WHERE DURING(interval(x5), x4): work_hours(x5)) <= 44 h\n[HARD] EACH(x6 in workers): EACH(x7 in adjacent(assignment_seq(x6))): gap_duration(x7) >= 10 h", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:max_days", "value": {"type": "duration", "unit_ref": "unit:day", "value": "6"}}], "constraint_ref": "constraint:max_consecutive_days", "scope": null, "strength": {"kind": "soft", "weight": "100"}}, {"arguments": [{"slot_ref": "slot:max_hours", "value": {"type": "duration", "unit_ref": "unit:hour", "value": "44"}}], "constraint_ref": "constraint:max_hours_per_week", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [{"slot_ref": "slot:min_hours", "value": {"type": "duration", "unit_ref": "unit:hour", "value": "10"}}], "constraint_ref": "constraint:min_rest_hours", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:unmet_demand", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/perturb:nurse:f5e2db5378652fd7", "domain": "nurse", "language": "mixed", "messages": [{"role": "user", "content": "근무표 짤 때 모든 shift 배정의 선호도 점수 총합이 가장 크게 나오도록 해 주세요. 그리고 간호사 모두 연속된 두 근무 사이 rest 시간은 8시간 이하로 부탁해요."}], "ir": "MAXIMIZE( SUM(x0 in assignments: preference_score(x0)) )\nEACH(x1 in workers): EACH(x2 in adjacent(assignment_seq(x1))): gap_duration(x2) <= 8 h", "decision_kind": "unsupported", "gold_decision": {"kind": "unsupported", "reason_code": "realization_absent", "related_refs": ["constraint:min_rest_hours"]}, "stratum": "v4/perturb", "episode_id": null} {"id": "v4/perturb:nurse:427c9b215b2edc89", "domain": "nurse", "language": "ko", "messages": [{"role": "user", "content": "모든 간호사의 연속 근무 사이 휴식시간을 8시간 이하로 하고, 선호도 점수 총합이 최대가 되게 해 주세요."}], "ir": "EACH(x0 in workers): EACH(x1 in adjacent(assignment_seq(x0))): gap_duration(x1) <= 8 h\nMAXIMIZE( SUM(x2 in assignments: preference_score(x2)) )", "decision_kind": "unsupported", "gold_decision": {"kind": "unsupported", "reason_code": "realization_absent", "related_refs": ["constraint:min_rest_hours"]}, "stratum": "v4/perturb", "episode_id": null} {"id": "v4/combo:routing:2fcbd9008a58bc4c", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "오늘 배차 짤 때 전체 이동거리가 최소가 되도록 해 주세요. 그리고 각 경로는 정류장들을 다 감싸는 가장 작은 원의 반경이 10km 이하여야 해요. 또 기사님마다 대기시간 한도, 근무 종료 시각, 회차별 종료 시한은 반드시 지켜 주셔야 해요."}], "ir": "MINIMIZE( SUM(x0 in routes: travel_distance(x0)) )\nEACH(x1 in routes): sec_radius(x1) <= 10 km\n[HARD] AND( EACH(x2 in routes): EACH(x3 in visits(x2)): wait_duration(x3) <= max_wait(x2), EACH(x4 in routes): end_time(x4) <= work_end(x4), EACH(x5 in routes): EACH(x6 in rounds(x5)): end_time(x6) <= round_window_end(x5) )", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:enclosing_circle_radius.exp_factor", "value": {"type": "decimal", "value": "2"}}, {"slot_ref": "slot:enclosing_circle_radius.max_radius", "value": {"type": "decimal", "value": "10000"}}], "constraint_ref": "constraint:enclosing_circle_radius", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:rider_time_window.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:rider_time_window", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:distance_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:4b58aab70929e96d", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "모든 경로의 총 이동거리를 최소화하고, 각 경로의 정류장을 감싸는 최소 외접원 반경은 10km 이하로 부탁드립니다. 기사별 배송 대기시간 한도, 근무 종료 시각, 회차 종료 시각은 반드시 지켜야 합니다"}], "ir": "MINIMIZE( SUM(x0 in routes: travel_distance(x0)) )\nEACH(x1 in routes): sec_radius(x1) <= 10 km\n[HARD] AND( EACH(x2 in routes): EACH(x3 in visits(x2)): wait_duration(x3) <= max_wait(x2), EACH(x4 in routes): end_time(x4) <= work_end(x4), EACH(x5 in routes): EACH(x6 in rounds(x5)): end_time(x6) <= round_window_end(x5) )", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:enclosing_circle_radius.exp_factor", "value": {"type": "decimal", "value": "2"}}, {"slot_ref": "slot:enclosing_circle_radius.max_radius", "value": {"type": "decimal", "value": "10000"}}], "constraint_ref": "constraint:enclosing_circle_radius", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:rider_time_window.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:rider_time_window", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:distance_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:000c5da2279f28a2", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "전체 이동거리를 최소로 해 주시고, 경로마다 외접원 반경은 10km 이하로 맞춰 주세요. 기사별 대기시간 한도랑 근무 종료 시간, 회차 종료 시각은 절대 넘기면 안 돼요."}], "ir": "MINIMIZE( SUM(x0 in routes: travel_distance(x0)) )\nEACH(x1 in routes): sec_radius(x1) <= 10 km\n[HARD] AND( EACH(x2 in routes): EACH(x3 in visits(x2)): wait_duration(x3) <= max_wait(x2), EACH(x4 in routes): end_time(x4) <= work_end(x4), EACH(x5 in routes): EACH(x6 in rounds(x5)): end_time(x6) <= round_window_end(x5) )", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:enclosing_circle_radius.exp_factor", "value": {"type": "decimal", "value": "2"}}, {"slot_ref": "slot:enclosing_circle_radius.max_radius", "value": {"type": "decimal", "value": "10000"}}], "constraint_ref": "constraint:enclosing_circle_radius", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:rider_time_window.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:rider_time_window", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:distance_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:c9ce1773d70f704b", "domain": "routing", "language": "mixed", "messages": [{"role": "user", "content": "전체 route의 시작부터 종료까지 걸린 시간을 합한 총 운행시간과, 각 배송의 도착시간에 해당 배송의 priority를 반영한 값의 전체 합을 줄여 주세요. 모든 배송은 해당 배송의 허용된 마지막 시간 이내에 배송지에서 출발하도록 해 주세요. 가능하면 각 경로의 모든 배송지를 감싸는 가장 작은 원의 반경을 3km 이하로 잡아 주세요"}], "ir": "MINIMIZE( SUM(x0 in routes: duration(x0)) )\nMINIMIZE( SUM(x1 in visits: priority_weighted_arrival(x1)) )\nEACH(x2 in visits): departure_time(x2) <= tw_late(x2)\n[SOFT] EACH(x3 in routes): sec_radius(x3) <= 3 km", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:delivery_time_priority.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:delivery_time_priority", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:enclosing_circle_radius.exp_factor", "value": {"type": "decimal", "value": "2"}}, {"slot_ref": "slot:enclosing_circle_radius.max_radius", "value": {"type": "decimal", "value": "3000"}}], "constraint_ref": "constraint:enclosing_circle_radius", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:time_window.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:time_window", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:duration_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:63d7ce189ad5f0e0", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "모든 경로의 시작부터 종료까지 소요된 시간의 합과, 각 배송의 도착시간에 해당 배송의 시간 우선순위를 곱한 값의 전체 합을 줄이는 배차를 부탁드립니다. 모든 배송은 해당 배송의 허용된 마지막 시간 이내에 배송지에서 출발하도록 계획 부탁드립니다. 되도록 각 경로의 모든 배송지를 포함하는 가장 작은 원의 반경은 3km 이하로 잡아 주시기 바랍니다"}], "ir": "MINIMIZE( SUM(x0 in routes: duration(x0)) )\nMINIMIZE( SUM(x1 in visits: priority_weighted_arrival(x1)) )\nEACH(x2 in visits): departure_time(x2) <= tw_late(x2)\n[SOFT] EACH(x3 in routes): sec_radius(x3) <= 3 km", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:delivery_time_priority.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:delivery_time_priority", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:enclosing_circle_radius.exp_factor", "value": {"type": "decimal", "value": "2"}}, {"slot_ref": "slot:enclosing_circle_radius.max_radius", "value": {"type": "decimal", "value": "3000"}}], "constraint_ref": "constraint:enclosing_circle_radius", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:time_window.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:time_window", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:duration_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:09007881b67aa394", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "모든 경로의 시작부터 끝까지 걸린 시간의 합도 줄이고, 각 배송의 도착시간에 그 배송의 시간 우선순위를 곱한 값의 전체 합도 줄여줘. 모든 배송은 해당 배송의 허용된 마지막 시간 이내에 배송지에서 출발하도록 하고, 가능하면 각 경로의 모든 배송지를 감싸는 가장 작은 원의 반경을 3km 이하로 잡아줘"}], "ir": "MINIMIZE( SUM(x0 in routes: duration(x0)) )\nMINIMIZE( SUM(x1 in visits: priority_weighted_arrival(x1)) )\nEACH(x2 in visits): departure_time(x2) <= tw_late(x2)\n[SOFT] EACH(x3 in routes): sec_radius(x3) <= 3 km", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:delivery_time_priority.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:delivery_time_priority", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:enclosing_circle_radius.exp_factor", "value": {"type": "decimal", "value": "2"}}, {"slot_ref": "slot:enclosing_circle_radius.max_radius", "value": {"type": "decimal", "value": "3000"}}], "constraint_ref": "constraint:enclosing_circle_radius", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:time_window.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:time_window", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:duration_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/multi:nurse:1d78b1c77123d342", "domain": "nurse", "language": "en", "messages": [{"role": "user", "content": "Please build the roster so the total staffing shortfall against demand across all shifts is as small as possible. If possible, give every nurse at least 11 hours of rest between consecutive shifts, and ideally keep each nurse's hours at 56 or less in any given week."}], "ir": "MINIMIZE( SUM(x0 in shift_instances: unmet_demand(x0)) )\n[SOFT] EACH(x1 in workers): EACH(x2 in adjacent(assignment_seq(x1))): gap_duration(x2) >= 11 h\n[SOFT] EACH(x3 in workers): EACH(x4 in windows(WEEK, 1)): SUM(x5 in assignments(x3) WHERE DURING(interval(x5), x4): work_hours(x5)) <= 56 h", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:max_hours", "value": {"type": "duration", "unit_ref": "unit:hour", "value": "56"}}], "constraint_ref": "constraint:max_hours_per_week", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:min_hours", "value": {"type": "duration", "unit_ref": "unit:hour", "value": "11"}}], "constraint_ref": "constraint:min_rest_hours", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:unmet_demand", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/multi", "episode_id": null} {"id": "v4/multi:nurse:172b6b1341b02f19", "domain": "nurse", "language": "mixed", "messages": [{"role": "user", "content": "이번 달 duty roster 짜야 되는데, 전체 shift에서 demand 대비 인력 부족 합계가 최소가 되게 해줘. 그리고 가능하면 모든 간호사가 연속된 근무 사이에 rest를 11시간 이상 갖게 하고, 주당 근무시간도 되도록 56시간 넘지 않게 맞춰줘."}], "ir": "MINIMIZE( SUM(x0 in shift_instances: unmet_demand(x0)) )\n[SOFT] EACH(x1 in workers): EACH(x2 in adjacent(assignment_seq(x1))): gap_duration(x2) >= 11 h\n[SOFT] EACH(x3 in workers): EACH(x4 in windows(WEEK, 1)): SUM(x5 in assignments(x3) WHERE DURING(interval(x5), x4): work_hours(x5)) <= 56 h", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:max_hours", "value": {"type": "duration", "unit_ref": "unit:hour", "value": "56"}}], "constraint_ref": "constraint:max_hours_per_week", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:min_hours", "value": {"type": "duration", "unit_ref": "unit:hour", "value": "11"}}], "constraint_ref": "constraint:min_rest_hours", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:unmet_demand", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/multi", "episode_id": null} {"id": "v4/multi:nurse:2d7533ba7225a917", "domain": "nurse", "language": "ko", "messages": [{"role": "user", "content": "다음 달 근무표 만들어줘, 모든 근무에서 필요 인원 대비 부족한 인원 총합이 제일 적게 나오게 해줘. 가능하면 간호사 모두 연달아 하는 근무 사이에 11시간 이상 쉬게 하고, 한 주에 일하는 시간도 되도록 56시간 이하로 해줘"}], "ir": "MINIMIZE( SUM(x0 in shift_instances: unmet_demand(x0)) )\n[SOFT] EACH(x1 in workers): EACH(x2 in adjacent(assignment_seq(x1))): gap_duration(x2) >= 11 h\n[SOFT] EACH(x3 in workers): EACH(x4 in windows(WEEK, 1)): SUM(x5 in assignments(x3) WHERE DURING(interval(x5), x4): work_hours(x5)) <= 56 h", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:max_hours", "value": {"type": "duration", "unit_ref": "unit:hour", "value": "56"}}], "constraint_ref": "constraint:max_hours_per_week", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:min_hours", "value": {"type": "duration", "unit_ref": "unit:hour", "value": "11"}}], "constraint_ref": "constraint:min_rest_hours", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:unmet_demand", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/multi", "episode_id": null} {"id": "v4/combo:routing:3af19fa37f8ea9e1", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "각 경로의 시작부터 종료까지 걸리는 시간을 모두 합친 값과, 각 경로에서 차량을 사용하는 데 드는 고정 운영비의 합계를 줄여 주세요. 모든 경로의 매 왕복 운행에서 중량·부피 등 적재 항목별로 운행 중 가장 많이 실린 양이 해당 차량의 항목별 용량을 넘지 않게 해 주세요. 가능하면 모든 경로의 매 왕복 운행에서 적재 항목별 용량 활용률 중 가장 높은 값이 0.6 이상이 되도록 하고, 좌표가 같은 배송들은 같은 경로에 묶어 주세요."}], "ir": "MINIMIZE( SUM(x0 in routes: duration(x0)) )\nMINIMIZE( SUM(x1 in routes: fixed_cost(x1)) )\nEACH(x2 in routes): EACH(x3 in rounds(x2)): EACH(x4 in keys(load)): MAX(x5 in positions(x3): load[x4](x5)) <= capacity[x4](x2)\n[SOFT] EACH(x6 in routes): EACH(x7 in rounds(x6)): MAX(x8 in keys(load): utilization[x8](x7)) >= 0.6\n[SOFT] EACH((x9, x10) in pairs(visits, same_coordinate)): TOGETHER(x9, x10, route)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:capacity.exp_factor", "value": {"type": "decimal", "value": "1"}}], "constraint_ref": "constraint:capacity", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [{"slot_ref": "slot:min_capacity.target_ratio", "value": {"type": "decimal", "value": "0.6"}}], "constraint_ref": "constraint:min_capacity", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:same_coordinate_grouping.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:same_coordinate_grouping", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:duration_cost", "weight": "1/2"}, {"objective_ref": "objective:fixed_cost", "weight": "1/2"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:6638e05260503114", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "전체 경로의 차량 고정 운영비 합계를 최소화해 주세요. 각 경로의 배송 건수는 12건 이하로 잡아 주세요. 서로 500m 이내에 있는 배송지들은 같은 경로에 묶어 주세요"}], "ir": "MINIMIZE( SUM(x0 in routes: fixed_cost(x0)) )\nEACH(x1 in routes): delivery_count(x1) <= 12\nEACH((x2, x3) in pairs(visits, nearby(500 m))): TOGETHER(x2, x3, route)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:delivery_length.exp_factor", "value": {"type": "decimal", "value": "2"}}, {"slot_ref": "slot:delivery_length.max_size", "value": {"type": "decimal", "value": "12"}}], "constraint_ref": "constraint:delivery_length", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:nearby_delivery_grouping.distance_threshold", "value": {"type": "decimal", "value": "500"}}, {"slot_ref": "slot:nearby_delivery_grouping.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:nearby_delivery_grouping", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fixed_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:255566cc3acb9304", "domain": "routing", "language": "en", "messages": [{"role": "user", "content": "Minimize the total fixed vehicle operating cost across all routes, and keep each route to at most 12 deliveries. Assign any two delivery stops within 500 m of each other to the same route."}], "ir": "MINIMIZE( SUM(x0 in routes: fixed_cost(x0)) )\nEACH(x1 in routes): delivery_count(x1) <= 12\nEACH((x2, x3) in pairs(visits, nearby(500 m))): TOGETHER(x2, x3, route)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:delivery_length.exp_factor", "value": {"type": "decimal", "value": "2"}}, {"slot_ref": "slot:delivery_length.max_size", "value": {"type": "decimal", "value": "12"}}], "constraint_ref": "constraint:delivery_length", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:nearby_delivery_grouping.distance_threshold", "value": {"type": "decimal", "value": "500"}}, {"slot_ref": "slot:nearby_delivery_grouping.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:nearby_delivery_grouping", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fixed_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:bfe6a5b4a94db6ad", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "전체 경로의 차량 고정 운영비 합계를 최소화하고, 경로마다 배송은 12건 이하로 잡아줘. 서로 500m 이내인 배송지들은 같은 경로로 묶어줘"}], "ir": "MINIMIZE( SUM(x0 in routes: fixed_cost(x0)) )\nEACH(x1 in routes): delivery_count(x1) <= 12\nEACH((x2, x3) in pairs(visits, nearby(500 m))): TOGETHER(x2, x3, route)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:delivery_length.exp_factor", "value": {"type": "decimal", "value": "2"}}, {"slot_ref": "slot:delivery_length.max_size", "value": {"type": "decimal", "value": "12"}}], "constraint_ref": "constraint:delivery_length", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:nearby_delivery_grouping.distance_threshold", "value": {"type": "decimal", "value": "500"}}, {"slot_ref": "slot:nearby_delivery_grouping.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:nearby_delivery_grouping", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fixed_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:38854f4ca11682c9", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "전체 경로 총 운행시간 최소로, 왕복마다 적재율 60% 이상은 가능하면 맞춰줘"}], "ir": "MINIMIZE( SUM(x0 in routes: duration(x0)) )\n[SOFT] EACH(x1 in routes): EACH(x2 in rounds(x1)): MAX(x3 in keys(load): utilization[x3](x2)) >= 0.6", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:min_capacity.target_ratio", "value": {"type": "decimal", "value": "0.6"}}], "constraint_ref": "constraint:min_capacity", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:duration_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:7fdb5f9460743698", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "이번 배차 계획 짜는 건데요, 모든 경로의 운행시간 합계가 가장 짧게 나오도록 해 주세요. 그리고 각 경로의 왕복마다 가장 많이 찬 적재 항목 기준으로 적재율이 0.6 이상 되도록, 가능하면 맞춰 주세요"}], "ir": "MINIMIZE( SUM(x0 in routes: duration(x0)) )\n[SOFT] EACH(x1 in routes): EACH(x2 in rounds(x1)): MAX(x3 in keys(load): utilization[x3](x2)) >= 0.6", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:min_capacity.target_ratio", "value": {"type": "decimal", "value": "0.6"}}], "constraint_ref": "constraint:min_capacity", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:duration_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:e430aad2d2575540", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "모든 경로 운행시간 다 합친 걸 최소화해줘. 되도록 경로별 왕복마다 최대 적재율이 60% 넘게 해주면 좋겠어"}], "ir": "MINIMIZE( SUM(x0 in routes: duration(x0)) )\n[SOFT] EACH(x1 in routes): EACH(x2 in rounds(x1)): MAX(x3 in keys(load): utilization[x3](x2)) >= 0.6", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:min_capacity.target_ratio", "value": {"type": "decimal", "value": "0.6"}}], "constraint_ref": "constraint:min_capacity", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:duration_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:962f4b858ae46c21", "domain": "routing", "language": "en", "messages": [{"role": "user", "content": "Can you plan the routes so that total fuel cost across all routes is as low as possible, and total time from start to finish across all routes is as low as possible too? Both matter. Also, if possible, try to keep the number of different delivery zones covered in each round trip small, summed over every round trip on every route"}], "ir": "MINIMIZE( SUM(x0 in routes: fuel_cost(x0)) )\nMINIMIZE( SUM(x1 in routes: duration(x1)) )\n[SOFT] MINIMIZE( SUM(x2 in routes: SUM(x3 in rounds(x2): COUNT_DISTINCT(x4 in visits(x3): zone(x4)))) )", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:rider_route_zone.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:rider_route_zone", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:duration_cost", "weight": "1/2"}, {"objective_ref": "objective:fuel_cost", "weight": "1/2"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:3625be6227bdac28", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "모든 경로 연료비 합계 최소로, 총 운행시간 합계도 최소로 짜줘. 가능하면 각 경로의 왕복마다 들르는 배달 구역 종류 수도 되도록 적게, 전체 합으로 줄여줘"}], "ir": "MINIMIZE( SUM(x0 in routes: fuel_cost(x0)) )\nMINIMIZE( SUM(x1 in routes: duration(x1)) )\n[SOFT] MINIMIZE( SUM(x2 in routes: SUM(x3 in rounds(x2): COUNT_DISTINCT(x4 in visits(x3): zone(x4)))) )", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:rider_route_zone.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:rider_route_zone", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:duration_cost", "weight": "1/2"}, {"objective_ref": "objective:fuel_cost", "weight": "1/2"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:d150df9fc4ec139d", "domain": "routing", "language": "mixed", "messages": [{"role": "user", "content": "전체 route의 fuel 비용 총합도 줄이고 운행시간 총합도 줄이는 쪽으로 배차해줘, 둘 다 중요해. 그리고 가능하면 각 route의 round trip마다 겹치지 않는 zone 수를 전부 합쳐서 되도록 적게 나오게 해줘"}], "ir": "MINIMIZE( SUM(x0 in routes: fuel_cost(x0)) )\nMINIMIZE( SUM(x1 in routes: duration(x1)) )\n[SOFT] MINIMIZE( SUM(x2 in routes: SUM(x3 in rounds(x2): COUNT_DISTINCT(x4 in visits(x3): zone(x4)))) )", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:rider_route_zone.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:rider_route_zone", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:duration_cost", "weight": "1/2"}, {"objective_ref": "objective:fuel_cost", "weight": "1/2"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:4f9a227e6210ec7c", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "전체 배송 경로에 걸쳐 차량 사용 고정 운영비 합계와 연료비 합계를 줄여 주세요. 모든 경로에서 각 배송지의 서비스 시작 전 대기시간은 담당 기사별 대기 한도 이내로, 경로 종료는 담당 기사 근무 종료시간 이내로, 각 왕복 운행 종료는 담당 기사의 왕복 운행 시간대 종료 시각 이내로 잡고, 좌표가 같은 배송지들은 같은 경로에 묶어 주세요."}], "ir": "MINIMIZE( SUM(x0 in routes: fixed_cost(x0)) )\nMINIMIZE( SUM(x1 in routes: fuel_cost(x1)) )\nAND( EACH(x2 in routes): EACH(x3 in visits(x2)): wait_duration(x3) <= max_wait(x2), EACH(x4 in routes): end_time(x4) <= work_end(x4), EACH(x5 in routes): EACH(x6 in rounds(x5)): end_time(x6) <= round_window_end(x5) )\nEACH((x7, x8) in pairs(visits, same_coordinate)): TOGETHER(x7, x8, route)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:rider_time_window.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:rider_time_window", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:same_coordinate_grouping.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:same_coordinate_grouping", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fixed_cost", "weight": "1/2"}, {"objective_ref": "objective:fuel_cost", "weight": "1/2"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:adeb48d02890e930", "domain": "routing", "language": "en", "messages": [{"role": "user", "content": "Please reduce both the total fixed vehicle operating cost and the total fuel cost across all routes. On every route, keep the wait before service at each delivery within the assigned driver's own waiting limit, finish the route by that driver's working-hours end, and finish each round trip by that driver's round-trip window end. Put deliveries at the same coordinates on the same route."}], "ir": "MINIMIZE( SUM(x0 in routes: fixed_cost(x0)) )\nMINIMIZE( SUM(x1 in routes: fuel_cost(x1)) )\nAND( EACH(x2 in routes): EACH(x3 in visits(x2)): wait_duration(x3) <= max_wait(x2), EACH(x4 in routes): end_time(x4) <= work_end(x4), EACH(x5 in routes): EACH(x6 in rounds(x5)): end_time(x6) <= round_window_end(x5) )\nEACH((x7, x8) in pairs(visits, same_coordinate)): TOGETHER(x7, x8, route)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:rider_time_window.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:rider_time_window", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:same_coordinate_grouping.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:same_coordinate_grouping", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fixed_cost", "weight": "1/2"}, {"objective_ref": "objective:fuel_cost", "weight": "1/2"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:54d1c692bfa6cbdf", "domain": "routing", "language": "en", "messages": [{"role": "user", "content": "Please minimize total fixed vehicle operating costs and total fuel costs across all routes, and put deliveries with matching coordinates on the same route. For every route, keep each delivery's wait before service within its driver's own waiting-time limit, end the route by that driver's end of working hours, and end each round trip by that driver's round-trip window end."}], "ir": "MINIMIZE( SUM(x0 in routes: fixed_cost(x0)) )\nMINIMIZE( SUM(x1 in routes: fuel_cost(x1)) )\nEACH((x2, x3) in pairs(visits, same_coordinate)): TOGETHER(x2, x3, route)\nAND( EACH(x4 in routes): EACH(x5 in visits(x4)): wait_duration(x5) <= max_wait(x4), EACH(x6 in routes): end_time(x6) <= work_end(x6), EACH(x7 in routes): EACH(x8 in rounds(x7)): end_time(x8) <= round_window_end(x7) )", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:rider_time_window.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:rider_time_window", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:same_coordinate_grouping.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:same_coordinate_grouping", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fixed_cost", "weight": "1/2"}, {"objective_ref": "objective:fuel_cost", "weight": "1/2"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:b98478fd3a9705cd", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "전체 루트의 이동거리 합계를 최소화해서 플랜을 잡아 주세요. 각 루트의 배송은 반드시 12건 이내로 해 주세요. 각 루트의 총 이동거리는 담당 기사별 총 거리 한도 이내로, 루트 내 각 왕복 운행의 이동거리는 해당 기사의 왕복당 거리 한도 이내로, 연속된 두 방문지 사이의 이동거리는 해당 기사의 방문지 간 거리 한도 이내로 맞춰 주세요."}], "ir": "MINIMIZE( SUM(x0 in routes: travel_distance(x0)) )\n[HARD] EACH(x1 in routes): delivery_count(x1) <= 12\nAND( EACH(x2 in routes): travel_distance(x2) <= total_limit(x2), EACH(x3 in routes): EACH(x4 in rounds(x3)): travel_distance(x4) <= trip_limit(x3), EACH(x5 in routes): EACH(x6 in adjacent(visit_seq(x5))): travel_distance(x6) <= between_limit(x5) )", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:delivery_length.exp_factor", "value": {"type": "decimal", "value": "2"}}, {"slot_ref": "slot:delivery_length.max_size", "value": {"type": "decimal", "value": "12"}}], "constraint_ref": "constraint:delivery_length", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [{"slot_ref": "slot:rider_distance.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:rider_distance", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:distance_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:f706b8fba51b226c", "domain": "routing", "language": "en", "messages": [{"role": "user", "content": "Minimize the total travel distance across all routes; every route must have at most 12 deliveries. Keep each route’s travel distance within its assigned driver’s own total distance limit, each round trip within that driver’s own per-round-trip distance limit, and travel between every consecutive pair of stops within that driver’s own between-stop distance limit."}], "ir": "MINIMIZE( SUM(x0 in routes: travel_distance(x0)) )\n[HARD] EACH(x1 in routes): delivery_count(x1) <= 12\nAND( EACH(x2 in routes): travel_distance(x2) <= total_limit(x2), EACH(x3 in routes): EACH(x4 in rounds(x3)): travel_distance(x4) <= trip_limit(x3), EACH(x5 in routes): EACH(x6 in adjacent(visit_seq(x5))): travel_distance(x6) <= between_limit(x5) )", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:delivery_length.exp_factor", "value": {"type": "decimal", "value": "2"}}, {"slot_ref": "slot:delivery_length.max_size", "value": {"type": "decimal", "value": "12"}}], "constraint_ref": "constraint:delivery_length", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [{"slot_ref": "slot:rider_distance.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:rider_distance", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:distance_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:95aaeb058766069d", "domain": "routing", "language": "mixed", "messages": [{"role": "user", "content": "전체 route의 차량 fixed cost 합계를 최소화해 주세요. 모든 경로의 총 이동거리는 반드시 120km 이내로 잡고, 각 경로의 매 왕복 운행에서는 중량·부피 등 적재 항목별로 운행 중 가장 많이 실린 양이 해당 차량의 항목별 capacity를 넘지 않게 해 주세요"}], "ir": "MINIMIZE( SUM(x0 in routes: fixed_cost(x0)) )\n[HARD] EACH(x1 in HOLE(scope)): travel_distance(x1) <= 120 km\nEACH(x2 in routes): EACH(x3 in rounds(x2)): EACH(x4 in keys(load)): MAX(x5 in positions(x3): load[x4](x5)) <= capacity[x4](x2)", "decision_kind": "clarify", "gold_decision": {"candidate_refs": ["constraint:max_distance"], "kind": "clarify", "missing_field_refs": [], "reason_code": "ambiguous_capability", "required_inputs": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:720d750db13b4dec", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "내일 배차 계획을 짜려고 합니다. 모든 경로의 연료비 합계와 시작부터 끝까지 걸리는 총 운행시간을 둘 다 최소화해 주시고, 각 경로의 배송 건수는 3건 이하로 부탁드립니다"}], "ir": "MINIMIZE( SUM(x0 in routes: fuel_cost(x0)) )\nMINIMIZE( SUM(x1 in routes: duration(x1)) )\nEACH(x2 in routes): delivery_count(x2) <= 3", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:delivery_length.exp_factor", "value": {"type": "decimal", "value": "2"}}, {"slot_ref": "slot:delivery_length.max_size", "value": {"type": "decimal", "value": "3"}}], "constraint_ref": "constraint:delivery_length", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:duration_cost", "weight": "1/2"}, {"objective_ref": "objective:fuel_cost", "weight": "1/2"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:8e481f51802fcdda", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "전체 경로 연료비 총합과 전체 경로 총 운행시간을 같이 줄이고, 경로마다 배송지는 최대 3곳으로 부탁드립니다"}], "ir": "MINIMIZE( SUM(x0 in routes: fuel_cost(x0)) )\nMINIMIZE( SUM(x1 in routes: duration(x1)) )\nEACH(x2 in routes): delivery_count(x2) <= 3", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:delivery_length.exp_factor", "value": {"type": "decimal", "value": "2"}}, {"slot_ref": "slot:delivery_length.max_size", "value": {"type": "decimal", "value": "3"}}], "constraint_ref": "constraint:delivery_length", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:duration_cost", "weight": "1/2"}, {"objective_ref": "objective:fuel_cost", "weight": "1/2"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:7151444091463217", "domain": "routing", "language": "mixed", "messages": [{"role": "user", "content": "오늘 route 배정 작업 요청드립니다. 전체 route의 fuel cost 합계와 시작부터 종료까지 총 duration을 모두 최소화해 주시고, 각 route의 delivery 건수는 3건 이하로 제한 부탁드립니다"}], "ir": "MINIMIZE( SUM(x0 in routes: fuel_cost(x0)) )\nMINIMIZE( SUM(x1 in routes: duration(x1)) )\nEACH(x2 in routes): delivery_count(x2) <= 3", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:delivery_length.exp_factor", "value": {"type": "decimal", "value": "2"}}, {"slot_ref": "slot:delivery_length.max_size", "value": {"type": "decimal", "value": "3"}}], "constraint_ref": "constraint:delivery_length", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:duration_cost", "weight": "1/2"}, {"objective_ref": "objective:fuel_cost", "weight": "1/2"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/multi:routing:acf6e396aada4163", "domain": "routing", "language": "en", "messages": [{"role": "user", "content": "Minimize the total fuel cost across all routes, and keep the highest capacity utilization ratio across cargo dimensions at least 0.6 on every round trip of every route. For every route, keep the total travel distance within its driver's own total distance limit, each round trip's travel distance within that driver's own per-round-trip limit, and the travel distance between each pair of consecutive stops within that driver's own between-stop limit."}], "ir": "MINIMIZE( SUM(x0 in routes: fuel_cost(x0)) )\nEACH(x1 in routes): EACH(x2 in rounds(x1)): MAX(x3 in keys(load): utilization[x3](x2)) >= 0.6\nAND( EACH(x4 in routes): travel_distance(x4) <= total_limit(x4), EACH(x5 in routes): EACH(x6 in rounds(x5)): travel_distance(x6) <= trip_limit(x5), EACH(x7 in routes): EACH(x8 in adjacent(visit_seq(x7))): travel_distance(x8) <= between_limit(x7) )", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:min_capacity.target_ratio", "value": {"type": "decimal", "value": "0.6"}}], "constraint_ref": "constraint:min_capacity", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:rider_distance.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:rider_distance", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fuel_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/multi", "episode_id": null} {"id": "v4/multi:routing:ac7756b27112221f", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "전체 경로에서 드는 연료비 합계를 최소로 해 주세요. 모든 경로의 각 왕복 운행마다 화물 용량 항목별 적재율 중 가장 높은 값이 0.6 이상이 되게 해 주세요. 모든 경로에서 전체 이동거리는 담당 기사님 본인의 총 거리 한도, 각 왕복 운행의 이동거리는 그 기사님 본인의 왕복 운행당 거리 한도, 연속된 두 방문지 사이의 이동거리는 그 기사님 본인의 방문지 간 거리 한도를 넘지 않게 해 주세요"}], "ir": "MINIMIZE( SUM(x0 in routes: fuel_cost(x0)) )\nEACH(x1 in routes): EACH(x2 in rounds(x1)): MAX(x3 in keys(load): utilization[x3](x2)) >= 0.6\nAND( EACH(x4 in routes): travel_distance(x4) <= total_limit(x4), EACH(x5 in routes): EACH(x6 in rounds(x5)): travel_distance(x6) <= trip_limit(x5), EACH(x7 in routes): EACH(x8 in adjacent(visit_seq(x7))): travel_distance(x8) <= between_limit(x7) )", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:min_capacity.target_ratio", "value": {"type": "decimal", "value": "0.6"}}], "constraint_ref": "constraint:min_capacity", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:rider_distance.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:rider_distance", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fuel_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/multi", "episode_id": null} {"id": "v4/perturb:routing:a52cb35ba85da530", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "전체 경로의 연료비 합계를 최소화해 주시기 바랍니다. 각 경로의 정차 지점을 모두 포함하는 가장 작은 원의 반지름은 10km 이상으로 잡아 주십시오."}], "ir": "MINIMIZE( SUM(x0 in routes: fuel_cost(x0)) )\nEACH(x1 in routes): sec_radius(x1) >= 10 km", "decision_kind": "unsupported", "gold_decision": {"kind": "unsupported", "reason_code": "semantic_not_declared", "related_refs": []}, "stratum": "v4/perturb", "episode_id": null} {"id": "v4/perturb:routing:ecb8b4f3c70f5830", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "전체 경로 총 연료비는 최소로, 각 경로 정차 지점을 모두 감싸는 가장 작은 원의 반지름은 10km 이상으로 해줘"}], "ir": "MINIMIZE( SUM(x0 in routes: fuel_cost(x0)) )\nEACH(x1 in routes): sec_radius(x1) >= 10 km", "decision_kind": "unsupported", "gold_decision": {"kind": "unsupported", "reason_code": "semantic_not_declared", "related_refs": []}, "stratum": "v4/perturb", "episode_id": null} {"id": "v4/perturb:routing:ae411bb3e1077ed0", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "전체 경로의 연료비 합계를 최소화해 주세요. 각 경로의 정차 지점을 모두 포함하는 가장 작은 원의 반지름은 10km 이상으로 해 주세요"}], "ir": "MINIMIZE( SUM(x0 in routes: fuel_cost(x0)) )\nEACH(x1 in routes): sec_radius(x1) >= 10 km", "decision_kind": "unsupported", "gold_decision": {"kind": "unsupported", "reason_code": "semantic_not_declared", "related_refs": []}, "stratum": "v4/perturb", "episode_id": null} {"id": "v4/hole-scope:routing:24462fa7db9c2a50", "domain": "routing", "language": "en", "messages": [{"role": "user", "content": "Please plan the routes so the total travel distance is as small as possible, and keep the travel distance at 8 km or less."}], "ir": "MINIMIZE( SUM(x0 in routes: travel_distance(x0)) )\nEACH(x1 in HOLE(scope)): travel_distance(x1) <= 8 km", "decision_kind": "clarify", "gold_decision": {"candidate_refs": ["constraint:max_distance"], "kind": "clarify", "missing_field_refs": [], "reason_code": "ambiguous_capability", "required_inputs": []}, "stratum": "v4/hole-scope", "episode_id": null} {"id": "v4/hole-scope:routing:5fa1ad4a11c62bee", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "모든 경로의 총 이동거리가 가장 짧도록 배차해 주시고, 이동거리는 8km를 넘지 않도록 부탁드립니다"}], "ir": "MINIMIZE( SUM(x0 in routes: travel_distance(x0)) )\nEACH(x1 in HOLE(scope)): travel_distance(x1) <= 8 km", "decision_kind": "clarify", "gold_decision": {"candidate_refs": ["constraint:max_distance"], "kind": "clarify", "missing_field_refs": [], "reason_code": "ambiguous_capability", "required_inputs": []}, "stratum": "v4/hole-scope", "episode_id": null} {"id": "v4/hole-scope:routing:caf07d6e93f22d1f", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "전체 배송 경로의 총 이동 거리를 최소화해줘. 배송 건수는 5건 이상으로 잡아줘"}], "ir": "MINIMIZE( SUM(x0 in routes: travel_distance(x0)) )\nEACH(x1 in HOLE(scope)): delivery_count(x1) >= 5", "decision_kind": "clarify", "gold_decision": {"candidate_refs": ["constraint:minimum_order"], "kind": "clarify", "missing_field_refs": [], "reason_code": "ambiguous_capability", "required_inputs": []}, "stratum": "v4/hole-scope", "episode_id": null} {"id": "v4/hole-scope:routing:0202a177c29a5a0e", "domain": "routing", "language": "mixed", "messages": [{"role": "user", "content": "전체 route의 총 이동 거리를 최소화해줘. 배송은 minimum order 5건으로 잡아줘"}], "ir": "MINIMIZE( SUM(x0 in routes: travel_distance(x0)) )\nEACH(x1 in HOLE(scope)): delivery_count(x1) >= 5", "decision_kind": "clarify", "gold_decision": {"candidate_refs": ["constraint:minimum_order"], "kind": "clarify", "missing_field_refs": [], "reason_code": "ambiguous_capability", "required_inputs": []}, "stratum": "v4/hole-scope", "episode_id": null} {"id": "v4/hole-scope:routing:e19995e35f258c5c", "domain": "routing", "language": "en", "messages": [{"role": "user", "content": "Minimize the total travel distance across all routes. Set the delivery count to at least 5."}], "ir": "MINIMIZE( SUM(x0 in routes: travel_distance(x0)) )\nEACH(x1 in HOLE(scope)): delivery_count(x1) >= 5", "decision_kind": "clarify", "gold_decision": {"candidate_refs": ["constraint:minimum_order"], "kind": "clarify", "missing_field_refs": [], "reason_code": "ambiguous_capability", "required_inputs": []}, "stratum": "v4/hole-scope", "episode_id": null} {"id": "v4/scenario:routing:f6b4306e285828da", "domain": "routing", "language": "en", "messages": [{"role": "user", "content": "Can you plan the warehouse runs to keep the total time across all routes as low as possible? Never load a vehicle beyond its capacity, and have every trip leave the depot at least 80% full. You must keep every driver within their working hours and waiting-time limits and every trip within its finish-time limit, and ideally get every delivery completed by its latest allowed time."}], "ir": "MINIMIZE( SUM(x0 in routes: duration(x0)) )\n[HARD] EACH(x1 in routes): EACH(x2 in rounds(x1)): EACH(x3 in keys(load)): MAX(x4 in positions(x2): load[x3](x4)) <= capacity[x3](x1)\nEACH(x5 in routes): EACH(x6 in rounds(x5)): MAX(x7 in keys(load): utilization[x7](x6)) >= 0.8\n[HARD] AND( EACH(x8 in routes): EACH(x9 in visits(x8)): wait_duration(x9) <= max_wait(x8), EACH(x10 in routes): end_time(x10) <= work_end(x10), EACH(x11 in routes): EACH(x12 in rounds(x11)): end_time(x12) <= round_window_end(x11) )\n[SOFT] EACH(x13 in visits): departure_time(x13) <= tw_late(x13)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:capacity.exp_factor", "value": {"type": "decimal", "value": "1"}}], "constraint_ref": "constraint:capacity", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [{"slot_ref": "slot:min_capacity.target_ratio", "value": {"type": "decimal", "value": "0.8"}}], "constraint_ref": "constraint:min_capacity", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:rider_time_window.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:rider_time_window", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [{"slot_ref": "slot:time_window.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:time_window", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:duration_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/scenario", "episode_id": null} {"id": "v4/wide:retail:106be1223f4f60fd", "domain": "retail", "language": "ko", "messages": [{"role": "user", "content": "냉장고가 꽉 차서 발주 계획 좀 잡아줘. 하루 평균 재고 보관비랑 재고 중 버리는 비율을 둘 다 낮추는 쪽으로 해줘. 품목마다 공급업체에서 입고까지 걸리는 시간을 반영하고, 각 품목은 반드시 발주 가능한 요일에만 주문하게 해줘."}], "ir": "MINIMIZE( MEAN(x0 in days(horizon): holding_cost(x0)) )\nMINIMIZE( waste_rate )\nEACH(x1 in orders): arrival_day(x1) = offset(order_day(x1), lead_time(x1))\n[HARD] EACH(x2 in orders): day_of_week(x2) IN allowed_order_days(x2)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:lead_time", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [], "constraint_ref": "constraint:order_days", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:minimize_holding_cost", "weight": "1/2"}, {"objective_ref": "objective:minimize_waste", "weight": "1/2"}]}, "parameters": []}, "stratum": "v4/wide", "episode_id": null} {"id": "v4/wide:retail:6c9ecbf63033bd2a", "domain": "retail", "language": "ko", "messages": [{"role": "user", "content": "반찬 재고로 냉장고가 꽉 찼네, 발주 계획 다시 짜줘. 하루 평균 재고 유지비도 줄이고 재고 중 폐기되는 비율도 낮춰줘. 품목별로 공급업체 배송에 걸리는 시간을 고려하고, 주문은 반드시 품목마다 정해진 발주 요일에만 넣도록 해줘."}], "ir": "MINIMIZE( MEAN(x0 in days(horizon): holding_cost(x0)) )\nMINIMIZE( waste_rate )\nEACH(x1 in orders): arrival_day(x1) = offset(order_day(x1), lead_time(x1))\n[HARD] EACH(x2 in orders): day_of_week(x2) IN allowed_order_days(x2)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:lead_time", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [], "constraint_ref": "constraint:order_days", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:minimize_holding_cost", "weight": "1/2"}, {"objective_ref": "objective:minimize_waste", "weight": "1/2"}]}, "parameters": []}, "stratum": "v4/wide", "episode_id": null} {"id": "v4/wide:retail:7670a54a3dc697c7", "domain": "retail", "language": "ko", "messages": [{"role": "user", "content": "냉장고가 꽉 차서 그러는데, 하루 평균 재고 보관비랑 재고 중 폐기되는 비율을 낮추도록 발주 계획 짜줘. 품목별 공급업체 입고 소요일을 반영하고, 각 품목은 반드시 발주 가능한 요일에만 주문해줘."}], "ir": "MINIMIZE( MEAN(x0 in days(horizon): holding_cost(x0)) )\nMINIMIZE( waste_rate )\nEACH(x1 in orders): arrival_day(x1) = offset(order_day(x1), lead_time(x1))\n[HARD] EACH(x2 in orders): day_of_week(x2) IN allowed_order_days(x2)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:lead_time", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [], "constraint_ref": "constraint:order_days", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:minimize_holding_cost", "weight": "1/2"}, {"objective_ref": "objective:minimize_waste", "weight": "1/2"}]}, "parameters": []}, "stratum": "v4/wide", "episode_id": null} {"id": "v4/wide:nurse:61f93d0b91111fa8", "domain": "nurse", "language": "mixed", "messages": [{"role": "user", "content": "다음 달 소아병동 duty roster 작성 부탁드립니다. 모든 shift의 인력 부족(understaffing) 합계가 최대한 적도록 해 주시고, 간호사 누구도 4일 넘게 연속 근무하지 않게 편성 부탁드립니다"}], "ir": "MINIMIZE( SUM(x0 in shift_instances: unmet_demand(x0)) )\nEACH(x1 in workers): RUN_LENGTH(x2 in day_seq(x1): works(x1, x2)) <= 4 day", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:max_days", "value": {"type": "duration", "unit_ref": "unit:day", "value": "4"}}], "constraint_ref": "constraint:max_consecutive_days", "scope": null, "strength": {"kind": "soft", "weight": "100"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:unmet_demand", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/wide", "episode_id": null} {"id": "v4/wide:nurse:19d1ec6864dcb4db", "domain": "nurse", "language": "ko", "messages": [{"role": "user", "content": "인력 부족 근무 총합 최소로, 연속근무는 4일까지만 해 주세요"}], "ir": "MINIMIZE( SUM(x0 in shift_instances: unmet_demand(x0)) )\nEACH(x1 in workers): RUN_LENGTH(x2 in day_seq(x1): works(x1, x2)) <= 4 day", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:max_days", "value": {"type": "duration", "unit_ref": "unit:day", "value": "4"}}], "constraint_ref": "constraint:max_consecutive_days", "scope": null, "strength": {"kind": "soft", "weight": "100"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:unmet_demand", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/wide", "episode_id": null} {"id": "v4/wide:nurse:79289c0e1456fb8a", "domain": "nurse", "language": "ko", "messages": [{"role": "user", "content": "다음 달 소아병동 근무표 짜 주세요. 근무마다 모자라는 인원을 다 합친 게 최대한 적었으면 좋겠고, 간호사 모두 연속으로 4일 넘게 일하지 않게 해 주세요."}], "ir": "MINIMIZE( SUM(x0 in shift_instances: unmet_demand(x0)) )\nEACH(x1 in workers): RUN_LENGTH(x2 in day_seq(x1): works(x1, x2)) <= 4 day", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:max_days", "value": {"type": "duration", "unit_ref": "unit:day", "value": "4"}}], "constraint_ref": "constraint:max_consecutive_days", "scope": null, "strength": {"kind": "soft", "weight": "100"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:unmet_demand", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/wide", "episode_id": null} {"id": "v4/short:nurse:0a686b27d3b0c984", "domain": "nurse", "language": "en", "messages": [{"role": "user", "content": "make the roster with total nurse overtime as low as possible, and nobody working more than 4 days in a row"}], "ir": "MINIMIZE( SUM(x0 in workers: overtime_hours(x0)) )\nEACH(x1 in workers): RUN_LENGTH(x2 in day_seq(x1): works(x1, x2)) <= 4 day", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:max_days", "value": {"type": "duration", "unit_ref": "unit:day", "value": "4"}}], "constraint_ref": "constraint:max_consecutive_days", "scope": null, "strength": {"kind": "soft", "weight": "100"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:overtime", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/short", "episode_id": null} {"id": "v4/short:nurse:141bdca64333d937", "domain": "nurse", "language": "ko", "messages": [{"role": "user", "content": "간호사 초과근무 시간 합계 최소로, 4일 넘게 연속 근무하는 사람 없게 근무표 짜 주세요"}], "ir": "MINIMIZE( SUM(x0 in workers: overtime_hours(x0)) )\nEACH(x1 in workers): RUN_LENGTH(x2 in day_seq(x1): works(x1, x2)) <= 4 day", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:max_days", "value": {"type": "duration", "unit_ref": "unit:day", "value": "4"}}], "constraint_ref": "constraint:max_consecutive_days", "scope": null, "strength": {"kind": "soft", "weight": "100"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:overtime", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/short", "episode_id": null} {"id": "v4/short:nurse:4698ccff1acd7c57", "domain": "nurse", "language": "ko", "messages": [{"role": "user", "content": "초과근무 총합 제일 적게, 연속근무는 4일까지만 되게 근무표 짜줘"}], "ir": "MINIMIZE( SUM(x0 in workers: overtime_hours(x0)) )\nEACH(x1 in workers): RUN_LENGTH(x2 in day_seq(x1): works(x1, x2)) <= 4 day", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:max_days", "value": {"type": "duration", "unit_ref": "unit:day", "value": "4"}}], "constraint_ref": "constraint:max_consecutive_days", "scope": null, "strength": {"kind": "soft", "weight": "100"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:overtime", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/short", "episode_id": null} {"id": "v4/wide:retail:f70df7c069623743", "domain": "retail", "language": "en", "messages": [{"role": "user", "content": "We threw out a ton of bread at the bakery last week and it really hurt. Can you plan my supplier orders so the share of stock we end up discarding is as low as possible, while accounting for each item's supplier lead time and shelf life, and ordering in multiples of each item's minimum order quantity"}], "ir": "MINIMIZE( waste_rate )\nEACH(x0 in orders): arrival_day(x0) = offset(order_day(x0), lead_time(x0))\nEACH(x1 in items): EACH(x2 in units(x1)): expiry_day(x2) = offset(arrival_day(x2), product_life(x1))\nEACH(x3 in orders): quantity(x3) MULTIPLE_OF min_order_quantity(x3)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:lead_time", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [], "constraint_ref": "constraint:minimum_order_quantity", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [], "constraint_ref": "constraint:shelf_life", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:minimize_waste", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/wide", "episode_id": null} {"id": "v4/wide:retail:188379dc7fa3db3a", "domain": "retail", "language": "mixed", "messages": [{"role": "user", "content": "지난주 베이커리에서 빵 폐기가 많이 나와서 발주 계획을 다시 짜고 싶습니다. 폐기율이 최대한 낮아지도록 품목별 lead time과 유통기한을 반영하고, 발주 수량은 품목별 MOQ의 배수로 맞춰서 plan 부탁드립니다."}], "ir": "MINIMIZE( waste_rate )\nEACH(x0 in orders): arrival_day(x0) = offset(order_day(x0), lead_time(x0))\nEACH(x1 in items): EACH(x2 in units(x1)): expiry_day(x2) = offset(arrival_day(x2), product_life(x1))\nEACH(x3 in orders): quantity(x3) MULTIPLE_OF min_order_quantity(x3)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:lead_time", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [], "constraint_ref": "constraint:minimum_order_quantity", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [], "constraint_ref": "constraint:shelf_life", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:minimize_waste", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/wide", "episode_id": null} {"id": "v4/wide:retail:8985fdbfeab14b68", "domain": "retail", "language": "ko", "messages": [{"role": "user", "content": "지난주에 빵을 너무 많이 버려서 손실이 컸습니다. 버리는 재고의 비율이 가장 낮아지도록 발주 계획을 세워 주시고, 품목마다 다른 공급자 리드타임과 유통기한을 고려해 주시기 바랍니다. 주문 수량은 품목별 최소 발주량의 배수로 부탁드립니다"}], "ir": "MINIMIZE( waste_rate )\nEACH(x0 in orders): arrival_day(x0) = offset(order_day(x0), lead_time(x0))\nEACH(x1 in items): EACH(x2 in units(x1)): expiry_day(x2) = offset(arrival_day(x2), product_life(x1))\nEACH(x3 in orders): quantity(x3) MULTIPLE_OF min_order_quantity(x3)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:lead_time", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [], "constraint_ref": "constraint:minimum_order_quantity", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [], "constraint_ref": "constraint:shelf_life", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:minimize_waste", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/wide", "episode_id": null} {"id": "v4/short:nurse:90c7c64c7fcd0a0d", "domain": "nurse", "language": "en", "messages": [{"role": "user", "content": "Make the roster with the lowest total staff shortage across all shifts and, if possible, at least 12 hours off between shifts for every nurse"}], "ir": "MINIMIZE( SUM(x0 in shift_instances: unmet_demand(x0)) )\n[SOFT] EACH(x1 in workers): EACH(x2 in adjacent(assignment_seq(x1))): gap_duration(x2) >= 12 h", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:min_hours", "value": {"type": "duration", "unit_ref": "unit:hour", "value": "12"}}], "constraint_ref": "constraint:min_rest_hours", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:unmet_demand", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/short", "episode_id": null} {"id": "v4/short:nurse:8edbd8ad957d1de6", "domain": "nurse", "language": "ko", "messages": [{"role": "user", "content": "전체 근무의 총 부족 인원을 최소화하고, 가능하면 모든 간호사가 근무 사이에 12시간 이상 쉬도록 근무표 작성 부탁드립니다"}], "ir": "MINIMIZE( SUM(x0 in shift_instances: unmet_demand(x0)) )\n[SOFT] EACH(x1 in workers): EACH(x2 in adjacent(assignment_seq(x1))): gap_duration(x2) >= 12 h", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:min_hours", "value": {"type": "duration", "unit_ref": "unit:hour", "value": "12"}}], "constraint_ref": "constraint:min_rest_hours", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:unmet_demand", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/short", "episode_id": null} {"id": "v4/short:nurse:fe3415147cbeebaa", "domain": "nurse", "language": "mixed", "messages": [{"role": "user", "content": "전체 shift의 총 부족 인원을 최소화하고, 가능하면 모든 간호사의 근무 간 휴식시간을 12시간 이상으로 roster 작성 부탁드립니다"}], "ir": "MINIMIZE( SUM(x0 in shift_instances: unmet_demand(x0)) )\n[SOFT] EACH(x1 in workers): EACH(x2 in adjacent(assignment_seq(x1))): gap_duration(x2) >= 12 h", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:min_hours", "value": {"type": "duration", "unit_ref": "unit:hour", "value": "12"}}], "constraint_ref": "constraint:min_rest_hours", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:unmet_demand", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/short", "episode_id": null} {"id": "v4/scenario:routing:58f4a0b457517809", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "전체 운행의 총 연료비를 줄이는 배차로 짜주고, 모든 운행 경로는 반드시 주행거리 120km를 넘지 않게 해줘. 배송은 전부 가능하면 마감시간 안에 끝내고, 기사별 근무시간과 회차별 종료시간, 대기시간 한도도 되도록 맞춰줘."}], "ir": "MINIMIZE( SUM(x0 in routes: fuel_cost(x0)) )\n[HARD] EACH(x1 in routes): travel_distance(x1) <= 120 km\n[SOFT] EACH(x2 in visits): departure_time(x2) <= tw_late(x2)\n[SOFT] AND( EACH(x3 in routes): EACH(x4 in visits(x3)): wait_duration(x4) <= max_wait(x3), EACH(x5 in routes): end_time(x5) <= work_end(x5), EACH(x6 in routes): EACH(x7 in rounds(x6)): end_time(x7) <= round_window_end(x6) )", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:max_distance.exp_factor", "value": {"type": "decimal", "value": "1"}}, {"slot_ref": "slot:max_distance.max_distance", "value": {"type": "decimal", "value": "120000"}}], "constraint_ref": "constraint:max_distance", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [{"slot_ref": "slot:rider_time_window.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:rider_time_window", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:time_window.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:time_window", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fuel_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/scenario", "episode_id": null} {"id": "v4/scenario:routing:889565eac0a81113", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "기사 근무시간 노사 합의가 있어서 배차 짤 때 참고해줘. 전체 운행에 드는 총 연료비는 줄이고, 각 경로의 주행거리는 반드시 120km 이내로 잡아줘. 모든 배송은 되도록 마감시간 안에 끝내고 기사마다 정해진 근무시간, 회차별 종료시간이랑 대기시간 한도도 가능하면 지켜줘"}], "ir": "MINIMIZE( SUM(x0 in routes: fuel_cost(x0)) )\n[HARD] EACH(x1 in routes): travel_distance(x1) <= 120 km\n[SOFT] EACH(x2 in visits): departure_time(x2) <= tw_late(x2)\n[SOFT] AND( EACH(x3 in routes): EACH(x4 in visits(x3)): wait_duration(x4) <= max_wait(x3), EACH(x5 in routes): end_time(x5) <= work_end(x5), EACH(x6 in routes): EACH(x7 in rounds(x6)): end_time(x7) <= round_window_end(x6) )", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:max_distance.exp_factor", "value": {"type": "decimal", "value": "1"}}, {"slot_ref": "slot:max_distance.max_distance", "value": {"type": "decimal", "value": "120000"}}], "constraint_ref": "constraint:max_distance", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [{"slot_ref": "slot:rider_time_window.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:rider_time_window", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:time_window.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:time_window", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fuel_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/scenario", "episode_id": null} {"id": "v4/scenario:routing:da155415ecd32b3b", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "모든 운행을 합친 연료비가 적게 들도록 배차해주고, 어느 경로도 주행거리가 절대 120km를 넘으면 안 돼. 배송은 전부 되도록 마감시간 내에 끝내고, 각 기사의 근무시간과 회차별 종료시간, 대기시간 한도도 가능하면 맞춰줘"}], "ir": "MINIMIZE( SUM(x0 in routes: fuel_cost(x0)) )\n[HARD] EACH(x1 in routes): travel_distance(x1) <= 120 km\n[SOFT] EACH(x2 in visits): departure_time(x2) <= tw_late(x2)\n[SOFT] AND( EACH(x3 in routes): EACH(x4 in visits(x3)): wait_duration(x4) <= max_wait(x3), EACH(x5 in routes): end_time(x5) <= work_end(x5), EACH(x6 in routes): EACH(x7 in rounds(x6)): end_time(x7) <= round_window_end(x6) )", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:max_distance.exp_factor", "value": {"type": "decimal", "value": "1"}}, {"slot_ref": "slot:max_distance.max_distance", "value": {"type": "decimal", "value": "120000"}}], "constraint_ref": "constraint:max_distance", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [{"slot_ref": "slot:rider_time_window.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:rider_time_window", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:time_window.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:time_window", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fuel_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/scenario", "episode_id": null} {"id": "v4/wide:retail:34adb0cbe8f3df25", "domain": "retail", "language": "ko", "messages": [{"role": "user", "content": "주말마다 생활용품 코너가 비어서 발주를 다시 짜려고 합니다. 폐기되는 재고 비율이 가장 낮아지도록, 품목별 유통기한과 공급업체별 리드타임을 반영해서 발주 계획 부탁드립니다"}], "ir": "MINIMIZE( waste_rate )\nEACH(x0 in items): EACH(x1 in units(x0)): expiry_day(x1) = offset(arrival_day(x1), product_life(x0))\nEACH(x2 in orders): arrival_day(x2) = offset(order_day(x2), lead_time(x2))", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:lead_time", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [], "constraint_ref": "constraint:shelf_life", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:minimize_waste", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/wide", "episode_id": null} {"id": "v4/wide:retail:14133d26ed315751", "domain": "retail", "language": "mixed", "messages": [{"role": "user", "content": "주말마다 생활용품 코너 텅 비어서 발주 다시 짜야 돼. waste 비율 최대한 낮게 가는 걸로 해줘. 품목마다 shelf life 다르고 공급처마다 lead time도 다르니까 그것도 같이 반영해서 짜줘"}], "ir": "MINIMIZE( waste_rate )\nEACH(x0 in items): EACH(x1 in units(x0)): expiry_day(x1) = offset(arrival_day(x1), product_life(x0))\nEACH(x2 in orders): arrival_day(x2) = offset(order_day(x2), lead_time(x2))", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:lead_time", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [], "constraint_ref": "constraint:shelf_life", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:minimize_waste", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/wide", "episode_id": null} {"id": "v4/wide:retail:5ae0c662d3413897", "domain": "retail", "language": "en", "messages": [{"role": "user", "content": "Our household-goods aisle runs empty every weekend, so I need a new ordering plan. Keep the share of stock we throw away as low as possible, and account for each item's shelf life and each supplier's lead time."}], "ir": "MINIMIZE( waste_rate )\nEACH(x0 in items): EACH(x1 in units(x0)): expiry_day(x1) = offset(arrival_day(x1), product_life(x0))\nEACH(x2 in orders): arrival_day(x2) = offset(order_day(x2), lead_time(x2))", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:lead_time", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [], "constraint_ref": "constraint:shelf_life", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:minimize_waste", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/wide", "episode_id": null} {"id": "v4/short:nurse:44cc599536df0e6f", "domain": "nurse", "language": "ko", "messages": [{"role": "user", "content": "간호사들 근무 횟수 차이 최소로 하고 주 52시간 넘는 사람 없게 근무표 짜줘"}], "ir": "MINIMIZE( RANGE(x0 in workers: workload(x0)) )\nEACH(x1 in workers): EACH(x2 in windows(WEEK, 1)): SUM(x3 in assignments(x1) WHERE DURING(interval(x3), x2): work_hours(x3)) <= 52 h", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:max_hours", "value": {"type": "duration", "unit_ref": "unit:hour", "value": "52"}}], "constraint_ref": "constraint:max_hours_per_week", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:workload_balance", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/short", "episode_id": null} {"id": "v4/short:nurse:64b04ab8d9aa07ef", "domain": "nurse", "language": "ko", "messages": [{"role": "user", "content": "근무표 짤 때 간호사 간 근무 수 차이를 가장 적게 하고, 주 52시간 넘는 사람은 없게 해 주세요"}], "ir": "MINIMIZE( RANGE(x0 in workers: workload(x0)) )\nEACH(x1 in workers): EACH(x2 in windows(WEEK, 1)): SUM(x3 in assignments(x1) WHERE DURING(interval(x3), x2): work_hours(x3)) <= 52 h", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:max_hours", "value": {"type": "duration", "unit_ref": "unit:hour", "value": "52"}}], "constraint_ref": "constraint:max_hours_per_week", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:workload_balance", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/short", "episode_id": null} {"id": "v4/short:retail:50937fdff5b8a427", "domain": "retail", "language": "ko", "messages": [{"role": "user", "content": "폐기율 최대한 낮게, 품목별 발주 가능 요일에만 발주 넣어 주세요"}], "ir": "MINIMIZE( waste_rate )\nEACH(x0 in orders): day_of_week(x0) IN allowed_order_days(x0)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:order_days", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:minimize_waste", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/short", "episode_id": null} {"id": "v4/short:retail:365f086d36cf68ce", "domain": "retail", "language": "ko", "messages": [{"role": "user", "content": "버리는 재고 비율 줄이고, 품목마다 발주 가능한 요일에만 주문 넣어줘"}], "ir": "MINIMIZE( waste_rate )\nEACH(x0 in orders): day_of_week(x0) IN allowed_order_days(x0)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:order_days", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:minimize_waste", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/short", "episode_id": null} {"id": "v4/short:retail:73be2a2dd920e9c6", "domain": "retail", "language": "en", "messages": [{"role": "user", "content": "Keep waste rate as low as possible, and order each item only on its allowed order days"}], "ir": "MINIMIZE( waste_rate )\nEACH(x0 in orders): day_of_week(x0) IN allowed_order_days(x0)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:order_days", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:minimize_waste", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/short", "episode_id": null} {"id": "v4/short:retail:b925a316aae5dd38", "domain": "retail", "language": "ko", "messages": [{"role": "user", "content": "폐기율은 낮추고 이익은 높이도록, 품목별 발주 가능 요일에 맞춰 발주 계획 짜 주세요"}], "ir": "MINIMIZE( waste_rate )\nMAXIMIZE( profit )\nEACH(x0 in orders): day_of_week(x0) IN allowed_order_days(x0)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:order_days", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:maximize_profit", "weight": "1/2"}, {"objective_ref": "objective:minimize_waste", "weight": "1/2"}]}, "parameters": []}, "stratum": "v4/short", "episode_id": null} {"id": "v4/short:retail:8ad7774adb9b74e1", "domain": "retail", "language": "ko", "messages": [{"role": "user", "content": "폐기율 줄이고 이익 늘리게 품목마다 발주 가능한 요일에 맞춰 발주 짜줘"}], "ir": "MINIMIZE( waste_rate )\nMAXIMIZE( profit )\nEACH(x0 in orders): day_of_week(x0) IN allowed_order_days(x0)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:order_days", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:maximize_profit", "weight": "1/2"}, {"objective_ref": "objective:minimize_waste", "weight": "1/2"}]}, "parameters": []}, "stratum": "v4/short", "episode_id": null} {"id": "v4/short:retail:48d598b4248e6291", "domain": "retail", "language": "ko", "messages": [{"role": "user", "content": "폐기율을 낮추고 이익을 높이는 발주 계획을 품목별 발주 가능 요일에 맞춰 부탁드립니다"}], "ir": "MINIMIZE( waste_rate )\nMAXIMIZE( profit )\nEACH(x0 in orders): day_of_week(x0) IN allowed_order_days(x0)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:order_days", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:maximize_profit", "weight": "1/2"}, {"objective_ref": "objective:minimize_waste", "weight": "1/2"}]}, "parameters": []}, "stratum": "v4/short", "episode_id": null} {"id": "v4/short:nurse:eef4e5769fcebf07", "domain": "nurse", "language": "ko", "messages": [{"role": "user", "content": "간호사들이 신청한 근무 최대한 반영해서 근무표 짜 주세요. 근무 사이 8시간은 가능하면 쉬게 해 주세요"}], "ir": "MAXIMIZE( SUM(x0 in assignments: preference_score(x0)) )\n[SOFT] EACH(x1 in workers): EACH(x2 in adjacent(assignment_seq(x1))): gap_duration(x2) >= 8 h", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:min_hours", "value": {"type": "duration", "unit_ref": "unit:hour", "value": "8"}}], "constraint_ref": "constraint:min_rest_hours", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:preference_satisfaction", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/short", "episode_id": null} {"id": "v4/short:nurse:7e3424e7750d45fd", "domain": "nurse", "language": "ko", "messages": [{"role": "user", "content": "근무표 만들어 주세요, 희망 근무 선호도 합계 최대로, 되도록 근무 간격 8시간 이상이요"}], "ir": "MAXIMIZE( SUM(x0 in assignments: preference_score(x0)) )\n[SOFT] EACH(x1 in workers): EACH(x2 in adjacent(assignment_seq(x1))): gap_duration(x2) >= 8 h", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:min_hours", "value": {"type": "duration", "unit_ref": "unit:hour", "value": "8"}}], "constraint_ref": "constraint:min_rest_hours", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:preference_satisfaction", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/short", "episode_id": null} {"id": "v4/short:nurse:d3052364a7f7b235", "domain": "nurse", "language": "en", "messages": [{"role": "user", "content": "Make the nurse roster so people get the shifts they requested as much as possible, and ideally at least 8 hours off between shifts"}], "ir": "MAXIMIZE( SUM(x0 in assignments: preference_score(x0)) )\n[SOFT] EACH(x1 in workers): EACH(x2 in adjacent(assignment_seq(x1))): gap_duration(x2) >= 8 h", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:min_hours", "value": {"type": "duration", "unit_ref": "unit:hour", "value": "8"}}], "constraint_ref": "constraint:min_rest_hours", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:preference_satisfaction", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/short", "episode_id": null} {"id": "v4/short:nurse:ac0b2b9264b0daf1", "domain": "nurse", "language": "ko", "messages": [{"role": "user", "content": "간호사들이 신청한 근무를 최대한 많이 받도록 근무표 부탁드립니다. 가능하면 근무와 근무 사이에 8시간 이상 쉬게 해주세요"}], "ir": "MAXIMIZE( SUM(x0 in assignments: preference_score(x0)) )\n[SOFT] EACH(x1 in workers): EACH(x2 in adjacent(assignment_seq(x1))): gap_duration(x2) >= 8 h", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:min_hours", "value": {"type": "duration", "unit_ref": "unit:hour", "value": "8"}}], "constraint_ref": "constraint:min_rest_hours", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:preference_satisfaction", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/short", "episode_id": null} {"id": "v4/short:nurse:8192f03f4942843f", "domain": "nurse", "language": "ko", "messages": [{"role": "user", "content": "근무 신청 희망 반영을 가능한 한 많이 해서 근무표를 짜 주세요. 되도록 모든 간호사가 근무 사이에 8시간은 쉬었으면 합니다"}], "ir": "MAXIMIZE( SUM(x0 in assignments: preference_score(x0)) )\n[SOFT] EACH(x1 in workers): EACH(x2 in adjacent(assignment_seq(x1))): gap_duration(x2) >= 8 h", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:min_hours", "value": {"type": "duration", "unit_ref": "unit:hour", "value": "8"}}], "constraint_ref": "constraint:min_rest_hours", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:preference_satisfaction", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/short", "episode_id": null} {"id": "v4/scenario:routing:7caf3ddb2ef97b71", "domain": "routing", "language": "en", "messages": [{"role": "user", "content": "Please plan the AC install routes so the total driving distance across all routes is as low as possible, and every visit is done by its latest allowed time. Keep each trip to as few zones as possible, no more than 6 deliveries per route, each rider must stay inside their own service radius, and ideally keep to working hours and waiting limits."}], "ir": "MINIMIZE( SUM(x0 in routes: travel_distance(x0)) )\nEACH(x1 in visits): departure_time(x1) <= tw_late(x1)\nMINIMIZE( SUM(x2 in routes: SUM(x3 in rounds(x2): COUNT_DISTINCT(x4 in visits(x3): zone(x4)))) )\nEACH(x5 in routes): delivery_count(x5) <= 6\n[HARD] EACH(x6 in routes): sec_radius(x6) <= individual_radius_limit(x6)\n[SOFT] AND( EACH(x7 in routes): EACH(x8 in visits(x7)): wait_duration(x8) <= max_wait(x7), EACH(x9 in routes): end_time(x9) <= work_end(x9), EACH(x10 in routes): EACH(x11 in rounds(x10)): end_time(x11) <= round_window_end(x10) )", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:delivery_length.exp_factor", "value": {"type": "decimal", "value": "2"}}, {"slot_ref": "slot:delivery_length.max_size", "value": {"type": "decimal", "value": "6"}}], "constraint_ref": "constraint:delivery_length", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:individual_enclosing_circle_radius.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:individual_enclosing_circle_radius", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [{"slot_ref": "slot:rider_route_zone.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:rider_route_zone", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:rider_time_window.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:rider_time_window", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:time_window.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:time_window", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:distance_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/scenario", "episode_id": null} {"id": "v4/wide:retail:3448e794974b38f2", "domain": "retail", "language": "en", "messages": [{"role": "user", "content": "Please plan our bakery orders to keep the share of stock we throw away as low as possible, taking each item's shelf life into account. Ideally, order each item only on its allowed order days, and quantities must be multiples of that item's minimum order quantity."}], "ir": "MINIMIZE( waste_rate )\nEACH(x0 in items): EACH(x1 in units(x0)): expiry_day(x1) = offset(arrival_day(x1), product_life(x0))\n[SOFT] EACH(x2 in orders): day_of_week(x2) IN allowed_order_days(x2)\n[HARD] EACH(x3 in orders): quantity(x3) MULTIPLE_OF min_order_quantity(x3)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:minimum_order_quantity", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [], "constraint_ref": "constraint:order_days", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [], "constraint_ref": "constraint:shelf_life", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:minimize_waste", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/wide", "episode_id": null} {"id": "v4/wide:retail:6cb99283757ed296", "domain": "retail", "language": "mixed", "messages": [{"role": "user", "content": "지난주 빵 폐기가 많아서 폐기율을 낮추는 발주 계획 부탁드립니다. 품목별 shelf life를 반영하고, 가능하면 품목마다 정해진 발주 가능 요일에만 주문하도록 잡아주시면 좋겠습니다. 발주 수량은 반드시 각 품목 MOQ의 배수로 맞춰야 합니다"}], "ir": "MINIMIZE( waste_rate )\nEACH(x0 in items): EACH(x1 in units(x0)): expiry_day(x1) = offset(arrival_day(x1), product_life(x0))\n[SOFT] EACH(x2 in orders): day_of_week(x2) IN allowed_order_days(x2)\n[HARD] EACH(x3 in orders): quantity(x3) MULTIPLE_OF min_order_quantity(x3)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:minimum_order_quantity", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [], "constraint_ref": "constraint:order_days", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [], "constraint_ref": "constraint:shelf_life", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:minimize_waste", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/wide", "episode_id": null} {"id": "v4/wide:retail:9ae9703e7c864d36", "domain": "retail", "language": "en", "messages": [{"role": "user", "content": "We threw out a lot of bread last week, so I'd like an order plan that keeps the proportion of stock discarded as low as possible and accounts for each item's shelf life. If possible, place orders for each item only on its allowed order days. Order quantities must be multiples of each item's minimum order quantity."}], "ir": "MINIMIZE( waste_rate )\nEACH(x0 in items): EACH(x1 in units(x0)): expiry_day(x1) = offset(arrival_day(x1), product_life(x0))\n[SOFT] EACH(x2 in orders): day_of_week(x2) IN allowed_order_days(x2)\n[HARD] EACH(x3 in orders): quantity(x3) MULTIPLE_OF min_order_quantity(x3)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:minimum_order_quantity", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [], "constraint_ref": "constraint:order_days", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [], "constraint_ref": "constraint:shelf_life", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:minimize_waste", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/wide", "episode_id": null} {"id": "v4/short:nurse:fd1ddd33c5e44d00", "domain": "nurse", "language": "en", "messages": [{"role": "user", "content": "Make the roster so nurses get the shifts they asked for as much as possible, with 8 hours off between shifts for everyone"}], "ir": "MAXIMIZE( SUM(x0 in assignments: preference_score(x0)) )\nEACH(x1 in workers): EACH(x2 in adjacent(assignment_seq(x1))): gap_duration(x2) >= 8 h", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:min_hours", "value": {"type": "duration", "unit_ref": "unit:hour", "value": "8"}}], "constraint_ref": "constraint:min_rest_hours", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:preference_satisfaction", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/short", "episode_id": null} {"id": "v4/short:nurse:b0f3486951581f4e", "domain": "nurse", "language": "ko", "messages": [{"role": "user", "content": "간호사들이 원하는 근무를 최대한 많이 받게 짜 주세요, 근무와 근무 사이에는 모두 8시간 쉬게 해 주세요"}], "ir": "MAXIMIZE( SUM(x0 in assignments: preference_score(x0)) )\nEACH(x1 in workers): EACH(x2 in adjacent(assignment_seq(x1))): gap_duration(x2) >= 8 h", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:min_hours", "value": {"type": "duration", "unit_ref": "unit:hour", "value": "8"}}], "constraint_ref": "constraint:min_rest_hours", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:preference_satisfaction", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/short", "episode_id": null} {"id": "v4/short:nurse:d2d0c3f9ab8e4f75", "domain": "nurse", "language": "mixed", "messages": [{"role": "user", "content": "preference 점수 합계 최대로 근무표 짜줘, 근무 사이 rest는 다 8시간 이상으로"}], "ir": "MAXIMIZE( SUM(x0 in assignments: preference_score(x0)) )\nEACH(x1 in workers): EACH(x2 in adjacent(assignment_seq(x1))): gap_duration(x2) >= 8 h", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:min_hours", "value": {"type": "duration", "unit_ref": "unit:hour", "value": "8"}}], "constraint_ref": "constraint:min_rest_hours", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:preference_satisfaction", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/short", "episode_id": null} {"id": "v4/short:nurse:586c025f93ae7881", "domain": "nurse", "language": "mixed", "messages": [{"role": "user", "content": "근무표 짜 주세요, 간호사들 preference 최대한 반영하고 shift 사이 휴식 8시간 이상은 가능하면 지켜 주세요"}], "ir": "MAXIMIZE( SUM(x0 in assignments: preference_score(x0)) )\n[SOFT] EACH(x1 in workers): EACH(x2 in adjacent(assignment_seq(x1))): gap_duration(x2) >= 8 h", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:min_hours", "value": {"type": "duration", "unit_ref": "unit:hour", "value": "8"}}], "constraint_ref": "constraint:min_rest_hours", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:preference_satisfaction", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/short", "episode_id": null} {"id": "v4/short:nurse:c3473cdfeb5dde04", "domain": "nurse", "language": "en", "messages": [{"role": "user", "content": "Make the roster so nurses get the shifts they asked for as much as possible, and ideally at least 8 hours off between shifts"}], "ir": "MAXIMIZE( SUM(x0 in assignments: preference_score(x0)) )\n[SOFT] EACH(x1 in workers): EACH(x2 in adjacent(assignment_seq(x1))): gap_duration(x2) >= 8 h", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:min_hours", "value": {"type": "duration", "unit_ref": "unit:hour", "value": "8"}}], "constraint_ref": "constraint:min_rest_hours", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:preference_satisfaction", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/short", "episode_id": null} {"id": "v4/wide:retail:230c351a1262ffc3", "domain": "retail", "language": "en", "messages": [{"role": "user", "content": "Head office is coming to check our expired stock next month, so I need this week's supplier orders planned. Keep the shelves stocked as many days as possible, order each item in multiples of its minimum order quantity, and factor in each item's shelf life. Each supplier's lead time must always be built in, no exceptions."}], "ir": "MAXIMIZE( in_stock_rate )\nEACH(x0 in orders): quantity(x0) MULTIPLE_OF min_order_quantity(x0)\nEACH(x1 in items): EACH(x2 in units(x1)): expiry_day(x2) = offset(arrival_day(x2), product_life(x1))\n[HARD] EACH(x3 in orders): arrival_day(x3) = offset(order_day(x3), lead_time(x3))", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:lead_time", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [], "constraint_ref": "constraint:minimum_order_quantity", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [], "constraint_ref": "constraint:shelf_life", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:minimize_stockout", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/wide", "episode_id": null} {"id": "v4/wide:retail:419cfa61c76f0464", "domain": "retail", "language": "en", "messages": [{"role": "user", "content": "I'm putting together our supplier orders before the expiry inspection from head office next month. I want the items in stock on as many days as possible, and every order should be in multiples of that item's MOQ. Look at the shelf life of each item too, and you must account for the supplier's lead time on every order."}], "ir": "MAXIMIZE( in_stock_rate )\nEACH(x0 in orders): quantity(x0) MULTIPLE_OF min_order_quantity(x0)\nEACH(x1 in items): EACH(x2 in units(x1)): expiry_day(x2) = offset(arrival_day(x2), product_life(x1))\n[HARD] EACH(x3 in orders): arrival_day(x3) = offset(order_day(x3), lead_time(x3))", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:lead_time", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [], "constraint_ref": "constraint:minimum_order_quantity", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [], "constraint_ref": "constraint:shelf_life", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:minimize_stockout", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/wide", "episode_id": null} {"id": "v4/wide:nurse:b827f4784656452d", "domain": "nurse", "language": "mixed", "messages": [{"role": "user", "content": "외과 병동 근무표 짜주세요, 간호사들이 신청한 preference 근무 최대한 많이 반영해 주시고 근무 사이 휴식시간은 모두 8시간 이상으로 해 주세요"}], "ir": "MAXIMIZE( SUM(x0 in assignments: preference_score(x0)) )\nEACH(x1 in workers): EACH(x2 in adjacent(assignment_seq(x1))): gap_duration(x2) >= 8 h", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:min_hours", "value": {"type": "duration", "unit_ref": "unit:hour", "value": "8"}}], "constraint_ref": "constraint:min_rest_hours", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:preference_satisfaction", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/wide", "episode_id": null} {"id": "v4/wide:nurse:8726b3f8da1aff47", "domain": "nurse", "language": "en", "messages": [{"role": "user", "content": "Build the surgical ward roster so nurses get the shifts they requested as much as possible, with total preference score as high as it can go, and every nurse has at least 8 hours off between one shift and the next"}], "ir": "MAXIMIZE( SUM(x0 in assignments: preference_score(x0)) )\nEACH(x1 in workers): EACH(x2 in adjacent(assignment_seq(x1))): gap_duration(x2) >= 8 h", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:min_hours", "value": {"type": "duration", "unit_ref": "unit:hour", "value": "8"}}], "constraint_ref": "constraint:min_rest_hours", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:preference_satisfaction", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/wide", "episode_id": null} {"id": "v4/wide:nurse:0299b5ab8466f885", "domain": "nurse", "language": "ko", "messages": [{"role": "user", "content": "외과 병동 근무표 부탁드려요. 이브닝 끝나고 바로 데이 들어가는 경우가 자꾸 생겨서요, 모든 간호사가 근무와 근무 사이에 8시간 이상은 쉬게 해 주세요. 그리고 간호사들이 원하는 근무는 전체 선호 점수 합이 최대한 높아지도록 많이 넣어 주세요."}], "ir": "EACH(x0 in workers): EACH(x1 in adjacent(assignment_seq(x0))): gap_duration(x1) >= 8 h\nMAXIMIZE( SUM(x2 in assignments: preference_score(x2)) )", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:min_hours", "value": {"type": "duration", "unit_ref": "unit:hour", "value": "8"}}], "constraint_ref": "constraint:min_rest_hours", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:preference_satisfaction", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/wide", "episode_id": null} {"id": "v4/scenario:routing:def340f4f69b7e3f", "domain": "routing", "language": "mixed", "messages": [{"role": "user", "content": "배차 plan은 출차 차량의 fixed cost 총액을 낮추는 방향으로 잡아 주세요. 매 trip은 반드시 적재율 70% 이상으로 차고지에서 출발하고 모든 배송은 반드시 마감시간까지 완료하도록 해 주시고, 각 route에는 가능하면 배송 12건 이상씩 배정해 주세요"}], "ir": "MINIMIZE( SUM(x0 in routes: fixed_cost(x0)) )\n[HARD] EACH(x1 in routes): EACH(x2 in rounds(x1)): MAX(x3 in keys(load): utilization[x3](x2)) >= 0.7\n[HARD] EACH(x4 in visits): departure_time(x4) <= tw_late(x4)\n[SOFT] EACH(x5 in routes): delivery_count(x5) >= 12", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:min_capacity.target_ratio", "value": {"type": "decimal", "value": "0.7"}}], "constraint_ref": "constraint:min_capacity", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [{"slot_ref": "slot:minimum_order.target_order", "value": {"type": "decimal", "value": "12"}}], "constraint_ref": "constraint:minimum_order", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:time_window.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:time_window", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fixed_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/scenario", "episode_id": null} {"id": "v4/wide:retail:1cb30870a3a31725", "domain": "retail", "language": "mixed", "messages": [{"role": "user", "content": "발주 계획 짜 주세요. 폐기까지 감안한 이익은 최대화하고, 하루 평균 holding cost는 낮추고, 품목별 유통기한은 반드시 지켜 주세요. 공급자별 lead time도 반영하고, 가능하면 MOQ 배수로 발주해 주세요."}], "ir": "MAXIMIZE( profit )\nMINIMIZE( MEAN(x0 in days(horizon): holding_cost(x0)) )\n[HARD] EACH(x1 in items): EACH(x2 in units(x1)): expiry_day(x2) = offset(arrival_day(x2), product_life(x1))\nEACH(x3 in orders): arrival_day(x3) = offset(order_day(x3), lead_time(x3))\n[SOFT] EACH(x4 in orders): quantity(x4) MULTIPLE_OF min_order_quantity(x4)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:lead_time", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [], "constraint_ref": "constraint:minimum_order_quantity", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [], "constraint_ref": "constraint:shelf_life", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:maximize_profit", "weight": "1/2"}, {"objective_ref": "objective:minimize_holding_cost", "weight": "1/2"}]}, "parameters": []}, "stratum": "v4/wide", "episode_id": null} {"id": "v4/wide:retail:a43b8f974d6bcd35", "domain": "retail", "language": "ko", "messages": [{"role": "user", "content": "동네 마트라 사장님이 비용 빼고 남는 돈을 항상 보세요. 그래서 판매액에서 매입비와 폐기 손실을 뺀 이익은 크게 나오게 하고, 하루 평균 재고 유지비는 낮게 나오게 발주 계획을 짜 주세요. 품목마다 유통기한은 반드시 지켜야 하고, 공급자별 리드타임도 반영해 주세요. 가능하면 최소 발주량의 배수로 주문하면 좋겠어요"}], "ir": "MAXIMIZE( profit )\nMINIMIZE( MEAN(x0 in days(horizon): holding_cost(x0)) )\n[HARD] EACH(x1 in items): EACH(x2 in units(x1)): expiry_day(x2) = offset(arrival_day(x2), product_life(x1))\nEACH(x3 in orders): arrival_day(x3) = offset(order_day(x3), lead_time(x3))\n[SOFT] EACH(x4 in orders): quantity(x4) MULTIPLE_OF min_order_quantity(x4)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:lead_time", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [], "constraint_ref": "constraint:minimum_order_quantity", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [], "constraint_ref": "constraint:shelf_life", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:maximize_profit", "weight": "1/2"}, {"objective_ref": "objective:minimize_holding_cost", "weight": "1/2"}]}, "parameters": []}, "stratum": "v4/wide", "episode_id": null} {"id": "v4/wide:retail:1fd9c5ada9e33b47", "domain": "retail", "language": "ko", "messages": [{"role": "user", "content": "이번 발주는 이익이 최대한 많이 남게 하고, 하루 평균 재고 보유비용도 낮게 가게 해 주세요. 품목별 유통기한은 무조건 지켜야 하고, 공급자마다 입고 소요일이 다른 것도 반영해 주세요. 되도록 최소 주문 수량 배수로 맞춰 주시면 좋겠어요."}], "ir": "MAXIMIZE( profit )\nMINIMIZE( MEAN(x0 in days(horizon): holding_cost(x0)) )\n[HARD] EACH(x1 in items): EACH(x2 in units(x1)): expiry_day(x2) = offset(arrival_day(x2), product_life(x1))\nEACH(x3 in orders): arrival_day(x3) = offset(order_day(x3), lead_time(x3))\n[SOFT] EACH(x4 in orders): quantity(x4) MULTIPLE_OF min_order_quantity(x4)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:lead_time", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [], "constraint_ref": "constraint:minimum_order_quantity", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [], "constraint_ref": "constraint:shelf_life", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:maximize_profit", "weight": "1/2"}, {"objective_ref": "objective:minimize_holding_cost", "weight": "1/2"}]}, "parameters": []}, "stratum": "v4/wide", "episode_id": null} {"id": "v4/short:nurse:ff6855faf9db1af0", "domain": "nurse", "language": "mixed", "messages": [{"role": "user", "content": "전체 shift의 총 부족 인원을 줄이고, 가능하면 모든 간호사 근무 사이 rest는 12시간 이상으로 짜 주세요"}], "ir": "MINIMIZE( SUM(x0 in shift_instances: unmet_demand(x0)) )\n[SOFT] EACH(x1 in workers): EACH(x2 in adjacent(assignment_seq(x1))): gap_duration(x2) >= 12 h", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:min_hours", "value": {"type": "duration", "unit_ref": "unit:hour", "value": "12"}}], "constraint_ref": "constraint:min_rest_hours", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:unmet_demand", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/short", "episode_id": null} {"id": "v4/short:nurse:8f2d0385937e37aa", "domain": "nurse", "language": "ko", "messages": [{"role": "user", "content": "전체 근무의 총 부족 인원을 줄이고, 가능하면 모든 간호사가 근무 사이 12시간 이상 쉬도록 짜 주세요"}], "ir": "MINIMIZE( SUM(x0 in shift_instances: unmet_demand(x0)) )\n[SOFT] EACH(x1 in workers): EACH(x2 in adjacent(assignment_seq(x1))): gap_duration(x2) >= 12 h", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:min_hours", "value": {"type": "duration", "unit_ref": "unit:hour", "value": "12"}}], "constraint_ref": "constraint:min_rest_hours", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:unmet_demand", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/short", "episode_id": null} {"id": "v4/short:nurse:7fc669617ae46c6b", "domain": "nurse", "language": "ko", "messages": [{"role": "user", "content": "전체 근무의 총 부족 인원을 줄이고, 되도록 모든 간호사가 근무 사이 12시간 이상 쉬게 짜줘"}], "ir": "MINIMIZE( SUM(x0 in shift_instances: unmet_demand(x0)) )\n[SOFT] EACH(x1 in workers): EACH(x2 in adjacent(assignment_seq(x1))): gap_duration(x2) >= 12 h", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:min_hours", "value": {"type": "duration", "unit_ref": "unit:hour", "value": "12"}}], "constraint_ref": "constraint:min_rest_hours", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:unmet_demand", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/short", "episode_id": null} {"id": "v4/short:nurse:9bb44094a64aaa5e", "domain": "nurse", "language": "ko", "messages": [{"role": "user", "content": "전체 근무의 총 부족 인원을 줄이고 모든 간호사의 연속근무는 4일 이내로 근무표 작성 부탁드립니다"}], "ir": "MINIMIZE( SUM(x0 in shift_instances: unmet_demand(x0)) )\nEACH(x1 in workers): RUN_LENGTH(x2 in day_seq(x1): works(x1, x2)) <= 4 day", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:max_days", "value": {"type": "duration", "unit_ref": "unit:day", "value": "4"}}], "constraint_ref": "constraint:max_consecutive_days", "scope": null, "strength": {"kind": "soft", "weight": "100"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:unmet_demand", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/short", "episode_id": null} {"id": "v4/wide:retail:c65b01a78ed6243d", "domain": "retail", "language": "ko", "messages": [{"role": "user", "content": "다음 달 본사 유통기한 점검을 앞두고 매장 발주 계획을 부탁드립니다. 폐기되는 재고 비율과 하루 평균 재고 보유비용을 낮추고, 품목별 공급업체의 입고 소요일을 반영해 주십시오. 각 품목은 반드시 발주 가능한 요일에만 주문하도록 계획해 주십시오."}], "ir": "MINIMIZE( waste_rate )\nMINIMIZE( MEAN(x0 in days(horizon): holding_cost(x0)) )\nEACH(x1 in orders): arrival_day(x1) = offset(order_day(x1), lead_time(x1))\n[HARD] EACH(x2 in orders): day_of_week(x2) IN allowed_order_days(x2)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:lead_time", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [], "constraint_ref": "constraint:order_days", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:minimize_holding_cost", "weight": "1/2"}, {"objective_ref": "objective:minimize_waste", "weight": "1/2"}]}, "parameters": []}, "stratum": "v4/wide", "episode_id": null} {"id": "v4/wide:retail:7c1944301776e2ae", "domain": "retail", "language": "ko", "messages": [{"role": "user", "content": "다음 달에 본사에서 유통기한 지난 재고를 점검해서 발주 계획을 잡으려고 해요. 폐기율과 하루 평균 재고 유지비를 낮추고 품목마다 공급업체에서 배송하는 데 걸리는 시간을 반영해 주세요. 품목별로 정해진 발주 요일은 반드시 지켜 주세요"}], "ir": "MINIMIZE( waste_rate )\nMINIMIZE( MEAN(x0 in days(horizon): holding_cost(x0)) )\nEACH(x1 in orders): arrival_day(x1) = offset(order_day(x1), lead_time(x1))\n[HARD] EACH(x2 in orders): day_of_week(x2) IN allowed_order_days(x2)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:lead_time", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [], "constraint_ref": "constraint:order_days", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:minimize_holding_cost", "weight": "1/2"}, {"objective_ref": "objective:minimize_waste", "weight": "1/2"}]}, "parameters": []}, "stratum": "v4/wide", "episode_id": null} {"id": "v4/wide:retail:4feacffa3365568f", "domain": "retail", "language": "ko", "messages": [{"role": "user", "content": "다음 달 본사 유통기한 점검에 맞춰 폐기율과 하루 평균 재고 보유비용을 낮추는 발주 계획을 짜줘. 품목마다 공급업체의 입고 소요일을 반영하고, 반드시 각 품목의 발주 가능 요일에만 주문하게 해줘"}], "ir": "MINIMIZE( waste_rate )\nMINIMIZE( MEAN(x0 in days(horizon): holding_cost(x0)) )\nEACH(x1 in orders): arrival_day(x1) = offset(order_day(x1), lead_time(x1))\n[HARD] EACH(x2 in orders): day_of_week(x2) IN allowed_order_days(x2)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:lead_time", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [], "constraint_ref": "constraint:order_days", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:minimize_holding_cost", "weight": "1/2"}, {"objective_ref": "objective:minimize_waste", "weight": "1/2"}]}, "parameters": []}, "stratum": "v4/wide", "episode_id": null} {"id": "v4/wide:retail:ac5c0258c34bc70d", "domain": "retail", "language": "ko", "messages": [{"role": "user", "content": "발주 계획 짜줘, 이익은 최대한 많이 남기고 재고 유지비는 하루 평균으로 최대한 낮게, 품절 안 나는 날 비율은 최대한 높게 가자. 주문은 품목마다 최소 발주량 배수로 넣어줘"}], "ir": "MAXIMIZE( profit )\nMINIMIZE( MEAN(x0 in days(horizon): holding_cost(x0)) )\nMAXIMIZE( in_stock_rate )\nEACH(x1 in orders): quantity(x1) MULTIPLE_OF min_order_quantity(x1)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:minimum_order_quantity", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:maximize_profit", "weight": "1/3"}, {"objective_ref": "objective:minimize_holding_cost", "weight": "1/3"}, {"objective_ref": "objective:minimize_stockout", "weight": "1/3"}]}, "parameters": []}, "stratum": "v4/wide", "episode_id": null} {"id": "v4/short:nurse:7c3c016654071a5e", "domain": "nurse", "language": "mixed", "messages": [{"role": "user", "content": "overtime 전체 합계 최대한 줄이고, 가능하면 간호사 모두 주 52시간 안 넘게 근무표 짜 주세요"}], "ir": "MINIMIZE( SUM(x0 in workers: overtime_hours(x0)) )\n[SOFT] EACH(x1 in workers): EACH(x2 in windows(WEEK, 1)): SUM(x3 in assignments(x1) WHERE DURING(interval(x3), x2): work_hours(x3)) <= 52 h", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:max_hours", "value": {"type": "duration", "unit_ref": "unit:hour", "value": "52"}}], "constraint_ref": "constraint:max_hours_per_week", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:overtime", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/short", "episode_id": null} {"id": "v4/short:nurse:81f3888d6b9c051b", "domain": "nurse", "language": "ko", "messages": [{"role": "user", "content": "초과근무 시간 다 합쳐서 적게 나오게, 되도록 모든 간호사 주당 52시간 넘지 않게 근무표 부탁해요"}], "ir": "MINIMIZE( SUM(x0 in workers: overtime_hours(x0)) )\n[SOFT] EACH(x1 in workers): EACH(x2 in windows(WEEK, 1)): SUM(x3 in assignments(x1) WHERE DURING(interval(x3), x2): work_hours(x3)) <= 52 h", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:max_hours", "value": {"type": "duration", "unit_ref": "unit:hour", "value": "52"}}], "constraint_ref": "constraint:max_hours_per_week", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:overtime", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/short", "episode_id": null} {"id": "v4/wide:retail:e186e27d54d5517b", "domain": "retail", "language": "ko", "messages": [{"role": "user", "content": "계산대에서 폰으로 치는 거라 짧게 할게. 보관창고 월세 나가는데 버리는 재고가 너무 아까워서, 폐기율이 제일 낮게 발주 짜줘. 품목마다 최소 주문 수량 배수로 가능하면 맞추고, 공급자별 입고 소요일도 같이 반영해줘."}], "ir": "MINIMIZE( waste_rate )\n[SOFT] EACH(x0 in orders): quantity(x0) MULTIPLE_OF min_order_quantity(x0)\nEACH(x1 in orders): arrival_day(x1) = offset(order_day(x1), lead_time(x1))", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:lead_time", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [], "constraint_ref": "constraint:minimum_order_quantity", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:minimize_waste", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/wide", "episode_id": null} {"id": "v4/wide:retail:7737e1345d7540e8", "domain": "retail", "language": "mixed", "messages": [{"role": "user", "content": "창고 월세 부담이 커서 폐기를 최대한 줄이고 싶습니다. 발주는 가능하면 품목별 MOQ 배수로 맞추고, 공급자별 lead time도 반영해서 발주 계획 부탁드립니다"}], "ir": "MINIMIZE( waste_rate )\n[SOFT] EACH(x0 in orders): quantity(x0) MULTIPLE_OF min_order_quantity(x0)\nEACH(x1 in orders): arrival_day(x1) = offset(order_day(x1), lead_time(x1))", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:lead_time", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [], "constraint_ref": "constraint:minimum_order_quantity", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:minimize_waste", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/wide", "episode_id": null} {"id": "v4/wide:retail:ef245c6a1e5255cd", "domain": "retail", "language": "en", "messages": [{"role": "user", "content": "I'm paying rent on a storage room, so I want to throw away as little stock as possible. If possible, order in multiples of each item's minimum order quantity, and factor in each supplier's lead time."}], "ir": "MINIMIZE( waste_rate )\n[SOFT] EACH(x0 in orders): quantity(x0) MULTIPLE_OF min_order_quantity(x0)\nEACH(x1 in orders): arrival_day(x1) = offset(order_day(x1), lead_time(x1))", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:lead_time", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [], "constraint_ref": "constraint:minimum_order_quantity", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:minimize_waste", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/wide", "episode_id": null} {"id": "v4/short:retail:6997721711e7a9fe", "domain": "retail", "language": "ko", "messages": [{"role": "user", "content": "폐기율 최대한 낮게 발주 짜 주세요. 품목별 발주 가능 요일에만 반드시 넣어야 해요"}], "ir": "MINIMIZE( waste_rate )\n[HARD] EACH(x0 in orders): day_of_week(x0) IN allowed_order_days(x0)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:order_days", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:minimize_waste", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/short", "episode_id": null} {"id": "v4/short:retail:008d89abe12d4eb4", "domain": "retail", "language": "ko", "messages": [{"role": "user", "content": "폐기율을 최대한 낮추는 발주 계획 부탁드립니다. 각 품목은 반드시 발주 가능 요일에만 주문해야 합니다"}], "ir": "MINIMIZE( waste_rate )\n[HARD] EACH(x0 in orders): day_of_week(x0) IN allowed_order_days(x0)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:order_days", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:minimize_waste", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/short", "episode_id": null} {"id": "v4/short:retail:0d66c5ee11218c6c", "domain": "retail", "language": "en", "messages": [{"role": "user", "content": "Plan orders to keep the waste rate as low as possible. Each item must only be ordered on its allowed order days"}], "ir": "MINIMIZE( waste_rate )\n[HARD] EACH(x0 in orders): day_of_week(x0) IN allowed_order_days(x0)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:order_days", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:minimize_waste", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/short", "episode_id": null} {"id": "v4/short:retail:e8f317be7946061a", "domain": "retail", "language": "ko", "messages": [{"role": "user", "content": "이익은 최대한 키우고 폐기율은 낮추면서, 품목별 발주 가능 요일에만 발주하도록 짜주세요"}], "ir": "MAXIMIZE( profit )\nMINIMIZE( waste_rate )\nEACH(x0 in orders): day_of_week(x0) IN allowed_order_days(x0)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:order_days", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:maximize_profit", "weight": "1/2"}, {"objective_ref": "objective:minimize_waste", "weight": "1/2"}]}, "parameters": []}, "stratum": "v4/short", "episode_id": null} {"id": "v4/short:retail:ce71935fc6b71c3d", "domain": "retail", "language": "ko", "messages": [{"role": "user", "content": "돈 최대한 남기고 폐기율 낮게, 발주는 품목마다 되는 요일에만 넣게 짜줘"}], "ir": "MAXIMIZE( profit )\nMINIMIZE( waste_rate )\nEACH(x0 in orders): day_of_week(x0) IN allowed_order_days(x0)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:order_days", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:maximize_profit", "weight": "1/2"}, {"objective_ref": "objective:minimize_waste", "weight": "1/2"}]}, "parameters": []}, "stratum": "v4/short", "episode_id": null} {"id": "v4/short:retail:6c716d29d5242fec", "domain": "retail", "language": "ko", "messages": [{"role": "user", "content": "수익 최대로, 버리는 재고 비율은 줄이고, 발주 가능한 요일에만 주문하게 해줘"}], "ir": "MAXIMIZE( profit )\nMINIMIZE( waste_rate )\nEACH(x0 in orders): day_of_week(x0) IN allowed_order_days(x0)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:order_days", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:maximize_profit", "weight": "1/2"}, {"objective_ref": "objective:minimize_waste", "weight": "1/2"}]}, "parameters": []}, "stratum": "v4/short", "episode_id": null} {"id": "v4/short:nurse:13ecaac87e8cd562", "domain": "nurse", "language": "ko", "messages": [{"role": "user", "content": "전체 근무에서 인력 부족 합계가 최소가 되도록 짜주시고, 가능하면 근무 사이 12시간은 쉬게 부탁드립니다"}], "ir": "MINIMIZE( SUM(x0 in shift_instances: unmet_demand(x0)) )\n[SOFT] EACH(x1 in workers): EACH(x2 in adjacent(assignment_seq(x1))): gap_duration(x2) >= 12 h", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:min_hours", "value": {"type": "duration", "unit_ref": "unit:hour", "value": "12"}}], "constraint_ref": "constraint:min_rest_hours", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:unmet_demand", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/short", "episode_id": null} {"id": "v4/short:nurse:341e09a8530c0249", "domain": "nurse", "language": "ko", "messages": [{"role": "user", "content": "인력 부족 총합을 줄이는 근무표 부탁드립니다. 되도록 모든 간호사 근무 간격 12시간 이상으로 해주세요"}], "ir": "MINIMIZE( SUM(x0 in shift_instances: unmet_demand(x0)) )\n[SOFT] EACH(x1 in workers): EACH(x2 in adjacent(assignment_seq(x1))): gap_duration(x2) >= 12 h", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:min_hours", "value": {"type": "duration", "unit_ref": "unit:hour", "value": "12"}}], "constraint_ref": "constraint:min_rest_hours", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:unmet_demand", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/short", "episode_id": null} {"id": "v4/scenario:routing:8c47a402d3797a27", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "이번에 대단지 아파트 세 곳 물량을 받았는데 같은 동에 가는 택배가 정말 많아요. 모든 경로를 합친 총 운행시간이 최대한 짧게 계획을 짜 주세요. 같은 주소로 가는 배송은 반드시 한 경로에 넣고, 서로 300m 안에 있는 배송지도 같은 경로로 묶어 주세요. 그리고 가능하면 한 경로당 배송은 30건을 넘지 않게 하고, 기사님마다 계약된 최소 회전 수는 되도록 채워 주세요. 창고에서 나가는 회전마다 5km 반경 안에서 도는 게 좋겠어요."}], "ir": "MINIMIZE( SUM(x0 in routes: duration(x0)) )\n[HARD] EACH((x1, x2) in pairs(visits, same_coordinate)): TOGETHER(x1, x2, route)\nEACH((x3, x4) in pairs(visits, nearby(300 m))): TOGETHER(x3, x4, route)\n[SOFT] EACH(x5 in routes): delivery_count(x5) <= 30\n[SOFT] EACH(x6 in routes): round_count(x6) >= base_rounds(x6)\n[SOFT] EACH(x7 in routes): EACH(x8 in rounds(x7)): sec_radius(x8) <= 5 km", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:minimum_round", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:delivery_length.exp_factor", "value": {"type": "decimal", "value": "2"}}, {"slot_ref": "slot:delivery_length.max_size", "value": {"type": "decimal", "value": "30"}}], "constraint_ref": "constraint:delivery_length", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:nearby_delivery_grouping.distance_threshold", "value": {"type": "decimal", "value": "300"}}, {"slot_ref": "slot:nearby_delivery_grouping.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:nearby_delivery_grouping", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [{"slot_ref": "slot:round_enclosing_circle_radius.exp_factor", "value": {"type": "decimal", "value": "2"}}, {"slot_ref": "slot:round_enclosing_circle_radius.max_radius", "value": {"type": "decimal", "value": "5000"}}], "constraint_ref": "constraint:round_enclosing_circle_radius", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:same_coordinate_grouping.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:same_coordinate_grouping", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:duration_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/scenario", "episode_id": null} {"id": "v4/scenario:routing:06556dba6c3d25e7", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "아파트 단지 세 곳이라 같은 건물로 가는 물량이 많아요. 전체 경로 운행시간을 다 더한 값이 최소가 되게 짜 주세요. 같은 주소 배송은 반드시 같은 경로에 배정하고 300m 이내 배송지끼리도 한 경로로 묶어 주세요. 가능하면 경로당 배송 30건 이하, 기사별 계약 최소 회전 수 충족, 회전마다 반경 5km 이내로 맞춰 주세요"}], "ir": "MINIMIZE( SUM(x0 in routes: duration(x0)) )\n[HARD] EACH((x1, x2) in pairs(visits, same_coordinate)): TOGETHER(x1, x2, route)\nEACH((x3, x4) in pairs(visits, nearby(300 m))): TOGETHER(x3, x4, route)\n[SOFT] EACH(x5 in routes): delivery_count(x5) <= 30\n[SOFT] EACH(x6 in routes): round_count(x6) >= base_rounds(x6)\n[SOFT] EACH(x7 in routes): EACH(x8 in rounds(x7)): sec_radius(x8) <= 5 km", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:minimum_round", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:delivery_length.exp_factor", "value": {"type": "decimal", "value": "2"}}, {"slot_ref": "slot:delivery_length.max_size", "value": {"type": "decimal", "value": "30"}}], "constraint_ref": "constraint:delivery_length", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:nearby_delivery_grouping.distance_threshold", "value": {"type": "decimal", "value": "300"}}, {"slot_ref": "slot:nearby_delivery_grouping.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:nearby_delivery_grouping", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [{"slot_ref": "slot:round_enclosing_circle_radius.exp_factor", "value": {"type": "decimal", "value": "2"}}, {"slot_ref": "slot:round_enclosing_circle_radius.max_radius", "value": {"type": "decimal", "value": "5000"}}], "constraint_ref": "constraint:round_enclosing_circle_radius", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:same_coordinate_grouping.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:same_coordinate_grouping", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:duration_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/scenario", "episode_id": null} {"id": "v4/scenario:routing:9c29a55998bcc040", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "새로 맡은 아파트 단지 3곳은 한 건물에 몰리는 택배가 많아서 묶어서 돌려야 돼. 모든 경로 운행시간 합이 최대한 적게 나오게 짜줘. 같은 주소는 무조건 한 경로로 보내고, 300m 안에 붙어 있는 배송지도 같은 경로로 가자. 되도록 한 경로에 30건 넘지 않게 하고, 기사마다 계약된 최소 회전 수도 가능하면 채워줘. 창고에서 나가는 회전마다 반경 5km 안이면 좋겠어"}], "ir": "MINIMIZE( SUM(x0 in routes: duration(x0)) )\n[HARD] EACH((x1, x2) in pairs(visits, same_coordinate)): TOGETHER(x1, x2, route)\nEACH((x3, x4) in pairs(visits, nearby(300 m))): TOGETHER(x3, x4, route)\n[SOFT] EACH(x5 in routes): delivery_count(x5) <= 30\n[SOFT] EACH(x6 in routes): round_count(x6) >= base_rounds(x6)\n[SOFT] EACH(x7 in routes): EACH(x8 in rounds(x7)): sec_radius(x8) <= 5 km", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:minimum_round", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:delivery_length.exp_factor", "value": {"type": "decimal", "value": "2"}}, {"slot_ref": "slot:delivery_length.max_size", "value": {"type": "decimal", "value": "30"}}], "constraint_ref": "constraint:delivery_length", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:nearby_delivery_grouping.distance_threshold", "value": {"type": "decimal", "value": "300"}}, {"slot_ref": "slot:nearby_delivery_grouping.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:nearby_delivery_grouping", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [{"slot_ref": "slot:round_enclosing_circle_radius.exp_factor", "value": {"type": "decimal", "value": "2"}}, {"slot_ref": "slot:round_enclosing_circle_radius.max_radius", "value": {"type": "decimal", "value": "5000"}}], "constraint_ref": "constraint:round_enclosing_circle_radius", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:same_coordinate_grouping.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:same_coordinate_grouping", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:duration_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/scenario", "episode_id": null} {"id": "v4/short:nurse:13b7b2975509ed50", "domain": "nurse", "language": "ko", "messages": [{"role": "user", "content": "전체 근무조의 총 부족 인원을 최소화하고 모든 간호사의 연속근무는 4일 이내로 편성 부탁드립니다"}], "ir": "MINIMIZE( SUM(x0 in shift_instances: unmet_demand(x0)) )\nEACH(x1 in workers): RUN_LENGTH(x2 in day_seq(x1): works(x1, x2)) <= 4 day", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:max_days", "value": {"type": "duration", "unit_ref": "unit:day", "value": "4"}}], "constraint_ref": "constraint:max_consecutive_days", "scope": null, "strength": {"kind": "soft", "weight": "100"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:unmet_demand", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/short", "episode_id": null} {"id": "v4/wide:retail:51e8243a3dce1ee2", "domain": "retail", "language": "ko", "messages": [{"role": "user", "content": "지난주에 빵을 많이 폐기해서 그러는데, 판매 금액에서 매입 비용과 폐기한 재고 비용을 뺀 이익이 가장 커지도록 발주 계획을 짜 주십시오. 품목별로 발주 가능한 요일에만 주문을 넣고, 공급자별 리드타임도 반영해 부탁드립니다"}], "ir": "MAXIMIZE( profit )\nEACH(x0 in orders): day_of_week(x0) IN allowed_order_days(x0)\nEACH(x1 in orders): arrival_day(x1) = offset(order_day(x1), lead_time(x1))", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:lead_time", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [], "constraint_ref": "constraint:order_days", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:maximize_profit", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/wide", "episode_id": null} {"id": "v4/wide:retail:4ae9b6e84d139219", "domain": "retail", "language": "en", "messages": [{"role": "user", "content": "We threw out a lot of bread last week, so I want to rethink our ordering. Please plan the orders to make as much profit as possible, meaning sales minus purchase cost and the cost of stock we throw away. Each item should only be ordered on its allowed order days, and the plan needs to take each supplier's lead time into account"}], "ir": "MAXIMIZE( profit )\nEACH(x0 in orders): day_of_week(x0) IN allowed_order_days(x0)\nEACH(x1 in orders): arrival_day(x1) = offset(order_day(x1), lead_time(x1))", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:lead_time", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [], "constraint_ref": "constraint:order_days", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:maximize_profit", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/wide", "episode_id": null} {"id": "v4/short:retail:8c24b1e97f6a4eae", "domain": "retail", "language": "en", "messages": [{"role": "user", "content": "Plan my orders so items are in stock as many days as possible, waste is as low as possible, and every order is a multiple of the MOQ, no exceptions"}], "ir": "MAXIMIZE( in_stock_rate )\nMINIMIZE( waste_rate )\n[HARD] EACH(x0 in orders): quantity(x0) MULTIPLE_OF min_order_quantity(x0)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:minimum_order_quantity", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:minimize_stockout", "weight": "1/2"}, {"objective_ref": "objective:minimize_waste", "weight": "1/2"}]}, "parameters": []}, "stratum": "v4/short", "episode_id": null} {"id": "v4/short:retail:18836c9351af6bfa", "domain": "retail", "language": "ko", "messages": [{"role": "user", "content": "결품 최대한 줄이고 폐기도 최대한 줄이되, 발주는 무조건 품목별 최소 발주량 배수로 해줘"}], "ir": "MAXIMIZE( in_stock_rate )\nMINIMIZE( waste_rate )\n[HARD] EACH(x0 in orders): quantity(x0) MULTIPLE_OF min_order_quantity(x0)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:minimum_order_quantity", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:minimize_stockout", "weight": "1/2"}, {"objective_ref": "objective:minimize_waste", "weight": "1/2"}]}, "parameters": []}, "stratum": "v4/short", "episode_id": null} {"id": "v4/wide:nurse:2a3953fad1b163bc", "domain": "nurse", "language": "mixed", "messages": [{"role": "user", "content": "응급실 agency 호출이 잦아 근무표 재작성을 요청드립니다. 전체 shift에서 인력 부족 인원의 총합이 최대한 줄어들도록 부탁드립니다. 간호사 모두 주당 근무시간은 44시간을 절대 넘기지 않아야 하며, 근무와 근무 사이 휴식은 반드시 10시간 이상 확보해 주십시오. 연속 근무는 되도록 4일 이내로 맞춰 주시기 바랍니다."}], "ir": "MINIMIZE( SUM(x0 in shift_instances: unmet_demand(x0)) )\n[HARD] EACH(x1 in workers): EACH(x2 in windows(WEEK, 1)): SUM(x3 in assignments(x1) WHERE DURING(interval(x3), x2): work_hours(x3)) <= 44 h\n[HARD] EACH(x4 in workers): EACH(x5 in adjacent(assignment_seq(x4))): gap_duration(x5) >= 10 h\n[SOFT] EACH(x6 in workers): RUN_LENGTH(x7 in day_seq(x6): works(x6, x7)) <= 4 day", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:max_days", "value": {"type": "duration", "unit_ref": "unit:day", "value": "4"}}], "constraint_ref": "constraint:max_consecutive_days", "scope": null, "strength": {"kind": "soft", "weight": "100"}}, {"arguments": [{"slot_ref": "slot:max_hours", "value": {"type": "duration", "unit_ref": "unit:hour", "value": "44"}}], "constraint_ref": "constraint:max_hours_per_week", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [{"slot_ref": "slot:min_hours", "value": {"type": "duration", "unit_ref": "unit:hour", "value": "10"}}], "constraint_ref": "constraint:min_rest_hours", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:unmet_demand", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/wide", "episode_id": null} {"id": "v4/wide:retail:10712227f8628735", "domain": "retail", "language": "ko", "messages": [{"role": "user", "content": "폐기율을 낮추는 발주 계획 부탁드립니다 품목별 발주 가능 요일은 반드시 지켜주십시오"}], "ir": "MINIMIZE( waste_rate )\n[HARD] EACH(x0 in orders): day_of_week(x0) IN allowed_order_days(x0)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:order_days", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:minimize_waste", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/wide", "episode_id": null} {"id": "v4/wide:retail:e362d334a2e96fe1", "domain": "retail", "language": "mixed", "messages": [{"role": "user", "content": "폐기율을 낮추는 발주 plan 부탁드립니다. 품목별 order days는 반드시 지켜주십시오"}], "ir": "MINIMIZE( waste_rate )\n[HARD] EACH(x0 in orders): day_of_week(x0) IN allowed_order_days(x0)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:order_days", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:minimize_waste", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/wide", "episode_id": null} {"id": "v4/wide:retail:91905c206c1590af", "domain": "retail", "language": "en", "messages": [{"role": "user", "content": "Plan orders to lower the waste rate; each item must be ordered only on its allowed order days."}], "ir": "MINIMIZE( waste_rate )\n[HARD] EACH(x0 in orders): day_of_week(x0) IN allowed_order_days(x0)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:order_days", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:minimize_waste", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/wide", "episode_id": null} {"id": "v4/wide:nurse:9896369875c67dd0", "domain": "nurse", "language": "en", "messages": [{"role": "user", "content": "Please put together the ward roster with the highest total preference score, giving nurses the shifts they requested. If possible, keep each nurse to no more than 5 days in a row. Keep each nurse's working hours at no more than 56 hours per week."}], "ir": "MAXIMIZE( SUM(x0 in assignments: preference_score(x0)) )\n[SOFT] EACH(x1 in workers): RUN_LENGTH(x2 in day_seq(x1): works(x1, x2)) <= 5 day\nEACH(x3 in workers): EACH(x4 in windows(WEEK, 1)): SUM(x5 in assignments(x3) WHERE DURING(interval(x5), x4): work_hours(x5)) <= 56 h", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:max_days", "value": {"type": "duration", "unit_ref": "unit:day", "value": "5"}}], "constraint_ref": "constraint:max_consecutive_days", "scope": null, "strength": {"kind": "soft", "weight": "100"}}, {"arguments": [{"slot_ref": "slot:max_hours", "value": {"type": "duration", "unit_ref": "unit:hour", "value": "56"}}], "constraint_ref": "constraint:max_hours_per_week", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:preference_satisfaction", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/wide", "episode_id": null} {"id": "v4/short:retail:380698aed6f21ffe", "domain": "retail", "language": "en", "messages": [{"role": "user", "content": "Plan orders to minimize waste rate and order each item only on its allowed days"}], "ir": "MINIMIZE( waste_rate )\nEACH(x0 in orders): day_of_week(x0) IN allowed_order_days(x0)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:order_days", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:minimize_waste", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/short", "episode_id": null} {"id": "v4/short:nurse:d20571b2e0b35adf", "domain": "nurse", "language": "en", "messages": [{"role": "user", "content": "Make the roster with as little total understaffing as possible, and give every nurse at least 12 hours off between shifts"}], "ir": "MINIMIZE( SUM(x0 in shift_instances: unmet_demand(x0)) )\nEACH(x1 in workers): EACH(x2 in adjacent(assignment_seq(x1))): gap_duration(x2) >= 12 h", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:min_hours", "value": {"type": "duration", "unit_ref": "unit:hour", "value": "12"}}], "constraint_ref": "constraint:min_rest_hours", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:unmet_demand", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/short", "episode_id": null} {"id": "v4/short:nurse:7849576f5fa1f06d", "domain": "nurse", "language": "ko", "messages": [{"role": "user", "content": "전체 인력 부족이 최대한 적게 나오게 짜 주세요, 그리고 모든 간호사는 근무와 근무 사이에 12시간 이상 쉬게 해 주세요"}], "ir": "MINIMIZE( SUM(x0 in shift_instances: unmet_demand(x0)) )\nEACH(x1 in workers): EACH(x2 in adjacent(assignment_seq(x1))): gap_duration(x2) >= 12 h", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:min_hours", "value": {"type": "duration", "unit_ref": "unit:hour", "value": "12"}}], "constraint_ref": "constraint:min_rest_hours", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:unmet_demand", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/short", "episode_id": null} {"id": "v4/short:nurse:4e234dee19be5f7e", "domain": "nurse", "language": "mixed", "messages": [{"role": "user", "content": "understaffing 총합 최대한 줄이고, 모든 간호사 근무 사이 rest 12시간 이상으로 짜줘"}], "ir": "MINIMIZE( SUM(x0 in shift_instances: unmet_demand(x0)) )\nEACH(x1 in workers): EACH(x2 in adjacent(assignment_seq(x1))): gap_duration(x2) >= 12 h", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:min_hours", "value": {"type": "duration", "unit_ref": "unit:hour", "value": "12"}}], "constraint_ref": "constraint:min_rest_hours", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:unmet_demand", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/short", "episode_id": null} {"id": "v4/wide:nurse:7f03e3d559a75603", "domain": "nurse", "language": "mixed", "messages": [{"role": "user", "content": "지난달 근무표로 노조 경고를 받아서 재작성합니다. 전체 shift의 인력 부족(understaffing) 합계가 최대한 적도록 짜 주시고, 간호사 누구도 주당 56시간을 넘지 않게, 연속 근무는 4일을 넘지 않게 반드시 지켜 주세요. 근무 사이 휴식은 가능하면 11시간 이상 확보 부탁드립니다."}], "ir": "MINIMIZE( SUM(x0 in shift_instances: unmet_demand(x0)) )\n[HARD] EACH(x1 in workers): EACH(x2 in windows(WEEK, 1)): SUM(x3 in assignments(x1) WHERE DURING(interval(x3), x2): work_hours(x3)) <= 56 h\n[HARD] EACH(x4 in workers): RUN_LENGTH(x5 in day_seq(x4): works(x4, x5)) <= 4 day\n[SOFT] EACH(x6 in workers): EACH(x7 in adjacent(assignment_seq(x6))): gap_duration(x7) >= 11 h", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:max_days", "value": {"type": "duration", "unit_ref": "unit:day", "value": "4"}}], "constraint_ref": "constraint:max_consecutive_days", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [{"slot_ref": "slot:max_hours", "value": {"type": "duration", "unit_ref": "unit:hour", "value": "56"}}], "constraint_ref": "constraint:max_hours_per_week", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [{"slot_ref": "slot:min_hours", "value": {"type": "duration", "unit_ref": "unit:hour", "value": "11"}}], "constraint_ref": "constraint:min_rest_hours", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:unmet_demand", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/wide", "episode_id": null} {"id": "v4/wide:nurse:a97b081b50c0b60f", "domain": "nurse", "language": "en", "messages": [{"role": "user", "content": "Our ward got a union warning over last month's roster, so please redo it with the total shortage across all shifts as low as possible. No nurse may ever work more than 56 hours in a week or more than 4 days in a row, and ideally everyone gets at least 11 hours off between shifts."}], "ir": "MINIMIZE( SUM(x0 in shift_instances: unmet_demand(x0)) )\n[HARD] EACH(x1 in workers): EACH(x2 in windows(WEEK, 1)): SUM(x3 in assignments(x1) WHERE DURING(interval(x3), x2): work_hours(x3)) <= 56 h\n[HARD] EACH(x4 in workers): RUN_LENGTH(x5 in day_seq(x4): works(x4, x5)) <= 4 day\n[SOFT] EACH(x6 in workers): EACH(x7 in adjacent(assignment_seq(x6))): gap_duration(x7) >= 11 h", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:max_days", "value": {"type": "duration", "unit_ref": "unit:day", "value": "4"}}], "constraint_ref": "constraint:max_consecutive_days", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [{"slot_ref": "slot:max_hours", "value": {"type": "duration", "unit_ref": "unit:hour", "value": "56"}}], "constraint_ref": "constraint:max_hours_per_week", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [{"slot_ref": "slot:min_hours", "value": {"type": "duration", "unit_ref": "unit:hour", "value": "11"}}], "constraint_ref": "constraint:min_rest_hours", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:unmet_demand", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/wide", "episode_id": null} {"id": "v4/wide:nurse:94f7fc14085e2181", "domain": "nurse", "language": "ko", "messages": [{"role": "user", "content": "지난달 근무표 때문에 노조에서 경고를 받았거든요. 전체 근무에서 인력이 모자란 걸 다 합쳐서 최대한 적게 나오게 짜 주세요. 그리고 간호사 누구든 일주일에 56시간 넘게 일하면 절대 안 되고, 4일 넘게 연속으로 일하는 것도 무조건 안 돼요. 근무 사이에는 되도록 11시간 이상 쉬게 해 주세요."}], "ir": "MINIMIZE( SUM(x0 in shift_instances: unmet_demand(x0)) )\n[HARD] EACH(x1 in workers): EACH(x2 in windows(WEEK, 1)): SUM(x3 in assignments(x1) WHERE DURING(interval(x3), x2): work_hours(x3)) <= 56 h\n[HARD] EACH(x4 in workers): RUN_LENGTH(x5 in day_seq(x4): works(x4, x5)) <= 4 day\n[SOFT] EACH(x6 in workers): EACH(x7 in adjacent(assignment_seq(x6))): gap_duration(x7) >= 11 h", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:max_days", "value": {"type": "duration", "unit_ref": "unit:day", "value": "4"}}], "constraint_ref": "constraint:max_consecutive_days", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [{"slot_ref": "slot:max_hours", "value": {"type": "duration", "unit_ref": "unit:hour", "value": "56"}}], "constraint_ref": "constraint:max_hours_per_week", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [{"slot_ref": "slot:min_hours", "value": {"type": "duration", "unit_ref": "unit:hour", "value": "11"}}], "constraint_ref": "constraint:min_rest_hours", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:unmet_demand", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/wide", "episode_id": null} {"id": "v4/wide:retail:541a060bb8b3dd33", "domain": "retail", "language": "ko", "messages": [{"role": "user", "content": "다음 달 본사 점검도 있어서 폐기율 낮추는 쪽으로 발주 계획 짜줘. 품목별 유통기한은 반드시 반영하고, 공급업체별 입고 소요일도 고려해줘. 발주 수량은 품목별 최소 발주량의 배수로 잡고, 가능하면 각 품목의 발주 가능 요일에만 주문 넣어줘."}], "ir": "MINIMIZE( waste_rate )\n[HARD] EACH(x0 in items): EACH(x1 in units(x0)): expiry_day(x1) = offset(arrival_day(x1), product_life(x0))\nEACH(x2 in orders): arrival_day(x2) = offset(order_day(x2), lead_time(x2))\nEACH(x3 in orders): quantity(x3) MULTIPLE_OF min_order_quantity(x3)\n[SOFT] EACH(x4 in orders): day_of_week(x4) IN allowed_order_days(x4)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:lead_time", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [], "constraint_ref": "constraint:minimum_order_quantity", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [], "constraint_ref": "constraint:order_days", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [], "constraint_ref": "constraint:shelf_life", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:minimize_waste", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/wide", "episode_id": null} {"id": "v4/wide:retail:4e1c44eba9db0151", "domain": "retail", "language": "ko", "messages": [{"role": "user", "content": "버리는 재고 비율을 낮출 수 있도록 발주 계획을 부탁드립니다. 품목별 유통기한은 반드시 반영하고, 각 품목의 공급업체 배송 기간을 고려해 주십시오. 주문 수량은 품목별 최소 주문 수량의 배수로 맞추고, 되도록 해당 품목의 발주 가능 요일에만 주문하도록 잡아주십시오."}], "ir": "MINIMIZE( waste_rate )\n[HARD] EACH(x0 in items): EACH(x1 in units(x0)): expiry_day(x1) = offset(arrival_day(x1), product_life(x0))\nEACH(x2 in orders): arrival_day(x2) = offset(order_day(x2), lead_time(x2))\nEACH(x3 in orders): quantity(x3) MULTIPLE_OF min_order_quantity(x3)\n[SOFT] EACH(x4 in orders): day_of_week(x4) IN allowed_order_days(x4)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:lead_time", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [], "constraint_ref": "constraint:minimum_order_quantity", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [], "constraint_ref": "constraint:order_days", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [], "constraint_ref": "constraint:shelf_life", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:minimize_waste", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/wide", "episode_id": null} {"id": "v4/wide:retail:91fb1ed43d1ce77b", "domain": "retail", "language": "ko", "messages": [{"role": "user", "content": "폐기로 버리는 비율을 낮추게 발주 계획 좀 잡아줘. 각 품목 유통기한은 반드시 챙기고 공급업체에서 입고되기까지 걸리는 시간도 반영해줘. 품목마다 최소 발주량의 배수로 주문량을 맞추고, 가능하면 주문 가능한 요일에만 발주 넣는 걸로 해줘"}], "ir": "MINIMIZE( waste_rate )\n[HARD] EACH(x0 in items): EACH(x1 in units(x0)): expiry_day(x1) = offset(arrival_day(x1), product_life(x0))\nEACH(x2 in orders): arrival_day(x2) = offset(order_day(x2), lead_time(x2))\nEACH(x3 in orders): quantity(x3) MULTIPLE_OF min_order_quantity(x3)\n[SOFT] EACH(x4 in orders): day_of_week(x4) IN allowed_order_days(x4)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:lead_time", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [], "constraint_ref": "constraint:minimum_order_quantity", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [], "constraint_ref": "constraint:order_days", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [], "constraint_ref": "constraint:shelf_life", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:minimize_waste", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/wide", "episode_id": null} {"id": "v4/short:retail:26eb2d09ee04d134", "domain": "retail", "language": "ko", "messages": [{"role": "user", "content": "일평균 재고 보유비용을 줄이고 품목별 발주 가능 요일에만 주문하도록 발주 계획 부탁드립니다"}], "ir": "MINIMIZE( MEAN(x0 in days(horizon): holding_cost(x0)) )\nEACH(x1 in orders): day_of_week(x1) IN allowed_order_days(x1)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:order_days", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:minimize_holding_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/short", "episode_id": null} {"id": "v4/short:retail:907fe5a69575254a", "domain": "retail", "language": "en", "messages": [{"role": "user", "content": "Plan orders to minimize average daily holding costs and order each item only on its allowed order days"}], "ir": "MINIMIZE( MEAN(x0 in days(horizon): holding_cost(x0)) )\nEACH(x1 in orders): day_of_week(x1) IN allowed_order_days(x1)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:order_days", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:minimize_holding_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/short", "episode_id": null} {"id": "v4/short:retail:2792fd9abdd234a7", "domain": "retail", "language": "ko", "messages": [{"role": "user", "content": "일평균 재고 유지비를 줄이고 품목마다 발주 가능한 요일에만 주문하게 계획해 주세요"}], "ir": "MINIMIZE( MEAN(x0 in days(horizon): holding_cost(x0)) )\nEACH(x1 in orders): day_of_week(x1) IN allowed_order_days(x1)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:order_days", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:minimize_holding_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/short", "episode_id": null} {"id": "v4/wide:retail:86258b38368088f1", "domain": "retail", "language": "ko", "messages": [{"role": "user", "content": "수입과일 코너 발주 계획 부탁드립니다. 판매액에서 매입비와 폐기 손실을 뺀 이익은 최대한 크게, 하루 평균 재고 보유비용은 최대한 작게 가져가고, 품목별 최소 발주량의 배수로만 주문하며, 발주 가능 요일이 아닌 날에는 반드시 발주하지 않도록 하고, 유통기한과 공급자 리드타임도 반영해 주세요."}], "ir": "MAXIMIZE( profit )\nMINIMIZE( MEAN(x0 in days(horizon): holding_cost(x0)) )\nEACH(x1 in orders): quantity(x1) MULTIPLE_OF min_order_quantity(x1)\n[HARD] EACH(x2 in orders): day_of_week(x2) IN allowed_order_days(x2)\nEACH(x3 in items): EACH(x4 in units(x3)): expiry_day(x4) = offset(arrival_day(x4), product_life(x3))\nEACH(x5 in orders): arrival_day(x5) = offset(order_day(x5), lead_time(x5))", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:lead_time", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [], "constraint_ref": "constraint:minimum_order_quantity", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [], "constraint_ref": "constraint:order_days", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [], "constraint_ref": "constraint:shelf_life", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:maximize_profit", "weight": "1/2"}, {"objective_ref": "objective:minimize_holding_cost", "weight": "1/2"}]}, "parameters": []}, "stratum": "v4/wide", "episode_id": null} {"id": "v4/wide:retail:3190a8999c7a86cc", "domain": "retail", "language": "ko", "messages": [{"role": "user", "content": "수입과일 코너 매대가 자꾸 비어서 발주 계획을 새로 짜고 싶어요. 판매 수익에서 매입비와 폐기된 재고 금액을 뺀 이익은 최대한 높이고, 하루 평균 재고 보유비용은 최대한 낮춰 주세요. 주문은 품목마다 최소 발주량의 배수로 넣고, 품목별로 발주 가능한 요일에만 반드시 넣어야 해요. 유통기한이랑 공급자 리드타임도 같이 고려해 주세요."}], "ir": "MAXIMIZE( profit )\nMINIMIZE( MEAN(x0 in days(horizon): holding_cost(x0)) )\nEACH(x1 in orders): quantity(x1) MULTIPLE_OF min_order_quantity(x1)\n[HARD] EACH(x2 in orders): day_of_week(x2) IN allowed_order_days(x2)\nEACH(x3 in orders): arrival_day(x3) = offset(order_day(x3), lead_time(x3))\nEACH(x4 in items): EACH(x5 in units(x4)): expiry_day(x5) = offset(arrival_day(x5), product_life(x4))", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:lead_time", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [], "constraint_ref": "constraint:minimum_order_quantity", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [], "constraint_ref": "constraint:order_days", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [], "constraint_ref": "constraint:shelf_life", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:maximize_profit", "weight": "1/2"}, {"objective_ref": "objective:minimize_holding_cost", "weight": "1/2"}]}, "parameters": []}, "stratum": "v4/wide", "episode_id": null} {"id": "v4/wide:retail:d8eb4b6f4c91702c", "domain": "retail", "language": "ko", "messages": [{"role": "user", "content": "수입과일 발주 짜줘, 이익은 최대로(판매액에서 매입비랑 폐기 뺀 거) 하루 평균 재고 보유비용은 최소로 가자. 주문은 품목별 최소 발주량 배수로만, 발주 요일은 품목마다 정해진 날에만 무조건 넣어야 해. 유통기한이랑 리드타임도 반영해줘"}], "ir": "MAXIMIZE( profit )\nMINIMIZE( MEAN(x0 in days(horizon): holding_cost(x0)) )\nEACH(x1 in orders): quantity(x1) MULTIPLE_OF min_order_quantity(x1)\n[HARD] EACH(x2 in orders): day_of_week(x2) IN allowed_order_days(x2)\nEACH(x3 in items): EACH(x4 in units(x3)): expiry_day(x4) = offset(arrival_day(x4), product_life(x3))\nEACH(x5 in orders): arrival_day(x5) = offset(order_day(x5), lead_time(x5))", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:lead_time", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [], "constraint_ref": "constraint:minimum_order_quantity", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [], "constraint_ref": "constraint:order_days", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [], "constraint_ref": "constraint:shelf_life", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:maximize_profit", "weight": "1/2"}, {"objective_ref": "objective:minimize_holding_cost", "weight": "1/2"}]}, "parameters": []}, "stratum": "v4/wide", "episode_id": null} {"id": "v4/wide:retail:660740d4a6917d53", "domain": "retail", "language": "en", "messages": [{"role": "user", "content": "I run a snack discount store and our suppliers only take orders by the box, so I need an order plan for the week. Keep the average daily holding cost as low as possible. Every item's shelf life must be taken into account, each item should only be ordered on its allowed order days, and if possible order in multiples of each item's minimum order quantity."}], "ir": "MINIMIZE( MEAN(x0 in days(horizon): holding_cost(x0)) )\n[HARD] EACH(x1 in items): EACH(x2 in units(x1)): expiry_day(x2) = offset(arrival_day(x2), product_life(x1))\nEACH(x3 in orders): day_of_week(x3) IN allowed_order_days(x3)\n[SOFT] EACH(x4 in orders): quantity(x4) MULTIPLE_OF min_order_quantity(x4)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:minimum_order_quantity", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [], "constraint_ref": "constraint:order_days", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [], "constraint_ref": "constraint:shelf_life", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:minimize_holding_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/wide", "episode_id": null} {"id": "v4/wide:retail:b983105963fc0cd4", "domain": "retail", "language": "ko", "messages": [{"role": "user", "content": "과자 발주 계획 짜줘. 하루 평균 재고 보유비용은 최대한 낮게, 품목마다 유통기한은 반드시 반영하고, 발주는 품목별 발주 가능 요일에만 넣고, 되도록 최소 발주량 배수로 맞춰줘."}], "ir": "MINIMIZE( MEAN(x0 in days(horizon): holding_cost(x0)) )\n[HARD] EACH(x1 in items): EACH(x2 in units(x1)): expiry_day(x2) = offset(arrival_day(x2), product_life(x1))\nEACH(x3 in orders): day_of_week(x3) IN allowed_order_days(x3)\n[SOFT] EACH(x4 in orders): quantity(x4) MULTIPLE_OF min_order_quantity(x4)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:minimum_order_quantity", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [], "constraint_ref": "constraint:order_days", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [], "constraint_ref": "constraint:shelf_life", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:minimize_holding_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/wide", "episode_id": null} {"id": "v4/wide:retail:115ef2dec0e08e6f", "domain": "retail", "language": "ko", "messages": [{"role": "user", "content": "수입 과일 코너 발주 계획을 잡아 주세요. 폐기율을 낮추고, 품목별로 공급업체에서 입고되기까지 걸리는 시간과 입고 후 판매 가능한 기간을 반영해 주세요. 발주 수량은 품목별 최소 발주량의 배수로 맞춰 주세요."}], "ir": "MINIMIZE( waste_rate )\nEACH(x0 in orders): arrival_day(x0) = offset(order_day(x0), lead_time(x0))\nEACH(x1 in items): EACH(x2 in units(x1)): expiry_day(x2) = offset(arrival_day(x2), product_life(x1))\nEACH(x3 in orders): quantity(x3) MULTIPLE_OF min_order_quantity(x3)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:lead_time", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [], "constraint_ref": "constraint:minimum_order_quantity", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [], "constraint_ref": "constraint:shelf_life", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:minimize_waste", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/wide", "episode_id": null} {"id": "v4/wide:retail:707940dbf97bb5eb", "domain": "retail", "language": "ko", "messages": [{"role": "user", "content": "수입 과일 발주를 어떻게 할지 계획해 주세요. 버리는 재고 비율을 낮추는 쪽으로 잡고, 품목마다 공급업체 배송에 걸리는 시간과 입고 후 유통기한을 고려해 주세요. 주문량은 각 품목의 최소 주문 수량의 배수로 맞춰 주세요"}], "ir": "MINIMIZE( waste_rate )\nEACH(x0 in orders): arrival_day(x0) = offset(order_day(x0), lead_time(x0))\nEACH(x1 in items): EACH(x2 in units(x1)): expiry_day(x2) = offset(arrival_day(x2), product_life(x1))\nEACH(x3 in orders): quantity(x3) MULTIPLE_OF min_order_quantity(x3)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:lead_time", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [], "constraint_ref": "constraint:minimum_order_quantity", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [], "constraint_ref": "constraint:shelf_life", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:minimize_waste", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/wide", "episode_id": null} {"id": "v4/wide:retail:81352d67597e0945", "domain": "retail", "language": "ko", "messages": [{"role": "user", "content": "수입 과일 발주 계획은 폐기율을 낮추는 방향으로 짜 주세요. 품목별 입고 소요일과 입고 후 유통기한을 반영하고, 발주량은 각 품목의 최소 발주량의 배수로 잡아 주세요."}], "ir": "MINIMIZE( waste_rate )\nEACH(x0 in orders): arrival_day(x0) = offset(order_day(x0), lead_time(x0))\nEACH(x1 in items): EACH(x2 in units(x1)): expiry_day(x2) = offset(arrival_day(x2), product_life(x1))\nEACH(x3 in orders): quantity(x3) MULTIPLE_OF min_order_quantity(x3)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:lead_time", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [], "constraint_ref": "constraint:minimum_order_quantity", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [], "constraint_ref": "constraint:shelf_life", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:minimize_waste", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/wide", "episode_id": null} {"id": "v4/wide:retail:54a35d9a825185c8", "domain": "retail", "language": "ko", "messages": [{"role": "user", "content": "재고를 쌓아두는 비용이 부담이라 하루 평균 재고 보유비용을 낮추는 발주 계획을 부탁드립니다. 품목별 최소 발주량의 배수로 주문하고 각 품목의 소비기한을 반영해 주시기 바랍니다. 발주 요일은 가능하면 품목마다 정해진 발주 가능 요일에 맞춰 주시기 바랍니다"}], "ir": "MINIMIZE( MEAN(x0 in days(horizon): holding_cost(x0)) )\nEACH(x1 in orders): quantity(x1) MULTIPLE_OF min_order_quantity(x1)\nEACH(x2 in items): EACH(x3 in units(x2)): expiry_day(x3) = offset(arrival_day(x3), product_life(x2))\n[SOFT] EACH(x4 in orders): day_of_week(x4) IN allowed_order_days(x4)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:minimum_order_quantity", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [], "constraint_ref": "constraint:order_days", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [], "constraint_ref": "constraint:shelf_life", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:minimize_holding_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/wide", "episode_id": null} {"id": "v4/wide:retail:caa1d863cbcbac8f", "domain": "retail", "language": "en", "messages": [{"role": "user", "content": "Please plan orders to minimize average daily inventory holding costs, using multiples of each item's minimum order quantity and accounting for each item's shelf life. If possible, place each item's orders only on its allowed ordering days."}], "ir": "MINIMIZE( MEAN(x0 in days(horizon): holding_cost(x0)) )\nEACH(x1 in orders): quantity(x1) MULTIPLE_OF min_order_quantity(x1)\nEACH(x2 in items): EACH(x3 in units(x2)): expiry_day(x3) = offset(arrival_day(x3), product_life(x2))\n[SOFT] EACH(x4 in orders): day_of_week(x4) IN allowed_order_days(x4)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:minimum_order_quantity", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [], "constraint_ref": "constraint:order_days", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [], "constraint_ref": "constraint:shelf_life", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:minimize_holding_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/wide", "episode_id": null} {"id": "v4/wide:retail:9ea1d2d558dc3c52", "domain": "retail", "language": "ko", "messages": [{"role": "user", "content": "하루 평균 재고 보유비용이 가장 적게 들도록 품목별 최소 발주량의 배수로 주문하고, 각 품목의 소비기한을 고려해서 발주 계획을 짜 주세요. 가능하면 품목마다 정해진 발주 가능 요일에만 주문해 주세요"}], "ir": "MINIMIZE( MEAN(x0 in days(horizon): holding_cost(x0)) )\nEACH(x1 in orders): quantity(x1) MULTIPLE_OF min_order_quantity(x1)\nEACH(x2 in items): EACH(x3 in units(x2)): expiry_day(x3) = offset(arrival_day(x3), product_life(x2))\n[SOFT] EACH(x4 in orders): day_of_week(x4) IN allowed_order_days(x4)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:minimum_order_quantity", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [], "constraint_ref": "constraint:order_days", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [], "constraint_ref": "constraint:shelf_life", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:minimize_holding_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/wide", "episode_id": null} {"id": "v4/scenario:routing:7641c1bd0321da0b", "domain": "routing", "language": "en", "messages": [{"role": "user", "content": "Planning tomorrow's frozen-food runs with the reefer trucks. Keep the total distance of all routes as low as possible. No route may ever have more than 12 deliveries, deliveries to the same address must be on the same route, and no route can go over 80 km of driving. If possible, each truck should leave the depot at least 70% full, and ideally every delivery gets made by its latest allowed time."}], "ir": "MINIMIZE( SUM(x0 in routes: travel_distance(x0)) )\n[HARD] EACH(x1 in routes): delivery_count(x1) <= 12\n[HARD] EACH((x2, x3) in pairs(visits, same_coordinate)): TOGETHER(x2, x3, route)\n[HARD] EACH(x4 in routes): travel_distance(x4) <= 80 km\n[SOFT] EACH(x5 in routes): EACH(x6 in rounds(x5)): MAX(x7 in keys(load): utilization[x7](x6)) >= 0.7\n[SOFT] EACH(x8 in visits): departure_time(x8) <= tw_late(x8)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:delivery_length.exp_factor", "value": {"type": "decimal", "value": "2"}}, {"slot_ref": "slot:delivery_length.max_size", "value": {"type": "decimal", "value": "12"}}], "constraint_ref": "constraint:delivery_length", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [{"slot_ref": "slot:max_distance.exp_factor", "value": {"type": "decimal", "value": "1"}}, {"slot_ref": "slot:max_distance.max_distance", "value": {"type": "decimal", "value": "80000"}}], "constraint_ref": "constraint:max_distance", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [{"slot_ref": "slot:min_capacity.target_ratio", "value": {"type": "decimal", "value": "0.7"}}], "constraint_ref": "constraint:min_capacity", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:same_coordinate_grouping.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:same_coordinate_grouping", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [{"slot_ref": "slot:time_window.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:time_window", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:distance_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/scenario", "episode_id": null} {"id": "v4/scenario:routing:817652d115ad0395", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "예식장 꽃 배송 배차 짜줘. 전체 배송 경로의 총 이동거리가 적게 나오게 하고, 차량 적재 한도를 넘기지 않으면서 모든 배송은 반드시 약속된 마감 시간까지 마쳐줘. 긴급 배송은 더 일찍 도착하게 하고 예식장별 배달 금지 시간에는 배송하지 않게 해줘"}], "ir": "MINIMIZE( SUM(x0 in routes: travel_distance(x0)) )\nMINIMIZE( SUM(x1 in visits: priority_weighted_arrival(x1)) )\nEACH(x2 in routes): EACH(x3 in rounds(x2)): EACH(x4 in keys(load)): MAX(x5 in positions(x3): load[x4](x5)) <= capacity[x4](x2)\n[HARD] EACH(x6 in visits): departure_time(x6) <= tw_late(x6)\nEACH(x7 in visits): NOT OVERLAPS(service_interval(x7), prohibited_window(x7))", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:prohibited_time_window", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:capacity.exp_factor", "value": {"type": "decimal", "value": "1"}}], "constraint_ref": "constraint:capacity", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [{"slot_ref": "slot:delivery_time_priority.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:delivery_time_priority", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:time_window.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:time_window", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:distance_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/scenario", "episode_id": null} {"id": "v4/scenario:routing:8de7c1cfb408aa77", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "예식장 꽃 배송 배차 계획을 부탁드립니다. 전체 경로의 총 이동거리를 줄이고 차량별 적재 한도를 넘기지 않도록 하되, 모든 배송은 반드시 약속된 마감 시간까지 완료해 주십시오. 긴급 배송은 더 일찍 도착하도록 하고, 각 예식장의 배달 금지 시간에는 배송하지 않도록 해주십시오."}], "ir": "MINIMIZE( SUM(x0 in routes: travel_distance(x0)) )\nEACH(x1 in routes): EACH(x2 in rounds(x1)): EACH(x3 in keys(load)): MAX(x4 in positions(x2): load[x3](x4)) <= capacity[x3](x1)\n[HARD] EACH(x5 in visits): departure_time(x5) <= tw_late(x5)\nMINIMIZE( SUM(x6 in visits: priority_weighted_arrival(x6)) )\nEACH(x7 in visits): NOT OVERLAPS(service_interval(x7), prohibited_window(x7))", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:prohibited_time_window", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:capacity.exp_factor", "value": {"type": "decimal", "value": "1"}}], "constraint_ref": "constraint:capacity", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [{"slot_ref": "slot:delivery_time_priority.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:delivery_time_priority", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:time_window.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:time_window", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:distance_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/scenario", "episode_id": null} {"id": "v4/scenario:routing:8f3022dcb50125a0", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "냉동차 아침 배차 짜줘. 전체 연료비 합쳐서 최대한 적게 들게 하고, 배송은 전부 늦어도 허용된 마지막 시간까지는 끝나게 해줘. 그리고 경로마다 배송 20건 넘으면 절대 안 되고, 주행거리도 무조건 120km 안에서 끝내야 돼. 차에 실을 수 있는 한도 넘게 싣는 것도 절대 안 돼"}], "ir": "MINIMIZE( SUM(x0 in routes: fuel_cost(x0)) )\nEACH(x1 in visits): departure_time(x1) <= tw_late(x1)\n[HARD] EACH(x2 in routes): delivery_count(x2) <= 20\n[HARD] EACH(x3 in routes): travel_distance(x3) <= 120 km\n[HARD] EACH(x4 in routes): EACH(x5 in rounds(x4)): EACH(x6 in keys(load)): MAX(x7 in positions(x5): load[x6](x7)) <= capacity[x6](x4)", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:capacity.exp_factor", "value": {"type": "decimal", "value": "1"}}], "constraint_ref": "constraint:capacity", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [{"slot_ref": "slot:delivery_length.exp_factor", "value": {"type": "decimal", "value": "2"}}, {"slot_ref": "slot:delivery_length.max_size", "value": {"type": "decimal", "value": "20"}}], "constraint_ref": "constraint:delivery_length", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [{"slot_ref": "slot:max_distance.exp_factor", "value": {"type": "decimal", "value": "1"}}, {"slot_ref": "slot:max_distance.max_distance", "value": {"type": "decimal", "value": "120000"}}], "constraint_ref": "constraint:max_distance", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [{"slot_ref": "slot:time_window.exp_factor", "value": {"type": "decimal", "value": "2"}}], "constraint_ref": "constraint:time_window", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fuel_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/scenario", "episode_id": null} {"id": "v4/multi:routing:ce0774c657d61cff", "domain": "routing", "language": "mixed", "messages": [{"role": "user", "content": "전체 route의 총 연료비를 최소화해 주세요. 각 route마다 왕복 한 번 한 번 기준으로 경로상 지점들 중 화물 종류별 최대 적재량이 그 route 차량의 capacity 이하여야 하고, route당 delivery는 8건 이하, 그리고 각 delivery의 서비스 시간이 그 delivery의 금지 시간대와 겹치지 않게 해 주세요"}], "ir": "MINIMIZE( SUM(x0 in routes: fuel_cost(x0)) )\nEACH(x1 in routes): EACH(x2 in rounds(x1)): EACH(x3 in keys(load)): MAX(x4 in positions(x2): load[x3](x4)) <= capacity[x3](x1)\nEACH(x5 in routes): delivery_count(x5) <= 8\nEACH(x6 in visits): NOT OVERLAPS(service_interval(x6), prohibited_window(x6))", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:prohibited_time_window", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:capacity.exp_factor", "value": {"type": "decimal", "value": "1"}}], "constraint_ref": "constraint:capacity", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [{"slot_ref": "slot:delivery_length.exp_factor", "value": {"type": "decimal", "value": "2"}}, {"slot_ref": "slot:delivery_length.max_size", "value": {"type": "decimal", "value": "8"}}], "constraint_ref": "constraint:delivery_length", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fuel_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/multi", "episode_id": null} {"id": "v4/multi:routing:82f71ae48358dff6", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "전체 경로의 연료비 합계를 최소화 부탁드립니다. 모든 경로에서 각 왕복마다 화물 종류별로 경로상 지점 중 가장 큰 적재량이 해당 경로 차량의 적재 용량 이하여야 하며, 경로당 배송은 8건 이하, 각 배송의 서비스 시간이 해당 배송의 진입 금지 시간대와 겹치지 않도록 해 주십시오."}], "ir": "MINIMIZE( SUM(x0 in routes: fuel_cost(x0)) )\nEACH(x1 in routes): EACH(x2 in rounds(x1)): EACH(x3 in keys(load)): MAX(x4 in positions(x2): load[x3](x4)) <= capacity[x3](x1)\nEACH(x5 in routes): delivery_count(x5) <= 8\nEACH(x6 in visits): NOT OVERLAPS(service_interval(x6), prohibited_window(x6))", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:prohibited_time_window", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:capacity.exp_factor", "value": {"type": "decimal", "value": "1"}}], "constraint_ref": "constraint:capacity", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [{"slot_ref": "slot:delivery_length.exp_factor", "value": {"type": "decimal", "value": "2"}}, {"slot_ref": "slot:delivery_length.max_size", "value": {"type": "decimal", "value": "8"}}], "constraint_ref": "constraint:delivery_length", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fuel_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/multi", "episode_id": null} {"id": "v4/multi:routing:0802dbf1296b4343", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "모든 경로의 연료비를 다 합친 총액이 최소가 되도록 부탁드립니다. 경로마다 왕복 한 번씩 볼 때 각 화물 종류별로 지나는 지점 중 가장 큰 적재량이 그 경로 차량의 용량 이하여야 하고, 경로당 배송 건수는 8건 이하이며, 각 배송의 서비스 구간은 그 배송의 금지 시간대와 겹치지 않아야 합니다."}], "ir": "MINIMIZE( SUM(x0 in routes: fuel_cost(x0)) )\nEACH(x1 in routes): EACH(x2 in rounds(x1)): EACH(x3 in keys(load)): MAX(x4 in positions(x2): load[x3](x4)) <= capacity[x3](x1)\nEACH(x5 in routes): delivery_count(x5) <= 8\nEACH(x6 in visits): NOT OVERLAPS(service_interval(x6), prohibited_window(x6))", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [], "constraint_ref": "constraint:prohibited_time_window", "scope": null, "strength": {"kind": "soft", "weight": "1"}}, {"arguments": [{"slot_ref": "slot:capacity.exp_factor", "value": {"type": "decimal", "value": "1"}}], "constraint_ref": "constraint:capacity", "scope": null, "strength": {"kind": "hard"}}, {"arguments": [{"slot_ref": "slot:delivery_length.exp_factor", "value": {"type": "decimal", "value": "2"}}, {"slot_ref": "slot:delivery_length.max_size", "value": {"type": "decimal", "value": "8"}}], "constraint_ref": "constraint:delivery_length", "scope": null, "strength": {"kind": "soft", "weight": "1"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:fuel_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/multi", "episode_id": null} {"id": "v4/combo:routing:e7170ee691884419", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "모든 경로 총 소요시간 최소화, 경로마다 정류장 감싸는 최소 원 반경 반드시 5km 이하로"}], "ir": "MINIMIZE( SUM(x0 in routes: duration(x0)) )\n[HARD] EACH(x1 in routes): sec_radius(x1) <= 5 km", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:enclosing_circle_radius.exp_factor", "value": {"type": "decimal", "value": "2"}}, {"slot_ref": "slot:enclosing_circle_radius.max_radius", "value": {"type": "decimal", "value": "5000"}}], "constraint_ref": "constraint:enclosing_circle_radius", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:duration_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:8776876fd32488b7", "domain": "routing", "language": "mixed", "messages": [{"role": "user", "content": "전체 route의 총 소요시간(start부터 finish까지)을 최소화해 주시기 바랍니다. 단, 각 route의 stop들을 감싸는 최소 원의 반경은 반드시 5km 이하여야 합니다."}], "ir": "MINIMIZE( SUM(x0 in routes: duration(x0)) )\n[HARD] EACH(x1 in routes): sec_radius(x1) <= 5 km", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:enclosing_circle_radius.exp_factor", "value": {"type": "decimal", "value": "2"}}, {"slot_ref": "slot:enclosing_circle_radius.max_radius", "value": {"type": "decimal", "value": "5000"}}], "constraint_ref": "constraint:enclosing_circle_radius", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:duration_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null} {"id": "v4/combo:routing:55005d2d0e05a924", "domain": "routing", "language": "ko", "messages": [{"role": "user", "content": "모든 경로의 시작부터 끝까지 걸리는 시간을 전부 합친 걸 최소로 줄여줘. 그리고 경로마다 정류장들을 다 포함하는 가장 작은 원의 반지름은 무조건 5km 이하여야 해."}], "ir": "MINIMIZE( SUM(x0 in routes: duration(x0)) )\n[HARD] EACH(x1 in routes): sec_radius(x1) <= 5 km", "decision_kind": "execute", "gold_decision": {"constraints": [{"arguments": [{"slot_ref": "slot:enclosing_circle_radius.exp_factor", "value": {"type": "decimal", "value": "2"}}, {"slot_ref": "slot:enclosing_circle_radius.max_radius", "value": {"type": "decimal", "value": "5000"}}], "constraint_ref": "constraint:enclosing_circle_radius", "scope": null, "strength": {"kind": "hard"}}], "data_binding": {"overrides": [], "selections": []}, "kind": "execute", "objectives": {"method": "weighted_sum", "terms": [{"objective_ref": "objective:duration_cost", "weight": "1/1"}]}, "parameters": []}, "stratum": "v4/combo", "episode_id": null}