IDEAS home Printed from https://ideas.repec.org/a/wly/jnljam/v2014y2014i1n108673.html

Threshold Accepting Heuristic for Fair Flow Optimization in Wireless Mesh Networks

Author

Listed:
  • Jarosław Hurkała
  • Tomasz Śliwiński

Abstract

Developing effective, fairness‐preserving optimization algorithms is of considerable importance in systems which serve many users. In this paper we show the results of the threshold accepting procedure applied to extremely difficult problem of fair resource allocation in wireless mesh networks (WMN). The fairness is modeled by allowing preferences with regard to distribution of Internet traffic between network participants. As aggregation operator we utilize weighted ordered weighted averaging (WOWA). In the underlaying optimization problem, the physical medium properties cause strong interference among simultaneously operating node devices, leading to nonlinearities in the mixed‐integer pricing subproblem. That is where the threshold accepting procedure is applied. We show that, the threshold accepting heuristic performs much better than the widely utilized simulated annealing algorithm.

Suggested Citation

  • Jarosław Hurkała & Tomasz Śliwiński, 2014. "Threshold Accepting Heuristic for Fair Flow Optimization in Wireless Mesh Networks," Journal of Applied Mathematics, John Wiley & Sons, vol. 2014(1).
    • Handle: RePEc:wly:jnljam:v:2014:y:2014:i:1:n:108673
    DOI: 10.1155/2014/108673
    as

    Download full text from publisher

    File URL: https://doi.org/10.1155/2014/108673
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2014/108673?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
    ---><---

    References listed on IDEAS

    as
    1. Włodzimierz Ogryczak, 2000. "Multiple criteria linear programming model for portfolio selection," Annals of Operations Research, Springer, vol. 97(1), pages 143-162, December.
    2. Koulamas, C & Antony, SR & Jaen, R, 1994. "A survey of simulated annealing applications to operations research problems," Omega, Elsevier, vol. 22(1), pages 41-56, January.
    3. C D Tarantilis & C T Kiranoudis & V S Vassiliadis, 2003. "A list based threshold accepting metaheuristic for the heterogeneous fixed fleet vehicle routing problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 54(1), pages 65-71, January.
    4. Tian, Peng & Ma, Jian & Zhang, Dong-Mo, 1999. "Application of the simulated annealing algorithm to the combinatorial optimisation problem with permutation property: An investigation of generation mechanism," European Journal of Operational Research, Elsevier, vol. 118(1), pages 81-94, October.
    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. Jang Ho Kim & Yongjae Lee & Woo Chang Kim & Frank J. Fabozzi, 2022. "Goal-based investing based on multi-stage robust portfolio optimization," Annals of Operations Research, Springer, vol. 313(2), pages 1141-1158, June.
    2. N. K. Oladejo & A. Abolarinwa & S. O. Salawu, 2020. "Linear Programming and Its Application Techniques in Optimizing Portfolio Selection of a Firm," Journal of Applied Mathematics, John Wiley & Sons, vol. 2020(1).
    3. 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.
    4. Serdar Kuzu & Murat Kirişci & Ali Kablan & Özden Calay, 2025. "Portfolio Selection Analysis with a Fermatean Fuzzy-type AHP," Istanbul Journal of Economics-Istanbul Iktisat Dergisi, Istanbul University, Faculty of Economics, vol. 75(1), pages 44-66, July.
    5. Alkhamis, Talal M. & Hasan, Merza & Ahmed, Mohamed A., 1998. "Simulated annealing for the unconstrained quadratic pseudo-Boolean function," European Journal of Operational Research, Elsevier, vol. 108(3), pages 641-652, August.
    6. TKACENKO, Alexandra, 2014. "Linear Programming Methods For Solving The Portfolio’S Problems," Journal of Financial and Monetary Economics, Centre of Financial and Monetary Research "Victor Slavescu", vol. 1(1), pages 216-221.
    7. Menz, Georg & Schlichting, André & Tang, Wenpin & Wu, Tianqi, 2022. "Ergodicity of the infinite swapping algorithm at low temperature," Stochastic Processes and their Applications, Elsevier, vol. 151(C), pages 519-552.
    8. Sehgal, Ruchika & Sharma, Amita & Mansini, Renata, 2023. "Worst-case analysis of Omega-VaR ratio optimization model," Omega, Elsevier, vol. 114(C).
    9. Klamroth, Kathrin & Köbis, Elisabeth & Schöbel, Anita & Tammer, Christiane, 2017. "A unified approach to uncertain optimization," European Journal of Operational Research, Elsevier, vol. 260(2), pages 403-420.
    10. Thi-Kien Dao & Tien-Szu Pan & Trong-The Nguyen & Jeng-Shyang Pan, 2018. "Parallel bat algorithm for optimizing makespan in job shop scheduling problems," Journal of Intelligent Manufacturing, Springer, vol. 29(2), pages 451-462, February.
    11. Rachida Benfedel & Fayçal Belkaid & Nadjib Brahimi, 2025. "Production and distribution planning with direct shipment and multi-trips," Post-Print hal-05059003, HAL.
    12. Robinson, Powell & Narayanan, Arunachalam & Sahin, Funda, 2009. "Coordinated deterministic dynamic demand lot-sizing problem: A review of models and algorithms," Omega, Elsevier, vol. 37(1), pages 3-15, February.
    13. Rafael Rodríguez & Mariano Luque & Mercedes González, 2011. "Portfolio selection in the Spanish stock market by interactive multiobjective programming," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 19(1), pages 213-231, July.
    14. Pablo Adasme & Ali Dehghan Firoozabadi, 2019. "Facility Location with Tree Topology and Radial Distance Constraints," Complexity, Hindawi, vol. 2019, pages 1-29, November.
    15. Andrey Novoselov & Ivan Potravny & Irina Novoselova & Violetta Gassiy, 2020. "Sustainable Development of the Arctic Indigenous Communities: The Approach to Projects Optimization of Mining Company," Sustainability, MDPI, vol. 12(19), pages 1-18, September.
    16. Mut, Murat & Wiecek, Margaret M., 2011. "Generalized equitable preference in multiobjective programming," European Journal of Operational Research, Elsevier, vol. 212(3), pages 535-551, August.
    17. Krystel K. Castillo-Villar, 2014. "Metaheuristic Algorithms Applied to Bioenergy Supply Chain Problems: Theory, Review, Challenges, and Future," Energies, MDPI, vol. 7(11), pages 1-33, November.
    18. Nearchou, Andreas C., 2006. "Meta-heuristics from nature for the loop layout design problem," International Journal of Production Economics, Elsevier, vol. 101(2), pages 312-328, June.
    19. Moritz Mühlenthaler & Rolf Wanka, 2016. "Fairness in academic course timetabling," Annals of Operations Research, Springer, vol. 239(1), pages 171-188, April.
    20. Liu, Shuguang, 2013. "A hybrid population heuristic for the heterogeneous vehicle routing problems," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 54(C), pages 67-78.

    More about this item

    Statistics

    Access and download statistics

    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:wly:jnljam:v:2014:y:2014:i:1:n:108673. 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: Wiley Content Delivery (email available below). General contact details of provider: https://onlinelibrary.wiley.com/journal/4185 .

    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.