Latest Contributions by JaySandhu

After you have solved the route, in the NA Window, right-click on the Line Barriers and choose Load Locations. In the Load Locations dialog, choose the Load From to come from the route layer's "Routes" sub-layer and in the Location Analysis Properties, for the Barrier Type property, change its default value from Restriction to Scaled cost and in the appropriate attribute such as  Attr_TravelTime change the default value from 1 to 1.1 (ten percent more) and click ok. You can now see a scaled cost barrier show up in the NAWindow and also a new dashed barrier line on the map and if you resolve your route you will get a different path. You can click on the barrier in the NAWindow to see it's properties and change it scaled cost if needed. More on barriers here: http://resources.arcgis.com/en/help/main/10.1/index.html#//004700000056000000 Jay Sandhu ... View more

There can be an infinite number of paths that connect two points in a network. What are you looking for or more precisely what is your application that you need to build or support. While you reply, here is one way you can generate some paths: Solve a path. Take the route line of this path and add it as a scaled cost line barrier at 10% more cost. Solve then path This should give you another path. Now you can repeat this process by adding in the second shortest path as additional line barrier with 10% and solve again. Keep repeating as needed. Jay Sandhu ... View more

Srirama, You are right that Network Analyst does not provide transportation demand forecasting tools. If that is the goal there I can point to a couple of products that work well with ArcGIS: Cube from CitiLabs http://www.citilabs.com/ Traffic Analyst from Rapidis  http://www.rapidis.com/ But if the goal is NOT the typical transportation planner type of traffic assignment, then you can simply put everyone on the shortest path (because you do not know if they are all trying to be on the network at the SAME TIME). You can do this by the Route solver mapping the OD pair ID as the routename and solving them all together and then generating the traversal result and summarizing that to find how many times each edge was traveled upon. And by the way, most planning tools also assume that people travel on the shortest path, but the edge costs are slowed down due to congestion as more and more people are put on the network BUT it is always the shortest path at that time. Also, if you want the traversal result from OD, then I suggest that you use the Closest Facility solver. It is exactly like OD but keeps track of the edges traveled so that the route geometry can be returned back and traversal result can be generated. But OD and CF are not the ideal tools if you only want to model single OD route pairs. (Yes the OD name can be confusing!) Regards, Jay Sandhu ... View more

How have you verified that your network dataset has been created and built correctly? Have you tried solving a route to see if you can route on it? At a minimum, use the network identify tool (second icon from right on the NA toolbar) and click on an edge of the network dataset and see if that edge is connected to neighboring edges and that the impedance attributes have valid values in them. If the network dataset is not set up correctly then you will not be able to route or create service areas on it. Jay Sandhu ... View more

What network dataset are you using? Can you use it to create any service area polygons, say a 3 minute from any location on the map? Do you get any warnings or error messages? You may have to turn on All messages on the NA toolbar options. Or use the GP Solve tool to see these messages in the GP results window. Jay Sandhu ... View more

The impact of slope on the wheelchair depends on the motor capabilities as well as it's mass with a person sitting in it. Perhaps you should look at the manufacturer for that information. Jay Sandhu ... View more

Please ask this question: When you have two facilities nearby and their service area overlap and you choose non-overlapping, what should happen to the overlap area? Should one facility get edges that are closer to another or should they be split such that each facility gets those edges that are closest to it? Service areas are "grown" outward to the specified distance. When you specify non-overlapping, then the overlap areas can only be assigned to one of the facilities. By definition, edges are assigned to their closest facility. When an edge is equidistant to two facilities then the resulting service area will split the line at the place where it is equidistant to the two facilities. So back to your case, if you have a facility with 7000 meter break surrounded by a number of facilities with 3000 meter break, the 7000 meter break facility is not going to get more edges assigned to it IF those edges happen to be closer to other facilities. So in your attached picture, other facilities "crowd out" your facility with larger break value as that is the solution to the non-overlapping case. If you want to "preserve" a 7000 meter around a facility then I suggest you solve that facility separately, then use the resulting polygon as a barrier polygon in another service area layer loaded with other facilities and solve. Combine the results. Jay Sandhu ... View more

if you have two groups of points and you want only the shortest one back then the only way to do this is to solve for all with the OD Cost Matrix, pick the shortest pair and put that into a Route solver and solve it to get the route geometry or directions. You can also use the Closest Facility to solve all and then pick the shortest and get directions. But that may take much longer depending on how many points are in each group. That is, there is no other way to know, without computing them all, which pair will give you the shortest path between two sets of points. Jay Sandhu ... View more

This has been answered many times before on the forums. For example, see the following post: http://forums.arcgis.com/threads/37149-road-distance-between-multi-points?highlight=routename Jay Sandhu ... View more

The services, including VRP are available on http://logistics.arcgis.com/arcgis/index.html. You need to get an organizational account to consume these services. Help on using these are here: http://resources.arcgis.com/en/help/main/10.1/#/What_are_the_ArcGIS_Online_network_analysis_services/0047000001t6000000/ Jay Sandhu ... View more

When it "freezes", what is the memory status for the ArcMap process? How much RAM has it consumed? Also, can you send me your points (export to shape file and zip OR save the route or vrp layer and zip and send) and I can run them locally to see if I can get a solution? jsandhu at esri.com Jay Sandhu ... View more

600 stops should be doable. Have you tried some other solver such as load them as stops in a route layer and solve. Do you get a path? If yes, you could turn on the find best order option and run again (this is similar to vrp) and see if it can solve. Other than that I cannot say what is going on preventing its completion. Jay Sandhu ... View more

The problem with about 2800 stops and 10 routes should be solveable. What are the max orders on each of the 10 routes? Jay Sandhu ... View more

Ideally you should place one point along the mid point of an edge with its demand summed from all the dwellings on that street. Or perhaps two points per edge, one on each side. You can create mid points on streets using the GP tool Feature To Point.Note that if you run the Calculate Locations on your point data, it will add the street object id and side of street information to each point. You can then summarize per street how many points are there on each side. 16 GB is more than enough. Normally on a 64 bit OS, only 4 GB can be used by an ArcMap process. Server 10.1 and background 64 bit GP in 10.1 can use more memory. How big is your network (number of edges)? Is there hierarchy? And is it being used by the VRP layer? Generally you should be able to solve a few thousand points per layer spread over many routes, but if you have more than a few hundred on a single route then it will take longer to solve. Jay Sandhu ... View more