Traffic allocation is a process of redistributing natural traffic to products by adjusting their positions in the post-search phase, aimed at effectively fostering merchant growth, precisely meeting customer demands, and ensuring the maximization of interests across various parties within e-commerce platforms. Existing methods based on learning to rank neglect the long-term value of traffic allocation, whereas approaches of reinforcement learning suffer from balancing multiple objectives and the difficulties of cold starts within real-world data environments. To address the aforementioned issues, this paper propose a multi-objective deep reinforcement learning framework consisting of multi-objective Q-learning (MOQ), a decision fusion algorithm (DFM) based on the cross-entropy method(CEM), and a progressive data augmentation system (PDA). Specifically. MOQ constructs ensemble RL models, each dedicated to an objective, such as click-through rate, conversion rate, etc. These models individually determine the position of items as actions, aiming to estimate the long-term value of multiple objectives from an individual perspective. Then we employ DFM to dynamically adjust weights among objectives to maximize long-term value, addressing temporal dynamics in objective preferences in e-commerce scenarios. Initially, PDA trained MOQ with simulated data from offline logs. As experiments progressed, it strategically integrated real user interaction data, ultimately replacing the simulated dataset to alleviate distributional shifts and the cold start problem. Experimental results on real-world online e-commerce systems demonstrate the significant improvements of MODRL-TA, and we have successfully deployed MODRL-TA on an e-commerce search platform.
Large-scale search and recommendation systems typically adopt a cascaded architecture of retrieval, pre-ranking, ranking, and re-ranking to balance efficiency and accuracy. However, pre-ranking still faces challenges of behavioral sparsity, limited interest diversity, and computational latency. We propose the Query-Attention Dual-Stream (QADS) framework to address these issues. QADS partitions user behaviors into strongly and weakly correlated streams and further decomposes them into fine-grained subsequences guided by domain knowledge. A query-centric attention mechanism reduces complexity from O(N) to O(1), enabling efficient inter- and intra-sequence modeling. A contrastive cross-category transfer module propagates dense patterns from weakly correlated to sparse domains, while a latency-aware parallel inference architecture further reduces delay by 36%. Experiments on public and industrial datasets show that QADS delivers significant performance improvements and has been successfully deployed in large-scale e-commerce search systems.