Affiliations: [a] School of Management, Chongqing Jiaotong University, Chongqing, China | [b] School of Transportation Science and Engineering, Beihang University, Beijing, China | [c] Department of Civil and Environmental Engineering, University of Washington, Seattle, WA, USA
Correspondence:
[*]
Corresponding author. Xiaolei Ma, School of Transportation
Science and Engineering, Beihang University, Beijing 100191, China.
E-mail: [email protected] and Yinhai Wang, Department
of Civil and Environmental Engineering, University of Washington,
Seattle, WA 98195-2700, USA. [email protected]
Abstract: Vehicle routing problem (VRP) is a combinatorial optimization and integer programming problem seeking to service a number of customers with a fleet of vehicles. Customer characteristics are neglected in traditional VRPs in the past due to the heterogeneity and ambiguousness. This study presents a vehicle route optimization model in consideration of customer characteristics with three major components: (1) A hierarchical analysis structure is developed to convert customers’ characteristics into linguistic variables, and fuzzy integration method is used to map the sub-criteria into higher hierarchical criteria based on the trapezoidal fuzzy numbers; (2) A fuzzy clustering algorithm based on Axiomatic Fuzzy Set is proposed to group the customers into multiple clusters; (3) The fuzzy technique for order preference by similarity to ideal solution (TOPSIS) approach is integrated into the dynamic programming approach to optimize vehicle routes in each cluster. A numerical case study in Anshun, China demonstrates the advantages of the proposed method by comparing with the other two prevailing algorithms. In addition, a sensitivity analysis is conducted to capture the impacts of various evaluation criteria weights. The results indicate our approach performs very well to identify similar customer groups and incorporate individual customer’s service priority into VRP.
Keywords: Vehicle routing problem, axiomatic fuzzy set, fuzzy clustering algorithm, dynamic programming approach, technique for order preference by similarity to ideal solution (TOPSIS)
