Item request has been placed! ×
Item request cannot be made. ×
loading  Processing Request

A hybrid metaheuristic for single truck and trailer routing problems

Item request has been placed! ×
Item request cannot be made. ×
loading   Processing Request
اقرأ أكثر حفظ في قائمتي
  • المؤلفون: Accorsi, Luca; Vigo, Daniele
  • المصدر:
    Vrije Universiteit Amsterdam Repository
  • نوع التسجيلة:
    Electronic Resource
  • الدخول الالكتروني :
    https://research.vu.nl/en/publications/5618e775-1fb7-4502-bb61-19dd0fddcb4b
    https://research.vu.nl/ws/files/228540762/A_Hybrid_Metaheuristic_for_Single_Truck_and_Trailer_Routing_Problems.pdf
    https://research.vu.nl/ws/files/228540762/A_Hybrid_Metaheuristic_for_Single_Truck_and_Trailer_Routing_Problems.pdf
  • معلومة اضافية
    • Publisher Information:
      2020
    • نبذة مختصرة :
      In this paper, we propose a general solution approach for a broad class of vehicle routing problems that all use a single vehicle, composed of a truck and a detachable trailer, to serve a set of customers with known demand and accessibility constraints. A more general problem, called the extended single truck and trailer routing problem (XSTTRP), is used as a common baseline to describe and model this class of problems. In particular, the XSTTRP contains, all together, a variety of vertex types previously considered only separately: Truck customers, vehicle customers with and without parking facilities, and parking-only locations. To solve the XSTTRP, we developed a fast and effective hybrid metaheuristic, consisting of an iterative core part, in which routes that define high-quality solutions are stored in a pool. Eventually, a set-partitioning-based postoptimization selects the best combination of routes that forms a feasible solution from the pool. The algorithm is tested on extensively studied problems from the literature, such as the multiple depot vehicle routing problem, the location routing problem, the single truck and trailer routing problem with satellite depots, and the single truck and trailer routing problem. Finally, computational results and a thorough analysis of the main algorithm's components on newly designed XSTTRP instances are provided. The obtained results show that the proposed hybrid metaheuristic is highly competitive with previous approaches designed to solve specific specialized problems, both in terms of computing time and solution quality.
    • الموضوع:
      Metaheuristics; Truck and trailer; Vehicle routing; Article
    • الرقم المعرف:
      10.1287.TRSC.2019.0943
    • Availability:
      Open access content. Open access content
      info:eu-repo/semantics/openAccess
    • Note:
      Transportation Science vol.54 (2020) nr.5 p.1351-1371 [ISSN 0041-1655]
      English
    • Other Numbers:
      NLVRU oai:research.vu.nl:publications/5618e775-1fb7-4502-bb61-19dd0fddcb4b
      DOI: 10.1287/TRSC.2019.0943
      1378930084
    • Contributing Source:
      VRIJE UNIVERSITEIT AMSTERDAM
      From OAIster®, provided by the OCLC Cooperative.
    • الرقم المعرف:
      edsoai.on1378930084
HoldingsOnline