Multi-Stop Errand Route Engine MCP Connector for Claude
A+Calculates feasible errand sequences considering travel time, service duration, and operating hours.
This MCP server provides an intelligent routing engine designed to solve complex errand scheduling problems. It calculates an optimal, feasible sequence of stops by accounting for travel time matrices, service durations at each location, and the specific operating hours of each stop. Users can define mandatory stops that must be included in the route, and the engine will identify any unreachable locations that cannot be serviced within their required windows. Use calculate_errand_route to generate a full itinerary, validate_stop_availability to check if a location is open, get_travel_metrics for specific durations, or summarize_route_efficiency to analyze time usage.
Related Connectors
jp-train-transfer-minimizer MCP
Calculate precise Japanese train route metrics including transfer penalties.
Shipping Route Optimization MCP
Optimize maritime routes for tankers using weather-aware routing and fuel efficiency calculations.
EV Charging Stop Planner MCP
Calculates optimal charging stops for electric vehicle routes.
Spa Appointment Duration Calculator MCP
Calculate precise appointment timelines, buffer times, and staff scheduling for spa operations.