Exact and Heuristic Algorithms for the Carrier-Vehicle Traveling Salesman Problem

This paper presents new structural properties for the Carrier-Vehicle Traveling Salesman Problem. The authors provide a new mixed integer second order conic optimization formulation, with associated optimality cuts based on the structural properties, and an Iterated Local Search (ILS) algorithm. Computational experiments on instances from the literature demonstrate the superiority of the new formulation to … Read more

Robust Active Preference Elicitation

We study the problem of strategically eliciting the preferences of a decision-maker through a moderate number of pairwise comparison queries with the goal of making them a high quality recommendation for a specific decision-making problem. We are particularly motivated by applications in high stakes domains, such as when choosing a policy for allocating scarce resources … Read more

Optimization-Based Dispatching Policies for Open-Pit Mining

We propose, implement, and test two approaches for dispatching trucks in an open-pit mining operation. The first approach relies on a nonlinear optimization model that incorporates queueing effects to set target average flow rates between mine locations. The second approach is based on a time-discretized mixed integer programming (MIP) model. The MIP model is difficult … Read more

A Robust Rolling Horizon Framework for Empty Repositioning

Naturally imbalanced freight flows force consolidation carriers to reposition resources empty. When constructing empty repositioning plans, the cost of repositioning resources empty needs to be weighed against the cost of corrective actions in case of unavailable resources. This is especially challenging given the uncertainty of future demand. We design and implement a robust rolling horizon … Read more

Integrated Pricing and Routing on a Network

We consider an integrated pricing and routing problem on a network. The problem is motivated by applications in freight transportation such as package delivery and less-than-truckload shipping services. The decision maker sets a price for each origin-destination pair of the network, which determines the demand flow that needs to be served. The flows are then … Read more

Optimal Residential Users Coordination Via Demand Response: An Exact Distributed Framework

This paper proposes a two-phase optimization framework for users that are involved in demand response (DR) programs. In a first phase, responsive users optimize their own household consumption, characterizing not only their appliances and equipments but also their comfort preferences. Subsequently, the aggregator exploits in a second phase this preliminary non-coordinated solution by implementing a … Read more

Solving Binary-Constrained Mixed Complementarity Problems Using Continuous Reformulations

Mixed complementarity problems are of great importance in practice since they appear in various fields of applications like energy markets, optimal stopping, or traffic equilibrium problems. However, they are also very challenging due to their inherent, nonconvex structure. In addition, recent applications require the incorporation of integrality constraints. Since complementarity problems often model some kind … Read more

A decomposition resolution approach for a production inventory- distribution-routing problem

The aim of this study is to develop a solution to the problem of distribution of goods proposed by the Mathematical Competitive Game 2017-2018, jointly organized by the French Federation of Mathematical Games and Mathematical Modelling Company. Referred to as a production-inventory-distribution-routing problem (PIDRP), it is an NP-hard combinatorial optimization problem, which received the least … Read more

Evaluating on-demand warehousing via dynamic facility location models

On-demand warehousing platforms match companies with underutilized warehouse and distribution capabilities with customers who need extra space or distribution services. These new business models have unique advantages, in terms of reduced capacity and commitment granularity, but also have different cost structures compared to traditional ways of obtaining distribution capabilities. This research is the first quantitative … Read more

Stochastic Last-mile Delivery with Crowd-shipping and Mobile Depots

This paper proposes a two-tier last-mile delivery model that optimally selects mobile depot locations in advance of full information about the availability of crowd-shippers, and then transfers packages to crowd-shippers for the final shipment to the customers. Uncertainty in crowd-shipper availability is incorporated by modeling the problem as a two-stage stochastic integer program. Enhanced decomposition … Read more