Customer Satisfaction and Differentiated Pricing in E-Retail Delivery

We study a system in which a common delivery fleet provides service to both same-day delivery (SDD) and next-day delivery (NDD) orders placed by e-retail customers who are sensitive to delivery prices. We develop a model of the system and optimize with respect to two separate objectives. First, empirical research suggests that fulfilling e-retail orders … Read more

Stochastic Dynamic Lot-sizing with Supplier-Driven Substitution and Service Level Constraints

We consider a multi-stage stochastic lot-sizing problem with service level constraints and supplier-driven product substitution. A firm has multiple products and it has the option to meet demand from substitutable products at a cost. Considering the uncertainty in future demands, the firm wishes to make ordering decisions in every period such that the probability that … Read more

Transportation and Inventory Planning in Serial Supply Chain with Heterogeneous Capacitated Vehicles

We study serial supply chain problems where a product is transported from a supplier to a warehouse (inbound transportation), and then from the warehouse (outbound transportation) to a retailer such that demand for a given planning horizon is satisfied. We consider heterogeneous vehicles of varying capacities for the transportation in each time period, and the … Read more

A comparison of different approaches for the vehicle routing problem with stochastic demands

The vehicle routing problem with stochastic demands (VRPSD) is a well studied variant of the classic (deterministic) capacitated vehicle routing problem (CVRP) where the customer demands are given by random variables. Two prominent approaches for solving the VRPSD model it either as a chance-constraint program (CC-VRPSD) or as a two-stage stochastic program (2S-VRPSD). In this … Read more

Decarbonizing OCP

Problem definition:  We present our collaboration with the OCP Group, one of the world’s largest producers of phosphate and phosphate-based products, in support of a green initiative designed to significantly reduce OCP’s carbon emissions. We study the problem of decarbonizing OCP’s electricity supply by installing a mixture of solar panels and batteries to minimize its … Read more

On solving the Cross-dock Door Assignment Problem, CDAP

\(\) A class of strong lower bounds on the solution value of a Linearized Integer Programming (LIP) reformulation is introduced for the binary quadratic optimization model to assign origin and destination nodes to strip and stack doors, resp., in a cross-dock infrastructure, whose goal is to minimize the transportation cost of the commodities to be … Read more

Production Theory for Constrained Linear Activity Models

The purpose of this paper is to generalize the framework of activity analysis discussed in Villar (2003) and obtain similar results concerning solvability. We generalize the model due to Villar (2003), without requiring any dimensional requirements on the activity matrices and by introducing a model of activity analysis in which each activity may (or may … Read more

Optimal configurations for modular systems at the example of crane bridges

The aim of this paper is to optimize modular systems which cover the construction of products that can be assembled on a modular basis. Increasing the number of different variants of individual components on the one hand decreases the cost of oversizing the assembled product, while on the other hand the cost for maintaining the … Read more

An Efficient Pixel-based Packing Algorithm for Additive Manufacturing Production Planning

Additive Manufacturing (AM), the technology of rapid prototyping directly from 3D digital models, has made a significant impact on both academia and industry. When facing the growing demand of AM services, AM production planning (AMPP) plays a vital role in reducing makespan and costs for AM service companies. This research focuses on the AMPP problem … Read more

Submodular Dispatching

Motivated by applications in e-commerce logistics where orders or items arrive at different times and must be dispatched or processed in batches, we propose the submodular dispatching problem (SMD), a strongly NP-hard model defined by a set of orders with release times and a non-decreasing submodular dispatch time function. A single uncapacitated vehicle must dispatch … Read more