localización de paraderos de detención y diseño óptimo de rutas en el transporte de personal a location-routing approach for personnel transportation

Clicks: 244
ID: 224940
2011
Free PDF
Article Quality & Performance Metrics
Overall Quality
Not rated
Combines reader engagement with the AI quality analysis. This article has not been analysed, so there is no overall score — reader engagement is measured and shown alongside.
AI Quality Assessment
Not analyzed
Readership in this journal
Steady

Ranked #13 of 42 articles by views in international journal of electrical and computer engineering

Most read Least read

Bar heights use a square-root scale.

Mint this article as an NFT
Not yet minted

Create a permanent, verifiable on-chain record of this article on the Scimatic Network. The NFT is held in your Journament account, and you can withdraw it to your own wallet at any time.

5 SUSD one-off · no wallet required
Sign in to mint
Abstract
En este artículo abordamos un problema que consiste en la selección de paraderos de detención y el respectivo diseño de rutas en los recorridos de buses que transportan personal desde el entorno de sus hogares al lugar en que laboran. Proponemos un modelo de programación entera de localización y ruteo como formulación matemática del problema en su conjunto. La formulación empleada permite alcanzar una solución óptima del problema al resolver diversas instancias de tamaño pequeño y mediano del mismo. Sin embargo, ante instancias de gran tamaño se hace necesario el empleo de alguna estrategia alternativa de resolución. Por ello se presenta igualmente un esquema jerárquico que resuelve el problema a través de un modelo de localización por cobertura para la selección de paraderos, seguido de otro diferente para el diseño de rutas, que asume como dada la ubicación de los puntos de detención. Este último considera igualmente el empleo de la heurística de Holmes y Parker en la resolución de las instancias de mayor tamaño. Los resultados exhibidos permiten apreciar la calidad de las soluciones entregadas por la estrategia alternativa respecto de la solución óptima del modelo propuesto y la necesidad de contar con alternativas de resolución en problemas de gran tamaño.
In this paper we face a problem that considers the selection of several bus stops from many potential ones and the respective design of optimal routes for the bus transportation of personnel from the surroundings of their houses to the place in which they work. We propose an integer programming model for the mathematical formulation of the resulting location-routing problem. The proposed location-routing model is suitable to solve little and medium size instances of the problem. However, to face large size instances of the problem an alternative strategy is needed. For that purposes, we propose a hierarchical scheme by solving a set covering location model for the bus stops selection, followed of another one for the design of routes based on the previous bus stops selected. To solve the vehicle routing problem we also incorporate the heuristic of Holmes and Parkerfor the resolution of larger instances of the problem. The alternative strategy does not provide the global solution to the problem but it is easy to apply and essential to face larger instances of the problem.
Reference Key
albornoz2011ingeniarelocalizacin Use this key to autocite in the manuscript while using SciMatic Manuscript Manager or Thesis Manager
Authors ;Víctor M Albornoz;Edward H Johns
Journal international journal of electrical and computer engineering
Year 2011
DOI
DOI not found
URL
http://www.scielo.cl/scielo.php?script=sci_arttext&pid=S0718-33052011000300014
Keywords
Integer Programming location vehicle routing problem management engineering localización covering location problemmechanical engineering and machineryindustrial engineering

Citations

No citations found. To add a citation, contact the admin at info@scimatic.org

Comments

No comments yet. Be the first to comment on this article.