Minimizing earliness-tardiness costs in supplier networks – A Just-in-time Truck Routing Problem

We consider a routing problem where orders are transported just-in-time from several suppliers to an original equipment manufacturer (OEM). This implies that shipments cannot be picked up before their release date when they are ready at the supplier and should be delivered as close as possible to their due date to the OEM. Every shipment … Read more

Structure-driven fix-and-propagate heuristics for mixed integer programming

Primal heuristics play an important role in the solving of mixed integer programs (MIPs). They often provide good feasible solutions early and help to reduce the time needed to prove optimality. In this paper, we present a scheme for start heuristics that can be executed without previous knowledge of an LP solution or a previously … Read more

The Benefits of Transfers in Crowdsourced Pickup-and-Delivery Systems

Rapid urban growth, the increasing importance of e-commerce and high consumer service expectations have given rise to new and innovative models for freight delivery within urban environments. Crowdsourced solutions – where drivers are not employed by a carrier but occasionally offer their services through on-line platforms and are contracted as required by carriers – are … Read more

Visualizing proportions and dissimilarities by Space-filling maps: a Large Neighborhood Search approach

In this paper we address the problem of visualizing a set of individuals, which have attached a statistical value given as a proportion, and a dissimilarity measure. Each individual is represented as a region within the unit square, in such a way that the area of the regions represent the proportions and the distances between … Read more

Alternating Criteria Search: A Parallel Large Neighborhood Search Algorithm for Mixed Integer Programs

We present a parallel large neighborhood search framework for finding high quality primal solutions for generic Mixed Integer Programs (MIPs). The approach simultaneously solves a large number of sub-MIPs with the dual objective of reducing infeasibility and optimizing with respect to the original objective. Both goals are achieved by solving restricted versions of two auxiliary … Read more

Free-Floating Bike Sharing: Solving Real-life Large-scale Static Rebalancing Problems

Free-floating bike sharing (FFBS) is an innovative bike sharing model. FFBS saves on start-up cost, in comparison to station-based bike sharing (SBBS), by avoiding construction of expensive docking stations and kiosk machines. FFBS prevents bike theft and offers significant opportunities for smart management by tracking bikes in real-time with built-in GPS. However, like SBBS, the … Read more