arXiv subjects

Bilge Atasoy

Publications and source records attributed to Bilge Atasoy.

5 recordsLinked to original sources

arXiv2026

Adaptive decision-making for stochastic service network design

This paper addresses the Service Network Design (SND) problem for a logistics service provider (LSP) operating in a multimodal freight transport network, considering uncertain travel times and limited truck fleet availability. A two-stage optimization approach is proposed, which combines metaheuristics, simulation and machine learning components. This solution framework integrates tactical decisions, such as transport request acceptance and capacity booking for scheduled services, with operational decisions, including dynamic truck allocation, routing, and re-planning in response to disruptions. A simulated annealing (SA) metaheuristic is employed to solve the tactical problem, supported by an adaptive surrogate model trained using a discrete-event simulation model that captures operational complexities and cascading effects of uncertain travel times. The performance of the proposed method is evaluated using benchmark instances. First, the SA is tested on a deterministic version of the problem and compared to state-of-the-art results, demonstrating it can improve the solution quality and significantly reduce the computational time. Then, the proposed SA is applied to the more complex stochastic problem. Compared to a benchmark algorithm that executes a full simulation for each solution evaluation, the learning-based SA generates high quality solutions while significantly reducing computational effort, achieving only a 5% difference in objective function value while cutting computation time by up to 20 times. These results demonstrate the strong performance of the proposed algorithm in solving complex versions of the SND. Moreover, they highlight the effectiveness of integrating diverse modeling and optimization techniques, and the potential of such approaches to efficiently address freight transport planning challenges.

math.OC↗

arXiv2024

Inverse Optimization for Routing Problems

We propose a method for learning decision-makers' behavior in routing problems using Inverse Optimization (IO). The IO framework falls into the supervised learning category and builds on the premise that the target behavior is an optimizer of an unknown cost function. This cost function is to be learned through historical data, and in the context of routing problems, can be interpreted as the routing preferences of the decision-makers. In this view, the main contributions of this study are to propose an IO methodology with a hypothesis function, loss function, and stochastic first-order algorithm tailored to routing problems. We further test our IO approach in the Amazon Last Mile Routing Research Challenge, where the goal is to learn models that replicate the routing preferences of human drivers, using thousands of real-world routing examples. Our final IO-learned routing model achieves a score that ranks 2nd compared with the 48 models that qualified for the final round of the challenge. Our examples and results showcase the flexibility and real-world potential of the proposed IO methodology to learn from decision-makers' decisions in routing problems.

math.OC↗

arXiv2024

Learning in Inverse Optimization: Incenter Cost, Augmented Suboptimality Loss, and Algorithms

In Inverse Optimization (IO), an expert agent solves an optimization problem parametric in an exogenous signal. From a learning perspective, the goal is to learn the expert's cost function given a dataset of signals and corresponding optimal actions. Motivated by the geometry of the IO set of consistent cost vectors, we introduce the "incenter" concept, a new notion akin to circumcenter recently proposed by Besbes et al. (2023). Discussing the geometric and robustness interpretation of the incenter cost vector, we develop corresponding tractable convex reformulations, which are in contrast with the circumcenter, which we show is equivalent to an intractable optimization program. We further propose a novel loss function called Augmented Suboptimality Loss (ASL), a relaxation of the incenter concept for problems with inconsistent data. Exploiting the structure of the ASL, we propose a novel first-order algorithm, which we name Stochastic Approximate Mirror Descent. This algorithm combines stochastic and approximate subgradient evaluations, together with mirror descent update steps, which is provably efficient for the IO problems with discrete feasible sets with high cardinality. We implement the IO approaches developed in this paper as a Python package called InvOpt. Our numerical experiments are reproducible, and the underlying source code is available as examples in the InvOpt package.

math.OC↗

arXiv2023

A Choice-Driven Service Network Design and Pricing Including Heterogeneous Behaviors

The design and pricing of services are two of the most important decisions faced by any intermodal transport operator. The key success factor lies in the ability of meeting the needs of the shippers. Therefore, making full use of the available information about the demand helps to come up with good design and pricing decisions. With this in mind, we propose a Choice-Driven approach, incorporating advanced choice models directly into a Service Network Design and Pricing problem. We evaluate this approach considering three different mode choice models: one deterministic with 4 attributes (cost, time, frequency and accessibility); and two stochastic also accounting for unobserved attributes and shippers heterogeneity respectively. To reduce the computational time for the stochastic instances, we propose a predetermination heuristic. These models are compared to a benchmark, where shippers are solely cost-minimizers. Results show that the operator profits can be significantly improved, even with the deterministic version. The two stochastic versions further increase the realized profits, but considering heterogeneity allows a better estimation of the demand.

math.OC↗

arXiv2019

Real-Time Predictive Control Strategy Optimization

Traffic congestion has lead to an increasing emphasis on management measures for a more efficient utilization of existing infrastructure. In this context, this paper proposes a novel framework that integrates real-time optimization of control strategies (tolls, ramp metering rates, etc.) with guidance generation using predicted network states for Dynamic Traffic Assignment systems. The efficacy of the framework is demonstrated through a fixed demand dynamic toll optimization problem which is formulated as a non-linear program to minimize predicted network travel times. A scalable efficient genetic algorithm is applied to solve this problem that exploits parallel computing. Experiments using a closed-loop approach are conducted on a large scale road network in Singapore to investigate the performance of the proposed methodology. The results indicate significant improvements in network wide travel time of up to 9% with real-time computational performance.

eess.SY↗