Authors: Lucio Grandinetti; Francesca Guerriero; Ferdinando Pezzella; Ornella Pisacane
Addresses: Department of Computer Engineering, Electronics and Systems, Università della Calabria, P. Bucci, 87036, Arcavacata di Rende, Italy ' Department of Mechanical, Energy and Management Engineering, Università della Calabria, P. Bucci, 87036, Arcavacata di Rende, Italy ' Department of Information Engineering, Università Politecnica delle Marche, B. Bianche, 60131, Ancona, Italy ' Department of Information Engineering, Università Politecnica delle Marche, B. Bianche, 60131, Ancona, Italy
Abstract: In the pick-up and delivery problem with time windows (PDPTW), each transportation service is delivered, from an origin to a destination, satisfying both the time windows and the precedence constraints. This paper addresses the related vehicle routing problem by using only electric vehicles (EVs) and by introducing the recharging stations (RSs). The problem is formulated as a multi-objective mixed integer linear model for minimising the total travel distance, the total cost for the EVs used and the total penalty cost for the unsatisfied time windows. In addition, length constraints on the routes are imposed in order to include several aspects such as the limited availability of the RSs. The weighted sum method is adopted and, to properly set the weights, three methods, derived from the analytical hierarchical process, are compared. Computational experiments on some instances are carried out, in order to assess the behaviour of our approach in terms of solution quality.
Keywords: multi-objective MILP; mixed integer linear programming; weighted sum method; WSM; analytical hierarchical process; AHP; electric vehicles; vehicle routing problem; VRP; pick-up and delivery; time windows; recharging stations; travel distance; vehicle cost; penalty cost.
International Journal of Productivity and Quality Management, 2016 Vol.18 No.2/3, pp.403 - 423
Received: 08 May 2021
Accepted: 12 May 2021
Published online: 23 May 2016 *