Adaptive large neighborhood search for the pickup and delivery problem with time windows, profits, and reserved requests

Title
Adaptive large neighborhood search for the pickup and delivery problem with time windows, profits, and reserved requests
Authors
Keywords
Vehicle routing problem, Pickup and delivery problem, Time window, Profit, Adaptive large neighborhood search
Journal
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
Volume 252, Issue 1, Pages 27-38
Publisher
Elsevier BV
Online
2015-12-24
DOI
10.1016/j.ejor.2015.12.032

Ask authors/readers for more resources

Reprint

Contact the author

Publish scientific posters with Peeref

Peeref publishes scientific posters from all research disciplines. Our Diamond Open Access policy means free access to content and no publication fees for authors.

Learn More

Become a Peeref-certified reviewer

The Peeref Institute provides free reviewer training that teaches the core competencies of the academic peer review process.

Get Started