Table of Contents Author Guidelines Submit a Manuscript
Journal of Applied Mathematics
Volume 2014, Article ID 108673, 11 pages
http://dx.doi.org/10.1155/2014/108673
Research Article

Threshold Accepting Heuristic for Fair Flow Optimization in Wireless Mesh Networks

Institute of Control & Computation Engineering, Warsaw University of Technology, Ulica Nowowiejska 15/19, 00-665 Warsaw, Poland

Received 10 February 2014; Revised 27 April 2014; Accepted 7 May 2014; Published 25 May 2014

Academic Editor: Dritan Nace

Copyright © 2014 Jarosław Hurkała and Tomasz Śliwiński. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. D. Bertsekas and R. Gallager, Data Networks, Prentice Hall, Englewood Cliffs, NJ, USA, 1987.
  2. J. Jaffe, “Bottleneck flow control,” IEEE Transactions on Communications, vol. 7, pp. 207–237.
  3. M. Pióro and D. Medhi, Routing, Flow and Capacity Design in Communication and Computer Networks, Morgan Kaufmann, San Francisco Calif, USA, 2004.
  4. D. Nace and M. Pióro, “Max-min fairness and its applications to routing and load-balancing in communication networks: A tutorial,” IEEE Communications Surveys and Tutorials, vol. 10, no. 4, pp. 5–17, 2008. View at Publisher · View at Google Scholar · View at Scopus
  5. I. Ahmed, A. Mohamed, and H. Alnuweiri, “On the fairness of resource allocation in wireless mesh networks: a survey,” Wireless Networks, vol. 19, pp. 1451–1468, 2013. View at Google Scholar
  6. R. R. Yager, “On ordered weighted averaging aggregation operators in multicriteria decisionmaking,” IEEE Transactions on Systems, Man, and Cybernetics, vol. 18, no. 1, pp. 183–190, 1988. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  7. R. R. Yager and J. Kacprzyk, The Ordered Weighted Averaging Operators, Theory and Applications, Kluwer Academic, Dordrecht, The Netherlands, 1997.
  8. W. Ogryczak and T. Śliwiński, “On equitable approaches to resource allocation problems: the conditional minimax solutions,” Journal of Telecommunications and Information Technology, vol. 3, pp. 40–48, 2002. View at Google Scholar
  9. M. M. Kostreva and W. Ogryczak, “Linear optimization with multiple equitable criteria,” RAIRO Operations Research, vol. 33, no. 3, pp. 275–297, 1999. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  10. J. Rawls, The Theory of Justice, Harvard University Press, Cambridge, Mass, USA, 1971.
  11. D. E. Bell and H. Raiffa, “Risky choice revisited,” in Decision Making Descriptive, Normative and Prescriptive Interactions, pp. 99–112, Cambridge University Press, Cambridge, UK, 1988. View at Google Scholar
  12. R. R. Yager and D. P. Filev, Essentials of Fuzzy Modeling and Control, Wiley, New York, NY, USA, 1994.
  13. W. Ogryczak, “Multiple criteria linear programming model for portfolio selection,” Annals of Operations Research, vol. 97, pp. 143–162, 2000. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  14. W. Ogryczak and T. Śliwiński, “On solving linear programs with the ordered weighted averaging objective,” European Journal of Operational Research, vol. 148, no. 1, pp. 80–91, 2003. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  15. V. Torra, “The weighted OWA operator,” International Journal of Intelligent Systems, vol. 12, pp. 153–166, 1997. View at Google Scholar
  16. W. Ogryczak and T. Śliwiński, “On optimization of the importance weighted OWA aggregation of multiple criteria,” in Computational Science and Its Applications—ICCSA 2007, vol. 4705 of Lecture Notes in Computer Science, pp. 804–817, Springer, Berlin, Germany, 2007. View at Publisher · View at Google Scholar · View at Scopus
  17. J. Hurkała and T. Śliwiński, “Fair flow optimization with advanced aggregation operators in Wireless Mesh Networks,” in Proceedings of the IEEE Federated Conference on Computer Science and Information Systems, pp. 415–421, 2012.
  18. I. F. Akyildiz and X. Wang, “A survey on wireless mesh networks,” IEEE Communications Magazine, vol. 43, pp. 23–30, 2005. View at Publisher · View at Google Scholar · View at Scopus
  19. M. Pióro, M. Zotkiewicz, B. Staehle, D. Staehle, and D. Yuan, “On max-min fair flow optimization in wireless mesh networks,” Ad Hoc Networks, vol. 13, pp. 134–152, 2014. View at Publisher · View at Google Scholar · View at Scopus
  20. A. Capone, G. Carello, I. Filippini, S. Gualandi, and F. Malucelli, “Routing, scheduling and channel assignment in WMN networks: optimization, models and algorithms,” Ad Hoc Networks, vol. 8, pp. 545–563, 2010. View at Google Scholar
  21. G. B. Dantzig and P. Wolfe, “The decomposition algorithm for linear programming,” Operations Research, vol. 8, pp. 101–111, 1960. View at Google Scholar
  22. W. Ogryczak and T. Śliviński, “On efficient WOWA optimization for decision support under risk,” International Journal of Approximate Reasoning, vol. 50, no. 6, pp. 915–928, 2009. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  23. M. Grabish, S. A. Orlowski, and R. R. Yager, “Fuzzy aggregation of numerical preferences,” in Fuzzy Sets in Decision Analysis, Operations Research and Statistics, pp. 32–68, Kluwer Academic, Dodrecht, The Netherlands, 1999. View at Google Scholar
  24. S. J. Brams and A. D. Taylor, Fair Division: From Cacke Cutting to Dispute Resolution, Cambridge University Press, Cambridge, UK, 1996. View at MathSciNet
  25. W. Ogryczak, “On principles of fair resource allocation for importance weighted agents,” in Proceedings of the International Workshop on Social Informatics (SOCINFO '09), pp. 57–62, pol, June 2009. View at Publisher · View at Google Scholar · View at Scopus
  26. D. S. Lee, V. S. Vassiliadis, and J. M. Park, “A novel threshold accepting meta-heuristic for the job-shop scheduling problem,” Computers and Operations Research, vol. 31, no. 13, pp. 2199–2213, 2004. View at Publisher · View at Google Scholar · View at Scopus
  27. D. S. Lee, V. S. Vassiliadis, and J. M. Park, “List-based threshold-accepting algorithm for zero-wait scheduling of multiproduct batch plants,” Industrial and Engineering Chemistry Research, vol. 41, no. 25, pp. 6579–6588, 2002. View at Google Scholar · View at Scopus
  28. C. D. Tarantilis and C. T. Kiranoudis, “A list-based threshold accepting method for job shop scheduling problems,” International Journal of Production Economics, vol. 77, no. 2, pp. 159–171, 2002. View at Publisher · View at Google Scholar · View at Scopus
  29. C. D. Tarantilis, C. T. Kiranoudis, and V. S. Vassiliadis, “A list based threshold accepting algorithm for the capacitated vehicle routing problem,” International Journal of Computer Mathematics, vol. 79, no. 5, pp. 537–553, 2002. View at Publisher · View at Google Scholar · View at Scopus
  30. C. D. Tarantilis, C. T. Kiranoudis, and V. S. Vassiliadis, “A list based threshold accepting metaheuristic for the heterogeneous fixed fleet vehicle routing problem,” Journal of the Operational Research Society, vol. 54, no. 1, pp. 65–71, 2003. View at Publisher · View at Google Scholar · View at Scopus
  31. S. Kirkpatrick, C. D. Gelatt, Jr., and M. P. Vecchi, “Optimization by simulated annealing,” The American Association for the Advancement of Science, vol. 220, no. 4598, pp. 671–680, 1983. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  32. V. Černý, “Thermodynamical approach to the traveling salesman problem: an efficient simulation algorithm,” Journal of Optimization Theory and Applications, vol. 45, no. 1, pp. 41–51, 1985. View at Publisher · View at Google Scholar · View at MathSciNet
  33. C. Koulamas, “A survey of simulated annealing applications to operations research problems,” Omega, vol. 22, no. 1, pp. 41–56, 1994. View at Publisher · View at Google Scholar · View at Scopus
  34. P. Tian, J. Ma, and D.-M. Zhang, “Application of the simulated annealing algorithm to the combinatorial optimization problem with permutation property: an investigation of generation mechanism,” European Journal of Operational Research, vol. 118, no. 1, pp. 81–94, 1999. View at Publisher · View at Google Scholar · View at Scopus
  35. J. Hurkała and A. Hurkała, “Effective Design of the Simulated Annealing Algorithm for the Flowshop Problem with Minimum Makespan Criterion,” in Journal of Telecommunications and Information Technology, vol. 2, pp. 92–98, 2012. View at Google Scholar
  36. J. Hurkała and A. Hurkała, “Fair optimization with advanced aggregation operators in a multicriteria facility layout problem,” in Proceedings of the IEEE Federated Conference on Computer Science and Information Systems, pp. 355–362, 2013.
  37. Y. M. Wang and C. Parkan, “A minimax disparity approach for obtaining OWA operator weights,” Information Sciences, vol. 175, no. 1-2, pp. 20–29, 2005. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  38. B. S. Ahn, “Preference relation approach for obtaining OWA operators weights,” International Journal of Approximate Reasoning, vol. 47, no. 2, pp. 166–178, 2008. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  39. G. R. Amin, “Notes on properties of the OWA weights determination model,” Computers and Industrial Engineering, vol. 52, no. 4, pp. 533–538, 2007. View at Publisher · View at Google Scholar · View at Scopus