Model and Heuristics for the Heterogeneous Fixed Fleet Vehicle Routing Problem with Pick-Up and Delivering

This paper discussed the heterogeneous fixed fleet vehicle routing problem with pick-up and delivery, which different type vehicles have different capacities, fixed costs and travel costs. A more practical mathematical model was established and because the NP-hard, we improved the traditional simulation annealing algorithm and test the new algorithm through a certain scale example. The results show that the new algorithm can obtain better solution, better stability. Through comparing the results of HFFVRP and HFFVRPPD, this paper illustrates the advantages of using HFFVRPPD for physical distribution enterprises in saving distribution vehicles, reducing logistics cost and raising economic benefits.