Ttgjyuk

How to check whether module is loaded with custom configurations?

When a wind turbine does not produce enough electricity how does the power company compensate for the loss?

Why is there an extra space when I type "ls" in the Desktop directory?

Proving a statement about real numbers

Why do we say ‘pairwise disjoint’, rather than ‘disjoint’?

Does an unused member variable take up memory?

Plausibility of Mushroom Buildings

Is it safe to abruptly remove Arduino power?

What problems would a superhuman have who's skin is constantly hot?

Is it possible to avoid unpacking when merging Association?

Rationale to prefer local variables over instance variables?

Doubts in understanding some concepts of potential energy

What is Tony Stark injecting into himself in Iron Man 3?

Having the player face themselves after the mid-game

Is it a Cyclops number? "Nobody" knows!

What do you call someone who likes to pick fights?

Minimizing with differential evolution

Shifting between bemols (flats) and diesis (sharps)in the key signature

Can one live in the U.S. and not use a credit card?

Expressing logarithmic equations without logs

Do items de-spawn?

Is a piano played in the same way as a harmonium?

Why does cron require MTA for logging?

Does "Until when" sound natural for native speakers?

Determining optimum shared school bus route to a single destination from multiple origin points

Creating transfer edges in a multimodal network datasetMultimodal route analysis not yielding correct resultsFinding optimal network with python and network analyst in arcgis 10.0Map walking distance/time from transit stopscreating shortest route using line-segment layer as network locationsIdentify all continuous networks in a datasetWhy modelbuilder does not give the actual result?Navigating a road network and avoiding u-turnsAdding Cost to Shortest Path Finder in FMEWays to make network analyst prefer one type of path over the other while preserving accurate distance and velocity

2

Using ArcGIS and the network analyst toolkit, I want to determine the path of an optimized walking school bus route to school. a walking school bus is essentially a system by which adult volunteers chaperone elementary school children along a pre-set pedestrian path, to help keep them safe from traffic hazards and busy intersections. the idea would be that students would, starting from home, travel to their nearest walking bus "stop", then take the walking bus all the way to school.

I have a very detailed pedestrian network for my study area. scaled cost barriers include intersection controls, areas with high crime. the walking bus would bypass most of these barriers

Is there a workflow that could help determine the optimum location for the walking bus route itself? Right now my process is as follows:

Using closest facility analysis I determine the shortest path to the school for each house, then look at the density of routes along each segment of the network using a spatial join and the join count to find common "corridors". I would then digitize a route visually along this.

This is obviously fairly imprecise, and relies heavily on human judgement. Is there a better way to go about this?

arcgis-desktop network-analyst network

share|improve this question

edited 4 hours ago

Vince

14.7k32749

asked 6 hours ago

AlexAlex

606

add a comment | 

2

Using ArcGIS and the network analyst toolkit, I want to determine the path of an optimized walking school bus route to school. a walking school bus is essentially a system by which adult volunteers chaperone elementary school children along a pre-set pedestrian path, to help keep them safe from traffic hazards and busy intersections. the idea would be that students would, starting from home, travel to their nearest walking bus "stop", then take the walking bus all the way to school.

I have a very detailed pedestrian network for my study area. scaled cost barriers include intersection controls, areas with high crime. the walking bus would bypass most of these barriers

Is there a workflow that could help determine the optimum location for the walking bus route itself? Right now my process is as follows:

Using closest facility analysis I determine the shortest path to the school for each house, then look at the density of routes along each segment of the network using a spatial join and the join count to find common "corridors". I would then digitize a route visually along this.

This is obviously fairly imprecise, and relies heavily on human judgement. Is there a better way to go about this?

arcgis-desktop network-analyst network

share|improve this question

edited 4 hours ago

Vince

14.7k32749

asked 6 hours ago

AlexAlex

606

add a comment | 

Using ArcGIS and the network analyst toolkit, I want to determine the path of an optimized walking school bus route to school. a walking school bus is essentially a system by which adult volunteers chaperone elementary school children along a pre-set pedestrian path, to help keep them safe from traffic hazards and busy intersections. the idea would be that students would, starting from home, travel to their nearest walking bus "stop", then take the walking bus all the way to school.

I have a very detailed pedestrian network for my study area. scaled cost barriers include intersection controls, areas with high crime. the walking bus would bypass most of these barriers

Is there a workflow that could help determine the optimum location for the walking bus route itself? Right now my process is as follows:

Using closest facility analysis I determine the shortest path to the school for each house, then look at the density of routes along each segment of the network using a spatial join and the join count to find common "corridors". I would then digitize a route visually along this.

