Optimize Shipping Route Planning | Dataford Interview Questions

Write a function to optimize route planning for shipping logistics at Mediterranean Shipping.

Implement optimize_route(graph, start, destination, max_stops). The directed graph maps each port to [neighbor, cost] pairs. Return {"cost": number, "path": [ports]} for the minimum-cost route using at most max_stops edges, or None when no route exists. Costs are nonnegative, and max_stops counts route edges, not intermediate ports.

Example: Port A -> Port C -> Port B -> Port D costs 2 + 1 + 2 = 5 and is preferred over more expensive alternatives.

Constraints

1 <= number of ports <= 2000
0 <= number of directed routes <= 10000
0 <= max_stops <= 2000
0 <= each route cost <= 10^6
Port names are nonempty strings
The graph may contain cycles
A route may not use more than max_stops edges

Function Signature

def optimize_route(graph, start, destination, max_stops):

Your question is Optimize Shipping Route Planning. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem

Write a function to optimize route planning for shipping logistics at Mediterranean Shipping.

Example: Port A -> Port C -> Port B -> Port D costs 2 + 1 + 2 = 5 and is preferred over more expensive alternatives.

Constraints

1 <= number of ports <= 2000
0 <= number of directed routes <= 10000
0 <= max_stops <= 2000
0 <= each route cost <= 10^6
Port names are nonempty strings
The graph may contain cycles
A route may not use more than max_stops edges

Function Signature

def optimize_route(graph, start, destination, max_stops):

Your question is Optimize Shipping Route Planning. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.