IDEAS home Printed from https://ideas.repec.org/a/eee/jomega/v36y2008i5p913-917.html
   My bibliography  Save this article

On step fixed-charge transportation problem

Author

Listed:
  • Kowalski, Krzysztof
  • Lev, Benjamin

Abstract

The fixed-charge problem is a nonlinear programming problem of practical interest in business and industry. One of its variations is the fixed-charge transportation problem (FCTP) where fixed cost is incurred for every route that is used in the solution, along with the variable cost that is proportional to the amount shipped. That cost structure causes the value of the objective function Z to also behave like a step function. Each time we open or close a route the objective function jumps a step. The step fixed-charge transportation problem (SFCTP) is a variation of the FCTP where the fixed cost is in the form of a step function dependent on the load in a given route. While the value of the objective function Z in the FCTP is a step function, the introduction of the step fixed cost in the SFCTP results in the objective function Z being itself a step function with many more steps. Fixed-charge problems are usually solved using sophisticated analytical or computer software. This paper discusses the theory of SFCTP and presents a computationally simple heuristic algorithm for solving small SFCTPs.

Suggested Citation

  • Kowalski, Krzysztof & Lev, Benjamin, 2008. "On step fixed-charge transportation problem," Omega, Elsevier, vol. 36(5), pages 913-917, October.
    • Handle: RePEc:eee:jomega:v:36:y:2008:i:5:p:913-917
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0305-0483(07)00121-1
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Adlakha, Veena & Kowalski, Krzysztof, 2000. "A note on the procedure MFL for a more-for-less solution in transportation problems," Omega, Elsevier, vol. 28(4), pages 481-483, August.
    2. Kuo, Ching-Chung & Nicholls, Gillian M., 2007. "A mathematical modeling approach to improving locomotive utilization at a freight railroad," Omega, Elsevier, vol. 35(5), pages 472-485, October.
    3. Dorndorf, Ulrich & Drexl, Andreas & Nikulin, Yury & Pesch, Erwin, 2007. "Flight gate scheduling: State-of-the-art and recent developments," Omega, Elsevier, vol. 35(3), pages 326-334, June.
    4. Adlakha, Veena & Kowalski, Krzysztof & Vemuganti, R.R. & Lev, Benjamin, 2007. "More-for-less algorithm for fixed-charge transportation problems," Omega, Elsevier, vol. 35(1), pages 116-127, February.
    5. Adlakha, Veena & Kowalski, Krzysztof, 2003. "A simple heuristic for solving small fixed-charge transportation problems," Omega, Elsevier, vol. 31(3), pages 205-211, June.
    6. Liu, Shiang-Tai, 2003. "The total cost bounds of the transportation problem with varying demand and supply," Omega, Elsevier, vol. 31(4), pages 247-251, August.
    7. Abd El-Wahed, Waiel F. & Lee, Sang M., 2006. "Interactive fuzzy goal programming for multi-objective transportation problems," Omega, Elsevier, vol. 34(2), pages 158-166, April.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Hong, Jiangtao & Diabat, Ali & Panicker, Vinay V. & Rajagopalan, Sridharan, 2018. "A two-stage supply chain problem with fixed costs: An ant colony optimization approach," International Journal of Production Economics, Elsevier, vol. 204(C), pages 214-226.
    2. Li, Xiangyong & Aneja, Y.P. & Huo, Jiazhen, 2012. "Using branch-and-price approach to solve the directed network design problem with relays," Omega, Elsevier, vol. 40(5), pages 672-679.
    3. Zhu, Kai & Ji, Kaiyuan & Shen, Jiayu, 2021. "A fixed charge transportation problem with damageable items under uncertain environment," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 581(C).
    4. Sharmistha Halder Jana & Biswapati Jana & Barun Das & Goutam Panigrahi & Manoranjan Maiti, 2019. "Constrained FC 4D MITPs for Damageable Substitutable and Complementary Items in Rough Environments," Mathematics, MDPI, vol. 7(3), pages 1-26, March.
    5. Adlakha, Veena & Kowalski, Krzysztof & Wang, Simi & Lev, Benjamin & Shen, Wenjing, 2014. "On approximation of the fixed charge transportation problem," Omega, Elsevier, vol. 43(C), pages 64-70.
    6. Lev, Benjamin & Kowalski, Krzysztof, 2011. "Modeling fixed-charge problems with polynomials," Omega, Elsevier, vol. 39(6), pages 725-728, December.
    7. J R Montoya-Torres & A Aponte & P Rosas, 2011. "Applying GRASP to solve the multi-item three-echelon uncapacitated facility location problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 62(2), pages 397-406, February.
    8. Ma, Hong & Miao, Zhaowei & Lim, Andrew & Rodrigues, Brian, 2011. "Crossdocking distribution networks with setup cost and time window constraint," Omega, Elsevier, vol. 39(1), pages 64-72, January.
    9. Ram Kumar P N, 2013. "On Modeling The Step Fixed-Charge Transportation Problem," Working papers 134, Indian Institute of Management Kozhikode.
    10. Adlakha, Veena & Kowalski, Krzysztof & Lev, Benjamin, 2010. "A branching method for the fixed charge transportation problem," Omega, Elsevier, vol. 38(5), pages 393-397, October.
    11. Asif Iqbal Malik & Biswajit Sarkar, 2019. "Coordinating Supply-Chain Management under Stochastic Fuzzy Environment and Lead-Time Reduction," Mathematics, MDPI, vol. 7(5), pages 1-28, May.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Ma, Hong & Miao, Zhaowei & Lim, Andrew & Rodrigues, Brian, 2011. "Crossdocking distribution networks with setup cost and time window constraint," Omega, Elsevier, vol. 39(1), pages 64-72, January.
    2. Adlakha, Veena & Kowalski, Krzysztof & Wang, Simi & Lev, Benjamin & Shen, Wenjing, 2014. "On approximation of the fixed charge transportation problem," Omega, Elsevier, vol. 43(C), pages 64-70.
    3. Arsham, Hossein & Adlakha, Veena & Lev, Benjamin, 2009. "A simplified algebraic method for system of linear inequalities with LP applications," Omega, Elsevier, vol. 37(4), pages 876-882, August.
    4. Zhang, Jiayuan & Yalcin, Mehmet G. & Hales, Douglas N., 2021. "Elements of paradoxes in supply chain management literature: A systematic literature review," International Journal of Production Economics, Elsevier, vol. 232(C).
    5. A. N. Balaji & J. Mukund Nilakantan & Izabela Nielsen & N. Jawahar & S. G. Ponnambalam, 2019. "Solving fixed charge transportation problem with truck load constraint using metaheuristics," Annals of Operations Research, Springer, vol. 273(1), pages 207-236, February.
    6. Adlakha, Veena & Kowalski, Krzysztof & Lev, Benjamin, 2010. "A branching method for the fixed charge transportation problem," Omega, Elsevier, vol. 38(5), pages 393-397, October.
    7. Jawahar, N. & Balaji, A.N., 2009. "A genetic algorithm for the two-stage supply chain distribution problem associated with a fixed charge," European Journal of Operational Research, Elsevier, vol. 194(2), pages 496-537, April.
    8. Hong, Jiangtao & Diabat, Ali & Panicker, Vinay V. & Rajagopalan, Sridharan, 2018. "A two-stage supply chain problem with fixed costs: An ant colony optimization approach," International Journal of Production Economics, Elsevier, vol. 204(C), pages 214-226.
    9. Dalalah, Doraid & Lev, Benjamin, 2009. "Duality of the improved algebraic method (DIAM)," Omega, Elsevier, vol. 37(5), pages 1027-1035, October.
    10. S. Dutta & S. Acharya & Rajashree Mishra, 2016. "Genetic algorithm based fuzzy stochastic transportation programming problem with continuous random variables," OPSEARCH, Springer;Operational Research Society of India, vol. 53(4), pages 835-872, December.
    11. Sumati Mahajan & S. K. Gupta, 2021. "On fully intuitionistic fuzzy multiobjective transportation problems using different membership functions," Annals of Operations Research, Springer, vol. 296(1), pages 211-241, January.
    12. Şeker, Merve & Noyan, Nilay, 2012. "Stochastic optimization models for the airport gate assignment problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 48(2), pages 438-459.
    13. Ulrich Dorndorf & Florian Jaehn & Erwin Pesch, 2017. "Flight gate assignment and recovery strategies with stochastic arrival and departure times," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 39(1), pages 65-93, January.
    14. Sharma, Dinesh K. & Jana, R.K., 2009. "A hybrid genetic algorithm model for transshipment management decisions," International Journal of Production Economics, Elsevier, vol. 122(2), pages 703-713, December.
    15. Lv, Y. & Yan, X.D. & Sun, W. & Gao, Z.Y., 2015. "A risk-based method for planning of bus–subway corridor evacuation under hybrid uncertainties," Reliability Engineering and System Safety, Elsevier, vol. 139(C), pages 188-199.
    16. Mojtaba Akbari & Saber Molla-Alizadeh-Zavardehi & Sadegh Niroomand, 2020. "Meta-heuristic approaches for fixed-charge solid transportation problem in two-stage supply chain network," Operational Research, Springer, vol. 20(1), pages 447-471, March.
    17. M. A. Hoque & Z. A. M. S. Juman, 2024. "Decreased minimum total transportation–inventory cost bounds assuming variability in supplies and demands," OPSEARCH, Springer;Operational Research Society of India, vol. 61(4), pages 1888-1905, December.
    18. S. K. Bharati & Rita Malhotra, 2017. "Two stage intuitionistic fuzzy time minimizing transportation problem based on generalized Zadeh’s extension principle," International Journal of System Assurance Engineering and Management, Springer;The Society for Reliability, Engineering Quality and Operations Management (SREQOM),India, and Division of Operation and Maintenance, Lulea University of Technology, Sweden, vol. 8(2), pages 1442-1449, November.
    19. Hong, Sung-Pil & Kim, Kyung Min & Lee, Kyungsik & Hwan Park, Bum, 2009. "A pragmatic algorithm for the train-set routing: The case of Korea high-speed railway," Omega, Elsevier, vol. 37(3), pages 637-645, June.
    20. Sankar Kumar Roy & Gurupada Maity & Gerhard-Wilhelm Weber, 2017. "Multi-objective two-stage grey transportation problem using utility function with goals," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 25(2), pages 417-439, June.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:jomega:v:36:y:2008:i:5:p:913-917. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/375/description#description .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.