TY - JOUR
T1 - Differential evolution algorithms with local search for the multi-products capacitated vehicle routing problem with time windows
T2 - A case study of the ice industry
AU - Kamphukaew, Rattanapong
AU - Sethanan, Kanchana
AU - Jamrus, Thitipong
AU - Wang, Hung Kai
N1 - Funding Information:
This work was supported by the Research Unit on System Modeling for Industry (Grant No. SMI. KKU MS 581003), Department of Industrial Engineering, Faculty of Engineering, Khon Kaen University, Thailand and we thank Mr. Stan Moore and Mr. Ian Thomas for linguistic corrections.
Publisher Copyright:
© 2018, Paulus Editora. All rights reserved.
PY - 2018/10/1
Y1 - 2018/10/1
N2 - This research aims to offer a solution to the capacitated vehicle routing problem for multiple products, time windows and a heterogeneous fleet for ice transport. The problem structure is that the capacitated vehicle routing problem is one-to-many with multiple products, where each customer has a variety of product types and demands. Also, limited delivery time is considered for each customer. We used a mixed integer linear programming model to give an optimal solution, and propose a differential evolution method with a local search that we have developed. The objective is to sequence the delivery procedures for ice transport to minimize total costs, comprised of traveling costs, driver wages and a penalty costs. We obtained various solutions by a comparison of our proposed solution and the optimal solution of the ice transport case study and differential evolution with local search (DELS) to validate the proposed metaheuristic. The relative improvement between the current practice of the ice transport in the case study and the differential evolution with a local search was 3.70-25.75%. The differential evolution with a local search outperformed current practices by an average by 2.29%.
AB - This research aims to offer a solution to the capacitated vehicle routing problem for multiple products, time windows and a heterogeneous fleet for ice transport. The problem structure is that the capacitated vehicle routing problem is one-to-many with multiple products, where each customer has a variety of product types and demands. Also, limited delivery time is considered for each customer. We used a mixed integer linear programming model to give an optimal solution, and propose a differential evolution method with a local search that we have developed. The objective is to sequence the delivery procedures for ice transport to minimize total costs, comprised of traveling costs, driver wages and a penalty costs. We obtained various solutions by a comparison of our proposed solution and the optimal solution of the ice transport case study and differential evolution with local search (DELS) to validate the proposed metaheuristic. The relative improvement between the current practice of the ice transport in the case study and the differential evolution with a local search was 3.70-25.75%. The differential evolution with a local search outperformed current practices by an average by 2.29%.
UR - http://www.scopus.com/inward/record.url?scp=85061856489&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85061856489&partnerID=8YFLogxK
M3 - Article
AN - SCOPUS:85061856489
SN - 2539-6161
VL - 45
SP - 273
EP - 281
JO - Engineering and Applied Science Research
JF - Engineering and Applied Science Research
IS - 4
ER -