IDEAS home Printed from https://ideas.repec.org/a/gam/jsusta/v15y2023i5p4289-d1082866.html
   My bibliography  Save this article

A Probabilistic Hill-Climbing Algorithm for the Single-Source Transportation Problem

Author

Listed:
  • Pisut Pongchairerks

    (Digital Engineering Program, Thai-Nichi International College, Thai-Nichi Institute of Technology, Bangkok 10250, Thailand)

Abstract

This paper proposes a probabilistic hill-climbing algorithm, called PH, for the single-source transportation problem (STP). PH is a tree search algorithm in which each node contains an assignment problem (AP) transformed from the STP being solved. The transformation converts each source’s product units into product lots; a product lot equals multiple product units. The AP aims to find the optimal assignment of product lots to destinations to minimize the total assignment cost. PH uses the Hungarian method to find the optimal solution of the AP in every node, which is a solution of the STP. For the AP of the root node (as the initial current node), the number of each source’s product lots is set to be small enough to guarantee the generation of a feasible solution for the STP. To generate every subsequent level, the current node is branched into multiple child nodes, in which the number of child nodes equals the number of sources in the STP. The AP of each child node is modified from the AP of the current node by adding one more product lot into a specific different source. Consequently, each child node provides a solution that is better than or the same as the current node’s solution; however, some child nodes’ solutions may be infeasible for the STP due to the insufficiency of a source’s capacity. If all of the child nodes cannot find a better feasible solution than the current node’s solution, PH stops its procedure. To diversify the search, PH selects one of the child nodes as the new current node in a probabilistic way, instead of always selecting the best child node. The experiment’s results in this paper reveal the performance of the three variants of PH.

