Developing a Collaborative Planning Framework for Sustainable Transportation

Procedure 1

Solving the carrier's routing problem.

Initiate a set of delivery patterns 𝑃={}

For  ℎ=1,…,𝐻

   Initiate the cluster centers by randomly choosing 𝐾 locations out of all customer locations

   For  𝑓=1,…,𝐹

     Assign customers to cluster centers by solving VSPP

     For  𝑘=1,…,𝐾

     Generate a delivery pattern 𝑝 for cluster 𝑘 and add this pattern to set 𝑃

     Calculate the centroid for all locations assigned to this cluster center

     Relocate the cluster center to the location closest to center of gravity of the cluster

     End For

   End For

End For

Remove the duplicated patterns in 𝑃

For  𝑝=1,…,|𝑃|

    Solve a TSP to calculate the cost and the emission of the route 𝛼_𝑝 and 𝛽_𝑝, respectively

End For

Solve 𝑃𝑆 to select the final 𝐾 delivery patterns