Test instances for a producer/customer vehicle routing problem with shared delivery

This study is set within the context of local food logistics and introduces a new delivery routing problem, called Collaborative Delivery Sharing. In this problem, producers may form partnerships with other producers and are free to collaborate by organising shared deliveries to customers, including both pick-ups and drop-offs at their respective locations. The problem involves determining delivery partnerships, selecting collaboration modes (pickup and/or drop-off), and optimising the associated routing. Several algorithms can be designed to solve this problem. The test instances given in this archive allow to test the effectiveness of algorithms, and therefore to compare their performances. The data have been randomly generated. They do not correspond to a real life application. File naming convention: I_X_Y_T_A_B.txt with - X: number of producers - Y: number of customers - T: type of instance with {'C' : customers in the middle, 'P': producers in the middle, 'R': random positions} - A: instance number A in {1..10} - B: number max of parnters B in {0..5} The format of each file is the following: 1st line: then lines and for each line: then lines