|
POST
|
If you want to load mid-points on both sides of a road then you can load them twice. Use the Add Locations GP tool and then in the Field Mappings, there is a curb approach property, choose Right Side of Vehicle and load them first. Then run the tool again but choose Left Side of Vehicle. Now you will have two points loaded in the same location but they have to be approached from a particular side of the road. Also for the route layer, make sure to set one of the analysis property of U-Turns at Junctions to be "Allowed Only at Dead Ends" to get paths which do not make u-turns at each stop and visit the other side! Jay Sandhu
... View more
02-23-2015
09:22 AM
|
0
|
1
|
1282
|
|
POST
|
Yes there is a limit to how many orders we show in the NA Window. It can start to slow down as we are populating so many items in that window.If you need to work with that data, you can right-click on the Orders and Open Attribute Table and look at that data in a tabular way. Is there a reason you would want to see such a large list in that view? Regards, Jay Sandhu
... View more
09-11-2014
04:09 PM
|
0
|
1
|
670
|
|
POST
|
OD Cost Matrix is the way to find the network distances between sets of points. And when you do Load Locations or use the GP tool Add Locations, it automatically finds the closest edge the points will snap to. If you just want to know where they will snap to on the network then you can use the GP tool Calculate Locations for that. Jay Sandhu
... View more
07-31-2014
03:12 PM
|
1
|
0
|
1343
|
|
POST
|
Sheldon, This does look like an issue that we need to fix. Thanks for reporting it. And just to reiterate, the best way to create/maintain street data is not to include the origins/destination type locations as junctions in the network as they can cause ambiguity with location snapping especially if they are not connected to the street features. Regards, Jay Sandhu
... View more
07-31-2014
03:05 PM
|
0
|
0
|
1943
|
|
POST
|
Most likely you have create the network dataset by including the demand point locations as one of the sources and they do not connect to the network streets. Open the properties of the network dataset and look at the sources. Normally it should only have the road features and the default junction feature class that it creates automatically.<br>At a minimum, before you do Load or Add Locations, turn off snapping to other feature sources besides the streets. This way the demand points will be "located" on the streets and then you will not have so many disconnected demand points resulting a large number of chosen facilities. Jay Sandhu
... View more
05-27-2014
04:10 PM
|
0
|
0
|
3366
|
|
POST
|
Most likely you have create the network dataset by including the demand point locations as one of the sources and they do not connect to the network streets. Open the properties of the network dataset and look at the sources. Normally it should only have the road features and the default junction feature class that it creates automatically. At a minimum, before you do Load or Add Locations, turn off snapping to other feature sources besides the streets. This way the demand points will be "located" on the streets and then you will not have so many disconnected demand points resulting a large number of chosen facilities. Jay Sandhu
... View more
05-27-2014
03:24 PM
|
0
|
0
|
3366
|
|
POST
|
It is not clear what you mean by 3 towns and you have 25 towns. The Route solver has an option to find the Best order to visit the stops and you can choose NOT to preserver the first or last stop. That way, it will solve the best way to visit all the stops that you load in. You can load in all 25 and solve or you can load 3 that you want. If this is not what you are looking for then please explain more. More help here: http://resources.arcgis.com/en/help/main/10.2/#/Route_analysis/004700000045000000/ and read the section titled: Reorder Stops To Find Optimal Route Jay Sandhu
... View more
05-02-2014
09:14 AM
|
0
|
0
|
1180
|
|
POST
|
You can adjust the 100 meter based on how big of a polygon you are generating. If you are making 100 miles or 2 hour service areas you could set it to 500 meters. It is all up to your needs. You can turn it off but the outer ring can odd shapes in area where there are not too many other edges near by. Jay Sandhu
... View more
05-01-2014
01:28 PM
|
0
|
0
|
776
|
|
POST
|
Generally that error means there is no path available to travel to/from that location. It could be due to restrictions such as one way or it could be some disconnected edges in the network. Can you select that incident and add it to a service area layer as a facility and do a 5, 10 , 15 minute service area polygon. Do you get any results? You may want to turn on the service area lines in addition to the polygons. Alternatively you can put that as a stop in a route layer and try to find a path from it to another location in the network. Jay Sandhu
... View more
05-01-2014
01:26 PM
|
0
|
0
|
892
|
|
POST
|
Barbara, If hierarchy is off, you are able to reach everywhere. So this essentially boils down to the fact that there are disconnects in the streets that belong to higher level hierarchies. Unfortunately there is no easy way to find the problem areas. One way is to select all the edges that belong to hierarchy 1 and export to a new feature class and then make a network on it and do a service area lines for a very large break value (turn off the polygons) and then examine the results to see if any lines are not part of the service area i.e., dis-connected. Then you would have to repeat this process by selecting hierarchy 1 and 2 and export them and check, etc. Jay Sandhu
... View more
03-28-2014
10:43 AM
|
0
|
0
|
2316
|
|
POST
|
The GP tool CopytraversedSourceFeatures will create a line feature class with the segments in order they were traversed in the shortest route. However this does not work with the OD Cost Matrix solver layer as the OD layer does not retain this information. However you can use the Closest Facility layer, load your Origins as Incidents and the Destinations as Facilities, set the number of facilities to find to the maximum number of facilities you have and solve. This will solve the complete N by M matrix of routes and also generate the paths and then the CopytraversedSourceFeatures tool will create the segment table you need. Try it with a small subset to make sure you understand how the process works. Tool help below: http://resources.arcgis.com/en/help/main/10.1/index.html#//004800000023000000 Jay Sandhu
... View more
03-18-2014
04:07 PM
|
0
|
0
|
706
|
|
POST
|
Dose your network dataset also have a length attribute in addition to the time one? If yes, then you can bring up the OD layer properties and on the accumulation tab check the length attribute to accumulate. Now when you solve it will solve on travel time and also accumulate the length and report it on the odlines table. Jay Sandhu
... View more
03-18-2014
04:02 PM
|
0
|
0
|
1582
|
|
POST
|
First, Do you get the same route IF you turn of hierarchy of in the two network datasets? If yes, then the hierarchy is playing a role in the differences. Regarding my statement: To find a path using hierarchy we are searching from both the start and end to get to the next level of the hierarchy and we assume that we can find a path using the hierarchy. But if the edges belonging to the hierarchy level are not well connected we do not find a path. So it is likely that if there are disconnected edges in the top level, a clipped portion of that may be connected. SO let's first make sure that hierarchy is the reason why you are getting differences and then we can try to figure out a solution. Jay Sandhu
... View more
03-18-2014
12:56 PM
|
0
|
0
|
2316
|
|
POST
|
This is a combinatorial problem so there is no one "solve" that will give you the answer. But you can use closest facility many times to generate the alternatives and then pick the shortest route. For example, start from your location, find the closest baker. Then from the closest baker find the closest bookstore and from the closest bookstore, the closet drug store. Then repeat from the the closest baker, find the closest drug store and from the closest drugstore find the closest bookstore. Repeat by starting from your location to find the closest bookstore and then the closest drug store. You can either sum up the distances between all pairs of combinations to find the shortest OR you could create a route layer and load the various sequences with the same Routename and solve and then pick the shortest route from all of them. This will work quickly as long as you have a few "different" types of locations to visit. Jay Sandhu
... View more
03-17-2014
03:58 PM
|
0
|
0
|
841
|
|
POST
|
If your points are in the USA, you can use the free streetmap network dataset that comes on the data and maps dvd. it is ready to use network and have time and distance attributes. You can also the Find Route tool (next the binoculars) on the standard toolbar in ArcMap. It will use the online service to return you back the routes. Jay Sandhu
... View more
03-17-2014
03:44 PM
|
0
|
0
|
879
|
| Title | Kudos | Posted |
|---|---|---|
| 1 | 06-21-2023 09:39 AM | |
| 1 | 11-20-2024 09:29 AM | |
| 1 | 10-09-2024 09:23 AM | |
| 1 | 09-09-2024 08:54 AM | |
| 1 | 09-05-2024 10:42 AM |
| Online Status |
Offline
|
| Date Last Visited |
Tuesday
|