Efficient algorithms for optimal pickup-point selection in the selective pickup and delivery problem with time-window constraints
We address the selective pickup and delivery problem with time-window constraints, which is a problem of finding vehicle routes that pick up commodities at stores and deliver them to customers so as to minimize the total distance of the routes under capacity and time-window constraints. In this pape...
Saved in:
| Published in: | Journal of advanced mechanical design, systems, and manufacturing Vol. 14; no. 5; p. JAMDSM0074 |
|---|---|
| Main Authors: | , , , |
| Format: | Journal Article |
| Language: | English |
| Published: |
The Japan Society of Mechanical Engineers
01.01.2020
|
| Subjects: | |
| ISSN: | 1881-3054 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | We address the selective pickup and delivery problem with time-window constraints, which is a problem of finding vehicle routes that pick up commodities at stores and deliver them to customers so as to minimize the total distance of the routes under capacity and time-window constraints. In this paper, to design a local search method for this problem, we consider the following: Given the order of customers in a route, we determine the pickup stores and optimal times of visiting at customers so that the total distance is minimized. This is called the optimal pickup point problem and is a subproblem of the selective pickup and delivery problem with time-window constraints. We show that the optimal pickup point problem is NP-hard in general, and then we propose dynamic programmingmethods, which can obtain upper and lower bounds in linear time, and optimal solution in pseudo-polynomial time. |
|---|---|
| ISSN: | 1881-3054 |
| DOI: | 10.1299/jamdsm.2020jamdsm0074 |