[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"skill:01M7C14QDM12TS0PBA94R1KSB4":3,"skill-same:01M7C14QDM12TS0PBA94R1KSB4":45},{"skillNo":4,"name":5,"nameZh":6,"description":7,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":12,"repositoryNo":13,"starsCount":14,"licenseSpdxId":15,"licenseFileUrl":6,"sourceHtmlUrl":16,"categories":17,"keywords":18,"publishedAt":19,"linkOnly":20,"markdownContent":21,"markdownBody":22,"frontMatter":23,"refName":24,"commitSha":25,"skillDirectory":26,"forksCount":27,"repositoryHtmlUrl":28,"repositoryHomepageUrl":6,"ownerHtmlUrl":29,"ownerBlogUrl":6,"ownerDescription":6,"updatedAt":30,"install":31,"resources":44},"01M7C14QDM12TS0PBA94R1KSB4","logistics-rules-to-optimization",null,"Translate logistics and operations rules into optimization variables and constraints. Use when an operations problem describes vehicles, routes, depots, pickups, dropoffs, inventory, capacity, assignments, time windows, service targets, penalties, resource limits, or other business rules that need to become an optimization model.","linyouxue\u002Fskill-repair-benchmark","linyouxue","https:\u002F\u002Favatars.githubusercontent.com\u002Fu\u002F216151464?v=4","01M7BJEVCXKD74KH6FG9CBVSQB","林宥学","01M7BJEVE02NP217V93BKZFC0J",0,"Apache-2.0","https:\u002F\u002Fgithub.com\u002Flinyouxue\u002Fskill-repair-benchmark\u002Fblob\u002Fmain\u002Fevaluation\u002Fresults\u002FSkillTTA-GPT52-Gold31-Local30-20260924\u002Ftasks\u002Fbike-rebalance\u002Frepaired_skill\u002Flogistics-rules-to-optimization\u002FSKILL.md",[],[],"2026-11-15 14:19:17",false,"---\nname: logistics-rules-to-optimization\ndescription: Translate logistics and operations rules into optimization variables and constraints. Use when an operations problem describes vehicles, routes, depots, pickups, dropoffs, inventory, capacity, assignments, time windows, service targets, penalties, resource limits, or other business rules that need to become an optimization model.\n---\n\n# Logistics Rules To Optimization\n\nUse this skill when the problem statement gives operational rules in words and the agent must turn them into an optimization model.\n\nThe goal is not only routing. The same translation pattern applies to transportation, dispatch, rebalancing, warehouse moves, staffing, scheduling, assignment, capacity planning, production, and service-level problems.\n\n## Rule Translation Workflow\n\n1. List the entities.\n   - Examples: vehicles, locations, depots, jobs, workers, machines, products, arcs, time periods.\n\n2. Choose the decision state.\n   - Binary variables for yes\u002Fno choices.\n   - Integer variables for counts, loads, inventory, units moved.\n   - Continuous variables for time, flow, cost, utilization, or fractional quantities.\n\n3. Convert each business rule into one of these patterns.\n   - Conservation: what enters equals what leaves, plus\u002Fminus changes.\n   - Capacity: quantity cannot exceed a limit.\n   - Linking: a quantity is allowed only if a binary decision is active.\n   - Assignment: exactly one, at most one, or at least one choice.\n   - Sequence: if one action follows another, update load\u002Ftime\u002Fstate.\n   - Compatibility: prohibit impossible combinations.\n   - Soft penalty: add slack for unmet demand or violation cost.\n\n4. Add the objective last.\n   - Keep named components such as travel cost, labor cost, inventory penalty, unmet demand penalty.\n\n5. Extract and independently validate the answer.\n   - Recompute routes, loads, assignments, inventory, penalties, and objective from the output data.\n\n## Variable Patterns\n\n### Selection and Assignment\n\nUse binary variables when an option is selected.\n\n```python\nx = {(i, j): model.addVar(vtype=\"B\", name=f\"x_{i}_{j}\") for i in I for j in J}\n```\n\nCommon rules:\n\n```python\n# each item i assigned to exactly one option j\nfor i in I:\n    model.addCons(quicksum(x[i, j] for j in J) == 1)\n\n# option j can handle at most capacity[j] items\nfor j in J:\n    model.addCons(quicksum(x[i, j] for i in I) \u003C= capacity[j])\n```\n\n### Route Arcs\n\nUse binary arc variables when the order of visits matters.\n\n```python\nx = {\n    (v, i, j): model.addVar(vtype=\"B\", name=f\"x_{v}_{i}_{j}\")\n    for v in vehicles\n    for i, j in arcs\n}\n```\n\nUse `x[v, i, j] = 1` to mean vehicle\u002Fresource `v` goes directly from node `i` to node `j`.\n\n### Visit Indicator\n\nDefine visit from route arcs instead of creating a second binary unless the model needs it repeatedly.\n\n```python\nvisit = quicksum(x[v, i, j] for j in to_nodes if j != i)\n```\n\nIf a standalone variable is useful:\n\n```python\nvisit = {(v, i): model.addVar(vtype=\"B\", name=f\"visit_{v}_{i}\") for v in vehicles for i in locations}\n\nfor v in vehicles:\n    for i in locations:\n        model.addCons(visit[v, i] == quicksum(x[v, i, j] for j in to_nodes if j != i))\n```\n\n### Quantity, Load, Inventory, and Time\n\n```python\nload = {(v, i): model.addVar(vtype=\"I\", lb=0, ub=vehicle_capacity, name=f\"load_{v}_{i}\") for v in vehicles for i in nodes}\nservice = {(v, i): model.addVar(vtype=\"I\", lb=-vehicle_capacity, ub=vehicle_capacity, name=f\"service_{v}_{i}\") for v in vehicles for i in locations}\ninventory = {(i, t): model.addVar(vtype=\"I\", lb=0, ub=storage_capacity[i], name=f\"inventory_{i}_{t}\") for i in locations for t in periods}\narrival = {(v, i): model.addVar(vtype=\"C\", lb=0, name=f\"arrival_{v}_{i}\") for v in vehicles for i in nodes}\n```\n\nUse integer variables for physical unit counts when the output must be integer-valued.\n\n## Common Logistics Rules\n\n| Business Rule | Variable Choice | Constraint Pattern |\n| --- | --- | --- |\n| Choose exactly one option | `x[i,j]` binary | `sum_j x[i,j] == 1` |\n| Choose at most one option | `x[i,j]` binary | `sum_j x[i,j] \u003C= 1` |\n| Open facility before assigning to it | `open[j]`, `assign[i,j]` binary | `assign[i,j] \u003C= open[j]` |\n| Resource capacity | quantity variable | `sum_i q[i,j] \u003C= capacity[j]` |\n| Quantity only if selected | `q[i]`, `use[i]` | `q[i] \u003C= M * use[i]` |\n| Fixed cost if used | `use[i]` binary | add `fixed_cost[i] * use[i]` to objective |\n| Mutually exclusive modes | mode binaries | `sum_m mode[i,m] \u003C= 1` |\n| Incompatible pair | two binaries | `x[a] + x[b] \u003C= 1` |\n| Demand must be met | flow\u002Fquantity | `supply_to[i] >= demand[i]` |\n| Demand may be unmet | nonnegative slack | `served[i] + unmet[i] >= demand[i]` |\n| Absolute deviation penalty | nonnegative slack | `actual-target \u003C= dev`, `target-actual \u003C= dev` |\n| Inventory balance | inventory variables | `inv[t+1] = inv[t] + inbound - outbound` |\n| Station\u002Fstorage upper bound | inventory variable | `inv[i,t] \u003C= capacity[i]` |\n| Cannot remove unavailable stock | move variable | `outbound[i,t] \u003C= inv[i,t]` |\n| Vehicle starts at depot | arc variables | `sum_j x[v, START, j] == use_vehicle[v]` |\n| Vehicle ends at depot | arc variables | `sum_i x[v, i, END] == use_vehicle[v]` |\n| Route continuity | arc variables | `incoming[v,i] == outgoing[v,i]` |\n| Visit at most once | arc variables | `outgoing[v,i] \u003C= 1` |\n| Split service allowed | arc\u002Fquantity variables | omit global single-visit; aggregate quantities over resources |\n| Time window | arrival variable | `earliest[i] \u003C= arrival[v,i] \u003C= latest[i]` when visited |\n| Travel time propagation | arc + arrival | `arrival[j] >= arrival[i] + service_time[i] + travel[i,j] - M(1-x[i,j])` |\n| Precedence | start\u002Farrival variables | `start[b] >= finish[a]` |\n| Route duration limit | arc variables | `sum travel[i,j] * x[v,i,j] \u003C= max_duration[v]` |\n\n## Constraint Examples\n\n### Capacity\n\n```python\nfor r in resources:\n    model.addCons(quicksum(amount[i, r] for i in items) \u003C= capacity[r])\n```\n\n### Quantity Allowed Only When Active\n\nUse the tightest possible `M`.\n\n```python\nfor i in items:\n    model.addCons(quantity[i] \u003C= upper_bound[i] * use[i])\n```\n\n### Soft Demand Satisfaction\n\n```python\nunmet = {i: model.addVar(vtype=\"I\", lb=0, name=f\"unmet_{i}\") for i in customers}\n\nfor i in customers:\n    model.addCons(served[i] + unmet[i] >= demand[i])\n\npenalty_cost = quicksum(penalty[i] * unmet[i] for i in customers)\n```\n\n### Absolute Target Deviation\n\nNever use Python `abs()` on solver expressions.\n\n```python\ndev = {i: model.addVar(vtype=\"C\", lb=0, name=f\"dev_{i}\") for i in items}\n\nfor i in items:\n    model.addCons(actual[i] - target[i] \u003C= dev[i])\n    model.addCons(target[i] - actual[i] \u003C= dev[i])\n```\n\n### Depot Start and End\n\nIf every vehicle must be used:\n\n```python\nfor v in vehicles:\n    model.addCons(quicksum(x[v, START, j] for j in locations) == 1)\n    model.addCons(quicksum(x[v, i, END] for i in locations) == 1)\n```\n\nIf vehicles are optional:\n\n```python\nuse_vehicle = {v: model.addVar(vtype=\"B\", name=f\"use_vehicle_{v}\") for v in vehicles}\n\nfor v in vehicles:\n    model.addCons(quicksum(x[v, START, j] for j in locations) == use_vehicle[v])\n    model.addCons(quicksum(x[v, i, END] for i in locations) == use_vehicle[v])\n```\n\n### Route Continuity and At-Most-Once Visits\n\n```python\nfor v in vehicles:\n    for i in locations:\n        incoming = quicksum(x[v, j, i] for j in from_nodes if j != i)\n        outgoing = quicksum(x[v, i, j] for j in to_nodes if j != i)\n\n        model.addCons(incoming == outgoing)\n        model.addCons(outgoing \u003C= 1)\n```\n\nThis means vehicle `v` visits location `i` no more than once. It does not prevent a different vehicle from also visiting `i`.\n\n### Global Single-Visit Rule\n\nUse only when the real rule forbids split service across vehicles\u002Fresources.\n\n```python\nfor i in locations:\n    model.addCons(\n        quicksum(x[v, i, j] for v in vehicles for j in to_nodes if j != i) \u003C= 1\n    )\n```\n\nDo not add this rule when a large pickup\u002Fdropoff target may need multiple vehicles.\n\n### Load or State Transition Along Selected Arcs\n\nIf `state[j] = state[i] + change[j]` when arc `(i, j)` is used:\n\n```python\nM = 2 * vehicle_capacity\n\nfor v in vehicles:\n    for i, j in arcs:\n        change_at_j = service[v, j] if isinstance(j, int) else 0\n        model.addCons(load[v, j] - load[v, i] - change_at_j \u003C= M * (1 - x[v, i, j]))\n        model.addCons(load[v, j] - load[v, i] - change_at_j >= -M * (1 - x[v, i, j]))\n```\n\nThis pattern works for load, arrival time, battery charge, inventory state, and other route-dependent state variables. Pick `M` from real variable bounds.\n\n### Time Windows\n\n```python\nfor v in vehicles:\n    for i in locations:\n        visit_i = quicksum(x[v, i, j] for j in to_nodes if j != i)\n        model.addCons(arrival[v, i] >= earliest[i] - horizon * (1 - visit_i))\n        model.addCons(arrival[v, i] \u003C= latest[i] + horizon * (1 - visit_i))\n\n    for i, j in arcs:\n        if j in locations:\n            model.addCons(\n                arrival[v, j] >= arrival[v, i] + service_time.get(i, 0) + travel_time[i, j] - horizon * (1 - x[v, i, j])\n            )\n```\n\n## Inventory Pickup\u002FDropoff Pattern\n\nFor rebalancing or material movement, define one signed service variable. Recommended convention:\n\n- `service[v, i] > 0`: pickup from location `i`, vehicle load increases, location inventory decreases.\n- `service[v, i] \u003C 0`: dropoff to location `i`, vehicle load decreases, location inventory increases.\n\n```python\nservice = {\n    (v, i): model.addVar(vtype=\"I\", lb=-vehicle_capacity, ub=vehicle_capacity, name=f\"service_{v}_{i}\")\n    for v in vehicles\n    for i in locations\n}\n\nfor v in vehicles:\n    for i in locations:\n        visit_i = quicksum(x[v, i, j] for j in to_nodes if j != i)\n        model.addCons(service[v, i] \u003C= vehicle_capacity * visit_i)\n        model.addCons(service[v, i] >= -vehicle_capacity * visit_i)\n\nfor i in locations:\n    net_change = quicksum(service[v, i] for v in vehicles)\n    free_space = storage_capacity[i] - initial_inventory[i]\n\n    model.addCons(net_change \u003C= initial_inventory[i])  # pickup cannot exceed stock\n    model.addCons(net_change >= -free_space)           # dropoff cannot exceed space\n```\n\nIf the target is a desired net pickup\u002Fdropoff:\n\n```python\nunmet = {i: model.addVar(vtype=\"I\", lb=0, name=f\"unmet_{i}\") for i in locations}\n\nfor i in locations:\n    net_change = quicksum(service[v, i] for v in vehicles)\n    model.addCons(net_change - target[i] \u003C= unmet[i])\n    model.addCons(target[i] - net_change \u003C= unmet[i])\n```\n\nExtract pickup\u002Fdropoff output as:\n\n```python\npicked_up = max(service_value, 0)\ndropped_off = max(-service_value, 0)\n```\n\n## Objective Assembly\n\nBuild named components:\n\n```python\ntravel_cost = quicksum(distance[i, j] * x[v, i, j] for v in vehicles for i, j in arcs)\nfixed_cost = quicksum(vehicle_fixed_cost[v] * use_vehicle[v] for v in vehicles)\npenalty_cost = quicksum(penalty[i] * unmet[i] for i in customers)\n\nmodel.setObjective(travel_cost + fixed_cost + penalty_cost, \"minimize\")\n```\n","# Logistics Rules To Optimization\n\nUse this skill when the problem statement gives operational rules in words and the agent must turn them into an optimization model.\n\nThe goal is not only routing. The same translation pattern applies to transportation, dispatch, rebalancing, warehouse moves, staffing, scheduling, assignment, capacity planning, production, and service-level problems.\n\n## Rule Translation Workflow\n\n1. List the entities.\n   - Examples: vehicles, locations, depots, jobs, workers, machines, products, arcs, time periods.\n\n2. Choose the decision state.\n   - Binary variables for yes\u002Fno choices.\n   - Integer variables for counts, loads, inventory, units moved.\n   - Continuous variables for time, flow, cost, utilization, or fractional quantities.\n\n3. Convert each business rule into one of these patterns.\n   - Conservation: what enters equals what leaves, plus\u002Fminus changes.\n   - Capacity: quantity cannot exceed a limit.\n   - Linking: a quantity is allowed only if a binary decision is active.\n   - Assignment: exactly one, at most one, or at least one choice.\n   - Sequence: if one action follows another, update load\u002Ftime\u002Fstate.\n   - Compatibility: prohibit impossible combinations.\n   - Soft penalty: add slack for unmet demand or violation cost.\n\n4. Add the objective last.\n   - Keep named components such as travel cost, labor cost, inventory penalty, unmet demand penalty.\n\n5. Extract and independently validate the answer.\n   - Recompute routes, loads, assignments, inventory, penalties, and objective from the output data.\n\n## Variable Patterns\n\n### Selection and Assignment\n\nUse binary variables when an option is selected.\n\n```python\nx = {(i, j): model.addVar(vtype=\"B\", name=f\"x_{i}_{j}\") for i in I for j in J}\n```\n\nCommon rules:\n\n```python\n# each item i assigned to exactly one option j\nfor i in I:\n    model.addCons(quicksum(x[i, j] for j in J) == 1)\n\n# option j can handle at most capacity[j] items\nfor j in J:\n    model.addCons(quicksum(x[i, j] for i in I) \u003C= capacity[j])\n```\n\n### Route Arcs\n\nUse binary arc variables when the order of visits matters.\n\n```python\nx = {\n    (v, i, j): model.addVar(vtype=\"B\", name=f\"x_{v}_{i}_{j}\")\n    for v in vehicles\n    for i, j in arcs\n}\n```\n\nUse `x[v, i, j] = 1` to mean vehicle\u002Fresource `v` goes directly from node `i` to node `j`.\n\n### Visit Indicator\n\nDefine visit from route arcs instead of creating a second binary unless the model needs it repeatedly.\n\n```python\nvisit = quicksum(x[v, i, j] for j in to_nodes if j != i)\n```\n\nIf a standalone variable is useful:\n\n```python\nvisit = {(v, i): model.addVar(vtype=\"B\", name=f\"visit_{v}_{i}\") for v in vehicles for i in locations}\n\nfor v in vehicles:\n    for i in locations:\n        model.addCons(visit[v, i] == quicksum(x[v, i, j] for j in to_nodes if j != i))\n```\n\n### Quantity, Load, Inventory, and Time\n\n```python\nload = {(v, i): model.addVar(vtype=\"I\", lb=0, ub=vehicle_capacity, name=f\"load_{v}_{i}\") for v in vehicles for i in nodes}\nservice = {(v, i): model.addVar(vtype=\"I\", lb=-vehicle_capacity, ub=vehicle_capacity, name=f\"service_{v}_{i}\") for v in vehicles for i in locations}\ninventory = {(i, t): model.addVar(vtype=\"I\", lb=0, ub=storage_capacity[i], name=f\"inventory_{i}_{t}\") for i in locations for t in periods}\narrival = {(v, i): model.addVar(vtype=\"C\", lb=0, name=f\"arrival_{v}_{i}\") for v in vehicles for i in nodes}\n```\n\nUse integer variables for physical unit counts when the output must be integer-valued.\n\n## Common Logistics Rules\n\n| Business Rule | Variable Choice | Constraint Pattern |\n| --- | --- | --- |\n| Choose exactly one option | `x[i,j]` binary | `sum_j x[i,j] == 1` |\n| Choose at most one option | `x[i,j]` binary | `sum_j x[i,j] \u003C= 1` |\n| Open facility before assigning to it | `open[j]`, `assign[i,j]` binary | `assign[i,j] \u003C= open[j]` |\n| Resource capacity | quantity variable | `sum_i q[i,j] \u003C= capacity[j]` |\n| Quantity only if selected | `q[i]`, `use[i]` | `q[i] \u003C= M * use[i]` |\n| Fixed cost if used | `use[i]` binary | add `fixed_cost[i] * use[i]` to objective |\n| Mutually exclusive modes | mode binaries | `sum_m mode[i,m] \u003C= 1` |\n| Incompatible pair | two binaries | `x[a] + x[b] \u003C= 1` |\n| Demand must be met | flow\u002Fquantity | `supply_to[i] >= demand[i]` |\n| Demand may be unmet | nonnegative slack | `served[i] + unmet[i] >= demand[i]` |\n| Absolute deviation penalty | nonnegative slack | `actual-target \u003C= dev`, `target-actual \u003C= dev` |\n| Inventory balance | inventory variables | `inv[t+1] = inv[t] + inbound - outbound` |\n| Station\u002Fstorage upper bound | inventory variable | `inv[i,t] \u003C= capacity[i]` |\n| Cannot remove unavailable stock | move variable | `outbound[i,t] \u003C= inv[i,t]` |\n| Vehicle starts at depot | arc variables | `sum_j x[v, START, j] == use_vehicle[v]` |\n| Vehicle ends at depot | arc variables | `sum_i x[v, i, END] == use_vehicle[v]` |\n| Route continuity | arc variables | `incoming[v,i] == outgoing[v,i]` |\n| Visit at most once | arc variables | `outgoing[v,i] \u003C= 1` |\n| Split service allowed | arc\u002Fquantity variables | omit global single-visit; aggregate quantities over resources |\n| Time window | arrival variable | `earliest[i] \u003C= arrival[v,i] \u003C= latest[i]` when visited |\n| Travel time propagation | arc + arrival | `arrival[j] >= arrival[i] + service_time[i] + travel[i,j] - M(1-x[i,j])` |\n| Precedence | start\u002Farrival variables | `start[b] >= finish[a]` |\n| Route duration limit | arc variables | `sum travel[i,j] * x[v,i,j] \u003C= max_duration[v]` |\n\n## Constraint Examples\n\n### Capacity\n\n```python\nfor r in resources:\n    model.addCons(quicksum(amount[i, r] for i in items) \u003C= capacity[r])\n```\n\n### Quantity Allowed Only When Active\n\nUse the tightest possible `M`.\n\n```python\nfor i in items:\n    model.addCons(quantity[i] \u003C= upper_bound[i] * use[i])\n```\n\n### Soft Demand Satisfaction\n\n```python\nunmet = {i: model.addVar(vtype=\"I\", lb=0, name=f\"unmet_{i}\") for i in customers}\n\nfor i in customers:\n    model.addCons(served[i] + unmet[i] >= demand[i])\n\npenalty_cost = quicksum(penalty[i] * unmet[i] for i in customers)\n```\n\n### Absolute Target Deviation\n\nNever use Python `abs()` on solver expressions.\n\n```python\ndev = {i: model.addVar(vtype=\"C\", lb=0, name=f\"dev_{i}\") for i in items}\n\nfor i in items:\n    model.addCons(actual[i] - target[i] \u003C= dev[i])\n    model.addCons(target[i] - actual[i] \u003C= dev[i])\n```\n\n### Depot Start and End\n\nIf every vehicle must be used:\n\n```python\nfor v in vehicles:\n    model.addCons(quicksum(x[v, START, j] for j in locations) == 1)\n    model.addCons(quicksum(x[v, i, END] for i in locations) == 1)\n```\n\nIf vehicles are optional:\n\n```python\nuse_vehicle = {v: model.addVar(vtype=\"B\", name=f\"use_vehicle_{v}\") for v in vehicles}\n\nfor v in vehicles:\n    model.addCons(quicksum(x[v, START, j] for j in locations) == use_vehicle[v])\n    model.addCons(quicksum(x[v, i, END] for i in locations) == use_vehicle[v])\n```\n\n### Route Continuity and At-Most-Once Visits\n\n```python\nfor v in vehicles:\n    for i in locations:\n        incoming = quicksum(x[v, j, i] for j in from_nodes if j != i)\n        outgoing = quicksum(x[v, i, j] for j in to_nodes if j != i)\n\n        model.addCons(incoming == outgoing)\n        model.addCons(outgoing \u003C= 1)\n```\n\nThis means vehicle `v` visits location `i` no more than once. It does not prevent a different vehicle from also visiting `i`.\n\n### Global Single-Visit Rule\n\nUse only when the real rule forbids split service across vehicles\u002Fresources.\n\n```python\nfor i in locations:\n    model.addCons(\n        quicksum(x[v, i, j] for v in vehicles for j in to_nodes if j != i) \u003C= 1\n    )\n```\n\nDo not add this rule when a large pickup\u002Fdropoff target may need multiple vehicles.\n\n### Load or State Transition Along Selected Arcs\n\nIf `state[j] = state[i] + change[j]` when arc `(i, j)` is used:\n\n```python\nM = 2 * vehicle_capacity\n\nfor v in vehicles:\n    for i, j in arcs:\n        change_at_j = service[v, j] if isinstance(j, int) else 0\n        model.addCons(load[v, j] - load[v, i] - change_at_j \u003C= M * (1 - x[v, i, j]))\n        model.addCons(load[v, j] - load[v, i] - change_at_j >= -M * (1 - x[v, i, j]))\n```\n\nThis pattern works for load, arrival time, battery charge, inventory state, and other route-dependent state variables. Pick `M` from real variable bounds.\n\n### Time Windows\n\n```python\nfor v in vehicles:\n    for i in locations:\n        visit_i = quicksum(x[v, i, j] for j in to_nodes if j != i)\n        model.addCons(arrival[v, i] >= earliest[i] - horizon * (1 - visit_i))\n        model.addCons(arrival[v, i] \u003C= latest[i] + horizon * (1 - visit_i))\n\n    for i, j in arcs:\n        if j in locations:\n            model.addCons(\n                arrival[v, j] >= arrival[v, i] + service_time.get(i, 0) + travel_time[i, j] - horizon * (1 - x[v, i, j])\n            )\n```\n\n## Inventory Pickup\u002FDropoff Pattern\n\nFor rebalancing or material movement, define one signed service variable. Recommended convention:\n\n- `service[v, i] > 0`: pickup from location `i`, vehicle load increases, location inventory decreases.\n- `service[v, i] \u003C 0`: dropoff to location `i`, vehicle load decreases, location inventory increases.\n\n```python\nservice = {\n    (v, i): model.addVar(vtype=\"I\", lb=-vehicle_capacity, ub=vehicle_capacity, name=f\"service_{v}_{i}\")\n    for v in vehicles\n    for i in locations\n}\n\nfor v in vehicles:\n    for i in locations:\n        visit_i = quicksum(x[v, i, j] for j in to_nodes if j != i)\n        model.addCons(service[v, i] \u003C= vehicle_capacity * visit_i)\n        model.addCons(service[v, i] >= -vehicle_capacity * visit_i)\n\nfor i in locations:\n    net_change = quicksum(service[v, i] for v in vehicles)\n    free_space = storage_capacity[i] - initial_inventory[i]\n\n    model.addCons(net_change \u003C= initial_inventory[i])  # pickup cannot exceed stock\n    model.addCons(net_change >= -free_space)           # dropoff cannot exceed space\n```\n\nIf the target is a desired net pickup\u002Fdropoff:\n\n```python\nunmet = {i: model.addVar(vtype=\"I\", lb=0, name=f\"unmet_{i}\") for i in locations}\n\nfor i in locations:\n    net_change = quicksum(service[v, i] for v in vehicles)\n    model.addCons(net_change - target[i] \u003C= unmet[i])\n    model.addCons(target[i] - net_change \u003C= unmet[i])\n```\n\nExtract pickup\u002Fdropoff output as:\n\n```python\npicked_up = max(service_value, 0)\ndropped_off = max(-service_value, 0)\n```\n\n## Objective Assembly\n\nBuild named components:\n\n```python\ntravel_cost = quicksum(distance[i, j] * x[v, i, j] for v in vehicles for i, j in arcs)\nfixed_cost = quicksum(vehicle_fixed_cost[v] * use_vehicle[v] for v in vehicles)\npenalty_cost = quicksum(penalty[i] * unmet[i] for i in customers)\n\nmodel.setObjective(travel_cost + fixed_cost + penalty_cost, \"minimize\")\n```\n",{"name":5,"description":7},"main","cdcb6d230f3b15c3c33f8a2bdd16439f43602cbe","evaluation\u002Fresults\u002FSkillTTA-GPT52-Gold31-Local30-20260924\u002Ftasks\u002Fbike-rebalance\u002Frepaired_skill\u002Flogistics-rules-to-optimization",1,"https:\u002F\u002Fgithub.com\u002Flinyouxue\u002Fskill-repair-benchmark","https:\u002F\u002Fgithub.com\u002Flinyouxue","2026-11-14 20:28:35",{"source":8,"skillName":5,"commands":32,"prompt":42,"zipAvailable":43},[33,36,39],{"tool":34,"command":35},"npx","npx skills add linyouxue\u002Fskill-repair-benchmark --skill logistics-rules-to-optimization",{"tool":37,"command":38},"bunx","bunx skills add linyouxue\u002Fskill-repair-benchmark --skill logistics-rules-to-optimization",{"tool":40,"command":41},"pnpm","pnpm dlx skills add linyouxue\u002Fskill-repair-benchmark --skill logistics-rules-to-optimization","安装技能，技能地址：https:\u002F\u002Fgithub.com\u002Flinyouxue\u002Fskill-repair-benchmark\u002Fblob\u002Fmain\u002Fevaluation\u002Fresults\u002FSkillTTA-GPT52-Gold31-Local30-20260924\u002Ftasks\u002Fbike-rebalance\u002Frepaired_skill\u002Flogistics-rules-to-optimization\u002FSKILL.md",true,[],[46,53,60,67,72,77],{"skillNo":47,"name":48,"nameZh":6,"description":49,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":12,"repositoryNo":13,"starsCount":14,"licenseSpdxId":15,"licenseFileUrl":6,"sourceHtmlUrl":50,"categories":51,"keywords":52,"publishedAt":19},"01M7E1HGVRY73NBJ022CJG13X6","video-frame-extraction","Extract frames from video files and save them as images using OpenCV","https:\u002F\u002Fgithub.com\u002Flinyouxue\u002Fskill-repair-benchmark\u002Fblob\u002Fmain\u002Fjpg-ocr-stat\u002Fresult\u002Fskilltta-claude4.7\u002Fgroup_03\u002Frun_03\u002Finputs\u002Fskills\u002Fvideo-frame-extraction\u002FSKILL.md",[],[],{"skillNo":54,"name":55,"nameZh":6,"description":56,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":12,"repositoryNo":13,"starsCount":14,"licenseSpdxId":15,"licenseFileUrl":6,"sourceHtmlUrl":57,"categories":58,"keywords":59,"publishedAt":19},"01M7E1HAG5R7CJ9C8NYJS771MB","openai-vision","Analyze images and multi-frame sequences using OpenAI GPT vision models","https:\u002F\u002Fgithub.com\u002Flinyouxue\u002Fskill-repair-benchmark\u002Fblob\u002Fmain\u002Fjpg-ocr-stat\u002Fresult\u002Fskilltta-claude4.7\u002Fgroup_03\u002Frun_03\u002Finputs\u002Fskills\u002Fopenai-vision\u002FSKILL.md",[],[],{"skillNo":61,"name":62,"nameZh":6,"description":63,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":12,"repositoryNo":13,"starsCount":14,"licenseSpdxId":15,"licenseFileUrl":6,"sourceHtmlUrl":64,"categories":65,"keywords":66,"publishedAt":19},"01M7E1H7DADKB6QBWKC2KQ63SZ","image-ocr","Extract text content from images using Tesseract OCR via Python, including structured field extraction from receipts and forms","https:\u002F\u002Fgithub.com\u002Flinyouxue\u002Fskill-repair-benchmark\u002Fblob\u002Fmain\u002Fjpg-ocr-stat\u002Fresult\u002Fskilltta-claude4.7\u002Fgroup_03\u002Frun_03\u002Finputs\u002Fskills\u002Fimage-ocr\u002FSKILL.md",[],[],{"skillNo":68,"name":48,"nameZh":6,"description":49,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":12,"repositoryNo":13,"starsCount":14,"licenseSpdxId":15,"licenseFileUrl":6,"sourceHtmlUrl":69,"categories":70,"keywords":71,"publishedAt":19},"01M7E1H0WBNT43TENGQY7AVZHD","https:\u002F\u002Fgithub.com\u002Flinyouxue\u002Fskill-repair-benchmark\u002Fblob\u002Fmain\u002Fjpg-ocr-stat\u002Fresult\u002Fskilltta-claude4.7\u002Fgroup_03\u002Frun_02\u002Finputs\u002Fskills\u002Fvideo-frame-extraction\u002FSKILL.md",[],[],{"skillNo":73,"name":55,"nameZh":6,"description":56,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":12,"repositoryNo":13,"starsCount":14,"licenseSpdxId":15,"licenseFileUrl":6,"sourceHtmlUrl":74,"categories":75,"keywords":76,"publishedAt":19},"01M7E1GTC7D4N4Q2EF03875J9E","https:\u002F\u002Fgithub.com\u002Flinyouxue\u002Fskill-repair-benchmark\u002Fblob\u002Fmain\u002Fjpg-ocr-stat\u002Fresult\u002Fskilltta-claude4.7\u002Fgroup_03\u002Frun_02\u002Finputs\u002Fskills\u002Fopenai-vision\u002FSKILL.md",[],[],{"skillNo":78,"name":62,"nameZh":6,"description":63,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":12,"repositoryNo":13,"starsCount":14,"licenseSpdxId":15,"licenseFileUrl":6,"sourceHtmlUrl":79,"categories":80,"keywords":81,"publishedAt":19},"01M7E1GQ92CWFMGH53KSSE4WER","https:\u002F\u002Fgithub.com\u002Flinyouxue\u002Fskill-repair-benchmark\u002Fblob\u002Fmain\u002Fjpg-ocr-stat\u002Fresult\u002Fskilltta-claude4.7\u002Fgroup_03\u002Frun_02\u002Finputs\u002Fskills\u002Fimage-ocr\u002FSKILL.md",[],[]]