Papers by Author: Chang Shi Liu

Abstract: The vehicle routing problem with stochastic demands is considered in this paper, and an effective tabu search algorithm for the proposed problem. The goal consists of minimizing the vehicle number and expected distance traveled in order to serve all customers’ demands. Finally, a numerical example is given to show the effectiveness of the algorithm.

Abstract: The vehicle routing problem with delivery and pick-up service was considered in this paper. A tabu search was proposed to determine the optimal set of routes to totally satisfy both the delivery and pick-up demand. Performances are compared with other heuristics appeared in the literature recently by the bench-mark data sets. The computational results show that the proposed approaches produce high quality results within a reasonable computing time.

Abstract: A two-stage hybrid heuristic is presented for vehicle routing problem with fuzzy demands in this paper, the fuzzy credibility measure is employed to determine the credibility to send the vehicle to next node in the first stage, and a hybrid heuristics is proposed to determine a set of vehicle routes to minimize total costs in the second stage, especially for the additional distance and additional loading times. Finally the computational results are presented to show the high effectiveness and performance of the proposed approaches.

Abstract: The vehicle routing problem with backhauls (VRPB) is considered in this paper, and an effective tabu search is proposed for VRPB to minimize the used vehicle number and total travel distance. The proposed approach is compared with the greedy randomised adaptive memory programming search published recently for the same purpose, the results show the high performance and effectiveness of our approach.

Abstract: We consider a multiple production two-stage forward/reverse logistics system design problem where a fixed number of capacitated distribution/reclaiming centers are to be located with respect to capacitated suppliers and retail locations while minimizing the total costs, and take the random of demand/reclaiming into consideration. We also provide hybrid heuristic procedures for the problem, and develop transshipment heuristic to improve the duration of the proposed approaches. Finally we present computational results that show the high performance and effectiveness of the solution approaches.

Abstract: The vehicel routing problem with time windows (VRPTW) was considered in this paper, and a genetic algorithm (GA) for the proposed problem was designed to minimize total travel distance. Finally we tested the proposed approach with Solomon’s test set, the experimental results show that the proposed GA is very effective compared with other approaches pulished recently.

Abstract: The vehicle routing problem with fuzzy demands at nodes is considered. The fuzzy credibility measure is developed to determine the credibility to send the vehicle to next node, and a hybrid mata-heuristics is proposed to determine a set of vehicle routes to minimizes vehicle number and total costs. Finally the computational results are presented to show the high effectiveness and performance of the proposed approaches.