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

A Tutorial on Formulating QUBO Models

The field of Combinatorial Optimization (CO) is one of the most important areas in the general field of optimization, with important applications found in every industry, including both the private and public sectors. It is also one of the most active research areas pursued by the research communities of Operations Research, Computer Science, and Analytics … Read more

A Decision Tool based on a Multi-Objective Methodology for designing High-Pressure Thermal Treatments in Food Industry

In this work, we propose a methodology for designing High-Pressure Thermal processes for food treatment. This approach is based on a multi-objective preference-based evolutionary optimization algorithm, called WASF-GA, combined with a decision strategy which provides the food engineer with the best treatment in accordance with some quality requirements. The resulting method is compared to a … Read more

The job shop scheduling problem with convex costs

The job shop scheduling literature has been dominated by a focus on regular objective functions — in particular the makespan — in its half a century long history. The last twenty years have encountered a spike of interest in other objectives, such as the total weighted tardiness, but research on non-regular objective functions has always … Read more

Recent Progress Using Matheuristics for Strategic Maritime Inventory Routing

This paper presents an extensive computational study of simple, but prominent matheuristics (i.e., heuristics that rely on mathematical programming models) to fi nd high quality ship schedules and inventory policies for a class of maritime inventory routing problems. Our computational experiments are performed on a set of the publicly available MIRPLib instances. This class of inventory … Read more

The Vehicle Routing Problem with Occasional Drivers

We consider a setting in which a company not only has a fleet of capacitated vehicles and drivers available to make deliveries, but may also use the services of occasional drivers who are willing to make a single delivery using their own vehicle in return for a small compensation if the delivery location is not … 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

Solving maximum cut problems by simulated annealing

This paper gives a straightforward implementation of simulated annealing for solving maximum cut problems and compares its performance to that of some existing heuristic solvers. The formulation used is classical, dating to a 1989 paper of Johnson, Aragon, McGeoch, and Schevon. This implementation uses no structure peculiar to the maximum cut problem, but its low … Read more

What Works Best When? A Systematic Evaluation of Heuristics for Max-Cut and QUBO

Though empirical testing is broadly used to evaluate heuristics, there are shortcomings with how it is often applied in practice. In a systematic review of Max-Cut and Quadratic Unconstrained Binary Optimization (QUBO) heuristics papers, we found only 4% publish source code, only 14% compare heuristics with identical termination criteria, and most experiments are performed with … Read more

Beam Search for integer multi-objective optimization

Beam search is a tree search procedure where, at each level of the tree, at most W nodes are kept. This results in a metaheuristic whose solving time is polynomial in W. Popular for single-objective problems, beam search has only received little attention in the context of multi-objective optimization. By introducing the concepts of oracle … Read more