Abstract

Very often items that are substitutable and complementary to each other are sent from suppliers to retailers for business. In this paper, for these types of items, fixed charge (FC) four-dimensional (4D) multi-item transportation problems (MITPs) are formulated with both space and budget constraints under crisp and rough environments. These items are damageable/breakable. The rates of damageability of the items depend on the quantity transported and the distance of travel i.e., path. A fixed charge is applied to each of the routes (independent of items). There are some depots/warehouses (origins) from which the items are transported to the sales counters (destinations) through different conveyances and routes. In proposed FC 4D-MITP models, per unit selling prices, per unit purchasing prices, per unit transportation expenditures, fixed charges, availabilities at the sources, demands at the destinations, conveyance capacities, total available space and budget are expressed by rough intervals, where the transported items are substitutable and complementary in nature. In this business, the demands for the items at the destinations are directly related to their substitutability and complementary natures and prices. The suggested rough model is converted into a deterministic one using lower and upper approximation intervals following Hamzehee et al. as well as Expected Value Techniques. The converted model is optimized through the Generalized Reduced Gradient (GRG) techniques using LINGO 14 software . Finally, numerical examples are presented to illustrate the preciseness of the proposed model. As particular cases, different models such as 2D, 3D FCMITPs for two substitute items, one item with its complement and two non substitute non complementary items are derived and results are presented.

Highlights

  • Due to globalization, nowadays, transportation of commodities from sources to the destinations by road is getting more important

  • The credit of first transportation problem goes to Hitchcock [1], which is a particular case of Linear Programming Problem (LPP)

  • Renowned scientific discoveries and Research always had a practical application in the real world

Read more

Summary

Introduction

Nowadays, transportation of commodities from sources to the destinations by road is getting more important. The advent of transportation problem (TP) was mainly based on real-life problems. Many numbers of real-life goods carrying problems are framed as transportation problems. The credit of first transportation problem goes to Hitchcock [1], which is a particular case of Linear Programming Problem (LPP). This optimizing problem consists of two main. Mathematics 2019, 7, 281 constraints i.e., source and destination constraints. It is very common knowledge that, in practical situations, these two constraints are not enough to formulate the problem perfectly since there exist other constraints, namely mode of transport, type of products, the distance of path traveled, etc

Results
Discussion
Conclusion
Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.