I use this dataset (ntu04Dataset.tgz)? in my 2002 (ISIC02, BibTeX) and 2004 (NTU04, BibTeX) papers to solve the Pickup and Delivery Problems with Time Windows (PDPTW) .? If you use this dataset, please cite at least one of my publication? (Here is my publication in BibTeX).? You are welcome to share your PDPTW-related research paper with me. 🙂
- Comment
- Reblog
-
Subscribe
Subscribed
Already have a WordPress.com account? Log in now.
Dwelling in the Dream 
hmm. look at test20, for example. Task 1 (line 50) and Task 13 (line 62) have same pickup location (25).
===============
#task (id, pickup, delivery, twin-pick, twin-delivery, demand)
1 (25 –> 17) [1381 1861] [1629 1869] 6
…
13 (25 –> 22) [0 119] [467 851] 2
===============
As far as I know, it is impossible in PDP(TW). Or did you mean something different?
LikeLike
To zatv,
As these are tasks for PDP with Time Window, Task 1 should be picked in time [1381, 1861] and the [1629, 1869] is the time window of the allowed delivery time. Task 13 has [0, 119] as the pick time window and the package should be delivered in time [467, 851]. Therefore, a solution route will fisish Task 13 before Task 1.
LikeLike
Hmmmm. As far as I know, where is a constraint: one point must be visited only once. You always can make “virtual” point with same coordinates for cases like you describe.
It seems you are using some modification of “classical” PDPTW.
LikeLike
yes, I formulate the PDPTW from the view of task, therefore, it’s possible that two different tasks have the same pickup (or delivery, or both) locations. Locations for any task, are the virtual points.
LikeLike
Sorry to ask a dumb question, but in test100.txt you have a line “#initial depot 5”. Does this mean the depot is at location 5 and not 0? Also, I assume the speed of the vehicle is 1, and the day starts at time 0? But then the travel times are very small compared to the timings given which range to over 10000?
LikeLike