Online restaurant aggregators with integrated meal delivery networks have become more common and more popular in the past few years. Meal delivery is arguably the ultimate challenge in last mile logistics: a typical order is expected to be delivered within an hour (much less if possible), and within minutes of the food becoming ready. We … Read more
Freight consolidation is a logistics practice that improves the cost-effectiveness and efficiency of transportation operations, and also reduces energy consumption and carbon footprint. A “fair” shipping cost sharing scheme is indispensable to help establish and sustain the cooperation of a group of suppliers in freight consolidation. In this paper, we design a truthful acyclic mechanism … Read more
Contract carriers in the trucking industry are known to offer shippers a per mile rate that decreases stepwise as the shipper’s route lengthens, with a mileage band designated for each rate. While the use of quantity-based pricing discounts in supply chains has been well studied, there has been no research on how shippers should route … Read more
The fast-growing carsharing and ride-hailing businesses are generating economic benefits and societal impacts in the modern society. However, both have limitation to cover demand from diverse populations, e.g., travelers in low-income, underserved communities. In this paper, we consider two types of travelers: Type~1 who rent shared cars and Type~2 who need shared rides. We propose … Read more
We study the robust resource constrained shortest path problem (RCSPP) under uncertainty in cost and multiple resource consumption. Contrary to the deterministic RCSPP where the cost and the consumption of resources on an arc are known and fixed, the robust RCSPP models the case where both the cost and the resource consumption are random, and … Read more
Two critical yet frequently conflicting objectives for logistics and transportation service companies are improving customer satisfaction and reducing transportation cost. In particular, given a net- work of customer requests with preferred service times, it is very challenging to find vehicle routes and service schedules simultaneously that respect all operating constraints and minimize the total transportation … Read more
This paper studies the Hamiltonian p-median problem defined on a directed graph, which consists of finding p mutually disjoint circuits of minimum total cost, such that each node of the graph is included in one of the circuits. Earlier formulations are based on viewing the problem as one resulting from the intersection of two subproblems. … Read more
Food rescue organizations collect and re-distribute surplus perishable food for hunger relief. We propose novel approaches to address this humanitarian logistics challenge and find envy-free allocations of the rescued food together with least travel cost routes. We show that this food rescue and delivery problem is NP-hard and we present a cutting-plane algorithm based on … Read more
We focus on a problem of locating recharging stations in one-way station based electric car sharing systems which operate under demand uncertainty. We model this problem as a mixed integer stochastic program and develop a Benders decomposition algorithm based on this formulation. We integrate a stabilization procedure to our algorithm and conduct a large-scale experimental … Read more
We address the robust vehicle routing problem with time windows (RVRPTW) under customer demand and travel time uncertainties. As presented thus far in the literature, robust counterparts of standard formulations have challenged general-purpose optimization solvers and specialized branch-and-cut methods. Hence, optimal solutions have been reported for small-scale instances only. Additionally, although the most successful methods … Read more