The Biobjective Bike-Sharing Rebalancing Problem with Balance Intervals: A Multistart Multiobjective Particle Swarm Optimization Algorithm

Table 3

An example of the initial solution.

Vehicle route	1	4	5	6	7	10	11	12	13	15
Inventories before rebalancing	98	32	19	87	27	27	97	26	31	38
Rebalance demands	+48	−18	−31	+37	−23	−23	+47	−24	−19	−12
Vehicle’s load after rebalancing	48	30	0	37	14	0	47	23	4	0
Inventories after rebalancing	50	50	49	50	50	41	50	50	50	42
Quantities satisfied	+48	−18	−30	+37	−23	−14	+47	−24	−19	−4

The stations in italics demonstrate that their demands are not fully met.