Finding optimal solutions for vehicle routing problem with pickup and delivery services with time windows: A dynamic programming approach based on state–space–time network representations

Published 2016 View Full Article

  1. Home
  2. Publications
  3. Publication Search
  4. Publication Details
Title
Finding optimal solutions for vehicle routing problem with pickup and delivery services with time windows: A dynamic programming approach based on state–space–time network representations
Authors
Keywords
Vehicle routing problem with pickup and delivery with time windows, Lagrangian relaxation, Time-dependent least-cost path problem, Forward dynamic programming, Ride-sharing service optimization
Journal
TRANSPORTATION RESEARCH PART B-METHODOLOGICAL
Volume 89, Issue -, Pages 19-42
Publisher
Elsevier BV
Online
2016-04-16
DOI
10.1016/j.trb.2016.03.009

Ask authors/readers for more resources

Protocol

Community support

Reagent

Community support

Reprint

Contact the author

Find the ideal target journal for your manuscript

Explore over 38,000 international journals covering a vast array of academic fields.

Search

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
Webinars Posters Questions Hubs Funding Journals Articles Connect Collections Reviewers About Us FAQs Mobile App Privacy Policy Terms of Use
© Peeref 2019-2024. All rights reserved.