Multi-trip vehicle routing problem with simultaneous deliveries and pickups is studied,in which the number and working time of the vehicles are limited.Based on the minimum number and travel distance of vehicles,a multiobjective model is formulated.The tabu search algorithm allowing infeasible solutions is proposed,which can simultaneously solve two problems,that is,planning and assigning routes for vehicles.For planning routes,four neighborhood search methods and restart strategy are employed;i...