A unified exact approach for a broad class of vehicle routing problems with simultaneous pickup and delivery
Published 2023 View Full Article
- Home
- Publications
- Publication Search
- Publication Details
Title
A unified exact approach for a broad class of vehicle routing problems with simultaneous pickup and delivery
Authors
Keywords
-
Journal
COMPUTERS & OPERATIONS RESEARCH
Volume -, Issue -, Pages 106467
Publisher
Elsevier BV
Online
2023-11-01
DOI
10.1016/j.cor.2023.106467
References
Ask authors/readers for more resources
Related references
Note: Only part of the references are listed.- A branch-and-price algorithm for a routing problem with inbound and outbound requests
- (2022) Maxime Agius et al. COMPUTERS & OPERATIONS RESEARCH
- New valid inequalities for the symmetric vehicle routing problem with simultaneous pickup and deliveries
- (2021) Yogesh Kumar Agarwal et al. NETWORKS
- A generic exact solver for vehicle routing and related problems
- (2020) Artur Pessoa et al. MATHEMATICAL PROGRAMMING
- A review of vehicle routing with simultaneous pickup and delivery
- (2020) Çağrı Koç et al. COMPUTERS & OPERATIONS RESEARCH
- A Bucket Graph–Based Labeling Algorithm with Application to Vehicle Routing
- (2020) Ruslan Sadykov et al. TRANSPORTATION SCIENCE
- A new model for the asymmetric vehicle routing problem with simultaneous pickup and deliveries
- (2019) Yogesh Kumar Agarwal et al. OPERATIONS RESEARCH LETTERS
- A branch-and-price algorithm for the Minimum Latency Problem
- (2018) Teobaldo Bulhões et al. COMPUTERS & OPERATIONS RESEARCH
- Limited memory Rank-1 Cuts for Vehicle Routing Problems
- (2017) Diego Pecin et al. OPERATIONS RESEARCH LETTERS
- A hybrid metaheuristic algorithm for heterogeneous vehicle routing problem with simultaneous pickup and delivery
- (2016) Mustafa Avci et al. EXPERT SYSTEMS WITH APPLICATIONS
- A Branch-and-Price-and-Cut Algorithm for Heterogeneous Pickup and Delivery Problems with Configurable Vehicle Capacity
- (2015) Yuan Qu et al. TRANSPORTATION SCIENCE
- A new exact algorithm for the multi-depot vehicle routing problem under capacity and route length constraints
- (2014) Claudio Contardo et al. Discrete Optimization
- A survey of resource constrained shortest path problems: Exact solution approaches
- (2013) Luigi Di Puglia Pugliese et al. NETWORKS
- Dynamic ng-Path Relaxation for the Delivery Man Problem
- (2013) Roberto Roberti et al. TRANSPORTATION SCIENCE
- A coevolutionary algorithm for the flexible delivery and pickup problem with time windows
- (2012) Hsiao-Fan Wang et al. INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS
- Branch-cut-and-price for the vehicle routing problem with simultaneous pickup and delivery
- (2012) Anand Subramanian et al. Optimization Letters
- A genetic algorithm for the simultaneous delivery and pickup problems with time window
- (2011) Hsiao-Fan Wang et al. COMPUTERS & INDUSTRIAL ENGINEERING
- A branch and cut algorithm for the location-routing problem with simultaneous pickup and delivery
- (2011) Ismail Karaoglan et al. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
- The location-routing problem with simultaneous pickup and delivery: Formulations and a heuristic approach
- (2011) Ismail Karaoglan et al. OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE
- New Route Relaxation and Pricing Strategies for the Vehicle Routing Problem
- (2011) Roberto Baldacci et al. OPERATIONS RESEARCH
- Branch-and-cut with lazy separation for the vehicle routing problem with simultaneous pickup and delivery
- (2011) Anand Subramanian et al. OPERATIONS RESEARCH LETTERS
- Dynamic pickup and delivery problems
- (2009) Gerardo Berbeglia et al. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
- Subset-Row Inequalities Applied to the Vehicle-Routing Problem with Time Windows
- (2007) Mads Jepsen et al. OPERATIONS RESEARCH
Find the ideal target journal for your manuscript
Explore over 38,000 international journals covering a vast array of academic fields.
SearchCreate your own webinar
Interested in hosting your own webinar? Check the schedule and propose your idea to the Peeref Content Team.
Create Now