CEP FINAL.docx - Route optimization It is the process of determining the most cost-efficient route You may think that it means finding the shortest path

CEP FINAL.docx - Route optimization It is the process of...

This preview shows page 1 - 2 out of 3 pages.

Route optimization It is the process of determining the most cost-efficient route. You may think that it means finding the shortest path between two points, but it’s rarely that simple: You must account for all relevant factors involved such as the number and location of all stops on the route, arrival/departure time gap, effective loading, etc. Route optimization is a solution for so-called vehicle routing problems (VRPs). The Vehicle Routing Problem: The Vehicle Routing Problem or VRP is the challenge of designing optimal routes from a depot to a set of destinations each with business-specific constraints, such as vehicle limitations, cost controls, time windows, resource limitations concerning the loading process at the depot, etc. The first classic VRP is known as the traveling salesman problem (TSP), which originated in the early 1800s and became widespread in the days when door-to-door salesmen peddled vacuum cleaners and encyclopedias. With time, VRP was categorized into much more sophisticated tasks involving large chunks of data. Real-world VRPs comprise of hundreds or thousands of nodes. The time required to solve them is growing relative to the size of the problem. For sufficiently large problems, it could take years
Image of page 1
Image of page 2

You've reached the end of your free preview.

Want to read all 3 pages?

  • Fall '17
  • Tahir Iqbal
  • Travelling salesman problem, Vehicle routing problem, Frane Saric

  • Left Quote Icon

    Student Picture

  • Left Quote Icon

    Student Picture

  • Left Quote Icon

    Student Picture

Stuck? We have tutors online 24/7 who can help you get unstuck.
A+ icon
Ask Expert Tutors You can ask You can ask You can ask (will expire )
Answers in as fast as 15 minutes