The two-region multi-depot pickup and delivery problem

Soriano, Adria; Gansterer, Margaretha; Hartl, Richard F.

doi:10.1007/s00291-018-0534-2

Cited by 16 publications

(11 citation statements)

References 34 publications

(43 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…MDLS, ECH, and EBSH need an underlying heuristic. For this, we use ALNS, which is a renowned metaheuristic that has been successfully applied to several planning problems (e.g., [17,34,39]) including a multi-graph in [4]. Furthermore, an ALNS is presented in [12], where it is used to generate benchmark results for several of the MCGRP instances.…”

Section: Literature Reviewmentioning

confidence: 99%

Secure and efficient routing on nodes, edges, and arcs of simple‐graphs and of multi‐graphs

2020

Self Cite

View full text Add to dashboard Cite

Many security companies offer patrolling services, such that guards inspect facilities or streets on a regular basis. Patrolling routes should be cost efficient, but the inspection patterns should not be predictable for offenders. We introduce this setting as a multi-objective periodic mixed capacitated general routing problem with objectives being cost minimization and route inconsistency maximization. The problem is transformed into an asymmetric capacitated vehicle routing problem, on both a simple-graph and a multi-graph; and three multi-objective frameworks using adaptive large neighborhood search are implemented to solve it. As tests with both artificial and real-world instances show that some frameworks perform better for some indicators, a hybrid search procedure, combining two of them, is developed and benchmarked against the individual solution methods. Generally, results indicate that considering more than one shortest path between nodes, can significantly increase solution quality for smaller instances, but is quickly becoming a detriment for larger instances.

show abstract

Section: Literature Reviewmentioning

confidence: 99%

Secure and efficient routing on nodes, edges, and arcs of simple‐graphs and of multi‐graphs

2020

Self Cite

View full text Add to dashboard Cite

show abstract

“…No solution method is provided. Soriano et al [44] solve a two-region LTL multi-depot pickup and delivery problem. However, long-haul schedules and capacity limits for the main-haul, multi-day truck scheduling and heterogeneous vehicles are not considered.…”

Section: Research Opportunitiesmentioning

confidence: 99%

Intermodal Container Routing: Integrating Long-Haul Routing and Local Drayage Decisions

et al. 2019

View full text Add to dashboard Cite

Intermodal logistics service providers decide on the routing of demand through their service network. Long-haul routing decisions determine the selected departure and arrival terminals for containers and imply corresponding drayage tasks. Traditionally, given these long-haul routes and fixed drayage tasks, drayage operations are planned in a second phase by establishing truck routes to transport containers to and from terminals by truck. In this paper, operational decisions on local drayage routing in large-volume freight regions with multiple terminals on the one hand, and intermodal long-haul routing on the other hand are merged into an integrated intermodal routing problem. Different long-haul routing decisions imply different drayage tasks to be performed and thus impact total trucking costs. The approach aims at reducing the number of road kilometres and increases bundling opportunities by maximising the long-haul capacity utilisation. In this way, it contributes to the modal shift towards intermodal transport and a more sustainable transport system. As a weekly planning horizon is used, a maximum daily active time and a minimum overnight's rest are included for multi-day drayage routing. A large neighbourhood search heuristic is proposed to solve the integrated intermodal routing problem. This integrated planning approach provides decision support for routing customer orders throughout the intermodal network with the aim of minimising total transport costs and maximising capacity utilisation. Experiments show the added value of the integrated approach, which uses more information to make better-informed decisions and increase the capacity utilisation. The largest savings in trucking costs are obtained for clustered instances with demand characteristics closest to real-life cases. Finally, a real-life case study analyses the impact of tactical service network design decisions on the total operational costs.

show abstract

“…No solution method is provided. Soriano et al (2018) solve a two-region LTL multi-depot pickup and delivery problem. However, long-haul schedules and capacity limits for the main-haul, multi-day truck scheduling and heterogeneous vehicles are not considered.…”

Section: Research Opportunitiesmentioning

confidence: 99%

Optimising load planning and container routing in intermodal rail transport

Heggen¹

2019

4OR-Q J Oper Res

View full text Add to dashboard Cite

People interested in the research are advised to contact the author for the final version of the publication, or visit the DOI to the publisher's website. • The final author version and the galley proof are versions of the publication after peer review. • The final published version features the final layout of the paper including the volume, issue and page numbers. Link to publication General rights Copyright and moral rights for the publications made accessible in the public portal are retained by the authors and/or other copyright owners and it is a condition of accessing publications that users recognise and abide by the legal requirements associated with these rights. • Users may download and print one copy of any publication from the public portal for the purpose of private study or research. • You may not further distribute the material or use it for any profit-making activity or commercial gain • You may freely distribute the URL identifying the publication in the public portal. If the publication is distributed under the terms of Article 25fa of the Dutch Copyright Act, indicated by the "Taverne" license above, please follow below link for the End User Agreement:

show abstract

The two-region multi-depot pickup and delivery problem

Cited by 16 publications

References 34 publications

Secure and efficient routing on nodes, edges, and arcs of simple‐graphs and of multi‐graphs

Secure and efficient routing on nodes, edges, and arcs of simple‐graphs and of multi‐graphs

Intermodal Container Routing: Integrating Long-Haul Routing and Local Drayage Decisions

Optimising load planning and container routing in intermodal rail transport

Contact Info

Product

Resources

About