This is obviously fairly imprecise, and relies heavily on human judgement. Is there a better way to go about this?

arcgis-desktop network-analyst network

share|improve this question

edited 4 hours ago

Vince

14.7k32749

asked 6 hours ago

AlexAlex

606

share|improve this question

edited 4 hours ago

Vince

14.7k32749

asked 6 hours ago

AlexAlex

606

share|improve this question

edited 4 hours ago

Vince

14.7k32749

asked 6 hours ago

AlexAlex

606

edited 4 hours ago

Vince

14.7k32749

edited 4 hours ago

Vince

14.7k32749

asked 6 hours ago

AlexAlex

606

asked 6 hours ago

AlexAlex

606

1 Answer
1

active

oldest

votes

2

This looks like a Steiner tree problem. You'll need some programming to solve it.
Picture below shows manually improved output of algorithm from networkX:

and I think computing "flow" in this network will bring you even closer to near optimal solution:

In this case SE student looks like a best candidate to start route.

What you are doing will give you blurry pattern like that:

share|improve this answer

edited 4 hours ago

answered 4 hours ago

FelixIPFelixIP

16.4k11642

• 
  
  
  

  
  

  
  
  
  
  
  

  
  
  thanks so much! I am however having a bit of trouble finding the paper that forms the source of the approximation they used - i am writing a paper myself and need to cite it. also, if you had any code you could share to speed me along i would be very grateful!. I do know python.
  
  – Alex
  10 mins ago
  

  
  
  
  

add a comment | 

Your Answer

StackExchange.ready(function()
var channelOptions =
tags: "".split(" "),
id: "79"
;
initTagRenderer("".split(" "), "".split(" "), channelOptions);

StackExchange.using("externalEditor", function()
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled)
StackExchange.using("snippets", function()
createEditor();
);

else
createEditor();

);

function createEditor()
StackExchange.prepareEditor(
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: false,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: null,
bindNavPrevention: true,
postfix: "",
imageUploader:
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
,
onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
);



);

draft saved

draft discarded

Sign up or log in

StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);

Sign up using Google

Sign up using Facebook

Sign up using Email and Password

Post as a guest

Name

Email

Required, but never shown

StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fgis.stackexchange.com%2fquestions%2f315008%2fdetermining-optimum-shared-school-bus-route-to-a-single-destination-from-multipl%23new-answer', 'question_page');

);

Post as a guest

Name

Email

Required, but never shown

2

This looks like a Steiner tree problem. You'll need some programming to solve it.
Picture below shows manually improved output of algorithm from networkX:

and I think computing "flow" in this network will bring you even closer to near optimal solution:

In this case SE student looks like a best candidate to start route.

What you are doing will give you blurry pattern like that:

share|improve this answer

edited 4 hours ago

answered 4 hours ago

FelixIPFelixIP

16.4k11642

• 
  
  
  

  
  

  
  
  
  
  
  

  
  
  thanks so much! I am however having a bit of trouble finding the paper that forms the source of the approximation they used - i am writing a paper myself and need to cite it. also, if you had any code you could share to speed me along i would be very grateful!. I do know python.
  
  – Alex
  10 mins ago
  

  
  
  
  

add a comment | 

2

This looks like a Steiner tree problem. You'll need some programming to solve it.
Picture below shows manually improved output of algorithm from networkX:

and I think computing "flow" in this network will bring you even closer to near optimal solution:

In this case SE student looks like a best candidate to start route.

What you are doing will give you blurry pattern like that:

share|improve this answer

edited 4 hours ago

answered 4 hours ago

FelixIPFelixIP

16.4k11642

• 
  
  
  

  
  

  
  
  
  
  
  

  
  
  thanks so much! I am however having a bit of trouble finding the paper that forms the source of the approximation they used - i am writing a paper myself and need to cite it. also, if you had any code you could share to speed me along i would be very grateful!. I do know python.
  
  – Alex
  10 mins ago
  

  
  
  
  

add a comment | 

This looks like a Steiner tree problem. You'll need some programming to solve it.
Picture below shows manually improved output of algorithm from networkX:

and I think computing "flow" in this network will bring you even closer to near optimal solution:

In this case SE student looks like a best candidate to start route.

What you are doing will give you blurry pattern like that:

share|improve this answer

edited 4 hours ago

answered 4 hours ago

FelixIPFelixIP

16.4k11642

share|improve this answer

edited 4 hours ago

answered 4 hours ago

FelixIPFelixIP

16.4k11642

answered 4 hours ago

FelixIPFelixIP

16.4k11642

answered 4 hours ago

FelixIPFelixIP

16.4k11642