Multi-homing is a technology used by Internet Service Provider (ISP) to connect to the Internet via different network providers. To make full use of the underlying networks with minimum cost, an optimal routing strategy is required by ISPs. This study investigates the optimal routing strategy in case where network providers charge ISPs according to top-percentile pricing. We call this problem t...

the capacitated vehicle routing problem (cvrp) is a well-known combinatorial optimization problem that holds a central place in logistics management. the vehicle routing is an applied task in the industrial transportation for which an optimal solution will lead us to better services, save more time and ultimately increase in customer satisfaction. this problem is classified into np-hard problem...

In this paper, we present a new mass-flow based Mixed Integer Linear Programming (MILP) formulation for the Inventory Routing Problem (IRP) with explicit energy consumption. The problem is based on a multiperiod single-vehicle IRP with one depot and several customers. Instead of minimizing the distance or inventory cost, the problem takes energy minimization as an objective. In this formulation...

This paper presents a column generation algorithm for solving combined vehicle and inventory problems. This problem is based on the idea of coordinating customer inventory levels through a minimum routing cost. This is a combinatory decision problem since vehicle routing and inventory problems, are combined. Using the column generation method, we can iteratively generate interesting routes to t...

The inventory slack routing problem is a specialized vehicle routing problem that focuses on delivering waves of inventory to sites in a timely and even manner. It is difficult to find an optimal solution to this problem, thus heuristic and search techniques are necessary. ...

Many real-world optimization problems today are multi-objective multi-constraint generalizations of NP-hard problems. A classic case we study in this paper is the Inventory Routing Problem with Time Windows (IRPTW). IRPTW considers inventory costs across multiple instances of Vehicle Routing Problem with Time Windows (VRPTW). The latter is in turn extended with time-windows constraints from the...

In this work we consider the generalized vehicle routing problem with stochastic demands (GVRPSD). This NP-hard problem combines the clustering aspect of the generalized vehicle routing problem with the uncertainty aspect of the vehicle routing problem with stochastic demands. We propose an integer L-shaped method based on decomposition and branch-and-cut. The subproblem of computing the restoc...

We propose a stochastic optimization approach for the location and distribution problem of medical supplies to be used in disaster situations. We develop a robust decision support mechanism, which is serviceable under the wide variety of possible disaster types and magnitudes. In preparation for disasters, we develop a stochastic programming model to select the storage locations of medical supp...