File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1016/j.tre.2023.103028
- Scopus: eid_2-s2.0-85147297202
- WOS: WOS:000989355400001
- Find via
Supplementary
- Citations:
- Appears in Collections:
Article: Service network design with consistent multiple trips
Title | Service network design with consistent multiple trips |
---|---|
Authors | |
Keywords | Adaptive large neighborhood search City logistics Consistent trips Multiple trips Service network design |
Issue Date | 2023 |
Citation | Transportation Research Part E: Logistics and Transportation Review, 2023, v. 171, article no. 103028 How to Cite? |
Abstract | We introduce and study a challenging service network design problem arising within a city logistics company based in Beijing, China. To provide cost-effective same-day delivery services, the company divides the whole urban area into regions. Within each region, a fleet of small-capacity vehicles picks up and delivers packages. A fleet of line-haul vehicles (large-capacity vehicles) executes consistent multiple trips over the regions to transport consolidated packages, during which transshipment is allowed. In this study, we focus on designing the trips of line-haul vehicles, i.e., their region visiting sequences, as the performance of the logistics system depends significantly on the coordination of line-haul vehicles. We model the trip design problem as a service network design problem with consistent multiple trips. We develop a continuous-time MIP model to formulate the problem and optimally solve small-size instances. In addition, we propose an adaptive large neighborhood search heuristic to solve larger instances. Numerical experiments on randomly generated instances as well as real-world operational data demonstrate the effectiveness and efficiency of our solution approach. |
Persistent Identifier | http://hdl.handle.net/10722/328851 |
ISSN | 2023 Impact Factor: 8.3 2023 SCImago Journal Rankings: 2.884 |
ISI Accession Number ID |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Liu, Chuanju | - |
dc.contributor.author | Zhang, Junlong | - |
dc.contributor.author | Lin, Shaochong | - |
dc.contributor.author | Shen, Zuo Jun Max | - |
dc.date.accessioned | 2023-07-22T06:24:36Z | - |
dc.date.available | 2023-07-22T06:24:36Z | - |
dc.date.issued | 2023 | - |
dc.identifier.citation | Transportation Research Part E: Logistics and Transportation Review, 2023, v. 171, article no. 103028 | - |
dc.identifier.issn | 1366-5545 | - |
dc.identifier.uri | http://hdl.handle.net/10722/328851 | - |
dc.description.abstract | We introduce and study a challenging service network design problem arising within a city logistics company based in Beijing, China. To provide cost-effective same-day delivery services, the company divides the whole urban area into regions. Within each region, a fleet of small-capacity vehicles picks up and delivers packages. A fleet of line-haul vehicles (large-capacity vehicles) executes consistent multiple trips over the regions to transport consolidated packages, during which transshipment is allowed. In this study, we focus on designing the trips of line-haul vehicles, i.e., their region visiting sequences, as the performance of the logistics system depends significantly on the coordination of line-haul vehicles. We model the trip design problem as a service network design problem with consistent multiple trips. We develop a continuous-time MIP model to formulate the problem and optimally solve small-size instances. In addition, we propose an adaptive large neighborhood search heuristic to solve larger instances. Numerical experiments on randomly generated instances as well as real-world operational data demonstrate the effectiveness and efficiency of our solution approach. | - |
dc.language | eng | - |
dc.relation.ispartof | Transportation Research Part E: Logistics and Transportation Review | - |
dc.subject | Adaptive large neighborhood search | - |
dc.subject | City logistics | - |
dc.subject | Consistent trips | - |
dc.subject | Multiple trips | - |
dc.subject | Service network design | - |
dc.title | Service network design with consistent multiple trips | - |
dc.type | Article | - |
dc.description.nature | link_to_subscribed_fulltext | - |
dc.identifier.doi | 10.1016/j.tre.2023.103028 | - |
dc.identifier.scopus | eid_2-s2.0-85147297202 | - |
dc.identifier.volume | 171 | - |
dc.identifier.spage | article no. 103028 | - |
dc.identifier.epage | article no. 103028 | - |
dc.identifier.isi | WOS:000989355400001 | - |