期刊名称：International Journal of Innovative Research in Science, Engineering and Technology
印刷版ISSN：2347-6710
电子版ISSN：2319-8753
出版年度：2017
卷号：6
期号：11
页码：21001
DOI：10.15680/IJIRSET.2017.0611003
出版社：S&S Publications
摘要：The Pickup and Delivery (PD) problem of Vehicle Routing is a further generalization of the VehicleRouting Problem, in which each customer demand is associated with two locations: an origin location where a certaindemand must be picked up and a destination where this demand must be delivered. This paper considers a logisticdistribution problem in which that there are several type of vehicles with different capacity operated to meet the PDconditions for customers. We use mixed integer nonlinear program to get the optimal decision of the problem. Aneighborhood search approach is developed to solve the model.
