Publications

@article{CONA10,

title = {Oil Platform Transport Problem (OPTP) is NP-hard },

author = {Ocotlán Díaz-Parra and Jorge A. Ruiz-Vanoye and Alejandro Fuentes-Penna and Beatriz Bernabe-Loranca and Joaquín Pérez-Ortega and Ricardo A. Barrera-Cámara and Daniel Vélez-Díaz and Nubia B. Pérez-Olguin},

url = {https://ijcopi.org/index.php/ojs/article/view/14},

issn = {2007-1558},

year  = {2017},

date = {2017-11-11},

journal = {International Journal of Combinatorial Optimization Problems and Informatics},

volume = {8},

number = {3},

pages = {2-19},

abstract = {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 Problem (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 provide 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 Transport 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 50 cases of randomly generated instances and real 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.



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 Problem (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 provide 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 Transport 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 50 cases of randomly generated instances and real 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.},

keywords = {CONACYT, ESCI, Oil Platform Transport Problem},

pubstate = {published},

tppubtype = {article}

}