Determining optimum shared school bus route to a single destination from multiple origin points
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
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
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
edited 4 hours ago
Vince
14.7k32749
asked 6 hours ago
AlexAlex
606
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
arcgis-desktop network-analyst network
edited 4 hours ago
Vince
14.7k32749
asked 6 hours ago
AlexAlex
606
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
edited 4 hours ago
Vince
14.7k32749
14.7k32749
asked 6 hours ago
AlexAlex
606
asked 6 hours ago
AlexAlex
606
asked 6 hours ago
AlexAlex
606
606
add a comment |
add a comment |
1 Answer
1
active
oldest
votes
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:
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
13 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
});
}
});
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
var $window = $(window),
onScroll = function(e) {
var $elem = $('.new-login-left'),
docViewTop = $window.scrollTop(),
docViewBottom = docViewTop + $window.height(),
elemTop = $elem.offset().top,
elemBottom = elemTop + $elem.height();
if ((docViewTop elemBottom)) {
StackExchange.using('gps', function() { StackExchange.gps.track('embedded_signup_form.view', { location: 'question_page' }); });
$window.unbind('scroll', onScroll);
}
};
$window.on('scroll', onScroll);
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
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
Required, but never shown
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
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:
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
13 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:
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
13 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:
answered 4 hours ago
FelixIPFelixIP
16.4k11642
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:
answered 4 hours ago
FelixIPFelixIP
16.4k11642
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
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
13 mins ago
add a comment |
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
13 mins ago
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
13 mins ago
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
13 mins ago
add a comment |
Thanks for contributing an answer to Geographic Information Systems Stack Exchange!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
var $window = $(window),
onScroll = function(e) {
var $elem = $('.new-login-left'),
docViewTop = $window.scrollTop(),
docViewBottom = docViewTop + $window.height(),
elemTop = $elem.offset().top,
elemBottom = elemTop + $elem.height();
if ((docViewTop elemBottom)) {
StackExchange.using('gps', function() { StackExchange.gps.track('embedded_signup_form.view', { location: 'question_page' }); });
$window.unbind('scroll', onScroll);
}
};
$window.on('scroll', onScroll);
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
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
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
var $window = $(window),
onScroll = function(e) {
var $elem = $('.new-login-left'),
docViewTop = $window.scrollTop(),
docViewBottom = docViewTop + $window.height(),
elemTop = $elem.offset().top,
elemBottom = elemTop + $elem.height();
if ((docViewTop elemBottom)) {
StackExchange.using('gps', function() { StackExchange.gps.track('embedded_signup_form.view', { location: 'question_page' }); });
$window.unbind('scroll', onScroll);
}
};
$window.on('scroll', onScroll);
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
var $window = $(window),
onScroll = function(e) {
var $elem = $('.new-login-left'),
docViewTop = $window.scrollTop(),
docViewBottom = docViewTop + $window.height(),
elemTop = $elem.offset().top,
elemBottom = elemTop + $elem.height();
if ((docViewTop elemBottom)) {
StackExchange.using('gps', function() { StackExchange.gps.track('embedded_signup_form.view', { location: 'question_page' }); });
$window.unbind('scroll', onScroll);
}
};
$window.on('scroll', onScroll);
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
var $window = $(window),
onScroll = function(e) {
var $elem = $('.new-login-left'),
docViewTop = $window.scrollTop(),
docViewBottom = docViewTop + $window.height(),
elemTop = $elem.offset().top,
elemBottom = elemTop + $elem.height();
if ((docViewTop elemBottom)) {
StackExchange.using('gps', function() { StackExchange.gps.track('embedded_signup_form.view', { location: 'question_page' }); });
$window.unbind('scroll', onScroll);
}
};
$window.on('scroll', onScroll);
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
