• Title/Summary/Keyword: 유연 회차

Search Result 1, Processing Time 0.013 seconds

The flexible routing with flex for the fast delivery

  • Park, TaeJoon;Chung, Yerim
    • Journal of the Korea Society of Computer and Information
    • /
    • v.26 no.9
    • /
    • pp.143-153
    • /
    • 2021
  • In this paper, we propose "flexible routing with flex" to provide fast delivery by using the flexible routing for the delivery vehicle and crowd-shipper named flex. To this end, we have introduced an algorithm that can build the delivery plan for delivery vehicles and flexes. The introduced algorithm uses the 2-opt algorithm to construct routes with low complexity and acceptable quality, and the revised saving algorithm to assign customer orders to the flex. The algorithm allows the vehicle and the flex to function complement each other without separating the delivery vehicle from the flex. The experiments consider the 3 different instances named Random, Mixed, Cluster, and show that "the flexible routing with flex" has a better result than "vehicle only". The sensitivity analysis of the flex cost and time penalty shows "the flexible routing with flex" can provide better service not only to the customers who are serviced by flex but also to the customers who are serviced by the delivery vehicle.