摘要：AbstractThe Pickup and Delivery Problem, known as PDP, is one of the most combinatorial optimization problems studied in the literature. In this type of problems, loads must be transported by a fleet of vehicles from pickup sites to delivery sites. A set of constraints must be respected in relation with the capacity of the vehicles, the opening and closing times of each site. This paper presents the first metaheuristic method to solve a new variant of the PDP which we called SPDPTWPD (Selective PDP with Time Windows and Paired Demands). In this variant, the precedence constraints (paired demands) and the choice of sites to be served (selective aspect) must be considered. We proposed a hybrid genetic algorithm to deal with the multi-objective SPDPTWPD. We tested our proposed approach on benchmark instances and the obtained results show its efficiency.
