Routing Problems

Flio.ai API supports various vehicle routing optimization problems. Each problem type has different requirements and constraints.

📋 Supported Problem Types

Basic Problems

Problem	Description	Use Case
TSP	Travelling Salesman Problem	Single vehicle, minimum distance route
VRP	Vehicle Routing Problem	Multi-vehicle, basic routing

Advanced Problems

Problem	Description	Use Case
CVRP	Capacitated VRP	Capacity-constrained vehicle routes
VRPTW	VRP with Time Windows	Time-windowed deliveries
VRPH	VRP with Heterogeneous Fleet	Different vehicle types
PDP	Pickup and Delivery Problem	Pickup and delivery operations

Complex Problems

Problem	Description	Use Case
MDHVRPTW	Multi Depot Heterogeneous VRP with Time Windows	Multi-depot, multi-vehicle type, time-windowed

🎯 Problem Selection

You can specify the problem type using the options.problem parameter:

{
  "options": {
    "problem": "CVRP",
    "objective": "distance",
    "solver": "heuristic"
  }
}

📊 Problem Comparison

Feature	TSP	VRP	CVRP	VRPTW	PDP	MDHVRPTW
Multi-Vehicle	❌	✅	✅	✅	✅	✅
Capacity Constraint	❌	❌	✅	✅	✅	✅
Time Windows	❌	❌	❌	✅	✅	✅
Multi-Depot	❌	❌	❌	❌	❌	✅
Heterogeneous Fleet	❌	❌	❌	❌	❌	✅
Pickup/Delivery	❌	❌	❌	❌	✅	✅

🔧 Getting Started Recommendations

• Simple routes → TSP
• Multi-vehicle → VRP
• Capacity limits → CVRP
• Time constraints → VRPTW
• Heterogeneous fleet → VRPH
• Pickup and delivery → PDP
• Complex operations → MDHVRPTW