|
|
 |
 |
| ½Ò |
½Òµ{³æ¤¸ |
«ü©w¾\Ū |
| 2 |
¦æ¤H¬ï¶V°ÝÃD¡AÀH¾÷µo¥Í²v Pedestrian Crossing Problem, Random Incidence |
°Ñ¦Ò®Ñ2.13, 2.14¤p¸` Sections 2.13, 2.14 |
| 3 |
¦æ¤H¬ï¶V°ÝÃD¡A»ZÂפó¥á°w¹êÅç Pedestrian Crossing Problem, Buffon's Needle Experiment |
°Ñ¦Ò®Ñ2.13, 2.14, 3.3.1¤p¸` Sections 2.13, 2.14, 3.3.1 |
| 5 |
§J¬¥¤Ò¹y¤ÀªR¤èªk Crofton's Method |
½Ò°ó¸É¥R¸ê®Æ¡A°Ñ¦Ò®Ñ3.5¤p¸` Lecture Note, Section 3.5 |
| 6 |
ºI½u°ÝÃD¡A¤Gºû®È¦æ°ÝÃD¡A³~¹J»Ùꪺ®È¦æ°ÝÃD Stick Breaking Problem, Two Dimensional Travel Problem, Travel with a Barrier Problem |
½Ò°ó¸É¥R¸ê®Æ¡A°Ñ¦Ò®Ñ2.1¤p¸` Lecture Note, Section 2.1 |
| 14 |
M/G/1ªÅ¶¡µ¥Ô¼Ò¦¡ Spatial M/G/1 Queueing Model |
°Ñ¦Ò®Ñ5.1, 5.2, 5.3¤p¸`¡]5.3.5¤p¸`°£¥~¡^ Sections 5.1, 5.2, 5.3(excluding 5.3.5) |
| 15 |
¦hºûµ¥Ô¼Ò¦¡¡A´Á±æ®È¦æ¶ZÂ÷»P´Á±æ®È¦æ®É¶¡ Hypercube Queueing Model, Expected Travel Distances and Expected Travel Times |
°Ñ¦Ò®Ñ5.4¤p¸`¡]5.4.5¤p¸`°£¥~¡^¡B5.8¤p¸` Sections 5.4(excluding 5.4.5), 5.8 |
| 17 |
ºô¸ô¼Ò¦¡ªì¤¶ Introduction to Network Models |
°Ñ¦Ò®Ñ6.1, 6.2¤p¸`¡]6.2.2»P6.2.3¤p¸`°£¥~¡^¡B6.3¤p¸` Sections 6.1, 6.2(excluding 6.2.2 and 6.2.3), 6.3 |
| 19 |
°Ï¦ì°ÝÃD Location Problems |
°Ñ¦Ò®Ñ6.5¤p¸`¡]6.5.6»P6.5.7¤p¸`°£¥~¡^ Section 6.5(excluding 6.5.6 and 6.5.7) |
| 20-21 |
¸ô½u³W¹º°ÝÃD Routing Problems |
°Ñ¦Ò®Ñ6.4¤p¸` Section 6.4 |
|
|
|
 |
 |
 |