A Constraint-Aware Generative Framework for Synthetic Origin-Destination Demand in Logistics Networks
Abstract
Large-scale logistics networks require synthetic data generation capabilities to support scenario-based planning under novel conditions-such as network reconfiguration and demand shocks. Existing approaches, which rely primarily on historical observations, lack the ability to generate demand patterns that adapt to changes in network topology while respecting operational constraints. We propose a constraint-aware conditional generative framework for synthetic origin-destination demand generation in hierarchical logistics networks. The framework models demand as a conditional distribution over destinations given each origin, enabling topology-aware synthesis that is both topologically realistic and operationally feasible. Operational guidance is incorporated directly into the generative objective via differentiable constraints, while a flexible conditioning mechanism supports various operational contexts and adaptation to evolving network configurations. We instantiate the proposed framework based on a conditional generative model. Experimental validation on industrial real fulfillment and transportation network demonstrates 16% improvement over graph neural network baselines, 87% operational compliance, and efficient cold-start adaptation, enabling applications in capacity planning, network design evaluation, and routing optimization.
Related
- A mechanism-guided simulation framework for synthetic tax-risk data: Constraint validation and reproducible benchmarking
- CLInstGen: An Instance Generation Framework for Two-Tier City Logistics
- Constraint-Embedded Fractal Self-Similar Generation of Synthetic Topologies for Receiving-End Power Grids with Rich Renewable Energy: A Hybrid Metaheuristic Approach
- AT-SKM-Net: An Accelerated Trainable Sampling Kaczmarz-Motzkin Framework for Linear Hard-Constraint Feasibility on Dynamic Graphs
- Sparse Identification for Automatic Large-Scale Screening: A Constraint-Aware Framework with Ultra Fast Decoding Algorithm
BibTeX
@misc{chen2026constraintaware,
title = {{A Constraint-Aware Generative Framework for Synthetic Origin-Destination Demand in Logistics Networks}},
author = {Leian Chen},
howpublished = {arXiv},
year = {2026},
month = sep,
doi = {10.48550/arxiv.2609.04345},
eprint = {2609.04345},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2609.04345},
}
RIS
TY - UNPB
TI - A Constraint-Aware Generative Framework for Synthetic Origin-Destination Demand in Logistics Networks
AU - Leian Chen
PY - 2026
DA - 2026/09/03
PB - arXiv
DO - 10.48550/arxiv.2609.04345
UR - https://arxiv.org/abs/2609.04345
AB - Large-scale logistics networks require synthetic data generation capabilities to support scenario-based planning under novel conditions-such as network reconfiguration and demand shocks. Existing approaches, which rely primarily on historical observations, lack the ability to generate demand patterns that adapt to changes in network topology while respecting operational constraints. We propose a constraint-aware conditional generative framework for synthetic origin-destination demand generation in hierarchical logistics networks. The framework models demand as a conditional distribution over destinations given each origin, enabling topology-aware synthesis that is both topologically realistic and operationally feasible. Operational guidance is incorporated directly into the generative objective via differentiable constraints, while a flexible conditioning mechanism supports various operational contexts and adaptation to evolving network configurations. We instantiate the proposed framework based on a conditional generative model. Experimental validation on industrial real fulfillment and transportation network demonstrates 16% improvement over graph neural network baselines, 87% operational compliance, and efficient cold-start adaptation, enabling applications in capacity planning, network design evaluation, and routing optimization.
ER -