3,245 research outputs found
Optimization of polling systems with Bernoulli schedules
Optimization;Polling Systems;Queueing Theory;operations research
An exact algorithm for the single-vehicle cyclic inventory routing problem
The single-vehicle cyclic inventory routing problem (SV CIRP) consists of a repetitive
distribution of a product from a single depot to a selected subset of customers. For each customer that is
selected for replenishments, the supplier collects a corresponding xed reward. The objective is to determine
the subset of customers to replenish, the quantity of the product to be delivered to each, and to design the
vehicle route so that the resulting pro t (di erence between the total reward and the total logistical cost) is
maximized while preventing stockouts at each of the selected customers. In this paper, the SV CIRP is
formulated as a mixed-integer program with a nonlinear objective function. After an e cient analysis of
the problem, an exact algorithm for its solution is proposed. This exact algorithm requires only solutions of
linear mixed-integer programs. Values of an insertion-based heuristic for this problem are compared to the
optimal values obtained for a set of some test problems. In general the gap may get as large as 25%, which
justi es the e ort to continue exploring and developing exact and approximation algorithms for the SV CIRP.Postprint (published version
Stochastic Cyclic Inventory Routing with Supply Uncertainty: A Case in Green-Hydrogen Logistics
Hydrogen can be produced from water, using electricity. The hydrogen can
subsequently be kept in inventory in large quantities, unlike the electricity
itself. This enables solar and wind energy generation to occur asynchronously
from its usage. For this reason, hydrogen is expected to be a key ingredient
for reaching a climate-neutral economy. However, the logistics for hydrogen are
complex. Inventory policies must be determined for multiple locations in the
network, and transportation of hydrogen from the production location to
customers must be scheduled. At the same time, production patterns of hydrogen
are intermittent, which affects the possibilities to realize the planned
transportation and inventory levels. To provide policies for efficient
transportation and storage of hydrogen, this paper proposes a parameterized
cost function approximation approach to the stochastic cyclic inventory routing
problem. Firstly, our approach includes a parameterized mixed integer
programming (MIP) model which yields fixed and repetitive schedules for vehicle
transportation of hydrogen. Secondly, buying and selling decisions in case of
underproduction or overproduction are optimized further via a Markov decision
process (MDP) model, taking into account the uncertainties in production and
demand quantities. To jointly optimize the parameterized MIP and the MDP model,
our approach includes an algorithm that searches the parameter space by
iteratively solving the MIP and MDP models. We conduct computational
experiments to validate our model in various problem settings and show that it
provides near-optimal solutions. Moreover, we test our approach on an
expert-reviewed case study at two hydrogen production locations in the
Netherlands. We offer insights for the stakeholders in the region and analyze
the impact of various problem elements in these case studies
Optimizing flow rates in a queueing network with side constraints
Network Analysis;operations research
Stochastic Cyclic Inventory Routing with Supply Uncertainty: A Case in Green-Hydrogen Logistics
Hydrogen can be produced from water, using electricity. The hydrogen can subsequently be kept in inventory in large quantities, unlike the electricity itself. This enables solar and wind energy generation to occur asynchronously from its usage. For this reason, hydrogen is expected to be a key ingredient for reaching a climate-neutral economy. However, the logistics for hydrogen are complex. Inventory policies must be determined for multiple locations in the network, and transportation of hydrogen from the production location to customers must be scheduled. At the same time, production patterns of hydrogen are intermittent, which affects the possibilities to realize the planned transportation and inventory levels. To provide policies for efficient transportation and storage of hydrogen, this paper proposes a parameterized cost function approximation approach to the stochastic cyclic inventory routing problem. Firstly, our approach includes a parameterized mixed integer programming (MIP) model which yields fixed and repetitive schedules for vehicle transportation of hydrogen. Secondly, buying and selling decisions in case of underproduction or overproduction are optimized further via a Markov decision process (MDP) model, taking into account the uncertainties in production and demand quantities. To jointly optimize the parameterized MIP and the MDP model, our approach includes an algorithm that searches the parameter space by iteratively solving the MIP and MDP models. We conduct computational experiments to validate our model in various problem settings and show that it provides near-optimal solutions. Moreover, we test our approach on an expert-reviewed case study at two hydrogen production locations in the Netherlands. We offer insights for the stakeholders in the region and analyze the impact of various problem elements in these case studies.<br/
An MDP decomposition approach for traffic control at isolated signalized intersections
This article presents a novel approach for the dynamic control of a signalized intersection. At the intersection, there is a number of arrival flows of cars, each having a single queue (lane). The set of all flows is partitioned into disjoint combinations of nonconflicting flows that will receive green together. The dynamic control of the traffic lights is based on the numbers of cars waiting in the queues. The problem concerning when to switch (and which combination to serve next) is modeled as a Markovian decision process in discrete time. For large intersections (i.e., intersections with a large number of flows), the number of states becomes tremendously large, prohibiting straightforward optimization using value iteration or policy iteration. Starting from an optimal (or nearly optimal) fixed-cycle strategy, a one-step policy improvement is proposed that is easy to compute and is shown to give a close to optimal strategy for the dynamic proble
Milk Run Design: Definitions, Concepts and Solution Approaches
Efficient inbound networks in the European automotive industry rely on a set of different transport concepts including milk runs - understood as regularly scheduled pickup tours. The complexity of designing such a mixed network makes decision support necessary: In this thesis we provide definitions, mathematical models and a solution method for the Milk Run Design problem and introduce indicators assessing the performance of established milk runs in relation to alternative transport concepts
Tabu search heuristic for inventory routing problem with stochastic demand and time windows
This study proposes the hybridization of tabu search (TS) and variable neighbourhood descent (VND) for solving the Inventory Routing Problems with Stochastic Demand and Time Windows (IRPSDTW). Vendor Managed Inventory (VMI) is among the most used approaches for managing supply chains comprising multiple stakeholders, and implementing VMI require addressing the Inventory Routing Problem (IRP). Considering practical constraints related to demand uncertainty and time constraint, the proposed model combines multi-item replenishment schedules with unknown demand to arrange delivery paths, where the actual demand amount is only known upon arrival at a customer location with a time limit. The proposed method starts from the initial solution that considers the time windows and uses the TS method to solve the problem. As an extension, the VND is conducted to jump the solution from its local optimal. The results show that the proposed method can solve the IRPSDTW, especially for uniformly distributed customer locations
Essays on Shipment Consolidation Scheduling and Decision Making in the Context of Flexible Demand
This dissertation contains three essays related to shipment consolidation scheduling and decision making in the presence of flexible demand. The first essay is presented in Section 1. This essay introduces a new mathematical model for shipment consolidation scheduling for a two-echelon supply chain. The problem addresses shipment coordination and consolidation decisions that are made by a manufacturer who provides inventory replenishments to multiple downstream distribution centers. Unlike previous studies, the consolidation activities in this problem are not restricted to specific policies such as aggregation of shipments at regular times or consolidating when a predetermined quantity has accumulated. Rather, we consider the construction of a detailed shipment consolidation schedule over a planning horizon. We develop a mixed-integer quadratic optimization model to identify the shipment consolidation schedule that minimizes total cost. A genetic algorithm is developed to handle large problem instances.
The other two essays explore the concept of flexible demand. In Section 2, we introduce a new variant of the vehicle routing problem (VRP): the vehicle routing problem with flexible repeat visits (VRP-FRV). This problem considers a set of customers at certain locations with certain maximum inter-visit time requirements. However, they are flexible in their visit times. The VRP-FRV has several real-world applications. One scenario is that of caretakers who provide service to elderly people at home. Each caretaker is assigned a number of elderly people to visit one or more times per day. Elderly people differ in their requirements and the minimum frequency at which they need to be visited every day. The VRP-FRV can also be imagined as a police patrol routing problem where the customers are various locations in the city that require frequent observations. Such locations could include known high-crime areas, high-profile residences, and/or safe houses. We develop a math model to minimize the total number of vehicles needed to cover the customer demands and determine the optimal customer visit schedules and vehicle routes. A heuristic method is developed to handle large problem instances.
In the third study, presented in Section 3, we consider a single-item cyclic coordinated order fulfillment problem with batch supplies and flexible demands. The system in this study consists of multiple suppliers who each deliver a single item to a central node from which multiple demanders are then replenished. Importantly, demand is flexible and is a control action that the decision maker applies to optimize the system. The objective is to minimize total system cost subject to several operational constraints. The decisions include the timing and sizes of batches delivered by the suppliers to the central node and the timing and amounts by which demanders are replenished. We develop an integer programing model, provide several theoretical insights related to the model, and solve the math model for different problem sizes
- …