• DocumentCode
    3773623
  • Title

    Forward Greedy Heuristic Algorithm for N-Vehicle Exploration Problem(NVEP)

  • Author

    Ruoyang Liu;Jinchuan Cui;Yuqing Song

  • Author_Institution
    Logistics Sch., Beijing Wuzi Univ., Beijing, China
  • Volume
    2
  • fYear
    2015
  • Firstpage
    243
  • Lastpage
    246
  • Abstract
    This paper introduces the N-Vehicle Exploration Problem (NVEP), and some properties of it. Then based on the previous work of Backward Greedy Heuristic Algorithm (BGH) [11], a improved algorithm, called Forward Greedy Heuristic Algorithm (FGH) has been put forward. It is proposed from the opposite direction of BGH, and has the same complexity as BGH, of which is O(n4). Last, the compared results calculated by ten cases from [6] show that FGH has a better effectiveness.
  • Keywords
    "Vehicles","Heuristic algorithms","Algorithm design and analysis","Complexity theory","Approximation algorithms","Aircraft"
  • Publisher
    ieee
  • Conference_Titel
    Computational Intelligence and Design (ISCID), 2015 8th International Symposium on
  • Print_ISBN
    978-1-4673-9586-1
  • Type

    conf

  • DOI
    10.1109/ISCID.2015.133
  • Filename
    7469124
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=3773623