|
POST
|
Hi, Topology is important to make sure that your lines are connected properly. If you are sure of the connections of lines or if you are sure of the quality of the source from where you have the shapefiles or feature class, then you can skip topology. You can proceed to defining connectivity 🙂 If you do not have any attributes, just start with shape_length so that your solution is based on shortest distance. You can easily convert the distance to speed by diving it by average speed of the mode. For example, if it is a walking network, just use the speed between 3 to 4 km/hr, if bicycle take 10-15km/hr. So time taken = (distance/ speed). Then you can use the same procedures for shortest time. regards,
... View more
10-21-2012
11:47 PM
|
0
|
0
|
1103
|
|
POST
|
I have seen others create multi-modal transit networks that utilized the route number as the elevation field so that the bus routes can remain over the street center line. Transfers, from bus to bus, bus to street, or street to bus, then take place "vertically." I am currently working on designing one myself for an accessibility study. The above comment is correct. I started doing such models since 2008, they all work !!!
... View more
10-16-2012
09:57 PM
|
0
|
0
|
2104
|
|
POST
|
Hi, Refer this for a slight improvement http://forums.arcgis.com/threads/17151-Shortest-Route-problem regards,
... View more
10-15-2012
11:38 AM
|
0
|
0
|
700
|
|
POST
|
Hi, Some basic info you need 1. travel time on each link (this can be same for both directions, or you could create different travel times for each direction with two attributes) 2. one-way restrictions regards,
... View more
10-15-2012
11:30 AM
|
0
|
0
|
1103
|
|
POST
|
Your question is very unclear. I will try my best 1. you want to update information on a line layer based on another line layer/ polygon layer that is not intersecting/touching the line layer. I suggest you convert your information layers (poly and line) into a point feature, pay attention to how it works 2. You would then do a spatial join with the following options: a) one to many b) set search distance to a value of your requirement c) use aggregation operations ( i would use join+comma) as indicated here http://webhelp.esri.com/arcgisdesktop/9.2/index.cfm?TopicName=Example%20of%20aggregating%20field%20values%20with%20Spatial%20Join I require a solution/function to update direction information of a line segment in the digitzed direction i.e. from F node to T node traverse. The directional information may be in char or int value in the linear feature attribute. Purpose is to fetch data from a poly file while traversing a road segment, what lies on the left hand side and what lies on the right hand side
... View more
06-06-2012
01:41 AM
|
0
|
0
|
567
|
|
POST
|
Your solution most probably lies in a VRP solution, please follow this page http://help.arcgis.com/en/arcgisdesktop/10.0/help/index.html#/Vehicle_routing_problem_analysis/00470000004v000000/ I try all solvers in network analysis and can't reach any solution,, so I want a help in detailed steps to know how to start and the next step
... View more
06-06-2012
01:21 AM
|
0
|
0
|
826
|
|
POST
|
A little bit of tweaking with this tool may be of your help. http://resources.arcgis.com/gallery/file/ArcObjects-.NET-API-Code-Gallery/details?entryID=C8A2186E-1422-2418-3494-48812C8DB8DE Hello, Is there a way to get an output of road segments used for each route so I can aggregate the usage for each road segment? Is closest facility the best tool to use for this process? Jackie
... View more
06-06-2012
01:11 AM
|
0
|
0
|
791
|
|
POST
|
Hallo, I am assuming that your O and D are same in number and same in locations. I am also assuming that OD cost matrix can be called with a python script. If above two conditions are true, then a small code "if j > i then calculate distance" will give the required result, where Ai is set of O and Bj is set of D and i is exact same quantity as j, because number of O = number of D. This will give you matrix values above the diagonal, that is one half of the matrix (diagonal being zero of course) Regards Hello all, For research purposes, I am currently solving OD Cost Matrix to compute shortest paths distances for about 10'000 origins and destinations (origins = destinations). I am using a undirected network, so the distance from A to B equal distance from B to A (symmetric distances). Therefore, do anyone has an idea on how to customize the OD Cost Matrix tool so that it only computes A to B and not B to A ? This would halve the size of the database and the computing time. Any idea ? Best regards, Theo
... View more
05-03-2012
09:34 AM
|
0
|
0
|
647
|
|
POST
|
Hi, I am not sure if this will work, but you could scale down you 7 day analysis to 24 hours. that is 0th hour on day 1 will be 0th hour on your 24 hour clock and the 24th hour of your 7th day will be 24th hour on the 24 hour clock. Similarly you can define lunch time and weekends on the same scale. Later when you get your answer, you can scale them up again. For display and mapping purposes you could use a evaluator field that gives your the correct real time from the scaled time. I never did it, but just an idea. Regards. Overview of my project. I have 600 sampling locations and 4 vehicles (150 stops per driver). The locations can only be visited between 8 am and 4:30 pm. Drivers have 30 minute break in middle of the day. What i would like to accomplish are routes that visit the sampling location during time window then assume the driver continues toward next location, stays overnight and starts with next set of points the following day. I want it to repeat this until all 150 points are visited. I would also like routes to return to a specified depot during weekends if possible. I have ran several attempts at this but keep getting violated constraints. It seems as though network analyst doesn't like that routes continue past the Specific Date that I set as a start date in the Analysis Settings. Has anyone successfully created routes spanning multiple days with time constraints? Any help would be appreciated. Thanks
... View more
04-27-2012
10:16 PM
|
0
|
0
|
3145
|
|
POST
|
Yes, it is possible. Select the option of creating directions when you are building your network dataset and follow the tutorials or the help file.
... View more
11-23-2011
08:30 AM
|
0
|
0
|
698
|
|
POST
|
The question probably meant to find closest facility on a multimodal network ? Nevertheless, it is good that this question is now answered 🙂
... View more
10-31-2011
11:29 PM
|
0
|
0
|
638
|
|
POST
|
Hmm, I am still wondering, why should there be a discrepancy in the first place (as originally posted) ? Sorry may be I did not get the message.
... View more
10-31-2011
11:24 PM
|
0
|
0
|
1336
|
|
POST
|
hi, Ideally they should not differ. And yes, snapping distances are not added (as far as I am sure). Do you have problems with all the pairs ? If not, just have another look at your cutoff distance parameter in your settings for OD matrix. This should not be the reason, but just have a look. As the documentation suggests, OD matrix is a quick solver and does not take into account shapes. May be there are slight differences in the manual version and OD (batch) versions of the algorithms. I stand under correction. Probably you should quantify your differences. Are they always differ by same amount, same percentage, may be some peculiar network edge common to all your (error) paths.
... View more
10-30-2011
11:39 PM
|
0
|
0
|
1336
|
|
POST
|
May be try increasing the search tolerance to look for locations (ports ?) or may be connect ports with dummy links with a very low resistance?
... View more
10-27-2011
10:06 AM
|
0
|
0
|
695
|
|
POST
|
May be try working with the linear referencing tool and then using its calibration tool to update when measurements change.
... View more
10-08-2011
03:34 AM
|
0
|
0
|
478
|
| Title | Kudos | Posted |
|---|---|---|
| 1 | 05-16-2019 04:38 AM | |
| 1 | 05-16-2022 11:35 PM | |
| 1 | 05-16-2022 10:30 PM | |
| 1 | 02-05-2013 05:02 AM | |
| 1 | 09-30-2015 09:30 PM |
| Online Status |
Offline
|
| Date Last Visited |
09-05-2024
03:53 PM
|