New model for a variant of Pick up and Delivery Problem
| Affiliation auteurs | !!!! Error affiliation !!!! |
| Titre | New model for a variant of Pick up and Delivery Problem |
| Type de publication | Conference Paper |
| Year of Publication | 2016 |
| Auteurs | Chami ZAl, Manier H, Manier M-A |
| Conference Name | 2016 IEEE INTERNATIONAL CONFERENCE ON SYSTEMS, MAN, AND CYBERNETICS (SMC) |
| Publisher | IEEE |
| Conference Location | 345 E 47TH ST, NEW YORK, NY 10017 USA |
| ISBN Number | 978-1-5090-1897-0 |
| Résumé | In pickup and delivery problems with time windows (PDPTW), vehicles have to transport loads from pickup locations to delivery locations while respecting capacity and time constraints. When global capacity is not sufficient, the choice of locations to be served is an additional problem (selective variant). This paper presents an exact algorithm which solves the Selective PDPTW, where precedence constraints must be considered (paired demands). The objective is to minimize the total transportation cost or to maximize the profit. We tested our proposed algorithm on benchmark instances from the literature and on our instances. The computational results obtained show the efficiency of our approach. |