[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"skill:01M7BTRCS5WY2F23AP1VQERHC0":3,"skill-same:01M7BTRCS5WY2F23AP1VQERHC0":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},"01M7BTRCS5WY2F23AP1VQERHC0","logistics-rules-to-optimization",null,"Translate rebalancing business rules (routing + pickup\u002Fdropoff + inventory + unmet-target penalty) into a consistent MIP formulation and extract a reportable solution.","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\u002FMMG2Skill-GPT52-Gold31-20260923\u002Ftasks\u002Fbike-rebalance\u002Frepaired_run\u002Finputs\u002Fskills\u002Flogistics-rules-to-optimization\u002FSKILL.md",[],[],"2026-11-15 14:19:17",false,"---\nname: logistics-rules-to-optimization\ndescription: Translate rebalancing business rules (routing + pickup\u002Fdropoff + inventory\n  + unmet-target penalty) into a consistent MIP formulation and extract a reportable\n  solution.\n---\n\n## Steps\n1. Enumerate entities and sets: vehicles `K`, stations `N`, depot start\u002Fend nodes, and routing arcs.\n2. Choose variables consistent with the rules:\n   - `x[v,i,j] ∈ {0,1}` for route arcs\n   - `service[v,i] ∈ Z` (signed): `>0` pickup, `\u003C0` dropoff, `=0` no service\n   - `load[v,node] ∈ Z` bounded in `[0, vehicle_capacity]`\n   - `unmet[i] ≥ 0` for absolute deviation from station `net_rebalancing_target`\n3. Add routing feasibility constraints:\n   - each vehicle leaves `depot_start` once and enters `depot_end` once (vehicles must be used)\n   - continuity at each station: in-degree = out-degree per vehicle\n   - per-vehicle “visit at most once”: out-degree at a station ≤ 1\n4. Link service to visiting and enforce “no pickup and drop at the same stop” by using a *single signed* `service[v,i]` and bounding it to zero when not visited:\n   - `-cap * visit[v,i] ≤ service[v,i] ≤ cap * visit[v,i]`\n5. Enforce load propagation along selected arcs with big‑M:\n   - `load[v,j] = load[v,i] + service[v,j]` when arc `(i→j)` is used (treat depot change as 0)\n   - keep all loads within `[0, vehicle_capacity]`, including start and end loads\n6. Enforce station inventory feasibility (hard bounds), using aggregated station net change:\n   - `net_change[i] = Σ_v service[v,i]`\n   - pickup limit: `net_change[i] ≤ initial_bikes[i]`\n   - dropoff limit: `net_change[i] ≥ -(station_capacity[i] - initial_bikes[i])`\n   These bounds correctly handle structurally impossible targets (e.g., pickup target exceeding available bikes) by limiting achievable service.\n7. Model unmet rebalancing with absolute deviation linearization:\n   - `net_change[i] - target[i] ≤ unmet[i]`\n   - `target[i] - net_change[i] ≤ unmet[i]`\n   - penalty term: `penalty_weight * Σ_i unmet[i]`\n8. Objective: minimize `total_travel_distance + unmet_penalty`.\n9. Extract a reportable solution:\n   - reconstruct each vehicle’s ordered route from selected arcs (and ensure it is a single depot→…→depot path)\n   - per stop, output either `bikes_picked_up=max(service,0)` or `bikes_dropped_off=max(-service,0)`, and compute `load_after_stop`\n   - station section must include **every station** with totals, `net_bike_change`, and `unmet_rebalancing_amount = abs(target - net_bike_change)`.\n## Expected Result\nA solution that satisfies all hard routing\u002Fload\u002Finventory rules, allows unavoidable target shortfalls via `unmet` penalties when targets exceed physical bounds, and supports direct construction of the required `report.json` station\u002Fvehicle summaries.\n","## Steps\n1. Enumerate entities and sets: vehicles `K`, stations `N`, depot start\u002Fend nodes, and routing arcs.\n2. Choose variables consistent with the rules:\n   - `x[v,i,j] ∈ {0,1}` for route arcs\n   - `service[v,i] ∈ Z` (signed): `>0` pickup, `\u003C0` dropoff, `=0` no service\n   - `load[v,node] ∈ Z` bounded in `[0, vehicle_capacity]`\n   - `unmet[i] ≥ 0` for absolute deviation from station `net_rebalancing_target`\n3. Add routing feasibility constraints:\n   - each vehicle leaves `depot_start` once and enters `depot_end` once (vehicles must be used)\n   - continuity at each station: in-degree = out-degree per vehicle\n   - per-vehicle “visit at most once”: out-degree at a station ≤ 1\n4. Link service to visiting and enforce “no pickup and drop at the same stop” by using a *single signed* `service[v,i]` and bounding it to zero when not visited:\n   - `-cap * visit[v,i] ≤ service[v,i] ≤ cap * visit[v,i]`\n5. Enforce load propagation along selected arcs with big‑M:\n   - `load[v,j] = load[v,i] + service[v,j]` when arc `(i→j)` is used (treat depot change as 0)\n   - keep all loads within `[0, vehicle_capacity]`, including start and end loads\n6. Enforce station inventory feasibility (hard bounds), using aggregated station net change:\n   - `net_change[i] = Σ_v service[v,i]`\n   - pickup limit: `net_change[i] ≤ initial_bikes[i]`\n   - dropoff limit: `net_change[i] ≥ -(station_capacity[i] - initial_bikes[i])`\n   These bounds correctly handle structurally impossible targets (e.g., pickup target exceeding available bikes) by limiting achievable service.\n7. Model unmet rebalancing with absolute deviation linearization:\n   - `net_change[i] - target[i] ≤ unmet[i]`\n   - `target[i] - net_change[i] ≤ unmet[i]`\n   - penalty term: `penalty_weight * Σ_i unmet[i]`\n8. Objective: minimize `total_travel_distance + unmet_penalty`.\n9. Extract a reportable solution:\n   - reconstruct each vehicle’s ordered route from selected arcs (and ensure it is a single depot→…→depot path)\n   - per stop, output either `bikes_picked_up=max(service,0)` or `bikes_dropped_off=max(-service,0)`, and compute `load_after_stop`\n   - station section must include **every station** with totals, `net_bike_change`, and `unmet_rebalancing_amount = abs(target - net_bike_change)`.\n## Expected Result\nA solution that satisfies all hard routing\u002Fload\u002Finventory rules, allows unavoidable target shortfalls via `unmet` penalties when targets exceed physical bounds, and supports direct construction of the required `report.json` station\u002Fvehicle summaries.\n",{"name":5,"description":7},"main","cdcb6d230f3b15c3c33f8a2bdd16439f43602cbe","evaluation\u002Fresults\u002FMMG2Skill-GPT52-Gold31-20260923\u002Ftasks\u002Fbike-rebalance\u002Frepaired_run\u002Finputs\u002Fskills\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\u002FMMG2Skill-GPT52-Gold31-20260923\u002Ftasks\u002Fbike-rebalance\u002Frepaired_run\u002Finputs\u002Fskills\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",[],[]]