• DocumentCode
    188646
  • Title

    Ramification Algorithm for Transporting Routes in R2

  • Author

    Piersa, Jaroslaw

  • Author_Institution
    Fac. of Math. & Comput. Sci., Nicolas Copernicus Univ. in Torun, Torun, Poland
  • fYear
    2014
  • fDate
    10-12 Nov. 2014
  • Firstpage
    657
  • Lastpage
    664
  • Abstract
    In this work we propose simulated annealing based search algorithm for optimal ramified transportation route in ℝ2. The cost function of the transport network allows the system to merge small roads into larger highways, carry the goods together and separate them near the destination. As a result the transportation route ha multiple branching-in and -out points, to some extend similar to nerve system of the tree leaf. The problem is known to be NP-complete even for finite set of branching points and metric spaces.
  • Keywords
    search problems; simulated annealing; traffic engineering computing; transportation; NP-complete; branching points; metric spaces; optimal ramified transportation route; ramification algorithm; simulated annealing based search algorithm; transport network; tree leaf; Cost function; Merging; Roads; Shape; Simulated annealing; Transport network; ramification algorithm; simulated annealing optimization;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Tools with Artificial Intelligence (ICTAI), 2014 IEEE 26th International Conference on
  • Conference_Location
    Limassol
  • ISSN
    1082-3409
  • Type

    conf

  • DOI
    10.1109/ICTAI.2014.104
  • Filename
    6984540
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=188646