Suggested Citation

  • Pisut Pongchairerks, 2023. "A Probabilistic Hill-Climbing Algorithm for the Single-Source Transportation Problem," Sustainability, MDPI, vol. 15(5), pages 1-14, February.
  • Handle: RePEc:gam:jsusta:v:15:y:2023:i:5:p:4289-:d:1082866
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2071-1050/15/5/4289/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/2071-1050/15/5/4289/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. V. Srinivasan & G. L. Thompson, 1973. "An Algorithm for Assigning Uses to Sources in a Special Class of Transportation Problems," Operations Research, INFORMS, vol. 21(1), pages 284-295, February.
    2. Robert M. Nauss, 2003. "Solving the Generalized Assignment Problem: An Optimizing and Heuristic Approach," INFORMS Journal on Computing, INFORMS, vol. 15(3), pages 249-266, August.
    3. Pentico, David W., 2007. "Assignment problems: A golden anniversary survey," European Journal of Operational Research, Elsevier, vol. 176(2), pages 774-793, January.
    4. Adriano De Maio & Claudio Roveda, 1971. "An all Zero-One Algorithm for a Certain Class of Transportation Problems," Operations Research, INFORMS, vol. 19(6), pages 1406-1418, October.
    5. Sabuncuoglu, I. & Bayiz, M., 1999. "Job shop scheduling with beam search," European Journal of Operational Research, Elsevier, vol. 118(2), pages 390-412, October.
    6. Pisut Pongchairerks & Yu Zhou, 2022. "A Two-Level Metaheuristic for the Job-Shop Scheduling Problem with Multipurpose Machines," Complexity, Hindawi, vol. 2022, pages 1-17, June.
    7. Pisut Pongchairerks, 2020. "An Enhanced Two-Level Metaheuristic Algorithm with Adaptive Hybrid Neighborhood Structures for the Job-Shop Scheduling Problem," Complexity, Hindawi, vol. 2020, pages 1-15, June.
    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. Pritibhushan Sinha, 2009. "Assignment problems with changeover cost," Annals of Operations Research, Springer, vol. 172(1), pages 447-457, November.
    2. T Öncan & S N Kabadi & K P K Nair & A P Punnen, 2008. "VLSN search algorithms for partitioning problems using matching neighbourhoods," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(3), pages 388-398, March.
    3. Ahmed Ghoniem & Tulay Flamand & Mohamed Haouari, 2016. "Optimization-Based Very Large-Scale Neighborhood Search for Generalized Assignment Problems with Location/Allocation Considerations," INFORMS Journal on Computing, INFORMS, vol. 28(3), pages 575-588, August.
    4. M. Gaudioso & L. Moccia & M. F. Monaco, 2010. "Repulsive Assignment Problem," Journal of Optimization Theory and Applications, Springer, vol. 144(2), pages 255-273, February.
    5. M Büther, 2010. "Reducing the elastic generalized assignment problem to the standard generalized assignment problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 61(11), pages 1582-1595, November.
    6. Mutsunori Yagiura & Toshihide Ibaraki & Fred Glover, 2004. "An Ejection Chain Approach for the Generalized Assignment Problem," INFORMS Journal on Computing, INFORMS, vol. 16(2), pages 133-151, May.
    7. Amit Kumar & Anila Gupta, 2013. "Mehar’s methods for fuzzy assignment problems with restrictions," Fuzzy Information and Engineering, Springer, vol. 5(1), pages 27-44, March.
    8. Ágoston, Kolos Csaba & Biró, Péter & Kováts, Endre & Jankó, Zsuzsanna, 2022. "College admissions with ties and common quotas: Integer programming approach," European Journal of Operational Research, Elsevier, vol. 299(2), pages 722-734.
    9. Xin Jia Jiang & Yanhua Xu & Chenhao Zhou & Ek Peng Chew & Loo Hay Lee, 2018. "Frame Trolley Dispatching Algorithm for the Frame Bridge Based Automated Container Terminal," Transportation Science, INFORMS, vol. 52(3), pages 722-737, June.
    10. Qingzhu Yao & Xiaoyan Zhu & Way Kuo, 2014. "A Birnbaum-importance based genetic local search algorithm for component assignment problems," Annals of Operations Research, Springer, vol. 212(1), pages 185-200, January.
    11. Cai, Zhiqiang & Si, Shubin & Sun, Shudong & Li, Caitao, 2016. "Optimization of linear consecutive-k-out-of-n system with a Birnbaum importance-based genetic algorithm," Reliability Engineering and System Safety, Elsevier, vol. 152(C), pages 248-258.
    12. Bennell, J.A. & Cabo, M. & Martínez-Sykora, A., 2018. "A beam search approach to solve the convex irregular bin packing problem with guillotine guts," European Journal of Operational Research, Elsevier, vol. 270(1), pages 89-102.
    13. Büther, Marcel, 2007. "Reducing the elastic generalized assignment problem to the standard generalized assignment problem," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 632, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    14. Agatz, Niels & Erera, Alan & Savelsbergh, Martin & Wang, Xing, 2012. "Optimization for dynamic ride-sharing: A review," European Journal of Operational Research, Elsevier, vol. 223(2), pages 295-303.
    15. Yokoya, Daisuke & Duin, Cees W. & Yamada, Takeo, 2011. "A reduction approach to the repeated assignment problem," European Journal of Operational Research, Elsevier, vol. 210(2), pages 185-193, April.
    16. Walteros, Jose L. & Vogiatzis, Chrysafis & Pasiliao, Eduardo L. & Pardalos, Panos M., 2014. "Integer programming models for the multidimensional assignment problem with star costs," European Journal of Operational Research, Elsevier, vol. 235(3), pages 553-568.
    17. Aidin Rezaeian & Hamidreza Koosha & Mohammad Ranjbar & Saeed Poormoaied, 2024. "The assignment of project managers to projects in an uncertain dynamic environment," Annals of Operations Research, Springer, vol. 341(2), pages 1107-1134, October.
    18. Rego, César & Duarte, Renato, 2009. "A filter-and-fan approach to the job shop scheduling problem," European Journal of Operational Research, Elsevier, vol. 194(3), pages 650-662, May.
    19. Jorge M. S. Valente, 2007. "Beam search heuristics for the single machine scheduling problem with linear earliness and quadratic tardiness costs," FEP Working Papers 250, Universidade do Porto, Faculdade de Economia do Porto.
    20. Bożena Staruch & Bogdan Staruch, 2021. "Competence-based assignment of tasks to workers in factories with demand-driven manufacturing," 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. 29(2), pages 553-565, 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:gam:jsusta:v:15:y:2023:i:5:p:4289-:d:1082866. 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.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.