Works with the AI Agents you already use

    Claude CodeClaude CodeCursorCursorCodex CLICodex CLIDeepSeekDeepSeekMuseMuse+22 more

    distribution network design analyst

    1

    - **Cost Optimization** calculates total expenditure by summing fixed facility costs and variable transport costs for each design.

    $2.99

    Secure checkout via Stripe

    Money-back guarantee

    Converts to your local currency at checkout

    Security scanned
    distribution network design analyst

    distribution network design analyst

    Example session with this skill installed

    Find the cheapest distribution design for candidate facilities WH-A (fixed 50k, cap 100), WH-B (fixed 70k, cap 200) serving demand DM-1 (req 150) with transport cost WH-A:5/u, WH-B:3/u. CAD.

    • Read your context and instructions
    • Compiled the distribution network design

    Analysis of distribution network design alternatives for 2 candidate facilities and 1 demand point is complete.

    Distribution Network Design Results

    Design #Active FacilitiesTotal Cost (CAD)CoverageFixed CostVariable Cost
    1WH-A, WH-B120,450.001.0000120,000.00450.00
    2WH-B70,450.001.000070,000.00450.00

    Cheapest Design Details

    {
     "status": "completed",
     "results": {
      "designs": [
       {
        "design_number": 1,
        "active_facilities": ["WH-B"],
        "num_active_facilities": 1,
        "total_cost": "70450.00",
        "total_cost_units": "CAD",
        "demand_coverage": "1.0000",
        "fixed_cost_total": "70000.00",
        "variable_cost_total": "450.00",
        "assignments": [
         {"facility_id": "WH-B", "demand_id": "DM-1", "demand": "150", "cost_per_unit": "3.0000", "line_cost": "450.00"}
        ],
        "capacity_utilisation": [
         {"facility_id": "WH-B", "capacity_utilisation": "0.7500"}
        ],
        "heuristic_label": "exact enumeration",
        "note": "Cheapest feasible design (optimal within enumerated space)."
       }
      ],
      "cheapest_design": { "design_number": 1, "active_facilities": ["WH-B"], "total_cost": "70450.00" },
      "total_facility_capacity": "300",
      "total_demand": "150",
      "num_feasible_designs": 2,
      "heuristic_used": false
     }
    }
    

    Next steps

    • Management decision required for capital commitment to WH-B.
    • Verify the Analytical estimate for unit transport costs between WH-B and DM-1.
    • Confirm if WH-A should be retained as a redundant capacity source for future growth.

    Connects securely to your tools. The creator never sees your data.

    About this skill

    Supply chain managers and logistics engineers often struggle to identify the most cost-effective facility configuration from a list of candidate sites. Manually calculating every combination of fixed costs, transport fees, and capacity constraints for multiple demand points is error-prone and slow. This skill automates the evaluation of distribution network designs to find the mathematically cheapest feasible setup.

    What it does

    • Network Enumeration evaluates every possible combination of candidate facilities to find feasible subsets.
    • Cost Optimization calculates total expenditure by summing fixed facility costs and variable transport costs for each design.
    • Single-Source Assignment maps demand points to the cheapest available facility while strictly respecting capacity limits.
    • Performance Metrics generates coverage ratios, capacity utilization percentages, and cost-to-service ratios for every configuration.
    • Design Ranking sorts all feasible network configurations by total cost and identifies the optimal baseline for decision-making.

    How it works

    1. Register facility data including fixed costs and capacities, alongside demand point requirements.
    2. Provide a matrix of transport costs per unit between specific facilities and demand points.
    3. The system enumerates all possible subsets (up to $2^{10}$ exactly) to check if total capacity meets total demand.
    4. The solver assigns demand to facilities, calculates the full cost profile over the planning horizon, and ranks the results.

    Frameworks & tools

    This skill utilizes a Python-based solver using exhaustive enumeration for small sets and a labeled greedy heuristic for networks with more than 10 facilities.

    Why this beats prompting it yourself

    Generic prompts fail to handle the combinatorial explosion of checking every facility subset against capacity constraints. This tool provides structured JSON outputs with rigorous cost breakdowns and utilization metrics that raw LLMs cannot calculate reliably.

    Use cases

    • Selecting the minimum-cost set of new warehouses to serve a regional market expansion.
    • Evaluating which current distribution centers to decommission without losing demand coverage.
    • Comparing network designs based on different planning horizons or currency fluctuations.
    • Auditing the capacity utilization of a proposed logistics network before capital commitment.

    Known limitations

    Exact optimality is only guaranteed for sets of 10 facilities or fewer. Beyond that, a heuristic is used. All results require human approval for capital expenditures.

    Find more skills like this on the Claude Skills Marketplace, the Codex Skills Marketplace and the Gemini Skills Marketplace, or browse All Claude Skills.

    Exact enumeration for 10 or fewer facilities only. Heuristic used for 11+ facilities with no optimality claim. Requires human approval for all capital commitments.

    How to use

    1. 1

      Connect your agent to the Agensi MCP

      Copy the prompt and paste it into Claude, ChatGPT, Cursor or any agent that supports MCP. It sets up the connection for you. Manual setup

    2. 2

      Sign in to Agensi

      Your agent shows a sign-in link. Sign in and click Allow.

    3. 3

      Ask for what you need

      Your agent loads this skill and uses it on your task. It always asks before buying a skill.

    Reviews

    No reviews yet

    Be one of the first to try it. Every listed skill goes through the trust checks below.

    Security scanned

    Checked by our 8-point scan before listing

    Fresh listing

    Recently published to Agensi

    Money-back guarantee

    Doesn't do what its page promises? You get your money back.

    Trust & safety

    Security scan

    Security scan passed 2 days ago

    Permissions

    Terminal / Shell
    Read Files
    Write Files
    Environment Variables
    Listed2 days ago

    What's inside

    Frequently Asked Questions

    This skill automates the complex task of facility location selection, calculating the mathematically lowest-cost combination of warehouses while ensuring all customer demand points are covered within capacity limits.

    The skill is built for integration with AI agents that support Python tool execution; you simply need to provide your facility, demand, and transport cost data in a structured format like JSON or CSV.

    For networks with up to 10 candidate facilities, the skill uses exhaustive enumeration to guarantee the absolute cheapest design; for larger networks, it employs a sophisticated heuristic to provide a high-performance solution.

    You receive the core Python-based solver logic, documentation on data schema requirements, and pre-configured reporting templates for coverage and utilization metrics.

    Unlike standard prompts that struggle with complex math and combinations, this skill uses a structured solver to provide rigorous cost breakdowns and utilization percentages that LLMs cannot calculate reliably.

    Yes, you can run multiple scenarios by adjusting your input data—such as changing fixed costs or demand volumes—to compare how different market conditions affect your optimal network design.