The pollution-routing problem, introduced by Bektas and Laporte (2011), extends the classi-
cal VRP by taking into account not only the traveled distance between origin and destination,
but also the fuel consumed and the emissions generated by the vehicles. The aim is to find a
proper route and speed for each vehicle, allowing customers’ requests to be met, by minimizing
the overall operational and environmental cost, while respecting time windows and capacity con-
straints (see, e.g., Kramer et al. (2014), Qian and Eglese (2014), Fukasawa et al. (2018), Nasri
et al. (2018), and Sung and Nielsen (2020)). More challenging problems arise when the stochas-
tic (Ritzinger et al. (2016), Oyola et al. (2016a), Oyola et al. (2016b), Eshtehadi et al. (2017)),
dynamic (Pillac et al. (2013), Berbeglia et al. (2010)), and multi-objective (Garc´ıa N´ajera and
Bullinaria (2009), Ghoseiri and Ghannadpour (2010), Demir et al. (2014a), Kumar et al. (2016))
versions are taken into account. When route is considered fixed and the only variable is the ve-
hicle speed, the problem is called the speed optimization problem (see Fagerholt et al. (2010)).
The problem considered in our paper can be included in the class of pollution-routing problems
because the environmental-impact objective is considered together with speed optimization.
In the literature, few works address a VRP (on a complete graph) by adopting a multi-level
formulation, and all of them propose a bilevel problem (see, e.g., Gupta et al. (2015), Marinakis
et al. (2007), Marinakis and Marinaki (2008), and Ma and Xu (2014)). In particular, in Gupta
et al. (2015) and Marinakis et al. (2007), the authors use an assignment-routing formulation to
solve a classical VRP. Similarly, Marinakis and Marinaki (2008) propose two nested optimization
levels to deal with a VRP integrated with a facility location problem but, in contrast with
Gupta et al. (2015) and Marinakis et al. (2007), the objective functions involved in each level
are conflicting with each other. In our paper, we take advantage of the hierarchical structure
at stake by proposing an optimization method that alternates between the assignment-routing
problem and the speed optimization problem until a satisfactory solution is returned. Differently
from the bilevel approach of Gupta et al. (2015), which extends the work of Marinakis et al.
(2007) to the bi-objective case by considering efficiency and service quality in each level, we also
account for the environmental impact as a third objective.
2.2 Optimization models for transportation on road networks
When considering road networks and, consequently, non-complete graphs (i.e., graphs that do
not contain an edge for every pair of nodes), routing problems face additional challenges be-
cause key assumptions are not satisfied (see, e.g., Fleischmann (1985), Cornu´ejols et al. (1985),
Ben Ticha et al. (2018), Ben Ticha et al. (2021b)). In particular, only a subset of nodes are
customers since most of the nodes are associated with cross-roads, which do not have a demand
to meet. Therefore, only some nodes need to be visited by the vehicles involved in the problem,
which is in contrast with the traditional VRP formulations considering each node in the graph
as a customer. Moreover, it may not be possible to find a route that visits nodes and edges
only once, thus leading to problems with an empty feasible set. Recently, exact approaches to
solve routing problems on a subset of nodes have been proposed in Raeesi and Zografos (2019)
and Boyacı et al. (2021) for VRP, Rodr´ıguez-Pereira et al. (2019) for the traveling salesman
problem (TSP), and Ben Ticha et al. (2021a) for the shortest path problem. Such papers belong
to the stream of works focusing on the so-called Steiner TSP, which was addressed for the first
time by Fleischmann (1985) and Cornu´ejols et al. (1985).
On road networks, arcs may be associated with several attributes (distance, cost, time, etc.),
and this implies that the shortest path does not coincide with the cheapest or quickest path.
5