ZCZhi-Long Chen

Zhi-Long Chen

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

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Zhi-Long Chen has a total of 21 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Assortment Optimization with General Linear Constraints Under the Paired Combinatorial Logit Choice Model

    by Jianguang Feng, Ada Che, Zhi-Long Chen

    We consider the assortment optimization problem under general linear constraints, where the customer choice behavior is governed by the paired combinatorial logit model. In the literature, only the unconstrained problem and the problem with constraints that can be written as “[ ]” linear inequalities with nonnegative coefficients, such as cardinality and knapsack constraints, are studied, and only approximation algorithms exist for these problems. We develop four exact solution approaches to solve the problem with any linear constraints to optimality. First, we reformulate the problem, which in its original form is a fractional program, as a mixed-integer linear programming (MILP) model, and solve the resulting formulation directly by a commercial solver. We then develop a classical Benders decomposition algorithm and enhance it with additional cuts. We further develop a parametric search method to solve the original fractional program optimally by solving a series of nonfractional parametric problems. Our extensive computational experiments show that, although the direct MILP approach and the classical Benders decomposition can solve instances with up to 100 products to optimality, the parametric search approach and the enhanced Benders decomposition approach are far more effective and can solve much larger instances (with 500 products) to optimality within reasonable computation time. We also derive several valuable insights regarding how each of the major problem parameters impacts the optimal expected revenue, and how the products included in the optimal assortment differ from those not included. In addition, we consider three extensions of the problem to include pricing decisions or to a more general setting with multiple customer segments or multiple stages and develop exact solution approaches for each extension. Funding: This work was supported by the National Natural Science Foundation of China [Grants 72471189, 72310107003, 71901176, and 72271201]. 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.2024.0830 ) as well as from the IJOC GitHub software repository ( https://github.com/INFORMSJoC/2024.0830 ). The complete IJOC Software and Data Repository is available at https://informsjoc.github.io/ .

  • Code and Data Repository for Assortment Optimization with General Linear Constraints Under the Paired Combinatorial Logit Choice Model

    by Jianguang Feng, Ada Che, Zhi-Long Chen

    The software and data in this repository are a snapshot of the software and data that were used in the research reported on in the paper Assortment Optimization with General Linear Constraints Under the Paired Combinatorial Logit Choice Model by Jianguang Feng, Ada Che, Zhi-Long Chen.


  • Integrated Learning and Optimization for Joint Routing and Loading Decisions in Preowned Automobile Shipping

    by Yanshuo Sun, Sajeeb Kirtonia, Zhi-Long Chen

    We study highway-based shipping of preowned automobiles by auto carriers, an important although overlooked problem in the automobile shipping literature. The special structure associated with auto carriers implies many different ways of loading a set of automobiles to an auto carrier with different loading costs. Thus, in addition to vehicle routing decisions, loading decisions are essential in automobile shipping optimization. The objective of our problem is to maximize the total revenue minus the total routing and loading cost subject to time windows and loading constraints among others. Most existing automobile shipping studies treat loading and routing separately; some studies partially address the loading aspect in routing optimization but only check the loading feasibility without evaluating the quality of loading decisions. We, thus, contribute to the literature by fully integrating loading decisions into routing decision making. An integrated machine learning (ML) and optimization approach is proposed to solve the problem. The overall approach follows a column generation–based solution framework, in which an insertion heuristic is proposed to find new routes based on existing routes, and ML is employed to predict the loading feasibility and estimate the minimum loading cost of a given route without solving the complex loading optimization problem. The integration of the ML approach and the insertion heuristic enables us to find high-quality new routes quickly in each column generation iteration. Two variants of this integrated approach are evaluated against a benchmark sequential approach in which routing and loading are tackled separately and another benchmark approach in which routing and loading are optimized jointly without using ML. Computational experiments demonstrate that the proposed integrated ML and optimization approach generates significantly better solutions than the sequential benchmark approach with only slightly more computation time and similar solutions to the joint optimization benchmark approach but with significantly less computation time. The proposed solution approach can be adopted by automobile shipping companies. It can also be adapted for other joint optimization problems, such as those in aircraft load planning. Funding: Y. Sun is partially supported by the National Science Foundation [Grants 2332161, 2100745, and 2055347]. Supplemental Material: The online appendix is available at https://doi.org/10.1287/trsc.2024.0712 .

  • Online Integrated Production and Distribution Scheduling: Review and Extensions

    by Zhi-Long Chen

    As a growing number of manufacturers adopt the make-to-order business mode and a growing number of retailers sell online, we are seeing numerous decision problems that can be modeled as what are known in the literature as integrated production and distribution scheduling (IPDS) problems. In such problems, order processing and delivery must be scheduled jointly in order to achieve an optimal balance between total operational costs and overall customer service. Offline IPDS problems, in which the information about every order is known in advance with certainty, are extensively studied. However, research on online IPDS problems, in which orders arrive randomly with their information unknown until they arrive, is relatively recent but is growing rapidly. In this paper, we first describe several real-world applications to illustrate the importance of studying online IPDS problems from a practical point of view. We then review the existing literature on online IPDS problems with a focus on existing online algorithms for these problems and their theoretical performance. We also derive some new results to fill several gaps left in the literature and discuss possible topics for future research. History: Accepted by Andrea Lodi, Area Editor for Design & Analysis of Algorithms–Discrete. Supplemental Material: The online appendix is available at https://doi.org/10.1287/ijoc.2022.0305 .


  • Selection of auto-carrier loading policy in automobile shipping

    by Sajeeb Kumar Kirtonia, Yanshuo Sun, Zhi-Long Chen


  • Production and Transportation Integration for Commit-to-Delivery Mode with General Shipping Costs

    by Feng Li, Zhou Xu, Zhi-Long Chen

    We study an integrated production and transportation problem for a make-to-order manufacturing company that operates under the commit-to-delivery mode and uses third-party logistics service provide...


  • Integrated Scheduling of Production and Two-Stage Delivery of Make-to-Order Products: Offline and Online Algorithms

    by Lixin Tang, Feng Li, Zhi-Long Chen

    We study integrated production- and delivery-scheduling problems that arise in practical make-to-order settings in several industries. In these problems, make-to-order products are first processed in a plant and then delivered to customer sites through two stages of shipping: first, from the plant to a pool point (e.g., a port, a distribution, or a consolidation center) and, second, from the pool point to customer sites. The objective is to obtain a joint schedule of job processing at the plant and two-stage shipping of completed jobs to customer sites to optimize a performance measure that takes into account both delivery timeliness and total transportation costs. We consider two problems in which delivery timeliness is measured by total or maximum lead time of the jobs and study both offline and online versions of these problems. For the offline problems involving a single production line at the plant, we provide optimal dynamic programming algorithms. For the more general offline problems involving multiple production lines at the plant, we propose fast heuristics and analyze their worst-case and asymptotic performances. For the online problems, we propose online algorithms and analyze their competitive ratios. By comparing our offline heuristics with lower bounds using randomly generated test instances, it is shown that these heuristics are capable of generating near-optimal solutions quickly. Using real data from Baosteel’s Meishan plant, we also show that our corresponding offline heuristic generates significantly better solutions than Baosteel’s rule-based approach. In addition, our computational results on the performance of the online algorithms relative to the offline heuristics generate important methodological insights that can be used by practitioners in choosing a specific solution approach.


  • Integrated pricing and production scheduling of multiple customized products with a common base product

    by Qing Yue, Zhi-Long Chen, Guohua Wan

    Make-to-order (MTO) is a popular production strategy commonly used by manufacturers selling customized products. Dynamic pricing is a popular tactical tool commonly used by sellers to match supply with demand when there is a limited capacity and high demand uncertainty over time. In this paper, we consider joint pricing and production scheduling decisions faced by a manufacturer that uses an MTO strategy to sell a number of customized products made from a common base product. At the beginning of each period in a planning horizon, the manufacturer sets the price of the base product, which in turn sets the prices for the customized products accordingly. Given the prices, orders for the products arrive. In each period, together with the pricing decision, the manufacturer needs to make a production scheduling decision for processing accepted orders on a single production line. The manufacturer’s objective is to maximize the total revenue of the processed orders minus a scheduling penalty over the planning horizon. Three specific problems with different order acceptance rules and objective functions are studied. In the first problem, the manufacturer has to accept all the incoming orders and treats the total weighted completion time of the orders as a part of the objective function. In the second problem, the manufacturer has to accept all incoming orders but is allowed to complete some orders after their due dates with tardiness penalties. In the third problem, the manufacturer may reject some incoming orders, but must complete all the accepted orders by their due dates. We show that all these problems are NP-hard, propose optimal pseudo-polynomial time dynamic programming algorithms and fully polynomial time approximation schemes for solving these problems, and conduct computational experiments to show the performance of the proposed algorithms. Furthermore, we derive several managerial insights through computational experiments.


  • Dynamic Pricing to Minimize Maximum Regret

    by Zhi‐Long Chen, Nicholas G. Hall, Hans Kellerer

    We consider a dynamic pricing problem that involves selling a given inventory of a single product over a short, two‐period selling season. There is insufficient time to replenish inventory during this season, hence sales are made entirely from inventory. The demand for the product is a stochastic, nonincreasing function of price. We assume interval uncertainty for demand, that is, knowledge of upper and lower bounds but not a probability distribution, with no correlation between the two periods. We minimize the maximum total regret over the two periods that results from the pricing decisions. We consider a dynamic model where the decision maker chooses the price for each period contingent on the remaining inventory at the beginning of the period, and a static model where the decision maker chooses the prices for both periods at the beginning of the first period. Both models can be solved by a polynomial time algorithm that solves systems of linear inequalities. Our computational study demonstrates that the prices generated by both our models are insensitive to errors in estimating the demand intervals. Our dynamic model outperforms our static model and two classical approaches that do not use demand probability distributions, when evaluated by maximum regret, average relative regret, variability, and risk measures. Further, our dynamic model generates a total expected revenue which closely approximates that of a maximum expected revenue approach which requires demand probability distributions.