The Vehicle Routing Problem with Shipment Consolidation (VRPSC) is a novel variation of the vehicle routing problem that involves multiple commodities, multiple dimensions, a fleet with different types of vehicles, and the challenge of consolidating shipments during the route. Exact algorithms...

This paper develops an integer programming approach to two-sided many-to-one matching by investigating stable integral matchings of a fictitious market where each worker is divisible. We show that a stable matching exists in a discrete matching market when the firms' preference profile satisfies...

This study focuses on optimizing last-mile delivery in e-commerce by balancing cost efficiency and customer preferences, particularly for mixed perishable and non-perishable goods distribution. As online grocery shopping grows, ensuring the timely and efficient delivery of perishable products...