IDEAS home Printed from https://ideas.repec.org/a/spr/ijsaem/v10y2019i5d10.1007_s13198-019-00889-4.html
   My bibliography  Save this article

Efficient triads related to transportation problem with common pivotal time

Author

Listed:
  • Sanchita Sharma

    (Indira Gandhi Delhi Technical University for Women)

  • Rita Malhotra

    (University of Delhi)

  • Shalini Arora

    (Indira Gandhi Delhi Technical University for Women)

Abstract

The present paper discusses a transportation problem with three objectives corresponding to the concept of common pivotal time. There may be a situation when different conflicting objectives have same pivotal time but routes consuming that pivotal time for those objectives are different. This may create a trade-off situation between the objectives over that pivotal time and thus create a desire for the associated efficient solutions. This paper explores such a situation by considering three linear conflicting objectives associated with the transportation problem. An algorithm has been proposed to obtain the desired triads of three objectives corresponding to all common pivotal followed by a theoretical justification. To exhibit the algorithm, a numerical illustration has been given at the end.

Suggested Citation

  • Sanchita Sharma & Rita Malhotra & Shalini Arora, 2019. "Efficient triads related to transportation problem with common pivotal time," 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. 10(5), pages 1353-1360, October.
    • Handle: RePEc:spr:ijsaem:v:10:y:2019:i:5:d:10.1007_s13198-019-00889-4
    DOI: 10.1007/s13198-019-00889-4
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s13198-019-00889-4
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s13198-019-00889-4?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    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. V. Srinivasan & G. L. Thompson, 1977. "Determining Cost vs. Time Pareto-Optimal Frontiers in Multi-Modal Transportation Problems," Transportation Science, INFORMS, vol. 11(1), pages 1-19, February.
    2. Prakash, Satya & Kumar, Pranav & Prasad, B.V.N.S. & Gupta, Anuj, 2008. "Pareto optimal solutions of a cost-time trade-off bulk transportation problem," European Journal of Operational Research, Elsevier, vol. 188(1), pages 85-100, July.
    3. Y. P. Aneja & K. P. K. Nair, 1979. "Bicriteria Transportation Problem," Management Science, INFORMS, vol. 25(1), pages 73-78, January.
    4. Arthur M. Geoffrion, 1967. "Solving Bicriterion Mathematical Programs," Operations Research, INFORMS, vol. 15(1), pages 39-54, February.
    Full references (including those not matched with items on IDEAS)

    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. Sedeno-Noda, A. & Gonzalez-Martin, C. & Gutierrez, J., 2005. "The biobjective undirected two-commodity minimum cost flow problem," European Journal of Operational Research, Elsevier, vol. 164(1), pages 89-103, July.
    2. Sedeno-Noda, A. & Gonzalez-Martin, C., 2000. "The biobjective minimum cost flow problem," European Journal of Operational Research, Elsevier, vol. 124(3), pages 591-600, August.
    3. Safer, Hershel M. & Orlin, James B., 1953-, 1995. "Fast approximation schemes for multi-criteria combinatorial optimization," Working papers 3756-95., Massachusetts Institute of Technology (MIT), Sloan School of Management.
    4. J. Fülöp & L. D. Muu, 2000. "Branch-and-Bound Variant of an Outcome-Based Algorithm for Optimizing over the Efficient Set of a Bicriteria Linear Programming Problem," Journal of Optimization Theory and Applications, Springer, vol. 105(1), pages 37-54, April.
    5. Hamacher, Horst W. & Pedersen, Christian Roed & Ruzika, Stefan, 2007. "Multiple objective minimum cost flow problems: A review," European Journal of Operational Research, Elsevier, vol. 176(3), pages 1404-1422, February.
    6. Sonia Singh & Shalabh Singh, 2018. "Bi-criteria transportation problem with multiple parameters," Annals of Operations Research, Springer, vol. 269(1), pages 667-692, October.
    7. 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.
    8. Zhong, Tao & Young, Rhonda, 2010. "Multiple Choice Knapsack Problem: Example of planning choice in transportation," Evaluation and Program Planning, Elsevier, vol. 33(2), pages 128-137, May.
    9. Yang, X. Q. & Goh, C. J., 1997. "A method for convex curve approximation," European Journal of Operational Research, Elsevier, vol. 97(1), pages 205-212, February.
    10. Aritra Pal & Hadi Charkhgard, 2019. "A Feasibility Pump and Local Search Based Heuristic for Bi-Objective Pure Integer Linear Programming," INFORMS Journal on Computing, INFORMS, vol. 31(1), pages 115-133, February.
    11. KIKOMBA KAHUNGU, Michaël & MABELA MAKENGO MATENDO, Rostin & M. NGOIE, Ruffin-Benoît & MAKENGO MBAMBALU, Fréderic & OKITONYUMBE Y.F, Joseph, 2013. "Les fondements mathématiques pour une aide à la décision du réseau de transport aérien : cas de la République Démocratique du Congo [Mathematical Foundation for Air Traffic Network Decision Aid : C," MPRA Paper 68533, University Library of Munich, Germany, revised Mar 2013.
    12. Przybylski, Anthony & Gandibleux, Xavier, 2017. "Multi-objective branch and bound," European Journal of Operational Research, Elsevier, vol. 260(3), pages 856-872.
    13. Singh, Preetvanti & Saxena, P. K., 2003. "The multiple objective time transportation problem with additional restrictions," European Journal of Operational Research, Elsevier, vol. 146(3), pages 460-476, May.
    14. Pankaj Gupta & Mukesh Mehlawat, 2007. "An algorithm for a fuzzy transportation problem to select a new type of coal for a steel manufacturing unit," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 15(1), pages 114-137, July.
    15. Boddiford, Ashley N. & Kaufman, Daniel E. & Skipper, Daphne E. & Uhan, Nelson A., 2023. "Approximating a linear multiplicative objective in watershed management optimization," European Journal of Operational Research, Elsevier, vol. 305(2), pages 547-561.
    16. Lizhen Shao & Matthias Ehrgott, 2014. "An objective space cut and bound algorithm for convex multiplicative programmes," Journal of Global Optimization, Springer, vol. 58(4), pages 711-728, April.
    17. Przybylski, Anthony & Gandibleux, Xavier & Ehrgott, Matthias, 2008. "Two phase algorithms for the bi-objective assignment problem," European Journal of Operational Research, Elsevier, vol. 185(2), pages 509-533, March.
    18. Diclehan Tezcaner & Murat Köksalan, 2011. "An Interactive Algorithm for Multi-objective Route Planning," Journal of Optimization Theory and Applications, Springer, vol. 150(2), pages 379-394, August.
    19. Cai, Zeen & Mo, Dong & Geng, Maosi & Tang, Wei & Chen, Xiqun Michael, 2023. "Integrating ride-sourcing with electric vehicle charging under mixed fleets and differentiated services," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 169(C).
    20. Derbel, Bilel & Humeau, Jérémie & Liefooghe, Arnaud & Verel, Sébastien, 2014. "Distributed localized bi-objective search," European Journal of Operational Research, Elsevier, vol. 239(3), pages 731-743.

    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:spr:ijsaem:v:10:y:2019:i:5:d:10.1007_s13198-019-00889-4. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.