Name
Abstract | ||
|---|---|---|
Delivering packages door-to-door is convenient because of its accuracy and speed. Recently, such delivery services have become widely used for online shopping. However, package delivery may sometimes fail to be completed in the specified time window because of the large number of packages. Therefore, it is important to optimize the delivery distance. This distance depends on the location of customers and whether they are absent. In this paper, we examine several cases of loading packages by considering redelivery, and evaluate delivery distance using the branch and bound method and the genetic algorithm. From the results, we conclude that the delivery distance depends on the probability of redelivery, and that the optimum order for visiting customers depends on their locations. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1109/CANDARW.2018.00071 | 2018 Sixth International Symposium on Computing and Networking Workshops (CANDARW) |
Keywords | Field | DocType |
traveling salesman problem, branch and bound method, genetic algorithm, delivery, redelivery | Mathematical optimization,Computer science,Travelling salesman problem,Branch and bound method,Genetic algorithm | Conference |
ISBN | Citations | PageRank |
978-1-5386-9185-4 | 0 | 0.34 |
References | Authors | |
2 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Daiki Ojima | 1 | 0 | 0.34 |
| Minoru Uehara | 2 | 525 | 96.87 |
| Takashi Mihara | 3 | 0 | 0.34 |