By Fatskills Exam Guides Team — the exam nerds behind 28,500+ quizzes and 2.1M practice questions across 500+ global exams.
Supply chain and logistics optimization is the backbone of military operations, humanitarian aid, and enterprise resilience. As an FDE, you’ll deploy models, pipelines, and dashboards to track inventory, optimize routes, and predict disruptions—often in austere environments with no cloud access, strict security constraints, or real-time data gaps. Field example: During a disaster response mission, you’re handed a CSV of warehouse stockpiles and a list of delivery routes with no API. You have 48 hours to build a Python script that ingests the data, runs a greedy routing algorithm, and outputs a prioritized manifest for helicopter drops—all while working on a laptop with no internet and a customer who keeps changing the priority zones.
pandas
SQL
SAP IBP
Google OR-Tools
MiniZinc
Prophet
ARIMA
XGBoost
PostGIS
Google Maps API
LoRaWAN
pandas.read_excel("inventory.xlsx", sheet_name=None)
psql -h <customer_db> -U <user> -c "\d"
pg_dump -t inventory --data-only > inventory.sql
Tesseract
tesseract receipt.jpg output -l eng
python df.describe() # Check for negative quantities, NaNs df["timestamp"].max() # Is the data stale?
For routing: Start with a greedy algorithm (fast, explainable). ```python from ortools.constraint_solver import routing_enums_pb2 from ortools.constraint_solver import pywrapcp
def create_distance_matrix(locations): # Replace with real distances (e.g., Haversine) return [[0, 10, 15], [10, 0, 20], [15, 20, 0]]
def main(): distance_matrix = create_distance_matrix(locations) manager = pywrapcp.RoutingIndexManager(len(distance_matrix), 1, 0) routing = pywrapcp.RoutingModel(manager) transit_callback_index = routing.RegisterTransitCallback( lambda from_index, to_index: distance_matrix[from_index][to_index] ) routing.SetArcCostEvaluatorOfAllVehicles(transit_callback_index) search_parameters = pywrapcp.DefaultRoutingSearchParameters() solution = routing.SolveWithParameters(search_parameters) print("Route:", solution) - For inventory: Use a simple reorder-point model.python def reorder_alert(df, threshold=10): return df[df["quantity"] < threshold][["item", "quantity"]] ``` - Field trap: Never assume the customer’s constraints are fixed. Ask: "What’s the one rule we can break to make this work?"
- For inventory: Use a simple reorder-point model.
pip download -d ./deps -r requirements.txt
pip install --no-index --find-links=./deps -r requirements.txt
Docker
conda-pack
bash conda pack -n my_env -o my_env.tar.gz scp my_env.tar.gz user@customer-server:/tmp ssh user@customer-server "mkdir -p my_env && tar -xzf /tmp/my_env.tar.gz -C my_env"
Go
Rust
item_id
quantity
warehouse
df.isna().sum()
df.describe()
PyInstaller
Cargo build --release
python dfs = [] for file in glob.glob("*.xlsx"): df = pd.read_excel(file, sheet_name=0) df["source_file"] = file # Track origin dfs.append(df) combined = pd.concat(dfs, ignore_index=True) combined.to_csv("standardized_inventory.csv", index=False)
Sentinel-2
OpenStreetMap
infinity
ortools
geopy
conda pack -n my_env -o my_env.tar.gz
5432
3306
6379
python def greedy_route(locations, start): unvisited = set(locations) route = [start] unvisited.remove(start) while unvisited: next_stop = min(unvisited, key=lambda x: distance(route[-1], x)) route.append(next_stop) unvisited.remove(next_stop) return route
python from math import radians, sin, cos, sqrt, atan2 def haversine(lat1, lon1, lat2, lon2): R = 6371 # Earth radius in km dLat = radians(lat2 - lat1) dLon = radians(lon2 - lon1) a = sin(dLat/2) * sin(dLat/2) + cos(radians(lat1)) * cos(radians(lat2)) * sin(dLon/2) * sin(dLon/2) c = 2 * atan2(sqrt(a), sqrt(1-a)) return R * c
Reorder Point = (Daily Demand × Lead Time) + Safety Stock
Join 4M+ learners. Unlock unlimited quizzes, wrong-answer tracking, flashcards + reminders, study guides, and 1-on-1 challenges.