Published: 3 September 2020| Version 1 | DOI: 10.17632/c9vm3bhr94.1
We adopt the trip decomposition method to transfer the trip to arc demand so as to propose a vehicle flow formulation for the RRVRP. In the computational experiments, we use 40 randomly-generated small-scale instances and the 20 benchmark instances provided by Bodin et al. (2000). To randomly generate the 40 small-scale instances, we abstract the transportation network on a 60×60 grid where the nodes denote the depot (on node (30, 30)), the disposal facility (on node (20, 40)) and customers. The small-scale instances are classified into four classes with 10 test problems (with 5, 10, 15 and 20 trips) in each class. The four classes differed in the mix of Trip type 1, 2, 3 and 4.
Vehicle Routing Problem