PTV Logistics Product Forum

Hi Bernd,

Sorry for this late response...

Here is an example :)

I have two tours on day D and on day D+1. I have a new customer to visit and I may visit it on day D or on day D+1. This customer can't be visited by vehicle 1 or vehicle 2 so I have to open a new tour.

Is it more efficient to open ...

Yes and no... ;-)

In fact I have a lot of vehicles tours on several days (from a date D to D+14). Some are full, some not. For a new given customer :
1- I want to know quickly what vehicles can visit this customer
2- If no vehicle can visit this customer, I want to know at what date I should open ...

Okay!

I would like a function which takes three arguments :
- the startpoint location (A)
- the endpoint location (B)
- the time I have to go from startpoint to endpoint (T)
As a result, I would like to get a polygon which ensures that every point N in it verifies (A:N) + (N:B) < T where (X:Y ...

Here is a map example :-)

Yeah good idea! I could first define the area with two isochrones and then calculate the "squared" ellipsochrone with (A:N) + (N:B) matrix requests.

I would like to ask you others questions about the distance matrix :
1- My map will be sliced into (approximatively) 6000 ...

Arf... So let's forget the function :-)

First I'm doubting in quality of results. Yes, in your example, any point inside both isochrones is reachable within 60 minutes but we miss a lot of points (as you said, points inside exactly one isochrone may match the condition).

The only way I see to get ...

Yes exactly!

You're right I could use matrix requests but I would prefer to avoid calculating a distance matrix. Using a distance matrix means divide my map into a lot of squares (for me it's the best way to get a precise area). Do you have another simple way to solve my problem ?

You assume you ...

Oh sorry I forgot to talk about one important thing

In fact I don't want to get the points that match the condition. I would like to get the area that contains all these points (like an isochrone).

Hello,

I would like to solve a problem and don't know if it's possible to do it easily with PTV xServer.

Here is my problem :-)

Let's take 2 locations A et B. It takes (for example) 30 minutes to go from A to B. I'm at point A and want to go to point B but I have 2 hours (for example) to do this ...