Can jsprit
solve the VRPSPD
(vehicle routing problem with simultaneous pickup and delivery
)?
The VRP with simultaneous pick-up and delivery (VRPSPD) is the following problem: a set of customers is located on a transportation network; each customer i requires either a delivery or a pick-up operation (or both) of a certain amount of goods (di) or waste (pi) and must be visited once for both operations. The service is provided by a set of vehicles of limited capacity Q; each vehicle leaves the depot carrying an amount of goods equal to the total amount it must deliver and returns to the depot carrying an amount of waste equal to the total amount it picked-up. In each point along its tour each vehicle cannot carry a total load greater than its capacity.The goal is to minimize the overall length of the tours. if jsprit can solve the VRPSPD,how to do it?