Zobrazeno 1 - 10
of 13
pro vyhledávání: '"Gabriel Gutiérrez-Jarpa"'
Autor:
Germán Paredes-Belmar, Pablo A. Miranda, Giovanni Campuzano, Gabriel Gutiérrez-Jarpa, Carlos Obreque
Publikováno v:
IEEE Access, Vol 8, Pp 178097-178107 (2020)
We introduce, formulate, and solve the Generalized Median Tour Problem, which is motivated in the health supplies distribution for urban and rural areas. A region comprises districts that must be served by a specialized vehicle visiting its health fa
Publikováno v:
IFAC-PapersOnLine. 52:2237-2242
Spare parts management encompasses all the spare parts decisions; thus, it has a significant impact on the company results. This paper studies the integration of supply chain network design and inventory control decisions into the spare parts managem
Autor:
Pablo A. Miranda, Javier Maturana-Ross, Gabriel Gutiérrez-Jarpa, Carola Blazquez, Carlos Obreque
Publikováno v:
European Journal of Operational Research. 271:1014-1036
This paper introduces and studies the bi-objective insular traveling salesman problem, where a set of rural islands must be served using a single barge following a single route. Each island presents a number of docks from which at least one dock must
Publikováno v:
IEEE Access, Vol 12, Pp 87181-87198 (2024)
We present an innovative extension of the Set Covering Problem, transitioning from a traditional radial covering to an angular covering structure. The decisions are based on locating the facilities and identifying the directional servers installed in
Externí odkaz:
https://doaj.org/article/b65d02bea8584edea47a61ff0a822a4a
Publikováno v:
Computers & Operations Research. 89:58-67
We consider a metro network design problem in which the objective is to maximize the origin/destination traffic captured by the system. The lines of the network are located within some corridors that are also determined by the procedure. The amount o
Publikováno v:
Computers & Industrial Engineering. 143:106410
In this article, we introduce two novel multi-commodity inventory-location models considering continuous and periodic review inventory control policies and modular stochastic capacity constraints. The models address a logistic problem in which a sing
Publikováno v:
Computers & operations research 78 (2017): 27–43. doi:10.1016/j.cor.2016.08.009
info:cnr-pdr/source/autori:Gutiérrez-Jarpa, Gabriel; Laporte, Gilbert; Marianov, Vladimir; Moccia, Luigi/titolo:Multi-objective rapid transit network design with modal competition: The case of Concepción, Chile/doi:10.1016%2Fj.cor.2016.08.009/rivista:Computers & operations research/anno:2017/pagina_da:27/pagina_a:43/intervallo_pagine:27–43/volume:78
info:cnr-pdr/source/autori:Gutiérrez-Jarpa, Gabriel; Laporte, Gilbert; Marianov, Vladimir; Moccia, Luigi/titolo:Multi-objective rapid transit network design with modal competition: The case of Concepción, Chile/doi:10.1016%2Fj.cor.2016.08.009/rivista:Computers & operations research/anno:2017/pagina_da:27/pagina_a:43/intervallo_pagine:27–43/volume:78
We present a mixed integer linear program for the rapid transit network design problem with static modal competition. Previous discrete formulations cannot handle modal competition for realistic size instances because of the complexity of modeling al
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ad4ede2f88f157b78628c7c61d6b81ef
https://publications.cnr.it/doc/360731
https://publications.cnr.it/doc/360731
Publikováno v:
COMPUTERS & OPERATIONS RESEARCH
Artículos CONICYT
CONICYT Chile
instacron:CONICYT
Artículos CONICYT
CONICYT Chile
instacron:CONICYT
This paper proposes a tractable model for the design of a rapid transit system. Travel cost is minimized and traffic capture is maximized. The problem is modeled on an undirected graph and cast as an integer linear program. The idea is to build segme
Publikováno v:
COMPUTERS & OPERATIONS RESEARCH
Artículos CONICYT
CONICYT Chile
instacron:CONICYT
Artículos CONICYT
CONICYT Chile
instacron:CONICYT
We address the p-cable-trench problem. In this problem, p facilities are located, a trench network is dug and cables are laid in the trenches, so that every customer - or demand - in the region is connected to a facility through a cable. The digging
Publikováno v:
COMPUTERS & INDUSTRIAL ENGINEERING
Artículos CONICYT
CONICYT Chile
instacron:CONICYT
Artículos CONICYT
CONICYT Chile
instacron:CONICYT
A free path (with no preset extreme nodes) is located on a network, in such a way as to minimize the cost and maximize the traffic captured by the path. Traffic between a pair of nodes is captured if both nodes are visited by the path. Applications a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d3f4b2333892de540ab415711b36c16e