Loading...
Please wait, while we are loading the content...
Similar Documents
A new metaheuristic to solve a selective pickup and delivery problem
| Content Provider | Semantic Scholar |
|---|---|
| Author | Chami, Zaher Al Flity, Hamza El Manier, Hervé Manier, Marie-Ange |
| Copyright Year | 2018 |
| Abstract | 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. |
| Starting Page | 1 |
| Ending Page | 5 |
| Page Count | 5 |
| File Format | PDF HTM / HTML |
| DOI | 10.1109/GOL.2018.8378089 |
| Alternate Webpage(s) | https://publiweb.femto-st.fr/tntnet/entries/14541/documents/author/data |
| Alternate Webpage(s) | https://doi.org/10.1109/GOL.2018.8378089 |
| Journal | 2018 4th International Conference on Logistics Operations Management (GOL) |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |
