Willem Guter
Research Scientist / Engineer
- Boston MA UNITED STATES
Willem Guter's research seeks to integrate optimization and machine learning to make supply chains more efficient.
Media
Social
Biography
Research Focus
Intelligent & Autonomous Supply Chains
AI-driven, data-centric, and increasingly autonomous decision systems for supply chain planning and execution.
Supply Chain Strategy & Network Architecture
Designing the structural configuration and competitive positioning of supply networks.
Areas of Expertise
Education
Massachusetts Institute of Technology
MEng
Computation and Cognition
2024
Massachusetts Institute of Technology
BS
Computer Science
2023
Languages
- English
Media Appearances
Mecalux sits down with Rodrigo Hermosilla and Willem Guter, Researchers at MIT CTL, to learn more about their joint project with Mecalux aiming to make AMRs more agile and efficient.
Mecalux Group online
2025-06-04
Mecalux sits down with Rodrigo Hermosilla and Willem Guter, Researchers at MIT CTL, to learn more about their joint project with Mecalux aiming to make AMRs more agile and efficient.
Research Papers
Type Enforced: A Python type enforcer for type annotations
The Journal of Open Source SoftwareConnor Makowski, Willem Guter, Timothy Russell
2025-09-30
type_enforcedis a pure Python package designed to enforce type annotations at runtimewithout the need for a special compiler. It provides an intuitive decorator-based interfacethat allows developers to enforce explicit typing constraints on function and method inputs,return types, dataclasses, and class instances. The package supports a comprehensive set ofPython’s built-in types, typing module constructs (such asList,Dict,Union,Optional, andLiteral), nested data structures, and custom constraints. By oering runtime validation oftype annotations and constraints,type_enforcedenhances code reliability, readability, andmaintainability.
BMSSPy: A Python Package and Empirical Comparison of Bounded Multi-Source Shortest Path Algorithm
MIT Center for Transportation & Logistics Research PaperConnor Makowski, Timothy Russell, Austin Saragih, Lucas Castro
2025-11-20
We introduce BMSSPy, the first open-source Python package faithfully implementing the Bounded Multi-Source Shortest Path (BMSSP) algorithm, recently proposed as a breakthrough beyond Dijkstra's sorting barrier for single-source shortest paths. BMSSPy translates theoretical advances into practice: it preserves the algorithm's asymptotic performance guarantees while returning both distance labels and route predecessors. Our implementation resolves core ambiguities in pivot selection, tight-edge forest construction, and frontier management that prior work left open for practitioners. We engineer BMSSPy to handle graphs with non-unique path lengths, structural irregularities, unreachable vertices, and highly variable node degrees, ensuring function and robust performance on real data. Extensive experiments on grid and geospatial networks demonstrate that BMSSPy delivers competitive performance.
SCGraph: A Dependency-Free Python Package for Road, Rail, and Maritime Shortest Path Routing Generation and Distance Estimation
MIT Center for Transportation & Logistics Research PaperConnor Makowski, Austin Saragih, Willem Guter, Tim Russell
2025-08-12
SCGraph (Supply Chain Graph) is a dependency-free Python toolkit that provides fully offline, accurate multimodal routing and network-based distance estimation across global road, rail, and maritime networks. SCGraph leverages optimized adjacency list data structures and customized implementations of Dijkstra and A* algorithms, specifically designed for sparse and large-scale transportation graphs. Accompanying SCGraph, SCGraph Data delivers global geospatial graphs that include worldwide highways, railways, and maritime networks.