Dynamic Scheduling Model of Bike-Sharing considering Invalid Demand

Table 4

Numbers of bikes for each period in the optimal scheduling scheme.

Point	1	2	3	4	5	6	7	8	9	10	11	12	13	14	15	16	17	18	19	20	21	22	23	24
1	41	40	43	51	61	69	76	86	91	101	106	116	121	9	12	18	24	32	40	44	48	54	58	67
2	47	45	46	47	48	48	48	49	49	51	53	55	58	61	63	61	61	62	63	64	63	62	62	63
3	56	48	43	40	36	35	33	32	32	31	27	146	145	142	138	134	130	128	122	117	117	115	110	108
4	44	36	33	27	25	133	130	124	118	113	111	108	106	99	96	89	82	79	73	66	63	59	53	46
5	52	56	63	71	79	89	96	106	113	122	127	139	143	152	161	171	178	190	17	23	35	47	54	64
6	38	38	40	40	38	41	40	41	44	45	47	47	48	51	50	53	54	58	58	60	64	67	68	67
7	38	31	29	25	109	104	96	90	85	78	75	70	66	59	54	51	47	45	42	36	34	27	23	18
8	55	47	40	35	27	22	85	79	74	66	60	52	44	36	28	23	19	17	11	7	4	0	0	0