this paper addresses the vehicle routing problem with delivery time cost. this problem aims to find a set of routes of minimal total costs including the travelling cost and delivery time cost, starting and ending at the depot, in such a way that each customer is visited by one vehicle given the capacity of the vehicle to satisfy a specific demand. in this research, a hybrid metaheuristic approa...

in this paper, boundary value problems of fractional order are converted into an optimal control problems. then an approximate solution is constructed from translations and dilations of a b-spline function such that the exact boundary conditions are satisfied. the fractional differential operators are taken in the riemann-liouville and caputo sense. several example are given and the optimal err...

Given an instance of the minimum cost flow problem, a version of the corresponding inverse problem, called the capacity inverse problem, is to modify the upper and lower bounds on arc flows as little as possible so that a given feasible flow becomes optimal to the modified minimum cost flow problem. The modifications can be measured by different distances. In this article, we consider the capac...

in this paper, we study the multi-depot vehiclerouting problem with inter-depot routes, in which the vehicles can replenish atintermediate depots. vehicles leave the origin depot with load on-board andserve customers until out of load. they may visit an intermediate depot toreplenish and finally return to the origin depot, completing their route. weinitiate a mathematical mixed integer programm...

the existing works considering the flow-based discount factor in the hub and spoke problems, assume that increasing the amount of flow passing through each edge of network continuously decreases the unit flow transportation cost. although a higher volume of flow allows for using wider links and consequently cheaper transportation, but the unit of flow enjoys more discounts, quite like replacing...

We consider flow rounding: finding an integral flow from a fractional flow. Costed flow rounding asks that we find an integral flow with no worse cost. Randomized flow rounding requires we randomly find an integral flow such that the expected flow along each edge matches the fractional flow. Both problems are reduced to cycle canceling, for which we develop an O(m log n 2 m ) algorithm.

the performance of water flooding can be investigated by using either detail numerical modeling or simulation, or simply through the analytical buckley-leverett (bl) model. the buckley-leverett analytical technique can be applied to one-dimensional homogeneous systems. in this paper, the impact of heterogeneity on water flooding performance and fractional flow curve is investigated. first, a ba...

The main goal of this project is to investigate the network flow allocation (routing) problem, and devise a practical algorithm for its solution. Particularly, we plan to investigate the trade-off between the algorithm’s optimality and its implementability; therefore, obtaining an 2-suboptimal solution would be sufficient, if this will speed-up convergence or simplify the overall algorithm. Thi...

The minimum cut problem (or mincut problem) is to find a cut of minimum cost. If all costs are 1 then the problem becomes the problem of finding a cut with as few edges as possible. Cuts are often defined in a different, not completely equivalent, way. Define a cutset to be a set of edges whose removal disconnects the graph into at least two connected components. Minimal cutsets (a minimal cuts...