Achievements

Customer-oriented and strategic-thinking professional with over 20 years of experience in innovation, building relationships, cultivating partnerships, retaining top accounts and growing profit channels. Multi-tasking and self-motivated leader with expertise in expanding network connections, implementing pricing models and turnaround management.

The R&D projects I have conducted over the past 20 years has made significant contributions in solving a wide range of important class of problems.

I excel as pioneer in optimization and operations research, as well as in AI and data science. My expertise and capabilities extend across diverse domains that demand innovation and process enhancement.

The link to the executable and testing problems will be made available soon.

We've transformed more than 3,000 patterns into digital format, compiling all pertinent details for each cutting pattern. Subsequently, we devised a solution that autonomously produces cutting patterns plan based on roll dimensions (length, width) and clothing orders. This system strategically arranges patterns to minimize fabric wastage, resulting in more than 61% enhancements in customer productivity.
QUEST/DYNAQUEST, which focuses on dynamic requests/tasks scheduling for satellites imaging while considering operational constraints limits (energy, memory, network flow...) and under the uncertainty of cloud.
MOSAIC enables you to cover a large area with satellite images, minimizing overlaps (loss of resources, energy, time etc.). We have approximated this problem by a quadratic model with resource constraints. This leads to a 30% reduction in losses and optimal gap to less than 5%.
The eTOWER software provides an efficient solution to a critical problem found in various industrial scenarios, namely, the optimization of task coverage with paths that adhere to operational constraints. By minimizing costs, the software identifies the most economical set of tasks, represented as nodes and/or arcs on a network, and ensures that the paths connecting them meet all operational requirements. This fundamental problem frequently arises across different industrial domains, and the eTOWER software effectively tackles it.
Introducing the eSAR software, a groundbreaking solution specifically designed to tackle the Search and Rescue Homogenous and Moving target problem (SARMOST). This problem, known for its NP-hard complexity, poses significant challenges when attempting to find an optimal solution, particularly in scenarios involving multiple agents. However, through the utilization of decomposition methods and advanced mathematical techniques like cutting plane with dynamic adding columns/rows, I have successfully devised an effective approach. This approach shares similarities with both column and row generation and Lagrangian relaxation techniques. Impressive results have been achieved, as I have managed to solve SARMOST instances involving 2 to 5 agents in under 10 minutes, with a gap of less than 3%. Moreover, for the single-agent case, solutions have been obtained in less than 30 seconds, with a 0% gap. The experiments were conducted using time horizons of T = 12 and a grid size of N = 15x15, as demonstrated in the attached file.
The prototype version 1.0.0 of TOPROUTE introduces an innovative solution for efficient transport management, specifically for pick-up and delivery operations. By optimizing routes, the software effectively minimizes both the distance traveled and the total number of trucks required for the task. This leads to significant improvements in operational efficiency, reducing costs and environmental impact by optimizing resource utilization.
The prototype version 1.0.0 of TOPPRODUCTION presents a cutting-edge solution for efficient production scheduling. This software enables the seamless assignment of orders to the most suitable production machines. By intelligently matching orders with the appropriate machinery, TOPPRODUCTION optimizes the production process, ensuring smooth operations and maximizing overall productivity.
During my Ph.D. thesis, I made a significant discovery related to calculating the order of 2 in the multiplicative group (ℤ/pℤ), where p is a prime congruent to 1 modulo 8. This particular case had remained unsolved and posed significant challenges in determining the level of a cyclotomic field. However, I successfully developed a polynomial algorithm and accompanying software that addresses this problem. Remarkably, my research demonstrated that it is possible to determine the order of class 2 in (ℤ/pℤ) solely by utilizing numbers smaller than p. This breakthrough has profound implications for understanding and analyzing the behavior of cyclotomic fields in a previously unsolved scenario.