A Branch-and-Cut Approach to the Vehicle Routing Problem with Simultaneous Delivery and Pick-up

摘要: The vehicle routing problem with simultaneous delivery and pickup (VRPSDP) is an extension of the capacitated in which products have to be transported from depot customer locations other trucked depot. Each requires a pick-up goods by same vehicle. VRPSDP basic reverse logistics: In addition distribution process customers, re-usable direction. We implement branch-and-cut approach study how it can applied solution VRPSDP. computational tests been performed on known benchmark instances. Some problems are solved optimality for first time