• DocumentCode
    2253031
  • Title

    Hybrid heuristic for vehicle routing problem with due times

  • Author

    Liu, Chang-shi ; Huang, Fu-hua

  • Author_Institution
    Sch. of Manage., Hunan Univ. of Commerce, Changsha, China
  • Volume
    1
  • fYear
    2010
  • fDate
    6-7 March 2010
  • Firstpage
    145
  • Lastpage
    148
  • Abstract
    The vehicle routing problem with due times is considered. The vehicles are supposed to visit customers within the due times, and a penalty cost is imposed in case the vehicle arrives past the due times. A mixed integer programming formulation and a hybrid tabu search (HTS) is presented to minimize the weighted sum of the traveling time and the tardiness of the service customers. HTS is compared with other heuristics, the computational results show that HTS produces high quality results within a reasonable computing time.
  • Keywords
    customer services; integer programming; search problems; transportation; vehicles; HTS; hybrid heuristic; hybrid tabu search; integer programming formulation; service customers; vehicle routing problem; Asia; Automatic control; Business; Costs; High temperature superconductors; Informatics; Linear programming; Robotics and automation; Routing; Vehicles; due time; tabu serch; vehicle routing problem;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Informatics in Control, Automation and Robotics (CAR), 2010 2nd International Asia Conference on
  • Conference_Location
    Wuhan
  • ISSN
    1948-3414
  • Print_ISBN
    978-1-4244-5192-0
  • Electronic_ISBN
    1948-3414
  • Type

    conf

  • DOI
    10.1109/CAR.2010.5456884
  • Filename
    5456884
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2253031