Menu
▾
▴
matsim-devel — Announcements from/to developers about changes, new features, etc.
You can subscribe to this list here.
| 2009 |
Jan
|
Feb
|
Mar
(6) |
Apr
(3) |
May
(6) |
Jun
(4) |
Jul
(5) |
Aug
(6) |
Sep
(4) |
Oct
(2) |
Nov
(3) |
Dec
(9) |
|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 2010 |
Jan
(8) |
Feb
(1) |
Mar
|
Apr
(3) |
May
(1) |
Jun
(2) |
Jul
(4) |
Aug
(4) |
Sep
(5) |
Oct
(2) |
Nov
(12) |
Dec
(7) |
| 2011 |
Jan
(6) |
Feb
(6) |
Mar
(11) |
Apr
(6) |
May
(12) |
Jun
(4) |
Jul
(1) |
Aug
(1) |
Sep
(1) |
Oct
(6) |
Nov
(1) |
Dec
(3) |
| 2012 |
Jan
(3) |
Feb
(5) |
Mar
(6) |
Apr
(3) |
May
(1) |
Jun
|
Jul
(7) |
Aug
(11) |
Sep
(8) |
Oct
(6) |
Nov
(7) |
Dec
(12) |
| 2013 |
Jan
(5) |
Feb
(3) |
Mar
(1) |
Apr
(2) |
May
|
Jun
(8) |
Jul
(5) |
Aug
|
Sep
(7) |
Oct
|
Nov
(7) |
Dec
|
| 2014 |
Jan
(1) |
Feb
(8) |
Mar
(5) |
Apr
(16) |
May
(15) |
Jun
(9) |
Jul
(6) |
Aug
(6) |
Sep
(13) |
Oct
(10) |
Nov
(9) |
Dec
(13) |
| 2015 |
Jan
(5) |
Feb
(11) |
Mar
(5) |
Apr
(3) |
May
(11) |
Jun
(10) |
Jul
(12) |
Aug
(4) |
Sep
(5) |
Oct
(11) |
Nov
(13) |
Dec
(10) |
| 2016 |
Jan
(2) |
Feb
(3) |
Mar
(3) |
Apr
(5) |
May
(9) |
Jun
(15) |
Jul
(10) |
Aug
(17) |
Sep
(1) |
Oct
|
Nov
(2) |
Dec
(2) |
| 2017 |
Jan
(1) |
Feb
|
Mar
|
Apr
|
May
|
Jun
|
Jul
|
Aug
|
Sep
|
Oct
|
Nov
|
Dec
|
|
From: Nagel K. <na...@vs...> - 2017-01-09 15:15:22
|
(NOTE: This is NOT the same email as to the users.) Dear MATSim developers, Many of you have already noticed that we have moved our communication to a "MATSim internal space" at https://matsim.atlassian.net/wiki/display/MATSIM/ . --> Please try if you have access to this URL; otherwise please let us know. <-- We now would like to finalize this move. This means in particular that: * questions concerning how to use matsim should be asked through http://matsim.org/faq (which points to a sub-area of the community space, where you should also be registered) * other communication should be run through the blog feature of the internal space (create --> blogPost) * internal information can be added in a wiki-like fashion. Everybody who is registered is allowed to edit all of the above. We would also expect that you listen at least to the blog of this web site, since it will replace the email list. If you register yourself, the system is configured to send you weekly notifications. You can then fine-tune these notifications to your needs/preferences. Please let us know if there are problems. The mailing list from which this email is coming will be shut down. We hope that you will stay with us. All the best Kai ========================================================== Agent-based Mobility, Traffic and Transportation Models, Methodologies and Applications (ABMTRANS, in Madeira): http://www.uhasselt.be/UH/IMOB-EN/IMOB_EN-Education/ABMTRANS.html Deadline for submissions 20/Jan/2017. ---------------------------------------------------------- Application of agents to passenger transport (TAAPT, in Porto): http://www.paams.net/workshops/taapt Deadline for submissions 6/Feb/2017. ---------------------------------------------------------- Agent-based modelling of urban systems (ABMUS, in Sao Paolo): http://modelling-urban-systems.com/ Deadline for submissions 7/Feb/2017. ---------------------------------------------------------- hEART: http://heart2017.net.technion.ac.il/ Deadline for submissions 15/Mar/2017. !! The MATSim conceptual meeting will be attached to this. !! ---------------------------------------------------------- Get the "matsim example project" from https://github.com/matsim-org/matsim-example-project . ---------------------------------------------------------- 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 |
|
From: Nagel, K. P. Dr. <na...@vs...> - 2016-12-22 08:45:20
|
Maybe of interest. Best wishes Kai Begin forwarded message: From: Guido Gentile <gui...@si...<mailto:gui...@si...>> Subject: special session MTITS 2017 NAPOLI (sorry for cross posting) Date: 22 Dec 2016 00:58:33 CET To: undisclosed-recipients:; Dear Colleague, The MT-ITS 2017 conference will include a Special Section on SIMULATION AND FORECASTING FOR INTELLIGENT TRANSIT NETWORKS SCOPE AND GOALS. In the era of ITS there is an increasing need of developing dynamic transport models to improve the realism of simulations, aiming to higher efficiency of network management interventions, as well as to more reliable real-time user information. These task are still today faced by operators with limited support from transport modelling with respect to the potential contribution of state-of-the-art methodologies. Moreover, great opportunities are envisaged by the availability of distributed computing, artificial intelligence and big data. Thus, new applicative solutions for transport network operators can emerge based on new modeling paradigms where dynamics play a major role in transit service optimization, fleet control and passenger information. TOPICS OF INTEREST (not limited to): - Multi-modal transit network modelling and simulation - Transit modelling and simulation up-grading using AVL , APC and other source data - Transit service performance forecasting (data driven) - Transit modelling and forecasting applications in service planning, operations control and traveller info. SUBMISSION GUIDELINES Short abstracts (max 500 words) should be submitted via the conference website http://www.mt-its2017.org/ by January 31, 2017 Further details on this Special Section are available on attached call and on MT-ITS 2017 are available on the official website of the conference:http://www.mt-its2017.org/. Please feel free to forward this call to your colleagues, networks and contacts who might be interested. Looking forward to seeing you in Napoli! With kind regards, Agostino Nuzzolo and Guido Gentile (Special Section Co-Chairs) -- _____________________________________________________________ Prof. Ing. Guido Gentile mobile +39 345.36.120.79 office +39 06.44.585.737 Sapienza Università di Roma Dipartimento di Ingegneria Civile, Edile e Ambientale gui...@un...<mailto:gui...@un...> https://sites.google.com/a/sistemaits.com/guidogentile/ PTV-SISTeMA s.r.l. Spinoff di Sapienza, PTV Group gui...@si...<mailto:gui...@si...> www.sistemaits.com<http://www.sistemaits.com/> ========================================================== 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 |
|
From: Nagel, K. P. Dr. <na...@vs...> - 2016-12-19 13:34:18
|
Hello, Not sure if these mailing lists still work ... there was some decision at the developer meeting, but somehow it has not yet been fully executed. In the meantime: We are going to have the MATSim '17 conceptual meeting and user meeting in conjunction with hEART'17, and most of it open to all interested parties. We don't know yet the complete details, but we will pre-attach this to the hEART conference. So please keep this in mind when planning your trip to Haifa. The ETH Zurich group has kindly agreed to work on the details. Thanks and best wishes Kai ========================================================== Get the "matsim example project" from https://github.com/matsim-org/matsim-example-project . ---------------------------------------------------------- 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 |
|
From: Ciari F. <ci...@iv...> - 2016-11-14 13:29:08
|
Dear all, The new MATSim Monthly report is online. https://matsim.atlassian.net/wiki/display/MATPUB/Report+September-October I'll get in touch with the new request for contributions short before holidays in December. Best, Francesco ------------------------------- Francesco Ciari, PhD Senior Research Officer ETH Zürich, IVT - Institute for Transport Planning and Systems HIL F 33.2, Stefano-Franscini-Platz 5 8093 Zürich, CH ci...@iv...<mailto:ci...@iv...> Tel: +41 44 633 71 65 From: Ciari Francesco Sent: Freitag, 16. September 2016 16:14 To: Ciari Francesco; 'mat...@li...'; 'Matsim Developers' Subject: RE: MATSim report --> Request for contributions Dear all, The new MATSim Monthly report is online. Sorry for being late. https://matsim.atlassian.net/wiki/display/MATPUB/Report+July-August I feel that several unmaintained contributions are accumulating in the list. I will get in touch the contact persons directly in order to sort it out and then clean it up before the next report will be published. Best, Francesco ------------------------------- Francesco Ciari, PhD Senior Research Officer ETH Zürich, IVT - Institute for Transport Planning and Systems HIL F 33.2, Stefano-Franscini-Platz 5 8093 Zürich, CH ci...@iv...<mailto:ci...@iv...> Tel: +41 44 633 71 65 From: Ciari Francesco [mailto:ci...@iv...] Sent: Mittwoch, 24. August 2016 14:34 To: 'mat...@li...'; 'Matsim Developers' Subject: [Matsim-users] MATSim report --> Request for contributions Dear MATSim Users and Developers, I'm kindly asking you to send your contributions to me for the new Monthly Report. I would appreciate getting them until next Thursday (September 1st). Thanks a lot! Best, Francesco ------------------------------- Francesco Ciari, PhD Senior Research Officer ETH Zürich, IVT - Institute for Transport Planning and Systems HIL F 33.2, Stefano-Franscini-Platz 5 8093 Zürich, CH ci...@iv...<mailto:ci...@iv...> Tel: +41 44 633 71 65 at your institution). |
|
From: Ciari F. <ci...@iv...> - 2016-11-02 12:54:42
|
Dear MATSim Users and Developers, I'm kindly asking you to send your contributions to me for the new Monthly Report. I would appreciate getting them until Monday next Week (November 7th). Sorry for being late, I'm still adjusting to the new life with a larger family... On top of the regular contributions, you are also asked to look into the latest report (https://matsim.atlassian.net/wiki/display/MATPUB/Report+July-August) paying special attention to all contributions from your institution and check if they are correct as for several projects I did not hear anything in a while. Thanks a lot! Best, Francesco ------------------------------- Francesco Ciari, PhD Senior Research Officer ETH Zürich, IVT - Institute for Transport Planning and Systems HIL F 33.2, Stefano-Franscini-Platz 5 8093 Zürich, CH ci...@iv...<mailto:ci...@iv...> Tel: +41 44 633 71 65 From: Ciari Francesco Sent: Freitag, 16. September 2016 16:14 To: Ciari Francesco; 'mat...@li...'; 'Matsim Developers' Subject: RE: MATSim report --> Request for contributions Dear all, The new MATSim Monthly report is online. Sorry for being late. https://matsim.atlassian.net/wiki/display/MATPUB/Report+July-August I feel that several unmaintained contributions are accumulating in the list. I will get in touch the contact persons directly in order to sort it out and then clean it up before the next report will be published. Best, Francesco ------------------------------- Francesco Ciari, PhD Senior Research Officer ETH Zürich, IVT - Institute for Transport Planning and Systems HIL F 33.2, Stefano-Franscini-Platz 5 8093 Zürich, CH ci...@iv...<mailto:ci...@iv...> Tel: +41 44 633 71 65 From: Ciari Francesco [mailto:ci...@iv...] Sent: Mittwoch, 24. August 2016 14:34 To: 'mat...@li...'; 'Matsim Developers' Subject: [Matsim-users] MATSim report --> Request for contributions Dear MATSim Users and Developers, I'm kindly asking you to send your contributions to me for the new Monthly Report. I would appreciate getting them until next Thursday (September 1st). Thanks a lot! Best, Francesco ------------------------------- Francesco Ciari, PhD Senior Research Officer ETH Zürich, IVT - Institute for Transport Planning and Systems HIL F 33.2, Stefano-Franscini-Platz 5 8093 Zürich, CH ci...@iv...<mailto:ci...@iv...> Tel: +41 44 633 71 65 at your institution). |
|
From: Ciari F. <ci...@iv...> - 2016-09-16 14:14:36
|
Dear all, The new MATSim Monthly report is online. Sorry for being late. https://matsim.atlassian.net/wiki/display/MATPUB/Report+July-August I feel that several unmaintained contributions are accumulating in the list. I will get in touch the contact persons directly in order to sort it out and then clean it up before the next report will be published. Best, Francesco ------------------------------- Francesco Ciari, PhD Senior Research Officer ETH Zürich, IVT - Institute for Transport Planning and Systems HIL F 33.2, Stefano-Franscini-Platz 5 8093 Zürich, CH ci...@iv...<mailto:ci...@iv...> Tel: +41 44 633 71 65 From: Ciari Francesco [mailto:ci...@iv...] Sent: Mittwoch, 24. August 2016 14:34 To: 'mat...@li...'; 'Matsim Developers' Subject: [Matsim-users] MATSim report --> Request for contributions Dear MATSim Users and Developers, I'm kindly asking you to send your contributions to me for the new Monthly Report. I would appreciate getting them until next Thursday (September 1st). Thanks a lot! Best, Francesco ------------------------------- Francesco Ciari, PhD Senior Research Officer ETH Zürich, IVT - Institute for Transport Planning and Systems HIL F 33.2, Stefano-Franscini-Platz 5 8093 Zürich, CH ci...@iv...<mailto:ci...@iv...> Tel: +41 44 633 71 65 at your institution). |
|
From: Nagel, K. P. Dr. <na...@vs...> - 2016-08-29 11:36:17
|
Dear Haitam, Could you please see here: https://matsim.atlassian.net/wiki/questions/80642086/how-to-extract-public-transit-waiting-time Best wishes ... On 25 Aug 2016, at 11:42, Haitam Lrb <ht...@gm...<mailto:ht...@gm...>> wrote: Dear prof. Nagel, Thank you for your explanation, you have clarified to me many points related to the subject. Giving that waiting time is incorporated in travel time of a Leg, What might be the best way to extract the actual waiting time at each stop after a pt interaction ? Cheers, Haitam On Thu, Aug 25, 2016 at 9:24 AM, Nagel, Kai, Prof. Dr. <na...@vs...<mailto:na...@vs...>> wrote: Dear Haitam, The waiting time is in the leg, not in the activity. That is, the agent arrives at the pt stop, has a "pt interaction" activity of duration zero, and then immediately starts the leg. From then on, it will wait until it is picked up by a pt vehicle (PersonEntersVehicle event). Reasons: * We wanted activities between legs (e.g. between the transit_walk and the pt leg) for the visualizer, and much other code that depends on alternating activities/legs. There is, however, a long-standing design decision to allow legs without activities in between, and at least most of the core should be able to process that. But we have never concluded that push (and are sometimes wondering if we should). * It would be difficult for the simulation logic to get the traveller out of an activity when the bus arrives. This may be a technicality, but in general agents at activities are removed from the transport side of the simulation. So if you drink a coffee for 10 minutes before entering a pt vehicle, it is an activity. (I.e. you also miss the pt vehicle if it departs early.) If you drink a coffee until the bus arrives, it is part of the leg. --- The pt Dijkstra handles all this by mapping "earliest departure times" at one pt stop into "earliest arrival time" at all pt stops that can be reached from there. E.g. you arrive at a pt stop at 7:00, the pt vehicle is departing at 7:10 and arriving at the next stop at 7:12, then your link travel time is 12min. If, instead, you arrive at the pt stop at 7:05, then your link travel time in 7min. So the Dijkstra subsumes the waiting time into the travel time. (There is also some retrofitting that looks at the waiting time separately, since often the VTTS there is different.). --- Start/endTime = NaN (really? should be Time.UNDEFINED) just means it is undefined, i.e. only the duration counts (as it makes sense). Please let us know if this does not clarify it. Best wishes Kai Sent from my iPad On 24 Aug 2016, at 18:01, Haitam Lrb <ht...@gm...<mailto:ht...@gm...>> wrote: Hi, As I am interested to know what are the start and end time of a "pt interaction" activity, I was surprised that the Transit Router module doesn't provide these information. When I looked into the code I found that the maximum duration is set to 0, while Start and End time of a pt activity are left as NaN. #TransitRouterWrapper ActivityImpl act = new ActivityImpl( PtConstants.TRANSIT_ACTIVITY_TYPE, this.transitSchedule.getFacilities().get(tRoute.getAccessStopId()).getCoord(), tRoute.getStartLinkId()); act.setMaximumDuration(0.0); trip.add(act); is there a way to get this information from the Router module, or should I use a different TransitRouterImpl and TransitRouterWrapper where I only add few lines to set the waiting time information at PT stops ? NB: I am wondering also about whether the MultiNodeDijkstra take into consideration the schedule for calculating the best route ? Sincerely, -- HAITAM ------------------------------------------------------------------------------ _______________________________________________ matsim-devel mailing list mat...@li...<mailto:mat...@li...> https://lists.sourceforge.net/lists/listinfo/matsim-devel -- HAITAM ========================================================== 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 |
|
From: Haitam L. <ht...@gm...> - 2016-08-25 09:42:33
|
Dear prof. Nagel, Thank you for your explanation, you have clarified to me many points related to the subject. Giving that waiting time is incorporated in travel time of a Leg, What might be the best way to extract the actual waiting time at each stop after a pt interaction ? Cheers, Haitam On Thu, Aug 25, 2016 at 9:24 AM, Nagel, Kai, Prof. Dr. < na...@vs...> wrote: > Dear Haitam, > > The waiting time is in the leg, not in the activity. That is, the agent > arrives at the pt stop, has a "pt interaction" activity of duration zero, > and then immediately starts the leg. From then on, it will wait until it > is picked up by a pt vehicle (PersonEntersVehicle event). > > Reasons: > > * We wanted activities between legs (e.g. between the transit_walk and the > pt leg) for the visualizer, and much other code that depends on alternating > activities/legs. There is, however, a long-standing design decision to > allow legs without activities in between, and at least most of the core > should be able to process that. But we have never concluded that push (and > are sometimes wondering if we should). > > * It would be difficult for the simulation logic to get the traveller out > of an activity when the bus arrives. This may be a technicality, but in > general agents at activities are removed from the transport side of the > simulation. So if you drink a coffee for 10 minutes before entering a pt > vehicle, it is an activity. (I.e. you also miss the pt vehicle if it > departs early.) If you drink a coffee until the bus arrives, it is part of > the leg. > > --- > > The pt Dijkstra handles all this by mapping "earliest departure times" at > one pt stop into "earliest arrival time" at all pt stops that can be > reached from there. E.g. you arrive at a pt stop at 7:00, the pt vehicle > is departing at 7:10 and arriving at the next stop at 7:12, then your link > travel time is 12min. If, instead, you arrive at the pt stop at 7:05, then > your link travel time in 7min. So the Dijkstra subsumes the waiting time > into the travel time. (There is also some retrofitting that looks at the > waiting time separately, since often the VTTS there is different.). > > --- > > Start/endTime = NaN (really? should be Time.UNDEFINED) just means it is > undefined, i.e. only the duration counts (as it makes sense). > > Please let us know if this does not clarify it. > > Best wishes > > Kai > > Sent from my iPad > > On 24 Aug 2016, at 18:01, Haitam Lrb <ht...@gm...> wrote: > > Hi, > As I am interested to know what are the start and end time of a "pt > interaction" activity, I was surprised that the Transit Router module > doesn't provide these information. When I looked into the code I found that > the maximum duration is set to 0, while Start and End time of a pt activity > are left as NaN. > > #TransitRouterWrapper > ActivityImpl act = > new ActivityImpl( > PtConstants.TRANSIT_ACTIVITY_TYPE, > this.transitSchedule. > getFacilities().get(tRoute.getAccessStopId()).getCoord(), > tRoute.getStartLinkId()); > act.setMaximumDuration(0.0); > trip.add(act); > > is there a way to get this information from the Router module, or should I > use a different TransitRouterImpl and TransitRouterWrapper where I only add > few lines to set the waiting time information at PT stops ? > > NB: I am wondering also about whether the MultiNodeDijkstra take into > consideration the schedule for calculating the best route ? > > Sincerely, > -- > HAITAM > > ------------------------------------------------------------ > ------------------ > > _______________________________________________ > matsim-devel mailing list > mat...@li... > https://lists.sourceforge.net/lists/listinfo/matsim-devel > > -- HAITAM |
|
From: Nagel, K. P. Dr. <na...@vs...> - 2016-08-25 07:25:05
|
Dear Haitam,
The waiting time is in the leg, not in the activity. That is, the agent arrives at the pt stop, has a "pt interaction" activity of duration zero, and then immediately starts the leg. From then on, it will wait until it is picked up by a pt vehicle (PersonEntersVehicle event).
Reasons:
* We wanted activities between legs (e.g. between the transit_walk and the pt leg) for the visualizer, and much other code that depends on alternating activities/legs. There is, however, a long-standing design decision to allow legs without activities in between, and at least most of the core should be able to process that. But we have never concluded that push (and are sometimes wondering if we should).
* It would be difficult for the simulation logic to get the traveller out of an activity when the bus arrives. This may be a technicality, but in general agents at activities are removed from the transport side of the simulation. So if you drink a coffee for 10 minutes before entering a pt vehicle, it is an activity. (I.e. you also miss the pt vehicle if it departs early.) If you drink a coffee until the bus arrives, it is part of the leg.
---
The pt Dijkstra handles all this by mapping "earliest departure times" at one pt stop into "earliest arrival time" at all pt stops that can be reached from there. E.g. you arrive at a pt stop at 7:00, the pt vehicle is departing at 7:10 and arriving at the next stop at 7:12, then your link travel time is 12min. If, instead, you arrive at the pt stop at 7:05, then your link travel time in 7min. So the Dijkstra subsumes the waiting time into the travel time. (There is also some retrofitting that looks at the waiting time separately, since often the VTTS there is different.).
---
Start/endTime = NaN (really? should be Time.UNDEFINED) just means it is undefined, i.e. only the duration counts (as it makes sense).
Please let us know if this does not clarify it.
Best wishes
Kai
Sent from my iPad
On 24 Aug 2016, at 18:01, Haitam Lrb <ht...@gm...<mailto:ht...@gm...>> wrote:
Hi,
As I am interested to know what are the start and end time of a "pt interaction" activity, I was surprised that the Transit Router module doesn't provide these information. When I looked into the code I found that the maximum duration is set to 0, while Start and End time of a pt activity are left as NaN.
#TransitRouterWrapper
ActivityImpl act =
new ActivityImpl(
PtConstants.TRANSIT_ACTIVITY_TYPE,
this.transitSchedule.getFacilities().get(tRoute.getAccessStopId()).getCoord(),
tRoute.getStartLinkId());
act.setMaximumDuration(0.0);
trip.add(act);
is there a way to get this information from the Router module, or should I use a different TransitRouterImpl and TransitRouterWrapper where I only add few lines to set the waiting time information at PT stops ?
NB: I am wondering also about whether the MultiNodeDijkstra take into consideration the schedule for calculating the best route ?
?Sincerely,?
--
HAITAM
------------------------------------------------------------------------------
_______________________________________________
matsim-devel mailing list
mat...@li...<mailto:mat...@li...>
https://lists.sourceforge.net/lists/listinfo/matsim-devel
|
|
From: Haitam L. <ht...@gm...> - 2016-08-24 16:00:49
|
Hi,
As I am interested to know what are the start and end time of a "pt
interaction" activity, I was surprised that the Transit Router module
doesn't provide these information. When I looked into the code I found that
the maximum duration is set to 0, while Start and End time of a pt activity
are left as NaN.
#TransitRouterWrapper
ActivityImpl act =
new ActivityImpl(
PtConstants.TRANSIT_ACTIVITY_TYPE,
this.transitSchedule.getFacilities().get(tRoute.getAccessStopId()).getCoord(),
tRoute.getStartLinkId());
act.setMaximumDuration(0.0);
trip.add(act);
is there a way to get this information from the Router module, or should I
use a different TransitRouterImpl and TransitRouterWrapper where I only add
few lines to set the waiting time information at PT stops ?
NB: I am wondering also about whether the MultiNodeDijkstra take into
consideration the schedule for calculating the best route ?
Sincerely,
--
HAITAM
|
|
From: Bischoff, J. F. <bis...@vs...> - 2016-08-24 14:20:29
|
Dear all, we have updated our tutorials for the current 0.8.0 release. You can find the tutorial here: http://matsim.org/content/2016-matsim-class-tu-berlin-matsim-version-08x It contains a guide on how to get started with using and extending MATSim, including the recommended way of installing MATSim. The tutorial is based on the MATSim class that runs at TU Berlin during the summer term. If you have questions or problems with the tutorial, just contact me. All the best from Berlin, Joschka |
|
From: Ciari F. <ci...@iv...> - 2016-08-24 12:34:09
|
Dear MATSim Users and Developers, I'm kindly asking you to send your contributions to me for the new Monthly Report. I would appreciate getting them until next Thursday (September 1st). Thanks a lot! Best, Francesco ------------------------------- Francesco Ciari, PhD Senior Research Officer ETH Zürich, IVT - Institute for Transport Planning and Systems HIL F 33.2, Stefano-Franscini-Platz 5 8093 Zürich, CH ci...@iv...<mailto:ci...@iv...> Tel: +41 44 633 71 65 at your institution). |
|
From: Tee Q. Y. A. <ame...@ga...> - 2016-08-08 12:17:37
|
Dear Kay,
Thank you for the link. I'll take look at the papers on the IVT website and will ask questions if needed.
Best Regards,
Amelia
________________________________
From: Axhausen Kay W. <axh...@iv...>
Sent: Monday, August 8, 2016 4:55:05 AM
To: Tee Qiao Ying, Amelia; mat...@li...
Cc: Balac Milos
Subject: Re: [Matsim-devel] Is it possible to implement and simulate parking algorithms in MATSim?
Thanks, the work of Rashid Waraich took this path and Milos Balac has recently continued along those lines for Z?rich.
See the relevant papers on the IVT webpage.
Kay Axhausen
--
KW Axhausen
IVT
ETH Z?rich
Office: ETH H?nggerberg, HIL, F31.3
Post: CH - 8093 Z?rich
Skype: Axhausen
T: +41.44.633 3943
M: +41.76.368 0249
F: +41.44.633 1057
From: "Tee Qiao Ying, Amelia" <ame...@ga...<mailto:ame...@ga...>>
Date: Friday 5 August 2016 21:09
To: "mat...@li...<mailto:mat...@li...>" <mat...@li...<mailto:mat...@li...>>
Subject: [Matsim-devel] Is it possible to implement and simulate parking algorithms in MATSim?
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
|
|
From: Axhausen K. W. <axh...@iv...> - 2016-08-08 09:07:58
|
Thanks, the work of Rashid Waraich took this path and Milos Balac has recently continued along those lines for Zürich.
See the relevant papers on the IVT webpage.
Kay Axhausen
--
KW Axhausen
IVT
ETH Zürich
Office: ETH Hönggerberg, HIL, F31.3
Post: CH – 8093 Zürich
Skype: Axhausen
T: +41.44.633 3943
M: +41.76.368 0249
F: +41.44.633 1057
From: "Tee Qiao Ying, Amelia" <ame...@ga...<mailto:ame...@ga...>>
Date: Friday 5 August 2016 21:09
To: "mat...@li...<mailto:mat...@li...>" <mat...@li...<mailto:mat...@li...>>
Subject: [Matsim-devel] Is it possible to implement and simulate parking algorithms in MATSim?
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
|
|
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
|
|
From: Nagel, K. P. Dr. <na...@vs...> - 2016-08-06 19:14:36
|
Dear Jaime, Glad you like it. (1) There is now the matsim book, matsim.org/the-book<http://matsim.org/the-book> . There is also a "user guide" extract of it, matsim.org/docs/userguide<http://matsim.org/docs/userguide> . At this point, both book and user guide extract are roughly matsim version 0.8.x. In the future, we expect the user guide extract to go with revisions, while the book will remain static for some time. (2) If you want to java-program against matsim under maven, we now strongly recommend git-cloning the matsim-example-project from https://github.com/matsim-org/matsim-example-project . That makes a lot of things truly a lot easier. This should not only import the matsim jar, but also its source attachment. If that has worked (seems to be a bit flaky), the package "org.matsim.morexamples" (in the example project; just added to github so git pull if you already had a checkout) points to more material. (3) In general, the place to get started is http://matsim.org/docs/tutorials . As so often, documentation is behind reality; e.g. the "quickstart" section still promotes the command line version, where we have a GUI now. The 2016 MATSim class at TU Berlin should become public fairly soon; that would be a good "step-by-step" place to start. The 2016 incarnation also uses the matsim-example-project from (2). Hope this helps a bit. In general matsim.org/tutorials<http://matsim.org/tutorials> should be the place to start, but we ain't fully consistent yet. Best wishes Kai PS: Johan Joubert did make great videos some time ago. Very unfortunately, also videos are static while the software moves on, and it is more work than we have time to keep these things consistent. On 06 Aug 2016, at 18:51, Jaime Benavides <jai...@gm...<mailto:jai...@gm...>> wrote: Dear all, my name is Jaime Benavides. I am a PhD student at Barcelona Supercomputing Center working on urban air quality modelling. In my PhD work, we are not planning to use a transport model at this moment. We are focus on combining air quality models at mesoscale and street scale. However, I am trying to learn Matsim during the weekends because I think it is a key tool to design and evaluate political measures to improve air quality. I am fascinated with the work conducted using matsim to simulate transport and emissions in Munich and with Benjamin Kickhöfer PhD thesis...Congratulations. In the last weeks, I spent some time learning maven and trying to get into matsim. Do you have any "recipes" for newbies? (video tutorials or step by step get into matsim?) Any suggestions to facilitate my integration as user is welcome. Thanks in advance. Regards Jaime ------------------------------------------------------------------------------ _______________________________________________ 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 |
|
From: Jaime B. <jai...@gm...> - 2016-08-06 16:51:48
|
Dear all, my name is Jaime Benavides. I am a PhD student at Barcelona Supercomputing Center working on urban air quality modelling. In my PhD work, we are not planning to use a transport model at this moment. We are focus on combining air quality models at mesoscale and street scale. However, I am trying to learn Matsim during the weekends because I think it is a key tool to design and evaluate political measures to improve air quality. I am fascinated with the work conducted using matsim to simulate transport and emissions in Munich and with Benjamin Kickhöfer PhD thesis...Congratulations. In the last weeks, I spent some time learning maven and trying to get into matsim. Do you have any "recipes" for newbies? (video tutorials or step by step get into matsim?) Any suggestions to facilitate my integration as user is welcome. Thanks in advance. Regards Jaime |
|
From: Tee Q. Y. A. <ame...@ga...> - 2016-08-05 22:43:39
|
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
|
|
From: Wilk, J. <wi...@vs...> - 2016-08-04 13:47:38
|
Please unsubscribe yourself here https://lists.sourceforge.net/lists/listinfo/matsim-devel (at the bottom) cheers Jakub Von: Gilberto Giordano Filho [mailto:gio...@gm...] Gesendet: Donnerstag, 4. August 2016 15:20 An: mat...@li... Betreff: [Matsim-devel] (no subject) Please, I would like to get out to the list! |
|
From: Gilberto G. F. <gio...@gm...> - 2016-08-04 13:20:16
|
Please, I would like to get out to the list! |
|
From: Dominik G. <dom...@tw...> - 2016-08-04 11:26:14
|
Dear all, just checked out matsim today and figured out that JDK 1.7 or newer (see http://matsim.org/docs/devguide/eclipse) is no longer correct, at least building the playgrounds requires java 8 ( https://github.com/matsim-org/matsim/commit/f4c6925ae9e6a3e565267accbb5282df4455387e ). Fine for me, but we should state this at http://matsim.org/docs/devguide/eclipse Bests, Dominik Mit freundlichen Grüßen / Best Regards i.A. Dominik Grether Competence Unit ICT -------------------------------------------------------------------- Dr. Dominik Grether Software Architect TWT GmbH Science & Innovation Ernsthaldenstraße 17 D-70565 Stuttgart Mobil: +491775380530 E-Mail: Dom...@tw... -------------------------------------------------------------------- www.twt-gmbh.de -------------------------------------------------------------------- Geschäftsführung: Dr. Dimitrios Vartziotis, Joachim Laicher (Stv.), Frank Beutenmüller (Stv.) Registergericht: Amtsgericht Stuttgart, HRB Nr. 212778 Umsatzsteuer: ID-Nr.: DE147841145 -------------------------------------------------------------------- |
|
From: Nagel, K. P. Dr. <na...@vs...> - 2016-08-01 20:25:27
|
Hallo Johannes, Nicht dass ich wüsste. Ich glaube, wir würden uns eher http://graphhopper.com anschauen ... ist in Java, und wir kennen einen der Leute dort (Stefan Schröder). Michael Z und Dominik Z haben opentripplanner in MATSim eingebunden. Nicht das gleiche, aber vom Ansatz her doch irgendwie ein wenig ähnlich. Let us know how it goes. VG Kai > On 01 Aug 2016, at 21:50, Johannes Illenberger <joh...@al...> wrote: > > Hi all, > > Before i start digging into this: Has anyone already tried to marry OSRM (http://project-osrm.org) with matsim — either via the http api or the C library? > > Cheers, Johannes > ------------------------------------------------------------------------------ > _______________________________________________ > matsim-devel mailing list > 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 fax +49-30-314-26269; fon +49-30-314-23308 TU Berlin Sek SG12; Salzufer 17-19; 10587 Berlin; Germany |
|
From: Johannes I. <joh...@al...> - 2016-08-01 20:04:20
|
Hi all, Before i start digging into this: Has anyone already tried to marry OSRM (http://project-osrm.org) with matsim — either via the http api or the C library? Cheers, Johannes |
|
From: Nagel, K. P. Dr. <na...@vs...> - 2016-07-19 18:51:49
|
Dear Mohammad, This is not yet functional. Please discuss with Amit (in cc), also if you want to help. Best On 19 Jul 2016, at 19:01, Mohammad Saleem <moh...@ou...<mailto:moh...@ou...>> wrote: Hi! I have a simple junction with four incoming links and one outgoing link. The travelers (20000) move from initial point 'O' to the final destination 'D1' through the junction. Ten percent travelers can reroute their routes in each iteration. <pastedImage.png> When I run this scenario and iterate, travelers change to alternative routes which can be observed easily from the score statistics. <pastedImage.png> But when I set the Inflow Constraint, the score doesn't improve with iterations, and the gap between worst score and best score disappears. Also the score goes way too low as compared to the run without setting any such constraint. <pastedImage.png> This is how I set the Inflow Constraint. controler.getConfig().qsim().setInflowConstraint(InflowConstraint.maxflowFromFdiag); controler.getConfig().qsim().setTrafficDynamics(TrafficDynamics.withHoles); I am wondering whether I doing something wrong, or is there any problem with the functionality of setting Inflow Constraint. Best Regards Mohammad Saleem ------------------------------------------------------------------------------ What NetFlow Analyzer can do for you? Monitors network bandwidth and traffic patterns at an interface-level. Reveals which users, apps, and protocols are consuming the most bandwidth. Provides multi-vendor support for NetFlow, J-Flow, sFlow and other flows. Make informed decisions using capacity planning reports.http://sdm.link/zohodev2dev_______________________________________________ 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 |
|
From: Mohammad S. <moh...@ou...> - 2016-07-19 17:26:48
|
Hi! I have a simple junction with four incoming links and one outgoing link. The travelers (20000) move from initial point 'O' to the final destination 'D1' through the junction. Ten percent travelers can reroute their routes in each iteration. [cid:bcf81ffb-aa77-4eeb-bdae-7e43bd0c8a7a] When I run this scenario and iterate, travelers change to alternative routes which can be observed easily from the score statistics. [cid:60288440-36e3-46c8-832b-e1e6bde0214e] But when I set the Inflow Constraint, the score doesn't improve with iterations, and the gap between worst score and best score disappears. Also the score goes way too low as compared to the run without setting any such constraint. [cid:1026beca-4e18-4cdf-b717-042814fbcf18] This is how I set the Inflow Constraint. controler.getConfig().qsim().setInflowConstraint(InflowConstraint.maxflowFromFdiag); controler.getConfig().qsim().setTrafficDynamics(TrafficDynamics.withHoles); I am wondering whether I doing something wrong, or is there any problem with the functionality of setting Inflow Constraint. Best Regards Mohammad Saleem |
24 messages has been excluded from this view by a project administrator.