Vehicle routing problems have been the focus of extensive research over the past sixty
years, driven by their economic importance and their theoretical interest. The diversity of …

The design of good heuristics or approximation algorithms for NP-hard combinatorial
optimization problems often requires significant specialized knowledge and trial-and-error …

The determination of vehicle routes fulfilling connectivity, time, and operational constraints is
a well-studied combinatorial optimization problem. The NP-hard complexity of vehicle …

Abstract Inventory Routing Problem is a variant of the Vehicle Routing Problem that consists
of interrelated vehicle routing and inventory decisions. There is a growing interest in …

Abstract “Primal heuristics” are a key contributor to the improved performance of exact
branch-and-bound solvers for combinatorial optimization and integer programming. Perhaps …

Bike Sharing Systems (BSSs) are widely adopted in major cities of the world due to
concerns associated with extensive private vehicle usage, namely, increased carbon …

We introduce, model and solve to optimality a rich multi-product, multi-period and multi-
compartment vehicle routing problem with a required compartment cleaning activity. This …

Combinatorial optimization is a well-established area in operations research and computer
science. Until recently, its methods have focused on solving problem instances in isolation …

Abstract The Maritime Inventory Routing Problem (MIRP) has gained attention in
combinatorial optimization in the last decades. The problem has several variations, mostly …

We consider a single product maritime inventory routing problem in which the production
and consumption rates are constant over the planning horizon. The problem involves a …