The senior transportation problem (STP) is an optimization problem in which a fixed fleet of volunteer-operated, heterogeneous vehicles from multiple depots must satisfy as many elderly door-to-door transportation requests as possible within a fixed time horizon. All requests consist of a oneto-one pickup and delivery with time windows. Moreover, as the clients are seniors, a maximum ride time ...

In this paper, we concentrate on developing a bi-fuzzy multi objective transportation problem (MOSTP) according to bi-fuzzy expected value method (EVM). In a transportation model, the available discount is normally offered on items/criteria, etc., in the form all unit discount (AUD) or incremental quantity discount (IQD) or combination of these two. Here transportation model is considered with ...

this paper introduces an implicit scheme for a   continuous representation of nonexpansive mappings on a closed convex subset of a hilbert space with respect to a   sequence of invariant means defined on an appropriate space of bounded, continuous real valued functions of the semigroup.   the main result is to    prove the strong convergence of the proposed implicit scheme to the unique solutio...

We study the online transportation problem. We show that the halfopt-competitive ratio for the greedy algorithm is (min(m; logC)), where m is the number of server sites, and C is the total number of servers. We also present an algorithm Balance that is a modi cation of the greedy algorithm and that has a halfopt-competitive ratio of O(1).

Consider a transportation problem with sets of sources and sinks. There are profits and prices on the edges. The goal is to maximize the profit while meeting the following constraints; the total flow going out of a source must not exceed its capacity and the total price of the incoming flow on a sink must not exceed its budget. This problem is closely related to the generalized flow problem. We...

In this article we present an algorithm for converting a network problem with several sources and several sinks including several transfer nodes and condition of supplying the demand of any sink from a particular source to the transportation problem.  Towards this end, and considering the very special structure of transportation algorithm, after implementing the shortest path algorithm or ...

1 Problem The interaction energy of an electric charge q and a " point " electric dipole with moment p of fixed magnitude, both at rest, is, in Gaussian units,

This paper formulates a mathematical model for the Green Vehicle Routing Problem (GVRP), incorporating bi-fuel (natural gas and gasoline) pickup trucks in a mixed vehicle fleet. The objective is to minimize overall costs relating to service (earliness and tardiness), transportation (fixed, variable and fuel), and carbon emissions. To reflect a real-world situation, the study considers: (1) a co...