|
From: Nagel, K. P. Dr. <na...@vs...> - 2016-08-06 19:17:44
|
Dear Amelia,
At TU Berlin, you would have to communicate with Joschka Bischoff, in cc. He is on vacation right now. I think that he just programmed something like this for a project, and might be quite happy to have someone thinnk about search algorithms.
ETH Zurich has its own approach. We ended up not using it since our project had a very different focus. They may or may not answer directly.
Best wishes
Kai
On 05 Aug 2016, at 21:09, Tee Qiao Ying, Amelia <ame...@ga...<mailto:ame...@ga...>> wrote:
Hey guys,
I am working on a research project concerning the efficiency of various parking algorithms. I was wondering if it is possible to implement parking algorithms in MATSim for an agent. So it will look like this:
1. Agent goes and reaches destination
2. Agent will look at parking lots located near said destination
3. Using parking algorithm, agent will determine which parking lot has the most probability of finding a parking space.
4. Agent will go to determined parking lot
* If the parking lot has empty spaces, agent parks and succeeds
* If the parking lot is full, agent will go back to Step 2-4 and repeat them until it finds a parking space
So, is it possible to implement such a simulation in MATSim? Your help will be very much appreciated!
Best Regards,
Amelia
------------------------------------------------------------------------------
_______________________________________________
matsim-devel mailing list
mat...@li...<mailto:mat...@li...>
https://lists.sourceforge.net/lists/listinfo/matsim-devel
==========================================================
Get the "matsim example project" from
https://github.com/matsim-org/matsim-example-project .
----------------------------------------------------------
www.vsp.tu-berlin.de<http://www.vsp.tu-berlin.de>
fax +49-30-314-26269; fon +49-30-314-23308
TU Berlin Sek SG12; Salzufer 17-19; 10587 Berlin; Germany
|