Latest Contributions by NaAn

Unfortunately, the internal solver does not support MaxOrderCount larger than 1000. There isn't any setting you can modify to change this limit. Thanks. Anna ... View more

You may try a few more things: If you have 10.2.2 installed, you can set some registry key in registry editor to generate better clustering result when dynamic seed points are in use: Type regedit in command line to open registry editor In HKEY_CURRENT_USER\Software\ESRI\Desktop10.2\NetworkAnalyst\VRPSolver, right-click to create a new string value key with name "RSPPenaltyFactor". You may set a large value, such as "200" to force solver generating nice-looking clusters You can also try Location-Allocation solver to partition the regions, and then use VRP solver to generate routes in each region: Here is document for Location-Allocation solver: ArcGIS Help (10.2, 10.2.1, and 10.2.2) . To model your problem: Load all locations to visit as Facilities, and load the same points into Demand Points as well. In layer properties Advanced Settings tab, set the problem type to Maximize  Capacitated Coverage, also set Facilities to Choose with the number of regions you'd like to create, set Default Capacity to be the average number of locations to visit within each region. Hope it can solve your problem! Anna ... View more

I'm not sure where you get the network dataset. Usually, when we prepare the network dataset, we take the weekly average travel speed on a street and divide it by the distance to get the time neutral travel time. If the street has a lot of traffic, the weekly average travel speed will be slower. So even with time neutral solve, VRP solver still knows where the high traffic streets are. Thanks. Anna ... View more

One workaround could be: I assume that you have a constant value of operational cost on each edge in the network. If that is the case, you may try to set the unit of your operational cost as a time unit in the network dataset and use it as the time impedance. Since travel cost on each edge is calculated as travel time (which is operational cost in your case) * CostPerUnitTime + travel distance * CostPerUnitDistance, you will need to set a proper value for CostPerUnitTime, i.e. 1. The solution will show you the low cost order assignment and sequence. However, all the time information output becomes meaningless and you shouldn't use any time windows in the problem setting. You may load the order assignment from VRP solver to Route solver, and choose a true time impedance to obtain the valid time output information. Hope this works for you. Thanks. Anna ... View more

Hi, Please read the attached document on how to setup your problem to avoid multiple drop-offs. Thanks. Anna ... View more

VRP solver does not use historical traffic to optimize the route, instead, it always uses the time-neutral time information for optimization and reports the time-neutral output in its NA classes. Once VRP solve finishes, you can click on "Directions" button to get the travel time with historical traffic. It will feed the order assignments and route start time from VRP results to the Route solver and populate the travel time information based on historical traffic. Thanks. Anna ... View more

Unfortunately, you can not use other than time impedance to optimize routes in VRP solver. ... View more

Hi, VRP solver uses the time impedance to calculate OD matrix and assign orders to route based on the time information from the OD matrix. The distance attribute will be accumulated along the route. Unfortunately, VRP solver only supports optimizing the route with the impedance in time unit. If you put monetary attribute in time impedance, it won't work. Route solver supports various impedance attributes and accumulated attributes. If you know the order assignment on routes, you may try to use route solver to calculate all kinds of accumulated costs. Thanks. Anna ... View more

Hi, VRP solver currently does not support optimization with historical traffic information. So the solutions returned in NA classes are all based on time-neutral time. After VRP solve finishes, you can click on Directions button. It will call Route solver to generate the travel time with the historical traffic information based on the route start time and sequence returned in VRP solver. Thanks. Anna ... View more

Hi, The error message is returned from database, which means your data might have problems. Please try to set the output shape to None and see whether you get the solution. You can also right click orders NA class to open the attribute table, and check the information on "Status" and "ViolatedConstraints." If you can send me the data and layer file, I would be able to help you investigate the problem. Thanks. Anna ... View more

Could you please show me the picture of your routes? If the Output Shape Type is set to None, you won't be able to see the route shape. Thanks. Anna ... View more

If you use one order to represent the whole waste pickup quantity, it won't work because the order quantity exceeds the vehicle capacity. You need to split it into multiple orders with each below the capacity of the vehicle so we can send multiple routes to do the pickup. Thanks. Anna ... View more

When there is no order assigned to a route, you won't be able to see the direction and route geometry in the map. You should double check the unassigned order to open its properties. The "Status" and "ViolatedConstraints" fields will show you the reason for the unassignment. ... View more

Hi, When using the assignment rule �??Preserve Route,�?� you need to provide the valid sequence number as the initial solution. If the sequence number does not produce a feasible solution, i.e. there is hard time window violation, solver will leave some orders unassigned. While with assignment rule 3 �??override,�?� solver has the flexibility to assign orders in any sequence. Therefore, you see the unassigned orders got assigned. When you don�??t know the initial feasible sequence numbers, to guarantee a set of orders are assigned to a route, you can use the specialty to match orders with routes. Thanks. Anna ... View more