A Large Neighborhood Search for the Pickup and Delivery Problem with Time Windows, Split Loads and Transshipments
Published 2020 View Full Article
- Home
- Publications
- Publication Search
- Publication Details
Title
A Large Neighborhood Search for the Pickup and Delivery Problem with Time Windows, Split Loads and Transshipments
Authors
Keywords
Pickup and Delivery Problem, Split Load, Transshipment, Large Neighbourhood Search
Journal
COMPUTERS & OPERATIONS RESEARCH
Volume 126, Issue -, Pages 105110
Publisher
Elsevier BV
Online
2020-10-09
DOI
10.1016/j.cor.2020.105110
References
Ask authors/readers for more resources
Related references
Note: Only part of the references are listed.- A comparison of two meta-heuristics for the pickup and delivery problem with transshipment
- (2018) N. Danloup et al. COMPUTERS & OPERATIONS RESEARCH
- Large neighborhood-based metaheuristic and branch-and-price for the pickup and delivery problem with split loads
- (2018) Matheus Nohra Haddad et al. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
- A long-haul freight transportation problem: Synchronizing resources to deliver requests passing through multiple transshipment locations
- (2016) F. Neves-Moreira et al. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
- The Dial-a-Ride Problem with Split Requests and Profits
- (2015) Sophie N. Parragh et al. TRANSPORTATION SCIENCE
- The Dial-A-Ride Problem with Transfers
- (2013) Renaud Masson et al. COMPUTERS & OPERATIONS RESEARCH
- New mixed integer-programming model for the pickup-and-delivery problem with transshipment
- (2013) A. Rais et al. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
- A branch-price-and-cut method for a ship routing and scheduling problem with split loads
- (2012) Magnus Stålhane et al. COMPUTERS & OPERATIONS RESEARCH
- An efficient heuristic for the Multi-vehicle One-to-one Pickup and Delivery Problem with Split Loads
- (2012) Mustafa Şahin et al. TRANSPORTATION RESEARCH PART C-EMERGING TECHNOLOGIES
- An Adaptive Large Neighborhood Search for the Pickup and Delivery Problem with Transfers
- (2012) Renaud Masson et al. TRANSPORTATION SCIENCE
- A GRASP with adaptive large neighborhood search for pickup and delivery problems with transshipment
- (2011) Yuan Qu et al. COMPUTERS & OPERATIONS RESEARCH
- A column generation approach for the split delivery vehicle routing problem
- (2011) C. Archetti et al. NETWORKS
- Enhanced Branch and Price and Cut for Vehicle Routing with Split Deliveries and Time Windows
- (2011) C. Archetti et al. TRANSPORTATION SCIENCE
- Vehicle routing problems with split deliveries
- (2011) C. Archetti et al. International Transactions in Operational Research
- The pickup and delivery problem with transfers: Formulation and a branch-and-cut solution method
- (2009) Cristián E. Cortés et al. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
- Branch-and-Price-and-Cut for the Split-Delivery Vehicle Routing Problem with Time Windows
- (2009) Guy Desaulniers OPERATIONS RESEARCH
- The splittable pickup and delivery problem with reloads
- (2008) H.L.M. Kerivin et al. European Journal of Industrial Engineering
- An empirical study on the benefit of split loads with the pickup and delivery problem
- (2008) Maciek Nowak et al. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
- Pickup and Delivery with Split Loads
- (2008) Maciek Nowak et al. TRANSPORTATION SCIENCE
Become a Peeref-certified reviewer
The Peeref Institute provides free reviewer training that teaches the core competencies of the academic peer review process.
Get StartedAsk a Question. Answer a Question.
Quickly pose questions to the entire community. Debate answers and get clarity on the most important issues facing researchers.
Get Started