Related papers: A column-generation-based matheuristic for periodi…
Space missions, particularly complex, large-scale exploration campaigns, can often involve many discrete decisions or events in their concepts of operations. Whilst a variety of methods exist for the optimisation of continuous variables in…
Column Generation (CG) is an effective and iterative algorithm to solve large-scale linear programs (LP). During each CG iteration, new columns are added to improve the solution of the LP. Typically, CG greedily selects one column with the…
This work is inspired by the problem of planning sequences of operations, as welding, in car manufacturing stations where multiple industrial robots cooperate. The goal is to minimize the station cycle time, \emph{i.e.} the time it takes…
In the framework of tensor spaces, we consider orthogonalization kernels to generate an orthogonal basis of a tensor subspace from a set of linearly independent tensors. In particular, we experimentally study the loss of orthogonality of…
In this research we introduce Local Area (LA) routes for improving the efficiency and tightness of column generation (CG) methods for solving vehicle routing problems (VRP). LA-routes rely on pre-computing the lowest cost elementary…
School bus planning problem (SBPP) has drawn much research attention due to the huge costs of school transportation. In the literature, the SBPP is usually decomposed into the routing and scheduling subproblems due to its complexity.…
The size and complexity of modern astronomical surveys has grown to the point where, in many cases, traditional human scheduling of observations are tedious at best and impractical at worst. Automated scheduling algorithms present an…
This paper develops an exact solution framework for the choice-based time slot management problem under mixed logit demand in attended home delivery systems. The problem jointly optimizes delivery slot offerings, price discounts, and…
We introduce a simple, accurate, and extremely efficient method for numerically solving the multi-marginal optimal transport (MMOT) problems arising in density functional theory. The method relies on (i) the sparsity of optimal plans [for…
Flow-based methods for sampling and generative modeling use continuous-time dynamical systems to represent a {transport map} that pushes forward a source measure to a target measure. The introduction of a time axis provides considerable…
Network design problems involve constructing edges in a transportation or supply chain network to minimize construction and daily operational costs. We study a stochastic version where operational costs are uncertain due to fluctuating…
An essential issue that a freight transportation system faced is how to deliver shipments (OD pairs) on a capacitated physical network optimally; that is, to determine the best physical path for each OD pair and assign each OD pair into the…
Due to increasing railway use, the capacity at railway yards and maintenance locations is becoming limiting. Therefore, the scheduling of rolling stock maintenance and the choice regarding optimal locations to perform maintenance is…
Accurate forecasting of passenger flow (i.e., ridership) is critical to the operation of urban metro systems. Previous studies mainly model passenger flow as time series by aggregating individual trips and then perform forecasting based on…
Transportation companies and organizations routinely collect huge volumes of passenger transportation data. By aggregating these data (e.g., counting the number of passengers going from a place to another in every 30 minute interval), it…
This paper presents an open data approach to model and solve the vehicle routing problem with time-dependent travel times (TDVRP). The proposed model is based on a multi-layer matrix composed of travel times, replacing the traditional…
Bin packing problem examines the minimum number of identical bins needed to pack a set of items of various weights. This problem arises in various areas of the artificial intelligence demanding derivation of the exact solutions in the…
Inventory management, vehicle routing, and delivery scheduling decisions are simultaneously considered in the context of the inventory routing problem. This paper focuses on the continuous-time version of this problem where, unlike its more…
This paper addresses a new variant of the multi-trip single vehicle routing problem where the nodes are related to each other through AND-type precedence constraints. The problem aims at determining a sequence of trips to visit all the…
Column generation is often used to solve multi-commodity flow problems. A program for column generation always includes a module that solves a linear equation. In this paper, we address three major issues in solving linear problem during…