Leaders and Followers algorithm is a metaheuristic which uses two sets of solutions avoid comparison between random exploratory sample the best solutions. In this paper, it used to solve balanced transportation problem. There are some modifications in proposed order fit The evaluated using 138 problems. results better than obtained by other from previous studies. Overall, has no difficulty find...

Multi-choice programming problems arise due to diverse needs of people. In this paper, multi-choice optimisation is applied bilevel transportation problem. This problem deals with at both the levels, upper as well lower. There are multiple choices for demand and supply parameters. The parameters respective levels converted into polynomials which transmute defined a mixed integer objective paper...

This paper studies a Stochastic Multi-Period Location-Transportation Problem (SMLTP) characterized by multiple transportation options, multiple demand periods and a stochastic stationary demand. We consider the determination of the number and location of the depots required to satisfy a set of customer’s demands, and the mission of these depots in terms of the subset of customers they must supp...

In this paper we provide a compact, formal description for an important class of problems involving the deployment of diverse equipment (e.g., planes, ships, trucks) to transport cargo (e.g., personnel and material) throughout large geographical areas for private, government, and military purposes. The problem is particularly interesting for its combination of static and dynamic sources of comp...

We describe a mechanical device which can be used as an analog computer to solve the transportation problem. In practice this device is simulated by a numerical algorithm. Tests show that this algorithm is 60 times faster than a current subroutine (NAG library) for an average 1000 × 1000 problem. Its performance is even better for degenerate problems in which the weights take only a small numbe...

The auction algorithm is a parallel relaxation nictliod for solving the classical assignment problem. It resembles a competitive bidding process whereby unussigncd persons bid simultaneously for objects, thereby raising their prices. Once all bids arc in, objects arc awarded to the highest bidder. Tliis paper generalizes the auction :ilgoritliin to solve linear transportation problems. The idea...