TY - GEN
T1 - Pool-based Recursive Construction Approach for Logistics Route Planning with Time Window
AU - Yang, Ya Wen
AU - Lu, Eric Hsueh Chan
N1 - Funding Information:
ACKNOWLEDGMENT This research was supported by Ministry of Science and Technology, Taiwan, R.O.C. under grant no. MOST 105-2119-M-006-030 -; and Ministry of Education, Taiwan, R.O.C. The Aim for the Top University Project to the National Cheng Kung University (NCKU).
Publisher Copyright:
© 2017 IEEE.
PY - 2017/7/2
Y1 - 2017/7/2
N2 - With the blossoming of online shopping, a lot of goods need be distributed to customers. For a logistics company, how to improve the delivery efficiency, reduce the logistics cost and satisfy the real logistical constraints including vehicle's capacity and customer's available time window is an important issue. This kind of problem is called Vehicle Routing Problem with Time Windows (VRPTW). Although a number of algorithms based on artificial intelligence have been proposed, most of them cannot efficiently solve VRPTW while the number of goods increases rapidly. In this paper, we propose a novel approach named Pool-based Recursive Constructor (PRC) to efficiently find a set of logistics routes by considering real logistics constraints. In PRC, an urgent value measurement, several customer selection strategies and a pool-based mechanism are proposed to evaluate the cost of each customer and select the most suitable customer for route constructing, recursively. Through the experimental evaluation based on two semi-real logistics datasets and comparison with two greedy strategies used by Kerry TJ Logistics, PRC shows an excellent performance in terms of route quality.
AB - With the blossoming of online shopping, a lot of goods need be distributed to customers. For a logistics company, how to improve the delivery efficiency, reduce the logistics cost and satisfy the real logistical constraints including vehicle's capacity and customer's available time window is an important issue. This kind of problem is called Vehicle Routing Problem with Time Windows (VRPTW). Although a number of algorithms based on artificial intelligence have been proposed, most of them cannot efficiently solve VRPTW while the number of goods increases rapidly. In this paper, we propose a novel approach named Pool-based Recursive Constructor (PRC) to efficiently find a set of logistics routes by considering real logistics constraints. In PRC, an urgent value measurement, several customer selection strategies and a pool-based mechanism are proposed to evaluate the cost of each customer and select the most suitable customer for route constructing, recursively. Through the experimental evaluation based on two semi-real logistics datasets and comparison with two greedy strategies used by Kerry TJ Logistics, PRC shows an excellent performance in terms of route quality.
UR - http://www.scopus.com/inward/record.url?scp=85059974134&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85059974134&partnerID=8YFLogxK
U2 - 10.1109/ICAdLT.2017.8547001
DO - 10.1109/ICAdLT.2017.8547001
M3 - Conference contribution
AN - SCOPUS:85059974134
T3 - 6th IEEE International Conference on Advanced Logistics and Transport, ICALT 2017 - Proceedings
SP - 133
EP - 138
BT - 6th IEEE International Conference on Advanced Logistics and Transport, ICALT 2017 - Proceedings
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 6th IEEE International Conference on Advanced Logistics and Transport, ICALT 2017
Y2 - 24 July 2017 through 27 July 2017
ER -