The transportation industry expanded rapidly in a highly competitive environment. Logistics companies with insufficient volume of transport capacities are forced to make a selection of customers that they can integrate efficiently into their tours. This is of particular relevance in the pickup and delivery market, where shipments from several different customers can be moved on the same vehicle. In the literature, however, the problem of customer selection has not been applied for the given class of pickup and delivery problems so far. We want to fill this gap by introducing the multi-vehicle profitable pickup and delivery problem (MVPPDP), where multiple carriers transport goods from a selection of pickup customers to the corresponding delivery customers within given travel time limits. car transporter for hire this problem, we propose a method based on general variable neighborhood search (GVNS).
Shopping Cart