Article Title
Mixed-Integer Linear Programming for Vehicle Routing Problem with Simultaneous Delivery and Pick-Up with Maximum Route-Length
Abstract
The vehicle routing problem with simultaneous delivery and pick-up (VRPSDP) is the problem of optimally assimilating goods collection and distribution, when no priority constraints are imposed on the order in which the vehicle must perform the operations. This paper considers an additional constraint of maximum route length in VRPSDP. We develop a mixed-integer linear programming model for VRPSDP with an additional constraint of maximum route length. The results are encouraging for a sample benchmark data set.
COinS
