Zhuo Fu

Zhuo Fu


Research Focus & Metrics

Academic Career Length

25Years (2002-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications

YXYangkun Xia
Yangkun Xia
ZFZhuo Fu
Zhuo Fu
Sang-Bing TsaiSang-Bing Tsai
Sang-Bing Tsai
WJWang Jiangtao
Wang Jiangtao
In order to promote the development of low-carbon logistics and economize logistics distribution costs, the vehicle routing problem with split deliveries by backpack is studied. With the help of the model of classical capacitated vehicle routing problem, in this study, a form of discrete split deliveries was designed in which the customer demand can be split only by backpack. A double-objective mathematical model and the corresponding adaptive tabu search (TS) algorithm were constructed for solving this problem. By embedding the adaptive penalty mechanism, and adopting the random neighborhood selection strategy and reinitialization principle, the global optimization ability of the new algorithm was enhanced. Comparisons with the results in the literature show the effectiveness of the proposed algorithm. The proposed method can save the costs of low-carbon logistics and reduce carbon emissions, which is conducive to the sustainable development of low-carbon logistics.

15 May 2018 in PLOS ONE
Verified
Journal Article
Open access
PDF file
YXYangkun Xia
Yangkun Xia
ZFZhuo Fu
Zhuo Fu
LPLijun Pan
Lijun Pan
FDFenghua Duan
Fenghua Duan
The vehicle routing problem (VRP) has a wide range of applications in the field of logistics distribution. In order to reduce the cost of logistics distribution, the distance-constrained and capacitated VRP with split deliveries by order (DCVRPSDO) was studied. We show that the customer demand, which can’t be split in the classical VRP model, can only be discrete split deliveries by order. A model of double objective programming is constructed by taking the minimum number of vehicles used and minimum vehicle traveling cost as the first and the second objective, respectively. This approach contains a series of constraints, such as single depot, single vehicle type, distance-constrained and load capacity limit, split delivery by order, etc. DCVRPSDO is a new type of VRP. A new tabu search algorithm is designed to solve the problem and the examples testing show the efficiency of the proposed algorithm. This paper focuses on constructing a double objective mathematical programming model for DCVRPSDO and designing an adaptive tabu search algorithm (ATSA) with good performance to solving the problem. The performance of the ATSA is improved by adding some strategies into the search process, including: (a) a strategy of discrete split deliveries by order is used to split the customer demand; (b) a multi-neighborhood structure is designed to enhance the ability of global optimization; (c) two levels of evaluation objectives are set to select the current solution and the best solution; (d) a discriminating strategy of that the best solution must be feasible and the current solution can accept some infeasible solution, helps to balance the performance of the solution and the diversity of the neighborhood solution; (e) an adaptive penalty mechanism will help the candidate solution be closer to the neighborhood of feasible solution; (f) a strategy of tabu releasing is used to transfer the current solution into a new neighborhood of the better solution.

5 February 2018 in Wireless Personal Communications
Verified
Journal Article
Closed access
PDF file
YXYangkun Xia
Yangkun Xia
ZFZhuo Fu
Zhuo Fu

1 October 2009
Verified
Conference Paper
Closed access
LPLijun Pan
Lijun Pan
ZFZhuo Fu
Zhuo Fu
In this paper, a clonal selection algorithm for the open vehicle routing problem (OVRP) is presented, in which a new definition of antibodies' affinity and algorithm of keeping antibodies' diversity are introduced. Computational results on a set of benchmark problems are provided. Comparison with the best ones in literature shows that the clonal selection algorithm is efficient.