Ruxin Xie
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Ruxin Xie has a total of 3 co-authors. Here are the top co-authors by number of shared publications:
- José Holguín-Veras
Department of Civil and Environmental Engineering, Rensselaer Polytechnic Institute, Troy, NY 12180, USA
1 shared publication - Tianhui Zhang
College of Engineering, Northeastern University, Boston, MA 02115, USA
1 shared publication - Yuyang Zhou
Beijing Univ. of Technology
1 shared publication
Latest Publications
- Open Access
- 21 February 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 8, 37746-37755
Joint Distribution Center Location Problem for Restaurant Industry Based on Improved K-Means Algorithm With Penalty
The location of joint distribution center (JDC) is of great importance in urban freight system. This work aims to minimize the total cost, including the fixed cost, the transportation cost, and the penalty cost for the missed deliveries, considering the joint distribution willingness (JDW) of restaurant and the coverage radius of JDC. The integer programming model is formulated to select the optimal location of JDC and opens no more than k-JDCs. To solve the problem, an improved K-means (I-K-means) algorithm combining local search with penalty is proposed. The delivery problems obtained by freight survey from 114 restaurants in Beijing, China are taken as a case study. The formulation in this paper can reduce the cost of deliveries in restaurant industry, decrease the number of freight vehicles on road, and promote the joint distribution mode in urban freight system.
- 21 February 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 8, 37746-37755
Open AccessJoint Distribution Center Location Problem for Restaurant Industry Based on Improved K-Means Algorithm With Penalty
The location of joint distribution center (JDC) is of great importance in urban freight system. This work aims to minimize the total cost, including the fixed cost, the transportation cost, and the penalty cost for the missed deliveries, considering the joint distribution willingness (JDW) of restaurant and the coverage radius of JDC. The integer programming model is formulated to select the optimal location of JDC and opens no more than k-JDCs. To solve the problem, an improved K-means (I-K-means) algorithm combining local search with penalty is proposed. The delivery problems obtained by freight survey from 114 restaurants in Beijing, China are taken as a case study. The formulation in this paper can reduce the cost of deliveries in restaurant industry, decrease the number of freight vehicles on road, and promote the joint distribution mode in urban freight system.