arXiv:2509. 07123v2 Announce Type: replace-cross Abstract: Generalized extreme value models capture dependence among choice alternatives in discrete choice modeling, but require this dependence to be predefined, symmetric, and shared uniformly across individuals.
arXiv:2607. 19270v1 Announce Type: cross Abstract: The Traffic Assignment Problem is a fundamental but computationally expensive component of transportation planning.
The Traffic Assignment Problem is a fundamental but computationally expensive component of transportation planning. While Graph Neural Networks have emerged as fast, data-driven surrogates, their practical deployment is severely constrained by a spatial generalization gap.
arXiv:2207. 12877v3 Announce Type: replace Abstract: Motivated by the successes of deep learning, we propose a class of neural network-based discrete choice models, called RUMnets, inspired by the random utility maximization (RUM) framework.
arXiv:2606. 04167v1 Announce Type: cross Abstract: We tackle the Metro Network Expansion Problem (MNEP), a subset of the Transport Network Design Problem (TNDP), which focuses on expanding metro systems to satisfy travel demand.
arXiv:2505. 18077v3 Announce Type: replace-cross Abstract: Discrete choice models (DCMs) are used to analyze individual decision-making in contexts such as transportation choices, political elections, and consumer preferences.
Neural-Bayesian Structure Learning (Neural-BSL) integrates differentiable structure learning with random-utility discrete choice estimation in a single differentiable framework. It keeps observed choices outside the graph to avoid distortion, learns attribute interactions through a structure-weighted network, and propagates interventions by updating attributes in topological order before recomputing utilities and choice probabilities. Evaluations on Seoul stated-preference and London revealed-preference data show Neural-BSL matches conventional benchmarks in predictive performance while uncovering behaviorally coherent dependency structures and revealing downstream traveler and trip adjustments under policy scenarios.
Conventional discrete choice and machine learning models are estimated primarily from observational data and typically treat explanatory covariates as parallel inputs, providing no internal mechanism...
arXiv:2608.24859v1 Announce Type: new Abstract: Multi-task vehicle routing problem (VRP) solvers seek to handle multiple VRP variants within a single unified model, avoiding the need to train a separ...
arXiv:2603. 24705v3 Announce Type: replace-cross Abstract: Discrete choice models are fundamental tools in management science, economics, and marketing for understanding and predicting decision-making.
arXiv:2607. 26404v1 Announce Type: new Abstract: Graph Neural Networks (GNN) facilitate effective prediction on graph data such as molecules, media networks and neural network blueprints.
The paper introduces a deep architecture that jointly optimizes cost functions and a route-ranking model to accommodate diverse user preferences in route planning. It first generates a complete set of Pareto‑optimal routes using a multi‑objective Dijkstra algorithm, then employs a neural network that emulates shortest‑path search and ranking in an end‑to‑end differentiable framework. A novel loss function treats route preference as a constrained optimization problem, allowing a single objective to be optimized while other attributes remain constrained, and experiments on real‑world data show significant improvements over existing methods.
arXiv:1905. 11395v2 Announce Type: replace Abstract: Graph convolution network based approaches have been recently used to model region-wise relationships in region-level prediction problems in urban computing.