• DocumentCode
    694296
  • Title

    An improved variable neighborhood search for the open vehicle routing problem with time windows

  • Author

    Perwira Redi, A.A.N. ; Maghfiroh, Meilinda F. N. ; Yu, Vincent F.

  • Author_Institution
    Dept. of Ind. Manage., Nat. Taiwan Univ. of Sci. & Technol., Taipei, Taiwan
  • fYear
    2013
  • fDate
    10-13 Dec. 2013
  • Firstpage
    1641
  • Lastpage
    1645
  • Abstract
    This paper considers the open vehicle routing problem with time windows (OVRPTW). An improved variable neighborhood search (VNS) algorithm is proposed to solve the problem. The improved VNS features a route construction mechanism to ensure the customers with earlier time windows will be served first. The results of computational study indicate that the proposed algorithm can solve OVRPTW effectively.
  • Keywords
    search problems; vehicle routing; OVRPTW; VNS algorithm; VNS features; computational study; open vehicle routing problem with time windows; route construction mechanism; variable neighborhood search; Companies; Customer services; Educational institutions; Search problems; Time factors; Vehicle routing; Vehicles; open vehicle routing problem; time windows; variable neighborhood search;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Industrial Engineering and Engineering Management (IEEM), 2013 IEEE International Conference on
  • Conference_Location
    Bangkok
  • Type

    conf

  • DOI
    10.1109/IEEM.2013.6962688
  • Filename
    6962688
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=694296