跳至正文
OpenAgentSkill
浏览已开放 · 目录记录日期 2026-11-21 · 自动更新和账户服务暂时关闭。
搜索与研究

logistics-rules-to-optimization

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.

xuansenpa1 · 已有静态检查记录

安装与使用

运行命令前先阅读来源与依赖说明。复制命令不会自动安装或执行。

npx skills add xuansenpa1/skillrevise --skill logistics-rules-to-optimization

技能说明


name: logistics-rules-to-optimization description: 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.

Logistics Rules To Optimization

Use this skill when the problem statement gives operational rules in words and the agent must turn them into an optimization model.

The 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.

Rule Translation Workflow

  1. List the entities.

    • Examples: vehicles, locations, depots, jobs, workers, machines, products, arcs, time periods.
  2. Choose the decision state.

    • Binary variables for yes/no choices.
    • Integer variables for counts, loads, inventory, units moved.
    • Continuous variables for time, flow, cost, utilization, or fractional quantities.
  3. Convert each business rule into one of these patterns.

    • Conservation: what enters equals what leaves, plus/minus changes.
    • Capacity: quantity cannot exceed a limit.
    • Linking: a quantity is allowed only if a binary decision is active.
    • Assignment: exactly one, at most one, or at least one choice.
    • Sequence: if one action follows another, update load/time/state.
    • Compatibility: prohibit impossible combinations.
    • Soft penalty: add slack for unmet demand or violation cost.
  4. Add the objective last.

    • Keep named components such as travel cost, labor cost, inventory penalty, unmet demand penalty.
  5. Extract and independently validate the answer.

    • Recompute routes, loads, assignments, inventory, penalties, and objective from the output data.

Variable Patterns

Selection and Assignment

Use binary variables when an option is selected.

x = {(i, j): model.addVar(vtype="B", name=f"x_{i}_{j}") for i in I for j in J}

Common rules:

# each item i assigned to exactly one option j
for i in I:
    model.addCons(quicksum(x[i, j] for j in J) == 1)

# option j can handle at most capacity[j] items
for j in J:
    model.addCons(quicksum(x[i, j] for i in I) <= capacity[j])

Route Arcs

Use binary arc variables when the order of visits matters.

x = {
    (v, i, j): model.addVar(vtype="B", name=f"x_{v}_{i}_{j}")
    for v in vehicles
    for i, j in arcs
}

Use x[v, i, j] = 1 to mean vehicle/resource v goes directly from node i to node j.

Visit Indicator

Define visit from route arcs instead of creating a second binary unless the model needs it repeatedly.

visit = quicksum(x[v, i, j] for j in to_nodes if j != i)

If a standalone variable is useful:

visit = {(v, i): model.addVar(vtype="B", name=f"visit_{v}_{i}") for v in vehicles for i in locations}

for v in vehicles:
    for i in locations:
        model.addCons(visit[v, i] == quicksum(x[v, i, j] for j in to_nodes if j != i))

Quantity, Load, Inventory, and Time

load = {(v, i): model.addVar(vtype="I", lb=0, ub=vehicle_capacity, name=f"load_{v}_{i}") for v in vehicles for i in nodes}
service = {(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}
inventory = {(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}
arrival = {(v, i): model.addVar(vtype="C", lb=0, name=f"arrival_{v}_{i}") for v in vehicles for i in nodes}

Use integer variables for physical unit counts when the output must be integer-valued.

Common Logistics Rules

Business RuleVariable ChoiceConstraint Pattern
Choose exactly one optionx[i,j] binarysum_j x[i,j] == 1
Choose at most one optionx[i,j] binarysum_j x[i,j] <= 1
Open facility before assigning to itopen[j], assign[i,j] binaryassign[i,j] <= open[j]
Resource capacityquantity variablesum_i q[i,j] <= capacity[j]
Quantity only if selectedq[i], use[i]q[i] <= M * use[i]
Fixed cost if useduse[i] binaryadd fixed_cost[i] * use[i] to objective
Mutually exclusive modesmode binariessum_m mode[i,m] <= 1
Incompatible pairtwo binariesx[a] + x[b] <= 1
Demand must be metflow/quantitysupply_to[i] >= demand[i]
Demand may be unmetnonnegative slackserved[i] + unmet[i] >= demand[i]
Absolute deviation penaltynonnegative slackactual-target <= dev, target-actual <= dev
Inventory balanceinventory variablesinv[t+1] = inv[t] + inbound - outbound
Station/storage upper boundinventory variableinv[i,t] <= capacity[i]
Cannot remove unavailable stockmove variableoutbound[i,t] <= inv[i,t]
Vehicle starts at depotarc variablessum_j x[v, START, j] == use_vehicle[v]
Vehicle ends at depotarc variablessum_i x[v, i, END] == use_vehicle[v]
Route continuityarc variablesincoming[v,i] == outgoing[v,i]
Visit at most oncearc variablesoutgoing[v,i] <= 1
Split service allowedarc/quantity variablesomit global single-visit; aggregate quantities over resources
Time windowarrival variableearliest[i] <= arrival[v,i] <= latest[i] when visited
Travel time propagationarc + arrivalarrival[j] >= arrival[i] + service_time[i] + travel[i,j] - M(1-x[i,j])
Precedencestart/arrival variablesstart[b] >= finish[a]
Route duration limitarc variablessum travel[i,j] * x[v,i,j] <= max_duration[v]

Constraint Examples

Capacity

for r in resources:
    model.addCons(quicksum(amount[i, r] for i in items) <= capacity[r])

Quantit

阅读完整来源 ↗