The paper focuses on one-way electric carsharing systems, where the fleet of cars is made up of Electric Vehicles (EVs) and the users can pick-up the EV at a station and return it to a different one. Such systems require efficient vehicle relocation for constantly balancing the availability of EVs among stations. In this work, the EVs are relocated by workers, and the issue of finding a trade-off among the customers’ satisfaction, the workers’ workload balance and the carsharing provider’s objective is addressed. This leads to a three-objective optimization problem for which a two-phase solution approach is proposed. In the first phase, feasible routes and schedules for relocating EVs are generated by different randomized search heuristics; in the second phase, non-dominated solutions are found through epsilon-constraint programming. Computational results are performed on benchmark instances and new large size instances based on the city of Milan.

A two-phase optimization method for a multiobjective vehicle relocation problem in electric carsharing systems / Bruglieri, Maurizio; Pezzella, Ferdinando; Pisacane, Ornella. - In: JOURNAL OF COMBINATORIAL OPTIMIZATION. - ISSN 1382-6905. - 36:1(2018), pp. 162-193. [10.1007/s10878-018-0295-5]

A two-phase optimization method for a multiobjective vehicle relocation problem in electric carsharing systems

Ferdinando Pezzella;Ornella Pisacane
2018-01-01

Abstract

The paper focuses on one-way electric carsharing systems, where the fleet of cars is made up of Electric Vehicles (EVs) and the users can pick-up the EV at a station and return it to a different one. Such systems require efficient vehicle relocation for constantly balancing the availability of EVs among stations. In this work, the EVs are relocated by workers, and the issue of finding a trade-off among the customers’ satisfaction, the workers’ workload balance and the carsharing provider’s objective is addressed. This leads to a three-objective optimization problem for which a two-phase solution approach is proposed. In the first phase, feasible routes and schedules for relocating EVs are generated by different randomized search heuristics; in the second phase, non-dominated solutions are found through epsilon-constraint programming. Computational results are performed on benchmark instances and new large size instances based on the city of Milan.
2018
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11566/258366
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo

Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 34
  • ???jsp.display-item.citation.isi??? 27
social impact