# Solving the Interval Green Inventory Routing Problem Using Optimization and Genetic Algorithms

Carlos Alberto Franco Franco, Juan Carlos Figueroa-Garcia, eduyn ramiro Lopéz-Santana

Resultado de la investigación: Contribución a RevistaArtículo

1 Cita (Scopus)

### Resumen

In this paper, we present a genetic algorithm embedded with mathematical optimization to solve a green inventory routing problem with interval fuel consumption. Using the idea of column generation in which only attractive routes are generated to the mathematical problem, we develop a genetic algorithm that allow us to determine speedily attractive routes that are connected to a mathematical model. We code our genetic algorithm using the idea of a integer number that represents all the feasible set of routes in which the maximum number allowed is the binary number that represents if a customer is visited or not. We approximate the fuel consumption as an interval number in which we want to minimize the overall fuel consumption of distribution. This is the first approximation made in the literature using this type of methodology so we cannot compare our approach with those used in the literature.
Idioma original English (US) 556 - 564 9 Communications in Computer and Information Science 742 Published - ago 29 2017

### Huella dactilar

Routing Problem
Fuel consumption
Optimization Algorithm
Genetic algorithms
Genetic Algorithm
Interval
Interval number
Column Generation
Customers
Mathematical Model
Mathematical models
Binary
Minimise
Integer
Optimization
Methodology
Approximation

### Citar esto

@article{ba60c804e62844b087d4f7866464201a,
title = "Solving the Interval Green Inventory Routing Problem Using Optimization and Genetic Algorithms",
abstract = "In this paper, we present a genetic algorithm embedded with mathematical optimization to solve a green inventory routing problem with interval fuel consumption. Using the idea of column generation in which only attractive routes are generated to the mathematical problem, we develop a genetic algorithm that allow us to determine speedily attractive routes that are connected to a mathematical model. We code our genetic algorithm using the idea of a integer number that represents all the feasible set of routes in which the maximum number allowed is the binary number that represents if a customer is visited or not. We approximate the fuel consumption as an interval number in which we want to minimize the overall fuel consumption of distribution. This is the first approximation made in the literature using this type of methodology so we cannot compare our approach with those used in the literature.",
author = "{Franco Franco}, {Carlos Alberto} and Figueroa-Garcia, {Juan Carlos} and Lop{\'e}z-Santana, {eduyn ramiro}",
year = "2017",
month = "8",
day = "29",
language = "English (US)",
volume = "742",
pages = "556 -- 564",
journal = "Communications in Computer and Information Science",
issn = "1865-0929",
publisher = "Springer",

}

Solving the Interval Green Inventory Routing Problem Using Optimization and Genetic Algorithms. / Franco Franco, Carlos Alberto; Figueroa-Garcia, Juan Carlos ; Lopéz-Santana, eduyn ramiro.

En: Communications in Computer and Information Science, Vol. 742, 29.08.2017, p. 556 - 564.

Resultado de la investigación: Contribución a RevistaArtículo

TY - JOUR

T1 - Solving the Interval Green Inventory Routing Problem Using Optimization and Genetic Algorithms

AU - Franco Franco, Carlos Alberto

AU - Figueroa-Garcia, Juan Carlos

AU - Lopéz-Santana, eduyn ramiro

PY - 2017/8/29

Y1 - 2017/8/29

N2 - In this paper, we present a genetic algorithm embedded with mathematical optimization to solve a green inventory routing problem with interval fuel consumption. Using the idea of column generation in which only attractive routes are generated to the mathematical problem, we develop a genetic algorithm that allow us to determine speedily attractive routes that are connected to a mathematical model. We code our genetic algorithm using the idea of a integer number that represents all the feasible set of routes in which the maximum number allowed is the binary number that represents if a customer is visited or not. We approximate the fuel consumption as an interval number in which we want to minimize the overall fuel consumption of distribution. This is the first approximation made in the literature using this type of methodology so we cannot compare our approach with those used in the literature.

AB - In this paper, we present a genetic algorithm embedded with mathematical optimization to solve a green inventory routing problem with interval fuel consumption. Using the idea of column generation in which only attractive routes are generated to the mathematical problem, we develop a genetic algorithm that allow us to determine speedily attractive routes that are connected to a mathematical model. We code our genetic algorithm using the idea of a integer number that represents all the feasible set of routes in which the maximum number allowed is the binary number that represents if a customer is visited or not. We approximate the fuel consumption as an interval number in which we want to minimize the overall fuel consumption of distribution. This is the first approximation made in the literature using this type of methodology so we cannot compare our approach with those used in the literature.

M3 - Article

VL - 742

SP - 556

EP - 564

JO - Communications in Computer and Information Science

JF - Communications in Computer and Information Science

SN - 1865-0929

ER -