Proposta de um modelo matemático para o problema dial-a-ride aplicado ao transporte público de cadeirantes
DOI:
https://doi.org/10.4237/transportes.v20i2.501Abstract
O presente artigo propõe um modelo de Programação Linear Inteira Mista para resolver o problema de roteamento denominado de Dial-a-Ride Problem – DARP. O DARP consiste no problema de roteamento de demandas onde os veículos saem da garagem, buscam e entregam os clientes nos locais e horários solicitados, e retornam para a garagem, tendo como objetivo a minimização dos custos de atendimento. Diferente do que é comumente encontrado na literatura, o modelo aqui proposto considera restrições de janela de tempo na origem e no destino e uma frota de veículos heterogênea. Alem disso, o modelo também possibilitou a redução do número de veículos usados. Visando uma aplicação real do modelo proposto, o mesmo foi testado com dados reais fornecidos pelo programa Porta a Porta da Prefeitura de Vitória - ES. O modelo foi executado no software CPLEX e os resultados mostraram que cenários com grande número clientes (20) podem ser resolvidos otimamente com essa formulação.
Palavras-chave: dial-a-ride problem, programação linear inteira mista, transporte público de cadeirantes.
Abstract: This article proposes a mixed integer linear programming model to solve the routing problem called Dial-a-Ride Problem - DARP. The DARP consists of a demands routing problem, where vehicles leave the garage, pickup and deliver customers at requested locations and times, and return to the garage, aiming to minimize the cost of the services. Differently from literature, the model proposed considers the origin and sink time windows and the use of an heterogenous fleet of vehicles. In addition, the model allow a reduction on number of vehicles used. Aiming a real application of the proposed model, it was tested with real data from the city of Vitória, provided by the Secretary of Infrastructure and Transportation. The model was implemented using CPLEX and the results showed that scenarios with a large number of wheelchair users (20) can be solved optimally.
Keywords: dial-a-ride problem, mixed integer linear programming, wheelchair public transport.
Downloads
Downloads
Published
How to Cite
Issue
Section
License
Authors who submit papers for publication by TRANSPORTES agree to the following terms:
- Authors retain copyright and grant TRANSPORTES the right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
- Authors may enter into separate, additional contractual arrangements for the non-exclusive distribution of this journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in TRANSPORTES.
- Authors are allowed and encouraged to post their work online (e.g., in institutional repositories or on their website) after publication of the article. Authors are encouraged to use links to TRANSPORTES (e.g., DOIs or direct links) when posting the article online, as TRANSPORTES is freely available to all readers.
- Authors have secured all necessary clearances and written permissions to published the work and grant copyright under the terms of this agreement. Furthermore, the authors assume full responsibility for any copyright infringements related to the article, exonerating ANPET and TRANSPORTES of any responsibility regarding copyright infringement.
- Authors assume full responsibility for the contents of the article submitted for review, including all necessary clearances for divulgation of data and results, exonerating ANPET and TRANSPORTES of any responsibility regarding to this aspect.
