[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"skill:01M7APFT8C2GY3AP4T02FGVHBW":3,"skill-same:01M7APFT8C2GY3AP4T02FGVHBW":48},{"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":29,"ownerHtmlUrl":30,"ownerBlogUrl":31,"ownerDescription":32,"updatedAt":33,"install":34,"resources":47},"01M7APFT8C2GY3AP4T02FGVHBW","logistics-inventory-forecasting-operations-and-solvers",null,"Use when the surrounding system matters as much as the algorithm: inventory policy and safety stock, forecasting and its error measures, the vendor and product landscape, warehouse operations including slotting and picking, last-mile delivery, the data layer that decides most project outcomes, dynamic and stochastic problems including re-optimization, and the solver and tooling options.","the-vibey-project\u002Fvibey","the-vibey-project","https:\u002F\u002Favatars.githubusercontent.com\u002Fu\u002F329298758?v=4","01M7AJHGZ9722CTJ4JNQZVRH0Q","the vibey project","01M7AJHGZVMG2K7TGXQ6XFHVG3",5,"MIT","https:\u002F\u002Fgithub.com\u002Fthe-vibey-project\u002Fvibey\u002Fblob\u002Fdevelop\u002Fsrc\u002Fvibey_tools\u002Fskills\u002Fplugins\u002Flogistics-software-optimization\u002Fskills\u002Flogistics-inventory-forecasting-operations-and-solvers\u002FSKILL.md",[],[],"2026-11-15 14:19:17",false,"---\nname: logistics-inventory-forecasting-operations-and-solvers\ndescription: \"Use when the surrounding system matters as much as the algorithm: inventory policy and safety stock, forecasting and its error measures, the vendor and product landscape, warehouse operations including slotting and picking, last-mile delivery, the data layer that decides most project outcomes, dynamic and stochastic problems including re-optimization, and the solver and tooling options.\"\n---\n\n# Logistics and Optimization Software: Inventory, Forecasting, Warehouse and Last-Mile Operations, Data, Stochastic Problems, and Solvers\n\n> **Part 4 of 5** of the *Logistics and Optimization Software* reference (plugin `logistics-software-optimization`), covering §17–§24. Sibling skills: `logistics-why-projects-fail-complexity-and-modeling` (§0–§5), `logistics-constraint-programming-metaheuristics-and-bounds` (§6–§9), `logistics-routing-packing-scheduling-and-network-design` (§10–§16), `logistics-reference` (§25–§31). Section numbers are shared across the set; a reference written as §N → `skill` points into that sibling skill.\n>\n> **Currency:** The algorithms and complexity results are permanent. Two areas are live. See §25 → `logistics-reference` for the solver landscape and the quantum and AI optimization claims.\n\n> **⚠️ Scope.** For engineers building or integrating logistics systems. Complements a\n> data-engineering reference (pipelines), an operations reference (process), and a\n> business reference (unit economics).\n>\n> **⚠️ GOTCHA** boxes mark things that sink projects or silently produce wrong answers.\n>\n> **The three ideas that organize this document:**\n> 1. **⚠️ Optimization projects almost never fail on the algorithm.** **They fail on data\n>    quality, on constraints nobody told you about, and on solutions the drivers refuse to\n>    run** (§1 → `logistics-why-projects-fail-complexity-and-modeling`). **The maths is the easy part and it is not where your time goes.**\n> 2. **⚠️ NP-hard does not mean unsolvable — it means no guaranteed-fast exact method.**\n>    **Real instances with tens of thousands of stops are solved to within a few percent\n>    of optimal every night by well-engineered heuristics** (§2 → `logistics-why-projects-fail-complexity-and-modeling`, §8 → `logistics-constraint-programming-metaheuristics-and-bounds`).\n> 3. **⚠️ A 2% better solution that operations won't execute is worth 0%.** **Stability,\n>    explainability and consistency with yesterday's plan routinely matter more than the\n>    objective value** (§1 → `logistics-why-projects-fail-complexity-and-modeling`, §26 → `logistics-reference`).\n\n---\n\n## §17. Inventory\n\n```\nEOQ            ⚠️ the classic square-root formula. Assumptions rarely hold,\n   and it's still a useful order-of-magnitude sanity check\n⚠️ NEWSVENDOR  single period, stochastic demand. Optimal service level =\n   Cu \u002F (Cu + Co) — underage cost over total. ⚠️ THE key insight: your\n   service level should follow from the COST ASYMMETRY, not from a target\n   somebody picked\n(s,S) \u002F (R,Q)  reorder point policies\nSAFETY STOCK   ⚠️ ≈ z · σ_demand-over-lead-time. Note it scales with the\n   square root of lead time — ⚠️ so REDUCING LEAD TIME VARIABILITY beats\n   reducing average lead time, usually by a lot\nMULTI-ECHELON  ⚠️ where to hold stock across a network. Risk pooling:\n   consolidated inventory needs less safety stock for the same service\n   level, scaling with √n\nABC \u002F XYZ      segmentation by value and by variability\n```\n> **⚠️ GOTCHA — the bullwhip effect is a structural property, not a forecasting failure.**\n> ⚠️ **Demand variability amplifies up the supply chain because of order batching, lead\n> time, price promotions and rationing behaviour** — **it arises from the STRUCTURE even\n> with rational actors.** **You mitigate it with information sharing and shorter lead\n> times, not with better local forecasts.**\n\n---\n\n## §18. Forecasting\n\n**⚠️ Keep expectations calibrated: for intermittent, lumpy SKU-level demand, sophisticated\nmethods frequently fail to beat simple ones.**\n**Methods**: **moving average, exponential smoothing \u002F Holt-Winters, ARIMA, Croston's\nmethod (⚠️ specifically for intermittent demand), gradient boosting on engineered\nfeatures, and hierarchical reconciliation (⚠️ forecast at multiple levels and reconcile so\nthey sum consistently).**\n**⚠️ The M-competitions are the honest benchmark literature here**, **and the recurring\nfinding is that simple methods and combinations are extremely hard to beat**, ⚠️ **with ML\nmethods winning mainly where there is cross-series structure to exploit.**\n**⚠️ Forecast accuracy metrics**: **MAPE (⚠️ breaks on zeros and is asymmetric — a real\nproblem for intermittent demand), MASE (⚠️ better), RMSE, bias.** ⚠️ **Track BIAS\nseparately from accuracy — a consistently biased forecast is a systematically\nmis-stocked warehouse, and it's invisible in symmetric error metrics.**\n\n---\n\n# PART III — SYSTEMS\n\n---\n\n## §19. The Landscape\n\n```\nERP    the system of record — orders, inventory, finance\nOMS    order management, allocation, sourcing decisions\n⚠️ WMS warehouse management — receiving, putaway, picking, packing, shipping\n⚠️ TMS transportation management — planning, tendering, execution, freight audit\nYMS    yard management — trailers, docks, gates\nWES\u002FWCS  execution\u002Fcontrol — the real-time layer talking to conveyors,\n       sorters and robots\nLMD    last-mile delivery platforms, driver apps, customer tracking\n```\n**⚠️ The integration reality**: **these are usually different vendors with different data\nmodels, and the join keys don't line up.** ⚠️ **EDI (X12\u002FEDIFACT) remains pervasive in\nfreight** — **214 shipment status, 204 load tender, 990 response, 210 invoice** — **and\nAPI-first carriers coexist with partners who will only do EDI over an SFTP drop.**\n**⚠️ Budget for the integration layer as a first-class component**; **in most logistics\nprojects it is larger than the optimization component.**\n\n---\n\n## §20. Warehouse Operations\n\n**⚠️ Travel time dominates manual picking** — **commonly cited as roughly half of picker\ntime** — **so most warehouse optimization is really travel reduction.**\n```\nSLOTTING       ⚠️ put fast movers near dispatch; account for ergonomics\n               (golden zone) and for affinity (items ordered together)\nPICK PATH      ⚠️ TSP on the warehouse graph. S-shape and return heuristics\n               are common and near-optimal for simple layouts\nBATCHING       ⚠️ pick multiple orders per trip — usually the single biggest\n               travel win available\nZONING         pick-and-pass vs pick-and-sort\nWAVE vs WAVELESS  ⚠️ batched release vs continuous flow\nGOODS-TO-PERSON   ⚠️ AS\u002FRS, shuttles, AMRs — inverts the problem: now you\n               optimize robot fleet movement and storage assignment instead\n```\n**⚠️ Labour standards and ergonomics are constraints, not preferences** — **and an\noptimizer that maximizes picks per hour without them produces injury rates and turnover\nthat cost more than the throughput gained.**\n\n---\n\n## §21. Last Mile\n\n**⚠️ The most expensive segment — commonly cited as a large share of total delivery cost —\nand the most constrained.**\n**Key issues**: **failed first delivery attempts** (⚠️ **each retry is close to a full\nadditional delivery cost, which is why access codes, safe-place instructions and\nnotification quality have outsized ROI**), **time window promises vs cost** (⚠️ **narrow\nwindows are extremely expensive; letting customers self-select from optimizer-suggested\nwindows is far cheaper than accepting arbitrary ones**), **parking and access reality that\nno routing model captures, gig vs employed fleets, lockers and pickup points, and returns\nas a first-class flow rather than an exception.**\n**⚠️ Service time is where routing plans die.** ⚠️ **Modeling every stop at a flat 3\nminutes when apartment buildings take 12 produces a plan that is an hour behind by\nmidday.** **Measure actual service times per stop type and per location, and feed the\ndistribution back** (§22).\n\n---\n\n## §22. ⚠️ Data\n\n**⚠️ Where the projects actually live or die.**\n```\n⚠️ ADDRESSES     unstructured, misspelled, ambiguous, missing units.\n   ⚠️ Geocoding returns a point that may be a street centroid, a rooftop,\n   or the middle of a postcode — and the QUALITY FLAG matters more than\n   the coordinate. Rooftop vs interpolated is the difference between\n   arriving and circling\n⚠️ ROAD NETWORKS OSM, HERE, TomTom. Turn restrictions, one-ways, height\n   and weight limits, seasonal closures\n⚠️ DISTANCE MATRIX  n² entries. ⚠️ THE dominant cost and latency issue at scale\nTRAVEL TIME     ⚠️ time-dependent, and asymmetric — A→B ≠ B→A\n⚠️ SERVICE TIME  measure it; don't assume it (§21)\nMASTER DATA     ⚠️ vehicle capacities, driver skills, customer constraints.\n   Usually stale, and nobody owns it\n```\n> **⚠️ GOTCHA — the distance matrix is the hidden scaling wall.** ⚠️ **1,000 stops = a\n> million matrix entries; 10,000 stops = 100 million.** **Commercial matrix APIs charge\n> per element and rate-limit, so a naive nightly full-matrix rebuild is both slow and\n> expensive.**\n> **⚠️ The mitigations**: **self-host a routing engine (OSRM, Valhalla, GraphHopper) —\n> which turns a per-element cost into a fixed server cost**; **compute only the k-nearest\n> neighbours per stop, since a good solution never uses most of the matrix**;\n> **cache aggressively — road networks change slowly**; **and ⚠️ use haversine distance\n> for early filtering and clustering, never for the final plan.**\n\n**⚠️ And a warning about the cheap shortcut**: **straight-line distance times a fudge\nfactor is fine for clustering and wrong for planning.** ⚠️ **The error is not uniform —\nit's worst exactly where geography constrains routing (rivers, motorways, one-way\nsystems), which is precisely where your plan will fail.**\n\n---\n\n## §23. Dynamic and Stochastic\n\n**⚠️ Real logistics is not a static problem solved once.**\n```\nDYNAMIC       ⚠️ orders arrive during execution; vehicles are en route\nSTOCHASTIC    ⚠️ travel times, service times and demand are random variables\nONLINE        ⚠️ decide without knowing the future. Competitive ratio analysis\nROLLING HORIZON  ⚠️ re-optimize periodically over a moving window. THE\n   standard practical approach\n```\n**Techniques**: **rolling-horizon re-optimization; scenario-based stochastic programming;\nsample average approximation; robust optimization (⚠️ optimize the worst case — often too\nconservative for logistics); chance constraints; and reinforcement learning\n(⚠️ genuinely promising for dispatch-style sequential decisions, and much harder to\nvalidate and deploy than the literature implies).**\n**⚠️ The practical patterns that matter more than the theory:**\n- ⚠️ **Buffer time in the plan.** **A plan with zero slack fails on the first delay and\n  cascades.**\n- ⚠️ **Re-optimize on a schedule AND on trigger events**, **not continuously — continuous\n  re-optimization destabilizes the plan** (§1 → `logistics-why-projects-fail-complexity-and-modeling`).\n- ⚠️ **Freeze a near horizon.** **Don't change what a driver is doing in the next 30\n  minutes.** **This is both operationally necessary and a large search-space reduction.**\n- **Anticipate rather than react where you can** — **positioning idle capacity toward\n  expected demand.**\n\n---\n\n## §24. Solvers and Tooling\n\n```\nCOMMERCIAL MIP   ⚠️ Gurobi · IBM CPLEX · FICO Xpress · COPT (§25.1)\nOPEN SOURCE MIP  ⚠️ HiGHS (the current default) · SCIP (excellent, check\n                 licence terms) · CBC (older, slower)\nCP               ⚠️ OR-Tools CP-SAT (outstanding, free) · IBM CP Optimizer\nROUTING          ⚠️ OR-Tools routing library · VROOM (open source, fast) ·\n                 jsprit · commercial routing engines\nMODELING LAYERS  ⚠️ Pyomo · PuLP · JuMP (Julia) · AMPL\u002FGAMS · linopy\nROAD ROUTING     ⚠️ OSRM · Valhalla · GraphHopper (self-host; §22)\nFIRST-ORDER\u002FGPU  ⚠️ PDLP and cuPDLP — GPU LP for very large instances (§25.1)\n```\n**⚠️ Sensible defaults for a team starting out**: **OR-Tools for routing and scheduling\n(free, well-documented, genuinely good); HiGHS for LP\u002FMIP; a self-hosted OSRM for\ndistances; Pyomo or JuMP if you want solver portability.** ⚠️ **Buy a commercial MIP\nlicence when you have demonstrated that solve time is your binding constraint — and not\nbefore, because §1 → `logistics-why-projects-fail-complexity-and-modeling` says it usually isn't.**\n","# Logistics and Optimization Software: Inventory, Forecasting, Warehouse and Last-Mile Operations, Data, Stochastic Problems, and Solvers\n\n> **Part 4 of 5** of the *Logistics and Optimization Software* reference (plugin `logistics-software-optimization`), covering §17–§24. Sibling skills: `logistics-why-projects-fail-complexity-and-modeling` (§0–§5), `logistics-constraint-programming-metaheuristics-and-bounds` (§6–§9), `logistics-routing-packing-scheduling-and-network-design` (§10–§16), `logistics-reference` (§25–§31). Section numbers are shared across the set; a reference written as §N → `skill` points into that sibling skill.\n>\n> **Currency:** The algorithms and complexity results are permanent. Two areas are live. See §25 → `logistics-reference` for the solver landscape and the quantum and AI optimization claims.\n\n> **⚠️ Scope.** For engineers building or integrating logistics systems. Complements a\n> data-engineering reference (pipelines), an operations reference (process), and a\n> business reference (unit economics).\n>\n> **⚠️ GOTCHA** boxes mark things that sink projects or silently produce wrong answers.\n>\n> **The three ideas that organize this document:**\n> 1. **⚠️ Optimization projects almost never fail on the algorithm.** **They fail on data\n>    quality, on constraints nobody told you about, and on solutions the drivers refuse to\n>    run** (§1 → `logistics-why-projects-fail-complexity-and-modeling`). **The maths is the easy part and it is not where your time goes.**\n> 2. **⚠️ NP-hard does not mean unsolvable — it means no guaranteed-fast exact method.**\n>    **Real instances with tens of thousands of stops are solved to within a few percent\n>    of optimal every night by well-engineered heuristics** (§2 → `logistics-why-projects-fail-complexity-and-modeling`, §8 → `logistics-constraint-programming-metaheuristics-and-bounds`).\n> 3. **⚠️ A 2% better solution that operations won't execute is worth 0%.** **Stability,\n>    explainability and consistency with yesterday's plan routinely matter more than the\n>    objective value** (§1 → `logistics-why-projects-fail-complexity-and-modeling`, §26 → `logistics-reference`).\n\n---\n\n## §17. Inventory\n\n```\nEOQ            ⚠️ the classic square-root formula. Assumptions rarely hold,\n   and it's still a useful order-of-magnitude sanity check\n⚠️ NEWSVENDOR  single period, stochastic demand. Optimal service level =\n   Cu \u002F (Cu + Co) — underage cost over total. ⚠️ THE key insight: your\n   service level should follow from the COST ASYMMETRY, not from a target\n   somebody picked\n(s,S) \u002F (R,Q)  reorder point policies\nSAFETY STOCK   ⚠️ ≈ z · σ_demand-over-lead-time. Note it scales with the\n   square root of lead time — ⚠️ so REDUCING LEAD TIME VARIABILITY beats\n   reducing average lead time, usually by a lot\nMULTI-ECHELON  ⚠️ where to hold stock across a network. Risk pooling:\n   consolidated inventory needs less safety stock for the same service\n   level, scaling with √n\nABC \u002F XYZ      segmentation by value and by variability\n```\n> **⚠️ GOTCHA — the bullwhip effect is a structural property, not a forecasting failure.**\n> ⚠️ **Demand variability amplifies up the supply chain because of order batching, lead\n> time, price promotions and rationing behaviour** — **it arises from the STRUCTURE even\n> with rational actors.** **You mitigate it with information sharing and shorter lead\n> times, not with better local forecasts.**\n\n---\n\n## §18. Forecasting\n\n**⚠️ Keep expectations calibrated: for intermittent, lumpy SKU-level demand, sophisticated\nmethods frequently fail to beat simple ones.**\n**Methods**: **moving average, exponential smoothing \u002F Holt-Winters, ARIMA, Croston's\nmethod (⚠️ specifically for intermittent demand), gradient boosting on engineered\nfeatures, and hierarchical reconciliation (⚠️ forecast at multiple levels and reconcile so\nthey sum consistently).**\n**⚠️ The M-competitions are the honest benchmark literature here**, **and the recurring\nfinding is that simple methods and combinations are extremely hard to beat**, ⚠️ **with ML\nmethods winning mainly where there is cross-series structure to exploit.**\n**⚠️ Forecast accuracy metrics**: **MAPE (⚠️ breaks on zeros and is asymmetric — a real\nproblem for intermittent demand), MASE (⚠️ better), RMSE, bias.** ⚠️ **Track BIAS\nseparately from accuracy — a consistently biased forecast is a systematically\nmis-stocked warehouse, and it's invisible in symmetric error metrics.**\n\n---\n\n# PART III — SYSTEMS\n\n---\n\n## §19. The Landscape\n\n```\nERP    the system of record — orders, inventory, finance\nOMS    order management, allocation, sourcing decisions\n⚠️ WMS warehouse management — receiving, putaway, picking, packing, shipping\n⚠️ TMS transportation management — planning, tendering, execution, freight audit\nYMS    yard management — trailers, docks, gates\nWES\u002FWCS  execution\u002Fcontrol — the real-time layer talking to conveyors,\n       sorters and robots\nLMD    last-mile delivery platforms, driver apps, customer tracking\n```\n**⚠️ The integration reality**: **these are usually different vendors with different data\nmodels, and the join keys don't line up.** ⚠️ **EDI (X12\u002FEDIFACT) remains pervasive in\nfreight** — **214 shipment status, 204 load tender, 990 response, 210 invoice** — **and\nAPI-first carriers coexist with partners who will only do EDI over an SFTP drop.**\n**⚠️ Budget for the integration layer as a first-class component**; **in most logistics\nprojects it is larger than the optimization component.**\n\n---\n\n## §20. Warehouse Operations\n\n**⚠️ Travel time dominates manual picking** — **commonly cited as roughly half of picker\ntime** — **so most warehouse optimization is really travel reduction.**\n```\nSLOTTING       ⚠️ put fast movers near dispatch; account for ergonomics\n               (golden zone) and for affinity (items ordered together)\nPICK PATH      ⚠️ TSP on the warehouse graph. S-shape and return heuristics\n               are common and near-optimal for simple layouts\nBATCHING       ⚠️ pick multiple orders per trip — usually the single biggest\n               travel win available\nZONING         pick-and-pass vs pick-and-sort\nWAVE vs WAVELESS  ⚠️ batched release vs continuous flow\nGOODS-TO-PERSON   ⚠️ AS\u002FRS, shuttles, AMRs — inverts the problem: now you\n               optimize robot fleet movement and storage assignment instead\n```\n**⚠️ Labour standards and ergonomics are constraints, not preferences** — **and an\noptimizer that maximizes picks per hour without them produces injury rates and turnover\nthat cost more than the throughput gained.**\n\n---\n\n## §21. Last Mile\n\n**⚠️ The most expensive segment — commonly cited as a large share of total delivery cost —\nand the most constrained.**\n**Key issues**: **failed first delivery attempts** (⚠️ **each retry is close to a full\nadditional delivery cost, which is why access codes, safe-place instructions and\nnotification quality have outsized ROI**), **time window promises vs cost** (⚠️ **narrow\nwindows are extremely expensive; letting customers self-select from optimizer-suggested\nwindows is far cheaper than accepting arbitrary ones**), **parking and access reality that\nno routing model captures, gig vs employed fleets, lockers and pickup points, and returns\nas a first-class flow rather than an exception.**\n**⚠️ Service time is where routing plans die.** ⚠️ **Modeling every stop at a flat 3\nminutes when apartment buildings take 12 produces a plan that is an hour behind by\nmidday.** **Measure actual service times per stop type and per location, and feed the\ndistribution back** (§22).\n\n---\n\n## §22. ⚠️ Data\n\n**⚠️ Where the projects actually live or die.**\n```\n⚠️ ADDRESSES     unstructured, misspelled, ambiguous, missing units.\n   ⚠️ Geocoding returns a point that may be a street centroid, a rooftop,\n   or the middle of a postcode — and the QUALITY FLAG matters more than\n   the coordinate. Rooftop vs interpolated is the difference between\n   arriving and circling\n⚠️ ROAD NETWORKS OSM, HERE, TomTom. Turn restrictions, one-ways, height\n   and weight limits, seasonal closures\n⚠️ DISTANCE MATRIX  n² entries. ⚠️ THE dominant cost and latency issue at scale\nTRAVEL TIME     ⚠️ time-dependent, and asymmetric — A→B ≠ B→A\n⚠️ SERVICE TIME  measure it; don't assume it (§21)\nMASTER DATA     ⚠️ vehicle capacities, driver skills, customer constraints.\n   Usually stale, and nobody owns it\n```\n> **⚠️ GOTCHA — the distance matrix is the hidden scaling wall.** ⚠️ **1,000 stops = a\n> million matrix entries; 10,000 stops = 100 million.** **Commercial matrix APIs charge\n> per element and rate-limit, so a naive nightly full-matrix rebuild is both slow and\n> expensive.**\n> **⚠️ The mitigations**: **self-host a routing engine (OSRM, Valhalla, GraphHopper) —\n> which turns a per-element cost into a fixed server cost**; **compute only the k-nearest\n> neighbours per stop, since a good solution never uses most of the matrix**;\n> **cache aggressively — road networks change slowly**; **and ⚠️ use haversine distance\n> for early filtering and clustering, never for the final plan.**\n\n**⚠️ And a warning about the cheap shortcut**: **straight-line distance times a fudge\nfactor is fine for clustering and wrong for planning.** ⚠️ **The error is not uniform —\nit's worst exactly where geography constrains routing (rivers, motorways, one-way\nsystems), which is precisely where your plan will fail.**\n\n---\n\n## §23. Dynamic and Stochastic\n\n**⚠️ Real logistics is not a static problem solved once.**\n```\nDYNAMIC       ⚠️ orders arrive during execution; vehicles are en route\nSTOCHASTIC    ⚠️ travel times, service times and demand are random variables\nONLINE        ⚠️ decide without knowing the future. Competitive ratio analysis\nROLLING HORIZON  ⚠️ re-optimize periodically over a moving window. THE\n   standard practical approach\n```\n**Techniques**: **rolling-horizon re-optimization; scenario-based stochastic programming;\nsample average approximation; robust optimization (⚠️ optimize the worst case — often too\nconservative for logistics); chance constraints; and reinforcement learning\n(⚠️ genuinely promising for dispatch-style sequential decisions, and much harder to\nvalidate and deploy than the literature implies).**\n**⚠️ The practical patterns that matter more than the theory:**\n- ⚠️ **Buffer time in the plan.** **A plan with zero slack fails on the first delay and\n  cascades.**\n- ⚠️ **Re-optimize on a schedule AND on trigger events**, **not continuously — continuous\n  re-optimization destabilizes the plan** (§1 → `logistics-why-projects-fail-complexity-and-modeling`).\n- ⚠️ **Freeze a near horizon.** **Don't change what a driver is doing in the next 30\n  minutes.** **This is both operationally necessary and a large search-space reduction.**\n- **Anticipate rather than react where you can** — **positioning idle capacity toward\n  expected demand.**\n\n---\n\n## §24. Solvers and Tooling\n\n```\nCOMMERCIAL MIP   ⚠️ Gurobi · IBM CPLEX · FICO Xpress · COPT (§25.1)\nOPEN SOURCE MIP  ⚠️ HiGHS (the current default) · SCIP (excellent, check\n                 licence terms) · CBC (older, slower)\nCP               ⚠️ OR-Tools CP-SAT (outstanding, free) · IBM CP Optimizer\nROUTING          ⚠️ OR-Tools routing library · VROOM (open source, fast) ·\n                 jsprit · commercial routing engines\nMODELING LAYERS  ⚠️ Pyomo · PuLP · JuMP (Julia) · AMPL\u002FGAMS · linopy\nROAD ROUTING     ⚠️ OSRM · Valhalla · GraphHopper (self-host; §22)\nFIRST-ORDER\u002FGPU  ⚠️ PDLP and cuPDLP — GPU LP for very large instances (§25.1)\n```\n**⚠️ Sensible defaults for a team starting out**: **OR-Tools for routing and scheduling\n(free, well-documented, genuinely good); HiGHS for LP\u002FMIP; a self-hosted OSRM for\ndistances; Pyomo or JuMP if you want solver portability.** ⚠️ **Buy a commercial MIP\nlicence when you have demonstrated that solve time is your binding constraint — and not\nbefore, because §1 → `logistics-why-projects-fail-complexity-and-modeling` says it usually isn't.**\n",{"name":5,"description":7},"develop","ae32736a1aabddabca5d2c96d665aa0ebc7d8700","src\u002Fvibey_tools\u002Fskills\u002Fplugins\u002Flogistics-software-optimization\u002Fskills\u002Flogistics-inventory-forecasting-operations-and-solvers",3,"https:\u002F\u002Fgithub.com\u002Fthe-vibey-project\u002Fvibey","https:\u002F\u002Fthe-vibey-project.github.io\u002Fvibey\u002F","https:\u002F\u002Fgithub.com\u002Fthe-vibey-project","https:\u002F\u002Fvibewithadam.matthewsteinberger.com","freedom for software engineers","2026-11-15 05:47:42",{"source":8,"skillName":5,"commands":35,"prompt":45,"zipAvailable":46},[36,39,42],{"tool":37,"command":38},"npx","npx skills add the-vibey-project\u002Fvibey --skill logistics-inventory-forecasting-operations-and-solvers",{"tool":40,"command":41},"bunx","bunx skills add the-vibey-project\u002Fvibey --skill logistics-inventory-forecasting-operations-and-solvers",{"tool":43,"command":44},"pnpm","pnpm dlx skills add the-vibey-project\u002Fvibey --skill logistics-inventory-forecasting-operations-and-solvers","安装技能，技能地址：https:\u002F\u002Fgithub.com\u002Fthe-vibey-project\u002Fvibey\u002Fblob\u002Fdevelop\u002Fsrc\u002Fvibey_tools\u002Fskills\u002Fplugins\u002Flogistics-software-optimization\u002Fskills\u002Flogistics-inventory-forecasting-operations-and-solvers\u002FSKILL.md",true,[],[49,56,63,70,77,84],{"skillNo":50,"name":51,"nameZh":6,"description":52,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":12,"repositoryNo":13,"starsCount":14,"licenseSpdxId":15,"licenseFileUrl":6,"sourceHtmlUrl":53,"categories":54,"keywords":55,"publishedAt":19},"01M7AT1FQJAE1FQYAMDTF490Y4","white-paper-writing","Use when writing white papers, technical reports, policy documents, thought leadership pieces, or any long-form authoritative document. Triggers on requests to write, structure, outline, or review white papers, technical reports, position papers, policy briefs, or evidence-driven arguments. Also use for B2B content marketing strategy, technical documentation requiring authority, academic-style reports, or any document that must educate while persuading. Use when someone asks \"how should I structure this\" for a long-form document.","https:\u002F\u002Fgithub.com\u002Fthe-vibey-project\u002Fvibey\u002Fblob\u002Fdevelop\u002Fsrc\u002Fvibey_tools\u002Fskills\u002Fplugins\u002Fwriting-craft\u002Fskills\u002Fwhite-paper-writing\u002FSKILL.md",[],[],{"skillNo":57,"name":58,"nameZh":6,"description":59,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":12,"repositoryNo":13,"starsCount":14,"licenseSpdxId":15,"licenseFileUrl":6,"sourceHtmlUrl":60,"categories":61,"keywords":62,"publishedAt":19},"01M7AT16BJRJJKK2MASXRZS76G","prose-technical-mechanics","Use when editing or writing prose at a technical\u002Fmechanical level: choosing between Anglo-Saxon and Latinate diction, placing information in topic vs stress positions, writing periodic vs cumulative sentences, handling sentence rhythm, punctuation as logic, transitions, paragraph structure, or phonesthetics. Use when someone wants to understand WHY prose works or doesn't, not just surface-level style advice. Triggers on word choice, sentence structure, emphasis, rhythm, diction, or any deep writing mechanics question.","https:\u002F\u002Fgithub.com\u002Fthe-vibey-project\u002Fvibey\u002Fblob\u002Fdevelop\u002Fsrc\u002Fvibey_tools\u002Fskills\u002Fplugins\u002Fwriting-craft\u002Fskills\u002Fprose-technical-mechanics\u002FSKILL.md",[],[],{"skillNo":64,"name":65,"nameZh":6,"description":66,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":12,"repositoryNo":13,"starsCount":14,"licenseSpdxId":15,"licenseFileUrl":6,"sourceHtmlUrl":67,"categories":68,"keywords":69,"publishedAt":19},"01M7AT0W9HT0ZZ9Y287NW99MR3","prose-mechanics","Use when writing, editing, or analyzing prose style; when trying to avoid generic AI-sounding writing; when applying specific prose styles such as journalistic, academic, narrative, KJV biblical, Hemingway plain, Latinate\u002FJamesian, Orwellian, Augustan, Victorian, Early Modern (Bacon, Browne, Milton), or free indirect discourse; or when coaching someone on writing voice and mechanics. Triggers on any request to improve, analyze, or write in a specific prose style, to fix \"AI-sounding\" writing, to make prose more vivid or concrete, to vary sentence rhythm, or to understand how a particular writer achieves their effects.","https:\u002F\u002Fgithub.com\u002Fthe-vibey-project\u002Fvibey\u002Fblob\u002Fdevelop\u002Fsrc\u002Fvibey_tools\u002Fskills\u002Fplugins\u002Fwriting-craft\u002Fskills\u002Fprose-mechanics\u002FSKILL.md",[],[],{"skillNo":71,"name":72,"nameZh":6,"description":73,"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},"01M7AT0KR635JX66X2X6F3E2CP","narrative-structure","Use when structuring stories, pitches, presentations, white papers, or any persuasive narrative; analyzing the hero's journey in fiction or non-fiction; applying StoryBrand for business communication; designing narrative arcs for thought leadership; or understanding Vogler, Snyder, Propp, or Campbell frameworks. Triggers on any narrative structure, storytelling, pitch structure, StoryBrand, hero's journey, three-act structure, Freytag, Save the Cat, narrative arc, or \"how should I structure this story\u002Fpitch\u002Fpresentation\" request.","https:\u002F\u002Fgithub.com\u002Fthe-vibey-project\u002Fvibey\u002Fblob\u002Fdevelop\u002Fsrc\u002Fvibey_tools\u002Fskills\u002Fplugins\u002Fwriting-craft\u002Fskills\u002Fnarrative-structure\u002FSKILL.md",[],[],{"skillNo":78,"name":79,"nameZh":6,"description":80,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":12,"repositoryNo":13,"starsCount":14,"licenseSpdxId":15,"licenseFileUrl":6,"sourceHtmlUrl":81,"categories":82,"keywords":83,"publishedAt":19},"01M7AT0AKGW09NKKZDYBT8VRDE","legal-brief-writing","Use when writing legal briefs, motions, or any court filing; when analyzing judicial cognition and persuasion; when applying elite brief-writing techniques from Roberts, Clement, Kagan, Garner; or when structuring legal arguments for maximum persuasion. Also use for autistic\u002Fneurodivergent advocates who need to understand how their natural communication style maps to elite legal advocacy. Triggers on any legal writing, brief drafting, motion preparation, or legal argument structuring request.","https:\u002F\u002Fgithub.com\u002Fthe-vibey-project\u002Fvibey\u002Fblob\u002Fdevelop\u002Fsrc\u002Fvibey_tools\u002Fskills\u002Fplugins\u002Fwriting-craft\u002Fskills\u002Flegal-brief-writing\u002FSKILL.md",[],[],{"skillNo":85,"name":86,"nameZh":6,"description":87,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":12,"repositoryNo":13,"starsCount":14,"licenseSpdxId":15,"licenseFileUrl":6,"sourceHtmlUrl":88,"categories":89,"keywords":90,"publishedAt":19},"01M7AT00VWPS4Q8B5VEMXX9NQT","journal-publishability-criteria","Use whenever a research paper, article or preprint is being written, revised, reviewed or published, and specifically before every publication of docs\u002Fpaper.md. Covers what legitimate journals actually gate on, in order of gating — the editor's desk screen (scope, novelty, package problems), what reviewers judge (methodological soundness, claims the evidence can carry, statistical and qualitative reporting), EQUATOR reporting guidelines, the ICMJE authorship criteria, COPE's view of text recycling, the near-universal generative-AI policy (no AI author, disclosure, author responsibility), TOP 2025 transparency standards, how to verify a journal is legitimate, submitting without an institution, and a pre-submission checklist. Triggers on requests to evaluate, review, prepare or submit a paper, to judge publishability, to write a declarations or data-availability section, to disclose AI use, or to check a journal.","https:\u002F\u002Fgithub.com\u002Fthe-vibey-project\u002Fvibey\u002Fblob\u002Fdevelop\u002Fsrc\u002Fvibey_tools\u002Fskills\u002Fplugins\u002Fwriting-craft\u002Fskills\u002Fjournal-publishability-criteria\u002FSKILL.md",[],[]]