Proceedings IJCIEOM – International Joint Conference on Industrial Engineering and Operations Management


ICIEOM2020_FULL_0002_37223

VEHICLE ROUTING PROBLEM CONSIDERING CARGO THEFT PROBABILITY APPLIED IN A REAL CONTEXT IN THE STATE OF RIO DE JANEIRO: SOLVED USING THE AIMS SOFTWARE


ÁREA: 02. Logistics and Supply Chain Management

RESUMO:
The Vehicle Routing Problem (VRP) is a classic well-known combinatorial problem. This paper introduces a factor in the VRP mathematical optimization model considering restrictions that address probability of cargo theft in the regions visited, beyond the traditional constraints such as the number of vehicles, time windows, the capacity of the vehicle and the vehicle's cycle time. The paper proposes a mixed integer linear model that minimizes total transportation costs and cargo theft costs. The model is tested in a real-life case study, a company that distributes pharmaceutical products in Rio de Janeiro. The route solutions with and without cargo theft risk are compared. The model is solved using the AIMMS software.

PALAVRAS-CHAVE:
logistics, vehicle routing problem, cargo theft, mixed integer linear programming, aimms.



DOI: 10.14488/ijcieom2020_full_0002_37223
AUTORES:

RODRIGO RANGEL RIBEIRO BEZERRA
UNIVERSITY OF THE STATE OF PARÁ - UEPA

JANAINA FIGUEIRA MARCHESI
PONTIFICAL CATHOLIC UNIVERSITY OF RIO DE JANEIRO - PUC-RIO

ANDRÉ CRISTIANO SILVA MELO
UNIVERSITY OF THE STATE OF PARÁ - UEPA

DENILSON RICARDO DE LUCENA NUNES
UNIVERSITY OF THE STATE OF PARÁ - UEPA

LEONARDO BRENO PESSOA DA SILVA
FEDERAL UNIVERSITY OF TECHNOLOGY - PARANÁ - UTFPR






ISSN ENEGEP: 23183349 / ISSN ICIEOM: 23178000


2018 ABEPRO - Todos os direitos reservados
Os artigos se tornam de uso público desde que resguardado o direito autoral.
Quando usado ou reproduzido, a fonte deve ser devidamente mencionada e os autores referenciados.

Rua Mayrink Veiga, Nº 32, Sala 601 - Centro, Rio de Janeiro - RJ, BRASIL - CEP: 20.090-050
Tel: 21 2263-0501 / 12 3207-5889 / E-Mail: secretaria@abepro.org.br