JLJunming Liu

Junming Liu

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Junming Liu has a total of 51 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Analyzing Consumer Footprints on E-Commerce Platforms: A Multichannel Sequential Search Model with Reference Price

    by Hao Zhang, Zhiling Guo, Junming Liu, Mingzheng Wang

    Accompanied by the popularity of mini-programs, consumers can easily browse products across both the e-commerce native app channel and the mini-program channel, leaving behind extensive click-through and purchase records across various channels. These multichannel footprints contain rich information about consumers’ search preferences, which offer great potential for optimizing platforms’ multichannel management. However, prior studies predominantly focus on single-channel contexts, which may not directly apply to analyzing consumers’ multichannel footprints. This research develops a multichannel sequential search (MSS) model to characterize consumers’ multichannel footprints as a threefold search process consisting of cross-channel, cross-product, and cross-page search, where consumers dynamically update their cross-channel reference prices as they navigate their search journeys. The estimation results of the MSS model reveal that consumers exhibit significant heterogeneity in channel preferences, cross-channel costs, and sensitivity to cross-channel reference prices, contributing to their diverse multichannel footprints. Drawing on a comprehensive understanding of the MSS process, our optimal policy recommends that the platform implement a promotion gap with an average discount percentage of 32% between the app and mini-program channels. The channel-specific promotion strategy fosters a strong cross-channel reference price effect, which uses a smaller promotion to achieve a significant profit improvement over the state-of-the-art model.


  • Fleet Repositioning for Vehicle Sharing Systems: Asymptotic Optimality of the Balanced Myopic Policy

    by Yihang Yang, Yimin Yu, Qian Wang, Junming Liu

    We investigate the fleet repositioning problem aimed at dynamically optimizing vehicle distributions to maximize long-run average social welfare in a vehicle-sharing system. We model the problem as a Markov decision process under the ex ante committed decision scheme, characterizing the balanced myopic policy as optimal for the average reward setting. This policy efficiently aligns vehicle supply with trip demand and mitigates the curse of dimensionality, enhancing computational efficiency significantly. Our analysis demonstrates that although the balanced myopic policy operates with less information, potentially leading to performance losses, the maximum performance gap relative to the ex post decision scheme asymptotically converges to zero as the system size increases. This finding underscores the asymptotic optimality of the balanced myopic policy, particularly in large systems, making it a robust and effective solution for fleet repositioning. Moreover, we extend our investigation to settings with seasonal demand, confirming that a generalized balanced myopic policy remains optimal. Through comprehensive numerical experiments and a counterfactual case study of a real-world vehicle-sharing system, we quantify the operational value of our approach. This study not only validates the balanced myopic policy against more information-intensive solutions but also illuminates effective heuristic design strategies for improving the efficiency of fleet repositioning in vehicle sharing systems.


  • Code and Data Repository for A Data-Driven Optimization Framework for Static Rebalancing Operations in Bike Sharing Systems

    by Junming Liu, Weiwei Chen, Leilei Sun

    This repository provides an end-to-end solution to the static rebalancing operations in bike sharing systems. The study uses the raw data of bike demand and station inventory status to generate the optimal rebalancing routes that reallocate system-wide bike inventories among stations during the night to maintain a high service level while minimizing demand loss due to stockout or overcapacity. The repository reports the raw data, algorithms, and extensive numerical experiments reported in the paper, using real-world data from New York City Citi Bike.


  • A Data-Driven Optimization Framework for Static Rebalancing Operations in Bike Sharing Systems

    by Junming Liu, Weiwei Chen, Leilei Sun

    Bike sharing systems have been widely deployed in urban cities for first- and last-mile transportation. However, because of the geographical and temporal imbalance of bike demand, bikes need to be reallocated system-wide among stations during the night to maintain a high service level while minimizing demand loss due to stockout or overcapacity. Two technical challenges remain in optimizing the static bike rebalancing operations. One challenge is to accurately predict bike pickup and dropoff demand at each station, considering demand substitution effects and subsequently determining the optimal rebalancing quantity for each station. The other is to efficiently optimize the routing of multiple rebalancing vehicles for large-scale bike sharing systems, considering outlier stations with rebalancing quantities exceeding vehicle capacity. To this end, we propose an end-to-end solution to tackle the aforesaid challenges. Specifically, we first develop deep learning-based predictors that capture the time dependencies of station-level demand, the impact of weather conditions, and the demand substitution effect by nearby stations. Based on the demand rate, a sequential simulation-based demand loss estimator is developed to find the optimal rebalancing quantities that lead to the minimum expected demand loss. Then, a mixed integer linear programming model is formulated to optimize the routing problem of rebalancing vehicles. To address the computational challenge, we propose a data-driven decomposition algorithm to support a multivehicle multivisit rebalancing strategy by decomposing the multivehicle routing problem into smaller and tractable single-vehicle routing problems, which can be solved in parallel. Finally, extensive numerical experiments using real-world data from New York City Citi Bike demonstrate the accuracy of the proposed bike demand predictors, the impact of demand substitution, and the efficiency of the data-driven optimization framework. History: Accepted by Ram Ramesh, Area Editor for Data Science & Machine Learning. Funding: This work was supported by the National Natural Science Foundation of China [Grant 72201222] and the Hong Kong Research Grants Council [Grants CityU 21500220 and CityU 11504322]. Supplemental Material: The software that supports the findings of this study is available within the paper and its Supplemental Information ( https://pubsonline.informs.org/doi/suppl/10.1287/ijoc.2022.0182 ) as well as from the IJOC GitHub software repository ( https://github.com/INFORMSJoC/2022.0182 ). The complete IJOC Software and Data Repository is available at https://informsjoc.github.io/ .


  • LEVER: Online Adaptive Sequence Learning Framework for High-Frequency Trading

    by Zixuan Yuan, Junming Liu, Haoyi Zhou, Denghui Zhang, Hao Liu, Nengjun Zhu, Hui Xiong

    Recent years have witnessed the fast development of deep learning techniques in quantitative trading. It still remains unclear how to exploit deep learning techniques to improve high-frequency trading (HFT). Indeed, there are two emerging challenges for the use of deep learning for HFT: (i) how to quantify fast-changing market conditions for tick-level signal prediction; (ii) how to establish a unified trading paradigm for different securities of diverse market conditions and severe signal sparsity. To this end, in this paper, we propose an Online Adaptive Sequence Learning (LEVER) framework, which consists of two distinct components to predict the HFT signals at the tick level for a variety of securities simultaneously. Specifically, we start with a single learner that adopts an encoder-decoder architecture for each security-based HFT signal prediction. In this single learner, an ordered encoder module first captures the variability patterns of the security's price curve by encoding the input indicator sequence from different time ranges. An unordered decoder module then outlines the pivot points of the price curve as support and resistance levels to quantify the market status. Based on the measured market condition, a prediction module further approximates the impacts of upcoming security data as the potential market momentum to detect the tick-level trading signals. To overcome the computational challenges and signal sparsity posed by online HFT for multiple securities, we develop a competitive active-meta learning paradigm to enhance the signal learners’ learning efficiency for online implementation. Finally, extensive experiments on real-world stock market data demonstrate the effectiveness of our deployed LEVER for improving the performances of the existing industry method by 0.27 in the Sharpe ratio and by 0.09% in a transaction-based return.


  • A Cost-Effective Sequential Route Recommender System for Taxi Drivers

    by Junming Liu, Mingfei Teng, Weiwei Chen, Hui Xiong

    This paper develops a cost-effective sequential route recommender system to provide real-time routing recommendations for vacant taxis searching for the next passenger. We propose a prediction-and-optimization framework to recommend the searching route that maximizes the expected profit of the next successful passenger pickup based on the dynamic taxi demand-supply distribution. Specifically, this system features a deep learning-based predictor that dynamically predicts the passenger pickup probability on a road segment and a recursive searching algorithm that recommends the optimal searching route. The predictor integrates a graph convolution network (GCN) to capture the spatial distribution and a long short-term memory (LSTM) to capture the temporal dynamics of taxi demand and supply. The GCN-LSTM model can accurately predict the pickup probability on a road segment with the consideration of potential taxi oversupply. Then, the dynamic distribution of pickup probability is fed into the route optimization algorithm to recommend the optimal searching routes sequentially as route inquiries emerge in the system. The recursion tree-based route optimization algorithm can significantly reduce the computational time and provide the optimal routes within seconds for real-time implementation. Finally, extensive experiments using Beijing Taxi GPS data demonstrate the effectiveness and efficiency of the proposed recommender system. History: Accepted by Ram Ramesh, Area Editor for Data Science and Machine Learning. Funding: This work was partially supported by the Hong Kong Research Grants Council [Grants CityU 21500220, CityU 11504322] and the National Natural Science Foundation of China [Grant 72201222]. Supplemental Material: The software that supports the findings of this study is available within the paper and its Supplemental Information ( https://pubsonline.informs.org/doi/suppl/10.1287/ijoc.2021.0112 ) as well as from the IJOC GitHub software repository ( https://github.com/INFORMSJoC/2021.0112 ). The complete IJOC Software and Data Repository is available at https://informsjoc.github.io/ .


  • Iterative Prediction-and-Optimization for E-Logistics Distribution Network Design

    by Junming Liu, Weiwei Chen, Jingyuan Yang, Hui Xiong, Can Chen

    The emergence of online retailers has brought new opportunities to the design of their distribution networks. Notably, for online retailers that do not operate offline stores, their target customers are more sensitive to the quality of logistic services, such as delivery speed and reliability. This paper is motivated by a leading online retailer for cosmetic products on Taobao.com that aimed to improve its logistics efficiency by redesigning its centralized distribution network into a multilevel one. The multilevel distribution network consists of a layer of primary facilities to hold stocks from suppliers and transshipment and a layer of secondary facilities to provide last-mile delivery. There are two major challenges of designing such a facility network. First, online customers can respond significantly to the change of logistics efficiency with the redesigned network, thereby rendering the network optimized under the original demand distribution suboptimal. Second, because online retailers have relatively small sales volumes and are very flexible in choosing facility locations, the facility candidate set can be large, causing the facility location optimization challenging to solve. To this end, we propose an iterative prediction-and-optimization strategy for distribution network design. Specifically, we first develop an artificial neural network (ANN) to predict customer demands, factoring in the logistic service quality given the network and the city-level purchasing power based on demographic statistics. Then, a mixed integer linear programming (MILP) model is formulated to choose facility locations with minimum transportation, facility setup, and package processing costs. We further develop an efficient two-stage heuristic for computing high-quality solutions to the MILP model, featuring an agglomerative hierarchical clustering algorithm and an expectation and maximization algorithm. Subsequently, the ANN demand predictor and two-stage heuristic are integrated for iterative network design. Finally, using a real-world data set, we validate the demand prediction accuracy and demonstrate the mutual interdependence between the demand and network design. Summary of Contribution: We propose an iterative prediction-and-optimization algorithm for multilevel distribution network design for e-logistics and evaluate its operational value for online retailers. We address the issue of the interplay between distribution network design and the demand distribution using an iterative framework. Further, combining the idea in operational research and data mining, our paper provides an end-to-end solution that can provide accurate predictions of online sales distribution, subsequently solving large-scale optimization problems for distribution network design problems.


  • Open Access

    Job2Vec

    by Denghui Zhang, Junming Liu, Hengshu Zhu, Yanchi Liu, Lichen Wang, Pengyang Wang, Hui Xiong


  • Development of An Intelligent NLP-Based Audit Plan Knowledge Discovery System

    by Qiao Li, Junming Liu

    High level of knowledge and expertise are required in auditing, which makes it a knowledge-intensive professional service. Auditors' brainstorming meetings involve various topics on risks, which provide numerous valuable knowledge on how auditors identify and assess risks and achieve decisions. However, it is very difficult to retrieve useful knowledge from these meeting conversations. With the help of Natural Language Processing (NLP) techniques, this paper proposes an intelligent NLP-based audit plan knowledge discovery system (APKDS) that will continuously and automatically extract important knowledge from audit brainstorming discussions and provide decision support to auditors in future engagement cases.