Skip to main content
SpringerLink
Log in

Time-Cost Solution Pairs in Multi-index Bulk Transportation Problem

  • Conference paper
  • First Online:
Data Science and Analytics (REDSET 2019)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 1230))

  • 805 Accesses

Abstract

Bi-Criteria Multi-Index Bulk Transportation Problem (BCMIBTP) is the extension of single criterion multi-index bulk transportation problem. There exist works in literature, for finding cost-time solution pairs in BCMIBTP, wherein cost is given priority over time. Sometimes, transportation time is more crucial than cost. So far, no method is discussed to get efficient time-cost solution pairs in BCMIBTP, where time criterion assumes priority over cost, to the best of our knowledge. Motivated by this research gap, a method is presented to minimize time and cost simultaneously. An example is discussed to illustrate the presented method.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Maio, A.D., Roveda, C.: An all zero-one algorithm for a certain class of Transportation problems. Oper. Res. 19, 1406–1418 (1971). https://doi.org/10.1287/opre.19.6.1406

    Article  MATH  Google Scholar 

  2. Murthy, M.S.: A bulk transportation problem. Opsearch 13, 143–155 (1976)

    MathSciNet  Google Scholar 

  3. Haley, K.B.: The solid transportation problem. Oper. Res. 10, 448–463 (1962). https://doi.org/10.1287/opre.10.4.448

    Article  MATH  Google Scholar 

  4. Haley, K.B.: The multi-index problem. Oper. Res. 11, 368–379 (1963). https://doi.org/10.1287/opre.11.3.368

    Article  MATH  Google Scholar 

  5. Vajda, S.: Readings in Linear Programming. Pitman, London (1958)

    MATH  Google Scholar 

  6. Smith, G.: A procedure for determining necessary and sufficient conditions for the existence of a solution to the multi-index problem. Aplikace Matematiky 19, 177–183 (1974)

    MathSciNet  MATH  Google Scholar 

  7. Bhatia, H.L., Swarup, K., Puri, M.C.: Time minimizing solid transportation problem. Math. Oper. Forsch. Stat. 7, 395–403 (1976). https://doi.org/10.1080/02331887608801306

    Article  MathSciNet  MATH  Google Scholar 

  8. Basu, M., Pal, B.B., Kundu, A.: An algorithm for the optimum time-cost trade-off in three-dimensional transportation problem. Optimization 28, 171–185 (1993). https://doi.org/10.1080/02331939308843912

    Article  MathSciNet  MATH  Google Scholar 

  9. Bandopadhya, L.: Cost-time trade-off in three-axial sums transportation problem. J. Aust. Math. Soc. Ser. 35, 498–505 (1994). https://doi.org/10.1017/S0334270000009577

    Article  MathSciNet  Google Scholar 

  10. Bhatia, H.L., Puri, M.C.: Time-cost trade-off in a solid transportation problem. J. Appl. Math. Mech. 57, 616–619 (1977). https://doi.org/10.1002/zamm.19770571013

    Article  MathSciNet  MATH  Google Scholar 

  11. Gupta, A.K., Sharma, J.K.: An iterative technique for time-cost trade-off in solid transportation problems. J. Math. Phy. Sci. 21, 133–142 (1987)

    MATH  Google Scholar 

  12. Singh, S., Chauhan, S.K., Kuldeep: A bi-criteria multi-index bulk transportation problem. Ann. Pure Appl. Math. 16, 479–485 (2018). https://doi.org/10.22457/apam.v16n2a26

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. MVN University, Palwal, Haryana, India

    Kuldeep Tanwar

  2. Amity School of Engineering and Technology, Noida, Uttar Pradesh, India

    Sudhir Kumar Chauhan

Authors
  1. Kuldeep Tanwar
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Sudhir Kumar Chauhan
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Kuldeep Tanwar .

Editor information

Editors and Affiliations

  1. GD Goenka University, Gurugram, India

    Usha Batra

  2. GD Goenka University, Sohna, Haryana, India

    Nihar Ranjan Roy

  3. University of Arkansas, Fayetteville, AR, USA

    Brajendra Panda

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Tanwar, K., Chauhan, S.K. (2020). Time-Cost Solution Pairs in Multi-index Bulk Transportation Problem. In: Batra, U., Roy, N., Panda, B. (eds) Data Science and Analytics. REDSET 2019. Communications in Computer and Information Science, vol 1230. Springer, Singapore. https://doi.org/10.1007/978-981-15-5830-6_14

Download citation

  • DOI: https://doi.org/10.1007/978-981-15-5830-6_14

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-15-5829-0

  • Online ISBN: 978-981-15-5830-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation