IDEAS home Printed from https://ideas.repec.org/a/eee/matcom/v204y2023icp727-742.html
   My bibliography  Save this article

Extension of Particle Swarm Optimization algorithm for solving two-level time minimization transportation problem

Author

Listed:
  • Singh, Gurwinder
  • Singh, Amarinder

Abstract

A time minimization transportation problem deals with the resource efficiency to minimize time taken by the transport systems to deliver the commodity from sources to destinations. In this paper, a two-level time minimization transportation problem has been considered that categorizes the source–destination links into Level-I and Level-II with respect to the higher and lower level priority. The optimal delivery schedule of Level-I is followed up with the same for the Level-II cells. The paper proposes a solution procedure consisting of new algorithms that have been hybridized within the Particle Swarm Optimization to solve the problem making efficient use of resources. The solution procedure provides a methodical approach to the transport enterprises.This procedure does away with the rigid constraints, such as the location and number of non-zero allocations, required to be met by the traditional techniques of solving the transportation problem. The procedure generates pairs of Level-I and Level-II times at each iteration and the best pair(s) amongst these is/are marked out as the optimal solution of the problem. The solution procedure is explained through a numerical illustration.

Suggested Citation

  • Singh, Gurwinder & Singh, Amarinder, 2023. "Extension of Particle Swarm Optimization algorithm for solving two-level time minimization transportation problem," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 204(C), pages 727-742.
    • Handle: RePEc:eee:matcom:v:204:y:2023:i:c:p:727-742
    DOI: 10.1016/j.matcom.2022.09.013
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0378475422003895
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.matcom.2022.09.013?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. Sun, Minghe & Aronson, Jay E. & McKeown, Patrick G. & Drinka, Dennis, 1998. "A tabu search heuristic procedure for the fixed charge transportation problem," European Journal of Operational Research, Elsevier, vol. 106(2-3), pages 441-456, April.
    2. R. S. Garfinkel & M. R. Rao, 1971. "The bottleneck transportation problem," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 18(4), pages 465-472, December.
    3. Sonia & Munish Puri, 2004. "Two level hierarchical time minimizing transportation problem," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 12(2), pages 301-330, December.
    4. Vikas Sharma & Kalpana Dahiya & Vanita Verma, 2010. "Capacitated Two-Stage Time Minimization Transportation Problem," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 27(04), pages 457-476.
    5. V. Srinivasan & G. L. Thompson, 1976. "Algorithms for minimizing total cost, bottleneck time and bottleneck shipment in transportation problems," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 23(4), pages 567-595, December.
    6. Sharma, Anuj & Verma, Vanita & Kaur, Prabhjot & Dahiya, Kalpana, 2015. "An iterative algorithm for two level hierarchical time minimization transportation problem," European Journal of Operational Research, Elsevier, vol. 246(3), pages 700-707.
    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. Fanrong Xie & Zuoan Li, 2022. "An iterative solution technique for capacitated two-stage time minimization transportation problem," 4OR, Springer, vol. 20(4), pages 637-684, December.
    2. Prabhjot Kaur & Anuj Sharma & Vanita Verma & Kalpana Dahiya, 2022. "An alternate approach to solve two-level hierarchical time minimization transportation problem," 4OR, Springer, vol. 20(1), pages 23-61, March.
    3. Xie, Fanrong & Butt, Muhammad Munir & Li, Zuoan & Zhu, Linzhi, 2017. "An upper bound on the minimal total cost of the transportation problem with varying demands and supplies," Omega, Elsevier, vol. 68(C), pages 105-118.
    4. Lutz, Christian M. & Roscoe Davis, K. & Sun, Minghe, 1998. "Determining buffer location and size in production lines using tabu search," European Journal of Operational Research, Elsevier, vol. 106(2-3), pages 301-316, April.
    5. 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.
    6. Yi Zhao & Qingwan Xue & Xi Zhang, 2018. "Stochastic Empty Container Repositioning Problem with CO 2 Emission Considerations for an Intermodal Transportation System," Sustainability, MDPI, vol. 10(11), pages 1-24, November.
    7. 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.
    8. Sharma, Anuj & Verma, Vanita & Kaur, Prabhjot & Dahiya, Kalpana, 2015. "An iterative algorithm for two level hierarchical time minimization transportation problem," European Journal of Operational Research, Elsevier, vol. 246(3), pages 700-707.
    9. 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.
    10. I. Stancu-Minasian & R. Caballero & E. Cerdá & M. Muñoz, 1999. "The stochastic bottleneck linear programming problem," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 7(1), pages 123-143, June.
    11. Borisovsky, P. & Dolgui, A. & Eremeev, A., 2009. "Genetic algorithms for a supply management problem: MIP-recombination vs greedy decoder," European Journal of Operational Research, Elsevier, vol. 195(3), pages 770-779, June.
    12. Abhijit Baidya & Uttam Kumar Bera, 2019. "New model for addressing supply chain and transport safety for disaster relief operations," Annals of Operations Research, Springer, vol. 283(1), pages 33-69, December.
    13. Gurwinder Singh & Amarinder Singh, 2021. "Solving fixed-charge transportation problem using a modified particle swarm optimization algorithm," 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. 12(6), pages 1073-1086, December.
    14. Pravash Kumar Giri & Manas Kumar Maiti & Manoranjan Maiti, 2023. "Profit maximization fuzzy 4D-TP with budget constraint for breakable substitute items: a swarm based optimization approach," OPSEARCH, Springer;Operational Research Society of India, vol. 60(2), pages 571-615, June.
    15. Dukwon Kim & Xinyan Pan & Panos Pardalos, 2006. "An Enhanced Dynamic Slope Scaling Procedure with Tabu Scheme for Fixed Charge Network Flow Problems," Computational Economics, Springer;Society for Computational Economics, vol. 27(2), pages 273-293, May.
    16. Prabuddha De & Jay B. Ghosh & Charles E. Wells, 1992. "On the solution of a stochastic bottleneck assignment problem and its variations," Naval Research Logistics (NRL), John Wiley & Sons, vol. 39(3), pages 389-397, April.
    17. F Altiparmak & I Karaoglan, 2008. "An adaptive tabu-simulated annealing for concave cost transportation problems," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(3), pages 331-341, March.
    18. Kavita Gupta & Ritu Arora, 2017. "More for less method to minimize the unit transportation cost of a capacitated transportation problem with bounds on rim conditions," OPSEARCH, Springer;Operational Research Society of India, vol. 54(3), pages 460-474, September.
    19. Gen, Mitsuo & Kumar, Anup & Ryul Kim, Jong, 2005. "Recent network design techniques using evolutionary algorithms," International Journal of Production Economics, Elsevier, vol. 98(2), pages 251-261, November.
    20. Dimitri J. Papageorgiou & Alejandro Toriello & George L. Nemhauser & Martin W. P. Savelsbergh, 2012. "Fixed-Charge Transportation with Product Blending," Transportation Science, INFORMS, vol. 46(2), pages 281-295, May.

    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:matcom:v:204:y:2023:i:c:p:727-742. 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.journals.elsevier.com/mathematics-and-computers-in-simulation/ .

    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.