An adaptive large neighborhood search with path relinking for a class of vehicle‐routing problems with simultaneous pickup and delivery
Published 2019 View Full Article
- Home
- Publications
- Publication Search
- Publication Details
Title
An adaptive large neighborhood search with path relinking for a class of vehicle‐routing problems with simultaneous pickup and delivery
Authors
Keywords
-
Journal
NETWORKS
Volume -, Issue -, Pages -
Publisher
Wiley
Online
2019-04-15
DOI
10.1002/net.21879
References
Ask authors/readers for more resources
Related references
Note: Only part of the references are listed.- An ant colony system empowered variable neighborhood search algorithm for the vehicle routing problem with simultaneous pickup and delivery
- (2016) Can B. Kalayci et al. EXPERT SYSTEMS WITH APPLICATIONS
- A parallel simulated annealing method for the vehicle routing problem with simultaneous pickup–delivery and time windows
- (2015) Chao Wang et al. COMPUTERS & INDUSTRIAL ENGINEERING
- Routing a mixed fleet of electric and conventional vehicles
- (2015) Dominik Goeke et al. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
- A perturbation based variable neighborhood search heuristic for solving the Vehicle Routing Problem with Simultaneous Pickup and Delivery with Time Limit
- (2015) Olcay Polat et al. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
- The Vehicle Routing Problem with Divisible Deliveries and Pickups
- (2015) Gábor Nagy et al. TRANSPORTATION SCIENCE
- An adaptive VNS algorithm for vehicle routing problems with intermediate stops
- (2014) Michael Schneider et al. OR SPECTRUM
- A note on the time travel approach for handling time windows in vehicle routing problems
- (2013) Michael Schneider et al. COMPUTERS & OPERATIONS RESEARCH
- A hybrid algorithm for a class of vehicle routing problems
- (2013) Anand Subramanian et al. COMPUTERS & OPERATIONS RESEARCH
- A unified solution framework for multi-attribute vehicle routing problems
- (2013) Thibaut Vidal et al. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
- A hybrid discrete particle swarm optimization for vehicle routing problem with simultaneous pickup and delivery
- (2012) Fatma Pinar Goksal et al. COMPUTERS & INDUSTRIAL ENGINEERING
- An adaptive large neighborhood search heuristic for Two-Echelon Vehicle Routing Problems arising in city logistics
- (2012) Vera C. Hemmelmayr et al. COMPUTERS & OPERATIONS RESEARCH
- The vehicle routing problem with restricted mixing of deliveries and pickups
- (2012) Gábor Nagy et al. JOURNAL OF SCHEDULING
- A genetic algorithm for the simultaneous delivery and pickup problems with time window
- (2011) Hsiao-Fan Wang et al. COMPUTERS & INDUSTRIAL ENGINEERING
- Solving the two-echelon location routing problem by a GRASP reinforced by a learning process and path relinking
- (2011) Viet-Phuong Nguyen et al. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
- A parallel heuristic for the Vehicle Routing Problem with Simultaneous Pickup and Delivery
- (2009) A. Subramanian et al. COMPUTERS & OPERATIONS RESEARCH
- A penalty-based edge assembly memetic algorithm for the vehicle routing problem with time windows
- (2009) Yuichi Nagata et al. COMPUTERS & OPERATIONS RESEARCH
- An adaptive memory methodology for the vehicle routing problem with simultaneous pick-ups and deliveries
- (2009) Emmanouil E. Zachariadis et al. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
- Lasso solution strategies for the vehicle routing problem with pickups and deliveries
- (2007) Arild Hoff et al. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
- A memetic algorithm and a tabu search for the multi-compartment vehicle routing problem
- (2006) Abdellah El Fallahi et al. COMPUTERS & OPERATIONS RESEARCH
Find the ideal target journal for your manuscript
Explore over 38,000 international journals covering a vast array of academic fields.
SearchAsk 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