Moltline Optimize
Routing, bin packing, cutting stock, knapsack and shift rostering over MCP, solved with Google OR-Tools: free single-vehicle routes, packing and 1-D cuts; licensed fleet routing, large packing, 2-D cutting and rosters.
CONNECT • Endpoint: https://mcp.moltlinestudio.com/optimize (MCP Streamable HTTP) • Claude Code: claude mcp add --transport http moltline-optimize https://mcp.moltlinestudio.com/optimize • Cursor, Codex CLI and any other Streamable HTTP client take the same URL unchanged • Free tools need no account and no API key; every tool description says FREE. or PREMIUM (...) before you call it • Machine-readable server card: https://mcp.moltlinestudio.com/optimize/.well-known/mcp/server-card.json
OVERVIEW Combinatorial optimisation as MCP tools, run on Google OR-Tools (routing library and CP-SAT) inside a bounded solver process with a time limit you set. Send a distance matrix or coordinates, get an ordered route with the status the solver reported; send boxes and containers, get placements with rotation, weight and fragile rules honoured; send stock lengths and demands, get a least-waste cut plan with kerf; send staff, shifts and constraints, get a roster. Every answer names the objective, the limits it hit and whether it is optimal or feasible. Free tiers: up to 12 stops, 20 items, 3-15 s solves. Licence: 200 stops with capacities and time windows, 300 item units, 2-D guillotine cutting, rostering, up to 60 s solves. One solve runs at a time on this server; a busy response says so and asks you to retry.
KEY CAPABILITIES • route_plan + distance_matrix_haversine — shortest single-vehicle route on your own matrix, or a great-circle matrix from coordinates • pack_bins + cutting_stock_1d + knapsack_select — 3-D packing with rotation and support rules, 1-D cuts with kerf, multi-constraint selection • validate_problem + explain_solution — shape and feasibility checks before solving; plain-language summary after • License: route_plan_fleet (capacities, time windows, drop penalties), pack_bins_large, cutting_stock_2d (guillotine layouts), roster_shifts (availability, skills, hour caps, rest, preferences)
USE CASES • A dispatcher's agent orders tomorrow's deliveries for three vans under time windows and capacities • A workshop cuts the day's bars from stock lengths with the least offcut • A café manager rosters next week from staff availability and hour limits
WHO THIS IS FOR Operations, logistics and scheduling teams — and their agents — who need real solver answers with stated limits rather than a heuristic guess.
WHY MOLTLINE • Every solver wrapped with validation, limits and worked-example tests before release • One All-Access licence ($19/month, settled in cryptocurrency through NOWPayments) unlocks the premium tools on every Moltline server - send it in the X-Moltline-License header • Support: first response <24h, confirmed defects fixed <30 days
Independently audited — MCPize Verified A+ (98/100) on this endpoint (https://mcp.moltlinestudio.com/optimize) · Live check result