xltry / spdptwlc-data Goto Github PK
View Code? Open in Web Editor NEWThe experimental instances of the selective pickup and delivery problem with time window and loading cost (SPDPTWLC) , which are generated based on a classical data generator presented in (Ropkeand Cordeau, 2009; Ropke et al., 2007) for the PDPTW. The coordinates of customers are randomly selected within a [0,50]×[0,50] square according to a uniform distribution and the depot is located in (25,25). The number of available vehicles| K| is set to be N/4, where N is the number of customers. Same as the Ropke’s generator, the planned time horizon of route T is set by 600, the vehicle capacity Q is 20 and the width of time window w is 60 for all the test instances. The time window of each customer is constructed by randomly selecting ai in [0,T−di,n+1] and setting bi=ai+w.