2017 

1.  DíazParra, Ocotlán; RuizVanoye, Jorge A; FuentesPenna, Alejandro; BernabeLoranca, Beatriz; PérezOrtega, Joaquín; BarreraCámara, Ricardo A; VélezDíaz, Daniel; PérezOlguin, Nubia B Oil Platform Transport Problem (OPTP) is NPhard Journal Article In: International Journal of Combinatorial Optimization Problems and Informatics, 8 (3), pp. 219, 2017, ISSN: 20071558. Abstract  Links  BibTeX  Tags: CONACYT, ESCI, Oil Platform Transport Problem @article{CONA10, title = {Oil Platform Transport Problem (OPTP) is NPhard}, author = {Ocotlán DíazParra and Jorge A. RuizVanoye and Alejandro FuentesPenna and Beatriz BernabeLoranca and Joaquín PérezOrtega and Ricardo A. BarreraCámara and Daniel VélezDíaz and Nubia B PérezOlguin}, url = {https://ijcopi.org/index.php/ojs/article/view/14}, issn = {20071558}, year = {2017}, date = {20171111}, journal = {International Journal of Combinatorial Optimization Problems and Informatics}, volume = {8}, number = {3}, pages = {219}, abstract = {The Oil Platform Transport Problem is considered as a combination/interlink of the two wellstudied NPHard/NPComplete problems: the Helicopter Routing ProblemHRP (a generalization of the Split Delivery Vehicle Routing Problem) and the onedimensional Bin Packing Problem (BPP1). 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 NPHard/NPComplete 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 stateowned 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 wellstudied NPHard/NPComplete problems: the Helicopter Routing ProblemHRP (a generalization of the Split Delivery Vehicle Routing Problem) and the onedimensional Bin Packing Problem (BPP1). 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 NPHard/NPComplete 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 stateowned 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} } The Oil Platform Transport Problem is considered as a combination/interlink of the two wellstudied NPHard/NPComplete problems: the Helicopter Routing ProblemHRP (a generalization of the Split Delivery Vehicle Routing Problem) and the onedimensional Bin Packing Problem (BPP1). 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 NPHard/NPComplete 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 stateowned 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 wellstudied NPHard/NPComplete problems: the Helicopter Routing ProblemHRP (a generalization of the Split Delivery Vehicle Routing Problem) and the onedimensional Bin Packing Problem (BPP1). 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 NPHard/NPComplete 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 stateowned 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. 
Publications
2017 

1.  Oil Platform Transport Problem (OPTP) is NPhard Journal Article In: International Journal of Combinatorial Optimization Problems and Informatics, 8 (3), pp. 219, 2017, ISSN: 20071558. 