A New Metaheuristic to Solve a Selective Pickup and Delivery Problem
| Affiliation auteurs | !!!! Error affiliation !!!! |
| Titre | A New Metaheuristic to Solve a Selective Pickup and Delivery Problem |
| Type de publication | Conference Paper |
| Year of Publication | 2018 |
| Auteurs | Chami ZAl, Flity HEl, Manier H, Manier M-A |
| Conference Name | 2018 4TH IEEE INTERNATIONAL CONFERENCE ON LOGISTICS OPERATIONS MANAGEMENT (GOL) |
| Publisher | IEEE; Univ Le Havre Normandy; Business Sch Normandy; IEEE France Sect; NOV@LOG; LOGAFRET; TRANSPORT INGER |
| Conference Location | 345 E 47TH ST, NEW YORK, NY 10017 USA |
| ISBN Number | 978-1-5386-6772-9 |
| Mots-clés | algorithm, Metaheuristic, Pickup and delivery problem, transportation |
| Résumé | The pickup and delivery problem (PDP) is a problem of optimization of vehicles routes, in order to satisfy the demands for carriage of goods between suppliers (pickup locations) and customers (delivery locations) using a set of vehicles. In this paper, we discuss a variant of PDP which is the SPDPTWPD (Selective PDP with Time Windows and Paired Demands). In this type of problems, a set of constraints must be respected. Those constraints are related to the capacity of the vehicles, the opening and closing times of each site (occurrence of time windows), the precedence (paired demands), and the choice of sites to be visited (selective aspect). We proposed a new metaheuristic to solve the SPDPTWPD, then we tested our method on benchmark instances, and its efficiency is shown by obtained results. |