最小化碳排放的共享单车迁移问题

苏兵, WyattCarlson, 范佳彬, GAO Arthur, 邵艳君, 林国辉

Sharing bicycle relocating with minimum carbon emission

Bing SU, Wyatt CARLSON, Jiabin FAN, Arthur GAO, Yanjun SHAO, Guohui LIN

Fig.3 The service paths generated by the three algorithms on two simulated instances of the $ 20 $-station dataset, on the left of which Greedy significantly outperforms TSP-based in carbon emission and on the right TSP-based significantly outperforms Greedy. (a) the paths by IQP-Cplex, with emission 121.13 and travel distance 52.52 (left) and emission 117.22 and travel distance 65.68 (right); (b) the paths by Greedy, with emission 146.90 and travel distance 53.67 (left) and emission 277.57 and travel distance 55.87 (right); (c) the paths by TSP-based, with emission 353.48 and travel distance 97.41 (left) and emission 176.41 and travel distance 68.82 (right). In the figures, the dots represent labelled stations with the depot labelled $ 0 $; a directed edge tells from which station to another the service vehicle moves along the streets