Personal portfolio of Mostafa Dadkhah Canada

Mostafa Dadkhah

Simulation & operations researchAutonomous fleet coordination

I build simulations and decision algorithms for autonomous underground haulage. They decide which truck moves, which one waits in the passing bay, and where the fleet goes next.

Now
PhD candidate, Industrial Engineering, Polytechnique Montréal
Research groups
GERAD · CIRRELT
BAY

About

Canada

Autonomous trucks share narrow ramps, single-lane drifts and one crusher queue. I design the customized behaviour of transporters in that network, and the rules that keep the fleet moving.

I am a simulation and operations research specialist and a PhD candidate in Industrial Engineering at Polytechnique Montréal. I develop custom agent-based and discrete-event models, dynamic routing and dispatch algorithms, and test them in designed experiments to assess fleet capacity, congestion and operating policies.

My graduate research since 2017 spans mining and emergency logistics. Before autonomous mines, I worked on how rescue teams reopen roads and reach trapped people in the first 72 hours after an earthquake.

Research · PhDPolytechnique Montréal · 2021–present

Underground traffic, simulated.

Enabling autonomous haulage systems (AHS) in real underground mines through a digital twin.

At its core is a high-resolution simulation that reproduces every truck, road segment, passing bay and queue, so traffic conflicts are detected and resolved one truck at a time. The traffic controller and the dispatcher run on top of it, and both are designed and tested inside the twin.

01 · Simulation & traffic control

Haulage simulation and short-interval control

AnyLogic · Java · JGraphT

A hybrid discrete-event and agent-based model of an underground haulage network. Each truck runs a custom statechart over capacity-constrained roads, passing bays and terminal queues. A custom routing model runs Dijkstra search on a dynamically masked graph that excludes occupied, reserved and blocked segments.

On this platform I built a short-interval control (SIC) system for conflict management. It predicts segment-occupancy conflicts and coordinates many trucks and simultaneous conflicts through right-of-way arbitration, node and bay reservations and rerouting. It resolves cyclic dependencies, so deadlocks and cycles of control failure do not occur.

  • 4–16trucks, fleet sizes tested
  • 48 × 30settings × replications
  • ~9trucks before the depot becomes the bottleneck
  • 0deadlocks in the reported campaign
  • −27%delay per cycle vs. loaded-priority control
  • 2⁄3less detour distance than local-information policies
  • Discrete-event simulation
  • Agent-based modelling
  • Statechart design
  • Graph routing
  • Fleet sizing
  • Bottleneck analysis
  • Design of experiments
  • Replication analysis
  • Parameter tuning
  • Calibration
  • Policy benchmarking
  • Conflict detection
  • Deadlock prevention
  • KPI design
  • Model verification
ramp_haulage.alpScreen recording
Simulation recording Screen capture from the AnyLogic haulage model
at stope full at crusher dispatch segment held TRAVEL EMPTY LOADING TRAVEL LOADED DUMPING WAIT AT BAY
Truck statechart, simplified

02 · Dispatch

Simulation-based dispatch

Rolling horizon · Lookahead · KPI accounting

A rolling-horizon dispatcher copies the current simulated fleet state, plays several candidate assignment sequences forward, and commits the one with the least delay. It runs on top of the SIC traffic controller, so its gains add to the traffic-control gains.

Event logs and KPI accounting separate travel conflicts from service queues, and consistency checks tie delay components to cycle times, throughput and crusher utilization.

  • 18–33%further delay reduction, on top of SIC
  • +4–9%more completed cycles
  • 700replications per scenario, four scenarios
  • 63–75%of baseline delay traced to traffic
  • Algorithm design
  • Rolling-horizon optimization
  • Simulation-based optimization
  • What-if analysis
  • Scenario analysis
  • Event logging
  • KPI accounting
  • Throughput & utilization analysis
  • Benchmarking
  • Statistical comparison
LOOKAHEAD HORIZON DELAY 742 518 311 905 467 COMMIT NOW t t + H
Each candidate is simulated forward and scored by delay. The lowest is committed.

03 · Architecture

Digital-twin architecture

Requirements · Interfaces · Verification

A six-step design method that links operational capabilities to module responsibilities, interface contracts, state requirements and verification criteria. I used it to specify a four-level control architecture and applied it to the traffic-control and dispatch modules. Presented at IISE 2024 and CIM CONNECT 2024.

  1. Operational capabilities
  2. Module responsibilities
  3. Interface contracts
  4. State requirements
  5. Verification criteria
  • 6steps in the design method
  • 4control levels specified
  • Systems architecture
  • Requirements engineering
  • Interface specification
  • Digital-twin design
  • Control hierarchy design
  • Verification planning
  • Interoperability
  • MQTT messaging
  • API integration
  • Technical communication
LEVEL 1 LEVEL 2 LEVEL 3 LEVEL 4 COMMANDS DOWN STATE UP
Four-level control architecture, schematic

Results · what the models showed

Case-study mine
  • 27%less delay per cycle with SIC traffic control than with loaded-priority control
  • 18–33%further delay reduction from rolling-horizon dispatch, on top of SIC, across four scenarios
  • 0deadlocks across the reported traffic campaign
  • 2⁄3less fleet detour distance than local-information policies
  • 63–75%of baseline delay came from traffic conflicts rather than service queues
  • 1,440runs in the fleet-sizing grid: 48 settings × 30 replications
