Bilevel transportation problem in neutrosophic environment

Multi-choice programming problems arise due to diverse needs of people. In this paper, multi-choice optimisation is applied to bilevel transportation problem. This problem deals with transportation at both the levels, upper as well as lower. There are multiple choices for demand and supply parameters. The multi-choice parameters at the respective levels are converted into polynomials which transmute the defined problem into a mixed integer programming problem. The objective of the paper is to determine a solution methodology for the transformed problem. The significance of the formulated model is exhibited through an example by applying it to a hotel industry. The fuzzy programing approach is employed to obtain the satisfactory solution for the decision makers at the two levels. A comparative analysis is presented in the paper by solving bilevel multi-choice transportation problem with goal programming mode as well as by the linear transformation technique proposed in the paper by Khalil et al. The example is solved using computing software.

Download Full-text

Decision making of transportation plan, a bilevel transportation problem approach

Journal of Industrial & Management Optimization ◽

10.3934/jimo.2005.1.305 ◽

2005 ◽

Vol 1 (3) ◽

pp. 305-314 ◽

Cited By ~ 4

Author(s):

G.S. Liu ◽

◽

J.Z. Zhang ◽

Keyword(s):

Decision Making ◽

Transportation Problem ◽

Bilevel Transportation ◽

Transportation Plan

Download Full-text

Time minimizing solid transportation problem

Optimization ◽

10.1080/02331937608842349 ◽

1976 ◽

Vol 7 (3) ◽

pp. 395-403

Author(s):

H.L. Bhatia ◽

Kanti Swarup ◽

M.C. Puri

Keyword(s):

Transportation Problem ◽

Solid Transportation Problem

Download Full-text

The assignment of airmen by solving the transportation problem.

PsycEXTRA Dataset ◽

10.1037/e417212004-001 ◽

1974 ◽

Author(s):

Manel Pina

Keyword(s):

Transportation Problem

Download Full-text

The Transportation Problem under Uncertainty

Journal of Automation and Information Sciences ◽

10.1615/jautomatinfscien.v52.i4.10 ◽

2020 ◽

Vol 52 (4) ◽

pp. 1-13

Author(s):

Alexander A. Pavlov ◽

Elena G. Zhdanova

Keyword(s):

Transportation Problem

Download Full-text

OPTIMAL FEASIBLE SOLUTIONS TO A ROAD FREIGHT TRANSPORTATION PROBLEM

MALAYSIAN JOURNAL OF COMPUTING ◽

10.24191/mjoc.v5i1.7786 ◽

2020 ◽

Vol 5 (1) ◽

pp. 456

Author(s):

Tolulope Latunde ◽

Joseph Oluwaseun Richard ◽

Opeyemi Odunayo Esan ◽

Damilola Deborah Dare

Keyword(s):

Transportation Problem ◽

Optimal Solution ◽

Transportation Cost ◽

North West ◽

Life Problems ◽

Basic Feasible Solutions ◽

Feasible Solutions ◽

Road Freight Transportation ◽

The Cost ◽

Cost Of Transportation

For twenty decades, there is a visible ever forward advancement in the technology of mobility, vehicles and transportation system in general. However, there is no "cure-all" remedy ideal enough to solve all life problems but mathematics has proven that if the problem can be determined, it is most likely solvable. New methods and applications will keep coming to making sure that life problems will be solved faster and easier. This study is to adopt a mathematical transportation problem in the Coca-Cola company aiming to help the logistics department manager of the Asejire and Ikeja plant to decide on how to distribute demand by the customers and at the same time, minimize the cost of transportation. Here, different algorithms are used and compared to generate an optimal solution, namely; North West Corner Method (NWC), Least Cost Method (LCM) and Vogel’s Approximation Method (VAM). The transportation model type in this work is the Linear Programming as the problems are represented in tables and results are compared with the result obtained on Maple 18 software. The study shows various ways in which the initial basic feasible solutions to the problem can be obtained where the best method that saves the highest percentage of transportation cost with for this problem is the NWC. The NWC produces the optimal transportation cost which is 517,040 units.

Download Full-text