| Feb. 13, 2024, 4:20 p.m. |
Created
43
|
[{"model": "core.projectfund", "pk": 63704, "fields": {"project": 11909, "organisation": 2, "amount": 932145, "start_date": "2023-09-04", "end_date": "2026-09-03", "raw_data": 179881}}]
|
|
| Jan. 30, 2024, 4:24 p.m. |
Created
43
|
[{"model": "core.projectfund", "pk": 56541, "fields": {"project": 11909, "organisation": 2, "amount": 932145, "start_date": "2023-09-04", "end_date": "2026-09-03", "raw_data": 156843}}]
|
|
| Jan. 2, 2024, 4:15 p.m. |
Created
43
|
[{"model": "core.projectfund", "pk": 49356, "fields": {"project": 11909, "organisation": 2, "amount": 932145, "start_date": "2023-07-01", "end_date": "2026-06-30", "raw_data": 134860}}]
|
|
| Dec. 5, 2023, 4:24 p.m. |
Created
43
|
[{"model": "core.projectfund", "pk": 42107, "fields": {"project": 11909, "organisation": 2, "amount": 932145, "start_date": "2023-06-30", "end_date": "2026-06-29", "raw_data": 102787}}]
|
|
| Nov. 27, 2023, 2:14 p.m. |
Added
35
|
{"external_links": []}
|
|
| Nov. 21, 2023, 4:39 p.m. |
Created
43
|
[{"model": "core.projectfund", "pk": 34815, "fields": {"project": 11909, "organisation": 2, "amount": 932145, "start_date": "2023-06-30", "end_date": "2026-06-29", "raw_data": 63217}}]
|
|
| Nov. 21, 2023, 4:39 p.m. |
Created
41
|
[{"model": "core.projectorganisation", "pk": 101897, "fields": {"project": 11909, "organisation": 15042, "role": "PP_ORG"}}]
|
|
| Nov. 21, 2023, 4:39 p.m. |
Created
41
|
[{"model": "core.projectorganisation", "pk": 101896, "fields": {"project": 11909, "organisation": 13930, "role": "PP_ORG"}}]
|
|
| Nov. 21, 2023, 4:39 p.m. |
Created
41
|
[{"model": "core.projectorganisation", "pk": 101895, "fields": {"project": 11909, "organisation": 15044, "role": "PP_ORG"}}]
|
|
| Nov. 21, 2023, 4:39 p.m. |
Created
41
|
[{"model": "core.projectorganisation", "pk": 101894, "fields": {"project": 11909, "organisation": 15045, "role": "PP_ORG"}}]
|
|
| Nov. 21, 2023, 4:39 p.m. |
Created
41
|
[{"model": "core.projectorganisation", "pk": 101893, "fields": {"project": 11909, "organisation": 10973, "role": "PP_ORG"}}]
|
|
| Nov. 21, 2023, 4:39 p.m. |
Created
41
|
[{"model": "core.projectorganisation", "pk": 101892, "fields": {"project": 11909, "organisation": 11583, "role": "LEAD_ORG"}}]
|
|
| Nov. 21, 2023, 4:39 p.m. |
Created
40
|
[{"model": "core.projectperson", "pk": 64073, "fields": {"project": 11909, "person": 15743, "role": "COI_PER"}}]
|
|
| Nov. 21, 2023, 4:39 p.m. |
Created
40
|
[{"model": "core.projectperson", "pk": 64072, "fields": {"project": 11909, "person": 16913, "role": "COI_PER"}}]
|
|
| Nov. 21, 2023, 4:39 p.m. |
Created
40
|
[{"model": "core.projectperson", "pk": 64071, "fields": {"project": 11909, "person": 16914, "role": "COI_PER"}}]
|
|
| Nov. 21, 2023, 4:39 p.m. |
Created
40
|
[{"model": "core.projectperson", "pk": 64070, "fields": {"project": 11909, "person": 16915, "role": "PI_PER"}}]
|
|
| Nov. 20, 2023, 2:05 p.m. |
Updated
35
|
{"title": ["", "A scaled and sustainable demand responsive transport service"], "description": ["", "\nPrivate mobility has a high carbon footprint due to the manufacturing, use, storage and disposal of vehicles. Private cars spend 96% of their time idle and were responsible for 60.7% of total CO2 emissions from road transport. To reduce CO2 emissions while mitigating societal loss, linking poorly served geographies and alleviating the challenges of elderly and disabled to afford mobility, this research proposes the development of the mathematical tools needed to deliver sustainable, shared mobility, specifically a Demand Responsive Transport Service (DRTS). \n\nWe will design novel algorithms that optimise the routing and scheduling integrated with dynamic pricing of DRTS. Solving these large-scale hard combinatorial optimisation problems, in real time, will enable a transformation of DRTS, part of the emerging sector of scaled shared transport solutions, encouraging increased take up of shared mobility. DRTS allows passengers to book a door-to-door service requesting pick up or drop off times, much like a taxi, but sharing a vehicle with other passengers that may be collected or dropped off along the route. Similar services, such as Dial-a-Ride, exist to meet specific needs but they are reduced in scope and heavily subsidized by local councils and the Department for Transport. They lack route planning flexibility and cannot manage high demand. At scale, with optimized dynamic pricing and routing, realistic demand forecasts, informed accurate behavioural models, and incentivised by policies that enhance their acceptance and induce voluntary behaviour changes, DRTS would be financially viable and more sustainable than private car use. The original transformative science in the form of efficient, complex optimization algorithms, and the rich understanding of preferences and attitudes towards shared mobility developed in this project will help enable DRTS to be both efficient and cost-effective; thus, promoting shared mobility and significantly reducing CO2 emission of local travel.\n\nThis project will integrate three important scientific components to deliver an attractive, flexible, low-carbon DRTS. \n1) An effective efficient scheduling and routing optimisation algorithm for a fleet of vehicles of different types that can provide instant accept/reject decisions on journey requests. In order to do this effectively, the algorithm needs to anticipate potential future demand and be continuously globally optimising schedules across the fleet in the background. \n2) New revenue management formulations that allow the prices of journeys to be changed dynamically, with prices dependent on journey length and service quality; thus, supporting the financial sustainability of the service. \n3) A rich understanding of customer behaviour and preferences, which will be obtained by running surveys and focus groups and using the data collected to build choice models, describing how potential passengers make decisions. These models will support service design and motivate behaviour changes.\nCombining these three components of work comprehensively addresses the practical challenge and advances an exciting new interdisciplinary research area for shared green transportation. The algorithmic approach also has the potential to be adapted to electric and autonomous vehicles in the future.\n\n"], "extra_text": ["", "\n\n\n\n"], "status": ["", "Active"]}
|
|
| Nov. 20, 2023, 2:05 p.m. |
Added
35
|
{"external_links": [48213]}
|
|
| Nov. 20, 2023, 2:05 p.m. |
Created
35
|
[{"model": "core.project", "pk": 11909, "fields": {"owner": null, "is_locked": false, "coped_id": "ee464421-edd0-45e5-b0f1-9cb066ea8036", "title": "", "description": "", "extra_text": "", "status": "", "start": null, "end": null, "raw_data": 63200, "created": "2023-11-20T13:44:23.170Z", "modified": "2023-11-20T13:44:23.170Z", "external_links": []}}]
|
|