Earlier research · MScSharif University of Technology · 2017–2020

First 72 hours after a severe earthquake.

For my MSc in Transportation Engineering I worked on rescue operations right after a severe earthquake. Teams face two problems at once: roads may be blocked, and people are trapped under debris. At first, both are only estimates.

  • Teams are dispatched under uncertainty to reach trapped people, routing on the roads assumed to be open. A blocked link can be opened, which takes far longer than driving it, and several teams can open the same link together.
  • Each team that reaches a link or a zone reveals its true state to every team, so the picture of the network sharpens over time. Teams leave their depots at time zero and, every hour, re-decide whether to keep their assignment or switch.
  • Built as a MATLAB discrete-event multi-agent simulation coupled with ant colony optimization over a 72-hour horizon, with candidate solutions evaluated in parallel across CPU threads.
  • Evaluated on an expanded network based on Bam, the city struck by the 2003 earthquake, against five heuristic benchmarks and three earthquake severities.

Four allocation policies trade total rescues against geographic coverage and equity. Sending teams by population density rescued the most people in simulation. Guaranteeing every damaged zone a minimum number of teams spread the effort across more zones.

  • Multi-agent simulation
  • Dynamic dispatching & routing
  • Decision-making under uncertainty
  • Ant colony optimization
  • Metaheuristics
  • Parallel computing
  • Parameter calibration
  • Sensitivity analysis
  • Monte Carlo experiments
  • Policy evaluation
Schematic · 5 teams · 2 depotsT+ 00:00

Step 1 of 6

Dispatch on prior information

At time zero, teams leave two depots for the zones estimated to hold the most trapped people, routing on the roads assumed to be open.

Assumed open Assumed closed Confirmed open Confirmed closed Team
  • 44zones
  • 40rescue teams
  • 10depots
  • 1,000runs per experiment
  • 5heuristic benchmarks
  • 3earthquake severities
  • 4allocation policies
ToolkitTools & methods

Toolkit what I build with.

AnyLogic hybrid discrete-event / agent-based simulation integer programming Java autonomous haulage systems rolling-horizon lookahead pandas Monte Carlo experiments JGraphT statecharts bottleneck analysis digital-twin architecture MATLAB ant colony optimization event scheduling short-interval traffic control design of experiments matplotlib simulation-based optimization reservation-based coordination parameter tuning Python multi-agent systems conflict resolution requirements decomposition sensitivity & scenario analysis Jupyter algorithm design graph routing fleet sizing dynamic dispatch calibration interface specification KPI design ramp haulage resource allocation model verification MQTT REST APIs Arena (teaching)

Timeline2012–2026

Timeline from civil engineering to autonomous mines.

PhD, Industrial EngineeringPolytechnique Montréal · 2021–now · GPA 3.84/4.0
Doctoral students’ representativeGERAD · 2022–2025
IAM Doctoral ScholarshipNSERC CREATE · 2022–2024
MSc, Transportation EngineeringSharif University of Technology · 2017–2020 · GPA 3.66/4.0
Teaching assistantSharif & Ferdowsi · 2017–2019
Research assistantFerdowsi · 2015–2017
BSc, Civil EngineeringFerdowsi University of Mashhad · 2012–2017
Talks & postersIAM 2023 · IISE, CIM, UQAT 2024
Community2013 · 2014 · 2019

Talks & recognition

  • 2024
    IISE Annual Conference, Montréal

    Oral presentation on digital-twin strategy and interoperability for autonomous mining.

  • 2024
    CIM CONNECT, Vancouver

    Poster on digital-twin architecture and interoperability for autonomous mining.

  • 2024
    IAM Summer School, UQAT, Rouyn-Noranda

    Poster, plus an underground visit to Agnico Eagle’s LaRonde Zone 5 operations.

  • 2023
    IAM Summer School, Polytechnique Montréal

    Talk.

  • 2022–24
    IAM Doctoral Scholarship, NSERC CREATE

    Intelligent and autonomous mining.

Leadership & community

  • 2022–25
    Doctoral Students’ Representative, GERAD

    Liaison between doctoral students and the GERAD assembly. Founding board member of the GERAD student space.

  • 2019
    Founder, Transportation Engineering Community Forum

    Sharif University of Technology.

  • 2014
    Technical Secretary

    First National Green Building Conference.

  • 2013
    Co-founder, Nature Cleaners

Training

  • Courses

    Machine learning, reinforcement learning, distributed production and logistics, vehicular networks, Industry 4.0, introduction to mining operations.

  • Certificates

    Deep Learning Specialization (DeepLearning.AI). Machine Learning (Stanford, Coursera).

  • Workshops

    Project development, intellectual property, scientific communication and research leadership.

  • Earlier

    Slope stability of unsaturated soils in GeoStudio, with genetic algorithms and particle swarm optimization in MATLAB (Ferdowsi, 2015–2017).

ContactCanada

Let’s talk

Working on autonomous fleets, mine simulation or dispatch? I’m glad to talk.

Based in
Canada 🇨🇦
Languages
English, French, Persian