Please use this identifier to cite or link to this item:
http://doi.org/10.25358/openscience-7219Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Tilk, Christian | - |
| dc.contributor.author | Olkis, Katharina | - |
| dc.contributor.author | Irnich, Stefan | - |
| dc.date.accessioned | 2022-06-27T09:09:40Z | - |
| dc.date.available | 2022-06-27T09:09:40Z | - |
| dc.date.issued | 2021 | - |
| dc.identifier.uri | https://openscience.ub.uni-mainz.de/handle/20.500.12030/7233 | - |
| dc.description.abstract | The ongoing rise in e-commerce comes along with an increasing number of first-time delivery failures due to the absence of the customer at the delivery location. Failed deliveries result in rework which in turn has a large impact on the carriers’ delivery cost. In the classical vehicle routing problem (VRP) with time windows, each customer request has only one location and one time window describing where and when shipments need to be delivered. In contrast, we introduce and analyze the vehicle routing problem with delivery options (VRPDO), in which some requests can be shipped to alternative locations with possibly different time windows. Furthermore, customers may prefer some delivery options. The carrier must then select, for each request, one delivery option such that the carriers’ overall cost is minimized and a given service level regarding customer preferences is achieved. Moreover, when delivery options share a common location, e.g., a locker, capacities must be respected when assigning shipments. To solve the VRPDO exactly, we present a new branch-price-and-cut algorithm. The associated pricing subproblem is a shortest-path problem with resource constraints that we solve with a bidirectional labeling algorithm on an auxiliary network. We focus on the comparison of two alternative modeling approaches for the auxiliary network and present optimal solutions for instances with up to 100 delivery options. Moreover, we provide 17 new optimal solutions for the benchmark set for the VRP with roaming delivery locations. | en_GB |
| dc.language.iso | eng | de |
| dc.rights | CC BY | * |
| dc.rights.uri | https://creativecommons.org/licenses/by/4.0/ | * |
| dc.subject.ddc | 330 Wirtschaft | de_DE |
| dc.subject.ddc | 330 Economics | en_GB |
| dc.subject.ddc | 650 Management | de_DE |
| dc.subject.ddc | 650 Management and auxiliary services | en_GB |
| dc.title | The last-mile vehicle routing problem with delivery options | en_GB |
| dc.type | Zeitschriftenaufsatz | de |
| dc.identifier.doi | http://doi.org/10.25358/openscience-7219 | - |
| jgu.type.dinitype | article | en_GB |
| jgu.type.version | Published version | de |
| jgu.type.resource | Text | de |
| jgu.organisation.department | FB 03 Rechts- und Wirtschaftswissenschaften | de |
| jgu.organisation.number | 2300 | - |
| jgu.organisation.name | Johannes Gutenberg-Universität Mainz | - |
| jgu.rights.accessrights | openAccess | - |
| jgu.journal.title | OR spectrum | de |
| jgu.journal.volume | 43 | de |
| jgu.pages.start | 877 | de |
| jgu.pages.end | 904 | de |
| jgu.publisher.year | 2021 | - |
| jgu.publisher.name | Springer | de |
| jgu.publisher.place | Berlin u.a. | de |
| jgu.publisher.issn | 1436-6304 | de |
| jgu.organisation.place | Mainz | - |
| jgu.subject.ddccode | 330 | de |
| jgu.subject.ddccode | 650 | de |
| jgu.publisher.doi | 10.1007/s00291-021-00633-0 | de |
| jgu.organisation.ror | https://ror.org/023b0x485 | |
| Appears in collections: | JGU-Publikationen | |
Files in This Item:
| File | Description | Size | Format | ||
|---|---|---|---|---|---|
 | the_lastmile_vehicle_routing_-20220624143541194.pdf | 2.46 MB | Adobe PDF | View/Open |