相关论文: A generalized formulation for vehicle routing prob…
We present an end-to-end framework for solving the Vehicle Routing Problem (VRP) using reinforcement learning. In this approach, we train a single model that finds near-optimal solutions for problem instances sampled from a given…
This paper studies the integrated spacecraft routing and trajectory optimization problem for satellite servicing missions involving partial en-route propellant replenishment. Unlike terrestrial routing problems, spacecraft operate in a…
We consider a wide family of vehicle routing problem variants with many complex and practical constraints, known as rich vehicle routing problems, which are faced on a daily basis by C.H. Robinson (CHR). Since CHR has many customers, each…
We consider here probabilistic models of transportation flows. The main goal of this introduction is rather not to present various techniques for problem solving but to present some intuition to invent adequate and natural models having…
This work focuses on exact methods for a Simultaneous Vehicle Routing and Crew Scheduling Problem in long-haul transport. Pickup-and-delivery requests with time windows must be fullfiled over a multi-day planning horizon. Unlike some…
A prominent model for transportation networks is branched transport, which seeks the optimal transportation scheme to move material from a given initial to a final distribution. The cost of the scheme encodes a higher transport efficiency…
This thesis introduces stochastic generalized routing problem model and proposes exact and heuristic algorithms to solve it efficiently, in a wide range of problem sizes. At first, the classic routing problem with its common variations in…
In the classic Vehicle Routing Problem (VRP) a fleet of of vehicles has to visit a set of customers while minimising the operations' costs. We study a rich variant of the VRP featuring split deliveries, an heterogeneous fleet, and…
Efficient trajectory optimization is essential for avoiding collisions in unstructured environments, but it remains challenging to have both speed and quality in the solutions. One reason is that second-order optimality requires calculating…
The branched transport problem, a popular recent variant of optimal transport, is a non-convex and non-smooth variational problem on Radon measures. The so-called urban planning problem, on the contrary, is a shape optimization problem that…
In dynamic vehicle routing problems (DVRPs), some part of the information is revealed or changed on the fly, and the decision maker has the opportunity to re-plan the vehicle routes during their execution, reflecting on the changes.…
The vehicle routing problem is a well known class of NP-hard combinatorial optimisation problems in literature. Traditional solution methods involve either carefully designed heuristics, or time-consuming metaheuristics. Recent work in…
We study the strategic decision-making problem of assigning time windows to customers in the context of vehicle routing applications that are affected by operational uncertainty. This problem, known as the Time Window Assignment Vehicle…
This work proposes a first extensive analysis of the Vehicle Routing Problem with Fractional Objective Function (vrpfof). We investigate how the principal techniques used either in the context of fractional programming or in the context of…
The Set Partitioning Problem is a combinatorial optimization problem with wide-ranging applicability, used to model various real-world tasks such as facility location and crew scheduling. However, real-world applications often require…
This study presents an in-depth computational analysis of four well-known Capacitated Vehicle Routing Problem (CVRP) formulations with polynomial number of subtour elimination constraints: a node-based formulation and three arc-based…
Public transport is vital for meeting people's mobility needs. Providers need to plan their services well to offer high quality and low cost. Optimized planning can benefit providers, customers, and municipalities. The planning process for…
The global objective of this work is to provide practical optimization methods to companies involved in inventory routing problems, taking into account this new type of data. Also, companies are sometimes not able to deal with changing…
While many classical traffic models treat the spatial extension of streets continuously or by discretization into cells of a certain length, we will subdivide roads into comparatively long homogeneous road sections of constant capacity with…
This paper introduces a discrete relaxation for the class of combinatorial optimization problems which can be described by a set partitioning formulation under packing constraints. We present two combinatorial relaxations based on computing…