The Park-and Loop Routing Problem with Parking Selection
Résumé
This paper presents a variant of the vehicle routing problem considering deliveries to customers in cities with a combination of walking and driving. The objective is first to offer a better model for actual delivery problems where drivers are usually assumed to have a single parking location to deliver each customer. Second, we show that serving some customers through walking trips is more efficient in congested areas. We introduce the Park-and-Loop Routing Problem with Parking Selection (PLRP-PS), which extends the work of [1, 2]. We investigate the case where parking locations should be selected among a large set of parking areas in a variant of Large Neighborhood Search (LNS).
Fichier principal
Pr_sentation_PLRP_PS_ROADEF.pdf (624.31 Ko)
Télécharger le fichier
Pr_sentation_PLRP_PS_ROADEF (1).pdf (624.31 Ko)
Télécharger le fichier
main.pdf (24.02 Mo)
Télécharger le fichier
| Origine | Fichiers produits par l'(les) auteur(s) |
|---|