TY - JOUR

T1 - A novel mathematical model for a discrete speed pollution routing problem with time windows in a Colombian context

AU - Gutiérrez-Padilla, M. V.

AU - Morillo-Torres, D.

AU - Gatica, G.

N1 - Publisher Copyright:
© 2021 The Authors. This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0)

PY - 2021

Y1 - 2021

N2 - Pollution affects globally, contributing to its reduction is a challenge. The Pollution Routing Problem (PRP) consists of a multi-objective problem that considers the minimization of transport costs and the reduction of polluting emissions. It is a generalization of the classic vehicle routing problem (VRP). It gets involved an additional level of decision making since the generation of pollutants is linked to the speed that vehicles use. Other generalizations of VRP consider time windows, in which each customer is associated with a time interval that determines their availability to receive the product. This paper addresses the integration of these problems in the so-called Discrete Speed Pollution Routing Problem with Time Windows (DSPRPTW). A novel model of linear integer-mixed programming is proposed. It considers inclination of the roads, three discrete speeds between each pair of nodes, the generation of pollutants, homogeneous fleet and the cost of transport in the Colombian context. Finally, a validation of the model is made using the CPLEX solver in 160 instances adapted from the literature, optimally solving 38.1% of them in less than 5 minutes.

AB - Pollution affects globally, contributing to its reduction is a challenge. The Pollution Routing Problem (PRP) consists of a multi-objective problem that considers the minimization of transport costs and the reduction of polluting emissions. It is a generalization of the classic vehicle routing problem (VRP). It gets involved an additional level of decision making since the generation of pollutants is linked to the speed that vehicles use. Other generalizations of VRP consider time windows, in which each customer is associated with a time interval that determines their availability to receive the product. This paper addresses the integration of these problems in the so-called Discrete Speed Pollution Routing Problem with Time Windows (DSPRPTW). A novel model of linear integer-mixed programming is proposed. It considers inclination of the roads, three discrete speeds between each pair of nodes, the generation of pollutants, homogeneous fleet and the cost of transport in the Colombian context. Finally, a validation of the model is made using the CPLEX solver in 160 instances adapted from the literature, optimally solving 38.1% of them in less than 5 minutes.

KW - Discrete speeds

KW - Linear integer-mixed programming

KW - Pollution routing problem

KW - Time windows

UR - http://www.scopus.com/inward/record.url?scp=85120710854&partnerID=8YFLogxK

U2 - 10.1016/j.ifacol.2021.08.027

DO - 10.1016/j.ifacol.2021.08.027

M3 - Conference article

AN - SCOPUS:85120710854

SN - 2405-8963

VL - 54

SP - 229

EP - 235

JO - IFAC-PapersOnLine

JF - IFAC-PapersOnLine

IS - 1

T2 - 17th IFAC Symposium on Information Control Problems in Manufacturing INCOM 2021

Y2 - 7 June 2021 through 9 June 2021

ER -