The other common constraint in VRP is the time window constraint, which specifi es a time interval
during which a certain node must be visited. This makes optimal routing more diffi cult to obtain.
A routing problem for which an exact solution is easily available is the so-called shortest path
problem. This relates to fi nding a sequence of nodes (from a given origin to a given destination)
on a network for which the total cost is minimum. This can be done by a well-known constructive
procedure called the Dijkstra’s algorithm. The other effi cient procedure called Floyd’s algorithm is
also used for fi nding the shortest path ...
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month, and much more.
O’Reilly covers everything we've got, with content to help us build a world-class technology community, upgrade the capabilities and competencies of our teams, and improve overall team performance as well as their engagement.
Julian F.
Head of Cybersecurity
I wanted to learn C and C++, but it didn't click for me until I picked up an O'Reilly book. When I went on the O’Reilly platform, I was astonished to find all the books there, plus live events and sandboxes so you could play around with the technology.
Addison B.
Field Engineer
I’ve been on the O’Reilly platform for more than eight years. I use a couple of learning platforms, but I'm on O'Reilly more than anybody else. When you're there, you start learning. I'm never disappointed.
Amir M.
Data Platform Tech Lead
I'm always learning. So when I got on to O'Reilly, I was like a kid in a candy store. There are playlists. There are answers. There's on-demand training. It's worth its weight in gold, in terms of what it allows me to do.