{"payload":{"pageCount":2,"repositories":[{"type":"Public","name":"MaaS-Platform-Equilibrium","owner":"BUILTNYU","isFork":false,"description":"","allTopics":[],"primaryLanguage":{"name":"Python","color":"#3572A5"},"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":1,"license":null,"participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-06-15T18:20:02.580Z"}},{"type":"Public","name":"transit-disruption-mitigation","owner":"BUILTNYU","isFork":false,"description":"","allTopics":[],"primaryLanguage":{"name":"Python","color":"#3572A5"},"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":0,"license":"Other","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-05-18T10:41:58.309Z"}},{"type":"Public","name":"ridepooling","owner":"BUILTNYU","isFork":false,"description":"NOMAD-RPS is a dynamic ride-pooling simulator that uses a non-myopic cost function approximation policy to make sequential decisions and find the best matches between riders and vehicles in the system","allTopics":["dynamic-routing","ride-sharing-simulator","ride-sharing","dial-a-ride","pickup-and-delivery","ride-pool","ridepooling","sequential-decision-problem","cfa-policy"],"primaryLanguage":{"name":"Java","color":"#b07219"},"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":0,"license":"Other","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-04-15T14:56:42.959Z"}},{"type":"Public","name":"ridepooling-with-transfers","owner":"BUILTNYU","isFork":false,"description":"This simulator uses a proposed non-myopic cost function approximation policy to allow passengers to have synchronized transfers within a ride-pooling system. ","allTopics":["dynamic-routing","transfers","ride-sharing-simulator","ride-sharing","dial-a-ride","pickup-and-delivery","ride-pool","ridepooling","sequential-decision-problem","cfa-policy","ridepooling-with-transfers"],"primaryLanguage":{"name":"Java","color":"#b07219"},"pullRequestCount":0,"issueCount":0,"starsCount":1,"forksCount":0,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-04-12T17:16:11.546Z"}},{"type":"Public","name":"GLAM-Logit","owner":"BUILTNYU","isFork":false,"description":"","allTopics":[],"primaryLanguage":{"name":"HTML","color":"#e34c26"},"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":0,"license":null,"participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-01-25T21:53:39.137Z"}},{"type":"Public","name":"Fleet-Demand-Platform","owner":"BUILTNYU","isFork":false,"description":"A fleet-based simulation platform that connects MATSim with external ride-pooling simulators","allTopics":["simulation","matsim","ridepooling","ridepooling-with-transfers"],"primaryLanguage":{"name":"Python","color":"#3572A5"},"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":0,"license":"Other","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2023-10-06T14:40:57.181Z"}},{"type":"Public","name":"Iterative-Balancing-for-Entropy-Maximization","owner":"BUILTNYU","isFork":false,"description":"Demonstration of the Iterative Balancing Algorithm outlined in Davis 2023","allTopics":[],"primaryLanguage":{"name":"Jupyter Notebook","color":"#DA5B0B"},"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":0,"license":null,"participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2023-06-06T16:24:42.660Z"}},{"type":"Public","name":"SSTNDP","owner":"BUILTNYU","isFork":false,"description":"SSTNDP: Sequential Segment-level Transit Network Design Problem","allTopics":[],"primaryLanguage":{"name":"MATLAB","color":"#e16737"},"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":0,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2023-05-16T05:09:37.754Z"}},{"type":"Public","name":"EVQUARIUM","owner":"BUILTNYU","isFork":false,"description":"EVQUARIUM is an evaluation tool that quantifies the accessibility of EV charging station locations using queueing and graph theory. Given a zonal distribution of EVs with access times to charging stations, it outputs the access patterns and social impacts under equilibrium.","allTopics":["electric-vehicles","clean-energy","user-equilibrium","investment-decisions","ev-charging-infrastructure","charging-station-queueing","utilization-ratio","charging-station-configuration","charging-station-performance-evaluation","policy-planning","infrastructure-planning"],"primaryLanguage":{"name":"Jupyter Notebook","color":"#DA5B0B"},"pullRequestCount":0,"issueCount":0,"starsCount":15,"forksCount":9,"license":null,"participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2023-03-28T14:56:12.697Z"}},{"type":"Public","name":"Equitable-Zone-Design-Algorithm","owner":"BUILTNYU","isFork":false,"description":"","allTopics":[],"primaryLanguage":{"name":"Jupyter Notebook","color":"#DA5B0B"},"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":0,"license":null,"participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2023-03-22T05:48:59.011Z"}},{"type":"Public","name":"optimization-toolbox","owner":"BUILTNYU","isFork":false,"description":"Common purpose optimization algorithms","allTopics":[],"primaryLanguage":{"name":"C++","color":"#f34b7d"},"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":0,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2023-02-24T15:55:42.013Z"}},{"type":"Public","name":"transit-data-game","owner":"BUILTNYU","isFork":false,"description":"This repository contains materials of our studies on transit data sharing games, including noncooperative and cooperative approaches.","allTopics":["transit","game","data"],"primaryLanguage":null,"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":0,"license":null,"participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2023-02-24T15:53:23.613Z"}},{"type":"Public","name":"restaurantRecoSystem","owner":"BUILTNYU","isFork":false,"description":"","allTopics":[],"primaryLanguage":{"name":"Python","color":"#3572A5"},"pullRequestCount":3,"issueCount":0,"starsCount":1,"forksCount":0,"license":"GNU General Public License v3.0","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2022-12-11T01:27:04.548Z"}},{"type":"Public","name":"Modular_Vehicle","owner":"BUILTNYU","isFork":false,"description":"","allTopics":[],"primaryLanguage":null,"pullRequestCount":0,"issueCount":0,"starsCount":1,"forksCount":0,"license":null,"participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2022-11-30T19:28:22.775Z"}},{"type":"Public","name":"PDPSET","owner":"BUILTNYU","isFork":false,"description":"","allTopics":[],"primaryLanguage":null,"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":0,"license":null,"participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2021-06-11T04:15:59.310Z"}},{"type":"Public","name":"multimodal_route_choice","owner":"BUILTNYU","isFork":false,"description":"","allTopics":[],"primaryLanguage":null,"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":0,"license":null,"participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2021-01-12T04:48:44.646Z"}},{"type":"Public","name":"Transit-Travel-Time-OTP","owner":"BUILTNYU","isFork":false,"description":"","allTopics":[],"primaryLanguage":{"name":"R","color":"#198CE7"},"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":1,"license":null,"participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2020-09-19T20:34:30.568Z"}},{"type":"Public","name":"ShoolBusRouting_MixedRide","owner":"BUILTNYU","isFork":false,"description":"This repository stores the data and scripts for the paper: A school bus routing problem with a mixed ride, mixed load, and heterogeneous fleet","allTopics":[],"primaryLanguage":{"name":"Python","color":"#3572A5"},"pullRequestCount":0,"issueCount":0,"starsCount":3,"forksCount":2,"license":null,"participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2020-07-30T20:22:27.474Z"}},{"type":"Public","name":"transit-flow-estimation","owner":"BUILTNYU","isFork":false,"description":"Two tools (schedule-based, static) provided for transit flow estimation. Assignment algorithms can be used independently.","allTopics":["transit","flow","assignment","estimation","schedule-based"],"primaryLanguage":{"name":"Python","color":"#3572A5"},"pullRequestCount":0,"issueCount":0,"starsCount":3,"forksCount":4,"license":null,"participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2020-03-03T13:41:39.048Z"}},{"type":"Public","name":"FTA_TransitSystems","owner":"BUILTNYU","isFork":false,"description":"Theses are codes for the simulation of fixed route, flexible route, and door-to-door service. Some parameters are originated from MTA B63 Bus route, connecting Cobble Hill and Bay Ridge, as an example.","allTopics":[],"primaryLanguage":{"name":"MATLAB","color":"#e16737"},"pullRequestCount":0,"issueCount":0,"starsCount":3,"forksCount":1,"license":null,"participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2020-02-26T19:06:59.972Z"}},{"type":"Public","name":"Excel-Spreadsheet-for-Cumulative-Prospect-Theory-Application","owner":"BUILTNYU","isFork":false,"description":"","allTopics":[],"primaryLanguage":null,"pullRequestCount":0,"issueCount":0,"starsCount":1,"forksCount":0,"license":null,"participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2019-08-19T18:10:31.733Z"}},{"type":"Public","name":"MATLAB-Code-for-Adaptive-Network-Design-Problem","owner":"BUILTNYU","isFork":false,"description":"","allTopics":[],"primaryLanguage":{"name":"MATLAB","color":"#e16737"},"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":0,"license":null,"participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2019-08-19T18:09:35.698Z"}},{"type":"Public","name":"MATLAB-Code-for-RBFCNDP","owner":"BUILTNYU","isFork":false,"description":"","allTopics":[],"primaryLanguage":{"name":"MATLAB","color":"#e16737"},"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":0,"license":null,"participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2019-08-19T18:08:12.887Z"}},{"type":"Public","name":"MATLAB-code-for-parameter-and-state-estimation-of-chaotic-series","owner":"BUILTNYU","isFork":false,"description":"","allTopics":[],"primaryLanguage":{"name":"MATLAB","color":"#e16737"},"pullRequestCount":0,"issueCount":0,"starsCount":1,"forksCount":0,"license":null,"participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2019-08-19T18:06:04.503Z"}},{"type":"Public","name":"MATLAB-Code-for-G-SHARP-Genetic-Algorithm","owner":"BUILTNYU","isFork":false,"description":"","allTopics":[],"primaryLanguage":{"name":"MATLAB","color":"#e16737"},"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":0,"license":null,"participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2019-08-19T18:04:29.606Z"}},{"type":"Public","name":"MATLAB-code-for-MO-RBF-multiobjective-heuristic","owner":"BUILTNYU","isFork":false,"description":"","allTopics":[],"primaryLanguage":{"name":"MATLAB","color":"#e16737"},"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":0,"license":null,"participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2019-08-19T18:01:25.707Z"}},{"type":"Public","name":"MATLAB-script-for-multimodal-HAPP-model-MILP-construction","owner":"BUILTNYU","isFork":false,"description":"","allTopics":[],"primaryLanguage":{"name":"MATLAB","color":"#e16737"},"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":0,"license":null,"participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2019-08-19T17:58:50.999Z"}},{"type":"Public","name":"MATLAB-script-for-obtaining-market-equilibrium-of-multimodal-design","owner":"BUILTNYU","isFork":false,"description":"","allTopics":[],"primaryLanguage":{"name":"MATLAB","color":"#e16737"},"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":0,"license":null,"participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2019-08-19T17:45:11.882Z"}},{"type":"Public","name":"MATLAB-Code-for-InvHAPP","owner":"BUILTNYU","isFork":false,"description":"The code is for the inverse optimization model in this paper: Chow, J.Y.J., Recker, W.W., 2012. Inverse optimization with endogenous arrival time constraints to calibrate the household activity pattern problem, Transportation Research Part B 46(3), 463-479. Note: unfortunately, a bug was found in the code after publishing the paper, it has since…","allTopics":[],"primaryLanguage":{"name":"MATLAB","color":"#e16737"},"pullRequestCount":0,"issueCount":2,"starsCount":0,"forksCount":1,"license":null,"participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2019-08-19T17:19:57.695Z"}},{"type":"Public","name":"IO-Validation","owner":"BUILTNYU","isFork":true,"description":"","allTopics":[],"primaryLanguage":{"name":"Python","color":"#3572A5"},"pullRequestCount":0,"issueCount":0,"starsCount":1,"forksCount":1,"license":null,"participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2019-08-01T13:09:54.421Z"}}],"repositoryCount":55,"userInfo":null,"searchable":true,"definitions":[],"typeFilters":[{"id":"all","text":"All"},{"id":"public","text":"Public"},{"id":"source","text":"Sources"},{"id":"fork","text":"Forks"},{"id":"archived","text":"Archived"},{"id":"template","text":"Templates"}],"compactMode":false},"title":"BUILTNYU repositories"}