Oil Platform Transport Problem (OPTP) is NP-hard
Fuente:
Redalyc
Enregistré dans:
| Auteur principal: | |
|---|---|
| Format: | Artículo científico |
| Langue: | en |
| Publié: |
International Journal of Combinatorial Optimization Problems and Informatics
2017
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1876437150784815104 |
|---|---|
| author | Ocotlán Díaz-Parra |
| author_facet | Ocotlán Díaz-Parra |
| contents | Oil Platform Transport Problem (OPTP) is NP-hard Ocotlán Díaz-Parra Jorge A. Ruiz-Vanoye Alejandro Fuentes Penna Beatriz Bernabe Loranca Joaquín Pérez-Ortega Ricardo A. Barrera-Cámara Daniel Velez-Díaz Nubia B. Pérez-Olguin Computación Oil Platform Transport Problem Split Delivery Vehicle Routing Problem The Oil Platform Transport Problem is considered as a combination/interlink of the two well - studied NP - Hard/NP - Complete problems: the Helicopter Routing Problem - HRP (a generalization of the Split Delivery Vehicle Routing Problem) and the one - dimensional Bin Packing P roblem (BPP - 1) . The Oil Platform Transport Problem consist of to minimize the cost of carry resources, goods or people from one location (airport/platform) to another location (airport/platform) using helicopters with some restrictions as capacity and time windows. We pro vide the proof that this problem is NP - Hard/NP - Complete Problem by the polynomial transformation using formal languages between the Vehicle Routing Problem and the Oil Platform Transport Problem. We propose a new mathematical model to the Oil Platform Tran sport problem, and we present the parameters or characterization of Oil Platform Transport Problem instances of Mexican state - owned petroleum company (PEMEX). We generated 5 instance set, each instance set has 5 0 cases of randomly generated instances and r eal instances (with GIS data) of PEMEX Oil Platforms. We use the CPLEX solver to find the optimal cost of carrier resources, goods or people contains in the Oil Platform Transport Problem. 2017 artículo científico 2007-1558 https://www.redalyc.org/articulo.oa?id=265254117002 en http://www.redalyc.org/revista.oa?id=2652 International Journal of Combinatorial Optimization Problems and Informatics application/pdf International Journal of Combinatorial Optimization Problems and Informatics International Journal of Combinatorial Optimization Problems and Informatics (México) Num.3 Vol.8 |
| format | Artículo científico |
| id | redalyc_265254117002 |
| institution | Redalyc |
| language | en |
| publishDate | 2017 |
| publisher | International Journal of Combinatorial Optimization Problems and Informatics |
| spellingShingle | Oil Platform Transport Problem (OPTP) is NP-hard Ocotlán Díaz-Parra Computación Oil Platform Transport Problem Split Delivery Vehicle Routing Problem Oil Platform Transport Problem (OPTP) is NP-hard Ocotlán Díaz-Parra Jorge A. Ruiz-Vanoye Alejandro Fuentes Penna Beatriz Bernabe Loranca Joaquín Pérez-Ortega Ricardo A. Barrera-Cámara Daniel Velez-Díaz Nubia B. Pérez-Olguin Computación Oil Platform Transport Problem Split Delivery Vehicle Routing Problem The Oil Platform Transport Problem is considered as a combination/interlink of the two well - studied NP - Hard/NP - Complete problems: the Helicopter Routing Problem - HRP (a generalization of the Split Delivery Vehicle Routing Problem) and the one - dimensional Bin Packing P roblem (BPP - 1) . The Oil Platform Transport Problem consist of to minimize the cost of carry resources, goods or people from one location (airport/platform) to another location (airport/platform) using helicopters with some restrictions as capacity and time windows. We pro vide the proof that this problem is NP - Hard/NP - Complete Problem by the polynomial transformation using formal languages between the Vehicle Routing Problem and the Oil Platform Transport Problem. We propose a new mathematical model to the Oil Platform Tran sport problem, and we present the parameters or characterization of Oil Platform Transport Problem instances of Mexican state - owned petroleum company (PEMEX). We generated 5 instance set, each instance set has 5 0 cases of randomly generated instances and r eal instances (with GIS data) of PEMEX Oil Platforms. We use the CPLEX solver to find the optimal cost of carrier resources, goods or people contains in the Oil Platform Transport Problem. 2017 artículo científico 2007-1558 https://www.redalyc.org/articulo.oa?id=265254117002 en http://www.redalyc.org/revista.oa?id=2652 International Journal of Combinatorial Optimization Problems and Informatics application/pdf International Journal of Combinatorial Optimization Problems and Informatics International Journal of Combinatorial Optimization Problems and Informatics (México) Num.3 Vol.8 |
| title | Oil Platform Transport Problem (OPTP) is NP-hard |
| topic | Computación Oil Platform Transport Problem Split Delivery Vehicle Routing Problem |
| url | https://www.redalyc.org/articulo.oa?id=265254117002 |