A New Variant of MTF-TRANS List Accessing Hybrid Algorithm

  • Richismita RoutEmail author
  • Shiba Prasad Dash
  • Pratyashi Satapathy
Conference paper
Part of the Advances in Intelligent Systems and Computing book series (AISC, volume 1089)


The whole problem of effectively reorganizing the list and also accessing its elements in order to obtain the optimal cost is list accessing problem. Here, the input is an unsorted linear list of distinct elements along with a sequence of requests; each element present in the request sequence is operated on an element in the list. The algorithm which is used to reorganize the list in order to obtain a minimum cost is list accessing algorithm. MTF and TRANS are two basic list accessing algorithms. In this thesis, we have analyzed both MTF and TRANS algorithms, and on the basis of their strengths, we have developed a new hybrid algorithm. The newly developed hybrid algorithm utilizes both the MTF and TRANS algorithms. We have performed experimental analysis on the newly developed hybrid algorithm, and it is found that it performs better in comparison with MTF and TRANS algorithms.


List accessing problem Request sequences MTF TRANS Hybrid algorithm 


  1. 1.
    Rout, D.: Experimental analysis of hybrid MTF-TRANS-FC (HMTFC) algorithm. Int. J. Res. Advent Technol. E. 1(5) (2013). ISSN: 2321-9637Google Scholar
  2. 2.
    Samanta, B., Dash, S.P.: A novel hybrid approach to list accessing problem using BIT algorithm. In: International Conference on Man and Machine Interfacing (MAMI) (2015)Google Scholar
  3. 3.
    Albers, S.: Online algorithms: a survey. Math. Program. 97 (2003). Print: ISSN 0025-5610/Online ISSN 1436-4646Google Scholar
  4. 4.
    Albers, S.: A competitive analysis of list update problem with lookahead. Theor. Comput. Sci. 197(1–2), 95–109 (1998)MathSciNetCrossRefGoogle Scholar
  5. 5.
    Mohanty, R., Tripathy, S.: An improved move to front offline algorithm for list accessing problem. IJACC 3(1) (2011)Google Scholar
  6. 6.
    Mohanty, R., et al.: TRANS outperforms MTF for two special types of request sequence without locality of reference. Procedia Technol. 6, 556–563 (2012).
  7. 7.
    Mohanty, R., Sharma, B., Tripathy, S.: Characterization of request sequences for list accessing algorithm and new theoretical results for MTF algorithm. IJCA 22(8) (2011). ISSN: 0975-8887Google Scholar
  8. 8.
    McCabe, J.: On serial files with relocatable records. Oper. Res. 12, 609–618 (1965)Google Scholar

Copyright information

© Springer Nature Singapore Pte Ltd. 2020

Authors and Affiliations

  • Richismita Rout
    • 1
    Email author
  • Shiba Prasad Dash
    • 1
  • Pratyashi Satapathy
    • 1
  1. 1.Biju Patnaik University of TechnologyRourkelaIndia

Personalised recommendations