Applied AI · ML · operations research

From customer discovery to operational decisions.

A broader portfolio of production-minded systems across personalization, demand forecasting, dynamic pricing, fraud, computer vision, NLP, generative AI, simulation and optimization — with selected technical deep dives.

CASE STUDY 01 · DYNAMIC PRICING

Demand forecasting-driven dynamic pricing

An end-to-end retail system that forecasts SKU-store demand, then uses optimization to convert demand, competitor-price and inventory signals into dynamic price recommendations.

Demand forecastingPrice optimizationXGBoostDask
10B+training records
200+stores in scope
20K+SKUs modeled
2-hourcompetitor price signals

Business problem

Forecast SKU-store demand at retail scale and turn those forecasts into optimized price recommendations that account for competitor position, inventory and commercial signals.

Data & scale

More than 200 stores, over 20,000 SKUs, competitor prices collected every two hours and more than 10 billion model-training records processed through the feature pipeline.

Two-stage approach

  • Scalable ETL and leakage-aware feature engineering across SKU-store histories.
  • Demand forecasting with temporal, lag, rolling, promotion, inventory and competitor-price features.
  • Baseline comparison, automated model tuning and explainability for forecast quality.
  • An optimization layer that converts forecast outputs and commercial constraints into dynamic price recommendations.

Measured forecasting result

The tuned forecasting model reduced RMSE by 21% versus the baseline. The stronger demand signal then feeds the price-optimization stage, separating model accuracy from the quality of the final pricing decision.

Production lens

The system is designed as two connected, independently evaluable stages: scalable demand forecasting followed by dynamic-price optimization across 200+ stores and 20,000+ SKUs.

CASE STUDY 02 · PERSONALIZATION

Sequential behavior mining at retail scale

A production-oriented comparison of GSP and PrefixSpan for discovering ordered customer journeys across categories, brands and products.

PrefixSpanGSPSparkSPMF
2–10 secPrefixSpan runtime range
30–75 minGSP runtime range
8Kpatterns at product level
>0.85category stability overlap

Business problem

Capture ordered purchasing behavior that unordered basket analysis misses, then convert those patterns into better cross-sell, discovery and recommendation decisions.

Data pipeline

Hadoop/Spark ETL, SKU-to-taxonomy enrichment, anonymization, session and basket construction, then controlled execution through Spark MLlib and SPMF.

Approach

  • Compare candidate-generation and projection-based algorithms.
  • Evaluate main category, subcategory, brand and product granularity.
  • Track runtime, memory, output size, pattern length and temporal stability.
  • Version parameter configurations and auditable outputs.

Measured result

PrefixSpan completed within seconds while GSP required tens of minutes in the reported tests. PrefixSpan also retained much broader pattern coverage as granularity increased.

Production lens

The value was not only faster mining. The pipeline included threshold calibration, stability monitoring, resource envelopes and business-readable sequence outputs.

CASE STUDY 03 · OPTIMIZATION

Order batching under warehouse constraints

Local Search, Genetic Algorithm and Particle Swarm Optimization compared under an equal evaluation budget using operational warehouse data.

Genetic AlgorithmLocal SearchPSOPython
4.5% gainGA best solution lift
3.7% gainLS best solution lift
2.0% gainPSO best solution lift
0.22%LS variation · highly stable

Business problem

Group warehouse orders to reduce spatial dispersion and operating effort while respecting batch capacity and SKU-level stock feasibility.

Model

A mixed-integer nonlinear formulation with deterministic allocation, stock constraints and a shared proximity-based objective evaluator.

Experiment design

  • Three dataset sizes under a common evaluator.
  • 600 objective evaluations per run.
  • Ten independent runs for GA and PSO on the large instance.
  • Best, average, worst, standard deviation and runtime comparison.

Measured result

GA delivered the strongest best-case solution quality; Local Search showed the lowest variability and strongest repeatability; PSO remained feasible but weaker under the shared budget.

Decision takeaway

Use GA where best-case quality matters and Local Search where stable, repeatable performance is the stronger operational requirement.

R&D portfolio

Ten-plus systems, summarized by the decision they support.

Completed and ongoing work for D&R and idefix. Company-sensitive implementation details and unverified business metrics are intentionally omitted.

A

Personalized recommendations

Collaborative and content-based filtering, sequential behavior, candidate generation and semantic ranking for D&R and idefix discovery.

Completed R&DRecSys
B

Cross-sell & product discovery

Category-to-category and category-to-product ranking systems that surface complementary products and new discovery paths.

Applied AIRanking
C

Fraud decision support

Fraud prediction, ranked alerts, review queues, audit sampling, feedback datasets and a human-in-the-loop operating structure.

Ongoing R&DAgent-based
D

Product color recognition

A computer-vision pipeline that identifies and classifies product colors from marketplace images for catalog automation.

Ongoing R&DComputer vision
E

Generative marketing imagery

A multimodal pipeline that generates product-aligned background scenes for idefix marketing and product visuals.

Generative AIMultimodal
F

Demand forecasting & dynamic pricing

SKU-store demand forecasts connected to an optimization layer that recommends prices using competitor, inventory and commercial signals.

ForecastingPrice optimization
G

Store simulation & workforce

Store simulation, bottleneck analysis and shift scheduling for capacity, service and staffing decisions.

SimulationScheduling
H

Warehouse decision systems

Warehouse slotting and order batching using mathematical optimization, heuristics and metaheuristics under real constraints.

Operations researchWarehouse
I

Sentiment decision support

NLP pipelines that extract sentiment from marketplace text and turn it into structured decision signals.

Ongoing R&DNLP
J

Book catalog intelligence

Metadata enrichment, NLP and rule-based content analysis for D&R book classification and listing workflows.

Applied AICatalog automation
K

Inventory & transfer optimization

Inventory replenishment and inter-store transfer decisions modeled as a separate operational optimization and decision-support workflow.

InventoryTransfer optimization

Publications & conference contributions

Research record.

Four contributions spanning retail forecasting, sequential pattern mining and warehouse optimization.

ISPR 2025 · Springer 2026

Retail Sales Forecasting Using Competitor Data: An XGBoost Model Optimized with Optuna

Lecture Notes in Mechanical Engineering, pp. 162–169.

DOI ↗
ETMS 2025 · Springer

A Comparative Analysis of GSP and PrefixSpan for Sequential Pattern Mining using Real-World Data

Retail sequence mining and production-scale algorithm comparison.

Conference paper
INFUS 2026

Comparative Analysis of Heuristic and Meta-heuristic Algorithms for Order Batching Problem in Warehouse Management

Equal-budget comparison of Local Search, Genetic Algorithm and PSO.

Conference paper
YAEM 2026

Comparative Analysis of a Multi-objective Optimization Model and Solution Approaches for the Storage Location Assignment Problem

Real-data slotting optimization across exact, local search, GA and PSO approaches.

Conference contribution

Next step

Need this kind of thinking on your team or project?

Tell me about the role, decision, data and constraint. I will reply with the most useful next step.