On computing temporal functions for a time-dependent networks using trajectory data (IDEAS) #21
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
|
|
@@ -17,3 +17,4 @@ null | |
| *.aux | ||
| *.synctex* | ||
| bin | ||
| core/.RData | ||
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,11 @@ | ||
| # remoto - nuvem arida | ||
| driver=org.postgresql.Driver | ||
| host=jdbc:postgresql://177.130.199.157:8080/fortaleza | ||
| user=postgres | ||
| password=aridapostgres12 | ||
|
|
||
| #local | ||
| #driver=org.postgresql.Driver | ||
| #host=jdbc:postgresql://localhost:5432/fortaleza_novo | ||
| #user=postgres | ||
| #password=postgres | ||
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -1,105 +1,116 @@ | ||
| package org.graphast.importer; | ||
|
|
||
| import java.util.Random; | ||
|
|
||
| import org.graphast.model.Graph; | ||
|
|
||
|
|
||
| public class CostGenerator { | ||
|
|
||
| public static int[] generateSyntheticEdgesCosts(int distance) { | ||
|
|
||
| Random random = new Random(); | ||
|
|
||
| int minSpeed, maxSpeed; //Millimeters Per Millisecond (mm/ms) | ||
| int[] syntheticCosts = new int[96]; | ||
|
|
||
| //1:00h to 6:00h | ||
| for(int i=0; i<24; i++) { | ||
| minSpeed = 14; // 50km/h | ||
| maxSpeed = 17; // 60km/h | ||
|
|
||
| syntheticCosts[i] = distance/(random.nextInt(maxSpeed-minSpeed)+minSpeed); | ||
|
|
||
| } | ||
|
|
||
| //6:00h to 7:00h | ||
| for(int i=24; i<28; i++) { | ||
| minSpeed = 6; //21km/h | ||
| maxSpeed = 9; //32km/h | ||
|
|
||
| syntheticCosts[i] = distance/(random.nextInt(maxSpeed-minSpeed)+minSpeed); | ||
|
|
||
| } | ||
|
|
||
| //7:00h to 9:00h | ||
| for(int i=28; i<36; i++) { | ||
| minSpeed = 1; //3km/h | ||
| maxSpeed = 4; //14km/h | ||
|
|
||
| syntheticCosts[i] = distance/(random.nextInt(maxSpeed-minSpeed)+minSpeed); | ||
|
|
||
| } | ||
|
|
||
| //9:00h to 11:00h | ||
| for(int i=36; i<44; i++) { | ||
| minSpeed = 6; //21km/h | ||
| maxSpeed = 9; //32km/h | ||
|
|
||
| syntheticCosts[i] = distance/(random.nextInt(maxSpeed-minSpeed)+minSpeed); | ||
|
|
||
| } | ||
|
|
||
| //11:00h to 14:00h | ||
| for(int i=44; i<56; i++) { | ||
| minSpeed = 1; //3km/h | ||
| maxSpeed = 4; //14km/h | ||
|
|
||
| syntheticCosts[i] = distance/(random.nextInt(maxSpeed-minSpeed)+minSpeed); | ||
|
|
||
| } | ||
|
|
||
| //14:00h to 16:00h | ||
| for(int i=56; i<64; i++) { | ||
| minSpeed = 14; //50km/h | ||
| maxSpeed = 17; //60km/h | ||
|
|
||
| syntheticCosts[i] = distance/(random.nextInt(maxSpeed-minSpeed)+minSpeed); | ||
|
|
||
| } | ||
|
|
||
| //16:00h to 17:00h | ||
| for(int i=64; i<68; i++) { | ||
| minSpeed = 6; //21km/h | ||
| maxSpeed = 9; //30/km/h | ||
|
|
||
| syntheticCosts[i] = distance/(random.nextInt(maxSpeed-minSpeed)+minSpeed); | ||
|
|
||
| } | ||
|
|
||
| //17:00h to 20:00h | ||
| for(int i=68; i<80; i++) { | ||
| minSpeed = 1; //3km/h | ||
| maxSpeed = 4; //14km/h | ||
|
|
||
| syntheticCosts[i] = distance/(random.nextInt(maxSpeed-minSpeed)+minSpeed); | ||
|
|
||
| } | ||
|
|
||
| //20:00h to 22:00h | ||
| for(int i=80; i<88; i++) { | ||
| minSpeed = 6; //21km/h | ||
| maxSpeed = 9; //30/km/h | ||
|
|
||
| syntheticCosts[i] = distance/(random.nextInt(maxSpeed-minSpeed)+minSpeed); | ||
|
|
||
| } | ||
|
|
||
| //22:00h to 00:00h | ||
| for(int i=88; i<96; i++) { | ||
| minSpeed = 14; //50km/h | ||
| maxSpeed = 17; //60km/h | ||
|
|
||
| syntheticCosts[i] = distance/(random.nextInt(maxSpeed-minSpeed)+minSpeed); | ||
|
|
||
| } | ||
|
|
||
| return syntheticCosts; | ||
| } | ||
|
|
||
| public static void generateAllSyntheticEdgesCosts(Graph graph) { | ||
| for (int i = 0; i < graph.getNumberOfEdges(); i++) { | ||
| graph.setEdgeCosts(i, CostGenerator.generateSyntheticEdgesCosts(graph.getEdge(i).getDistance())); | ||
| } | ||
| } | ||
|
|
||
| } |
Oops, something went wrong.
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
mirla, acho que este arquivo não deveria ser enviado por ter dados sensíveis e bem específicos do banco.
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Concordo. Arquivo removido.