A new optimization algorithm for the vehicle routing problem with time windows
Operations Research
Using MPI (2nd ed.): portable parallel programming with the message-passing interface
Using MPI (2nd ed.): portable parallel programming with the message-passing interface
A Template for Scatter Search and Path Relinking
AE '97 Selected Papers from the Third European Conference on Artificial Evolution
Branch-And-Price: Column Generation for Solving Huge Integer Programs
Operations Research
Decomposition of a Combined Inventory and Time Constrained Ship Routing Problem
Transportation Science
A general heuristic for vehicle routing problems
Computers and Operations Research
An optimization algorithm for the inventory routing problem with continuous moves
Computers and Operations Research
An Optimization-Based Heuristic for the Split Delivery Vehicle Routing Problem
Transportation Science
A Hybrid Solution Approach for Ready-Mixed Concrete Delivery
Transportation Science
Invited Review: Industrial aspects and literature survey: Combined inventory management and routing
Computers and Operations Research
Combining Exact and Heuristic Approaches for the Capacitated Fixed-Charge Network Flow Problem
INFORMS Journal on Computing
A Branch-and-Price Method for a Liquefied Natural Gas Inventory Routing Problem
Transportation Science
A Branch-Price-and-Cut Algorithm for Single-Product Maritime Inventory Routing
Operations Research
A maritime inventory routing problem: Practical approach
Computers and Operations Research
Hi-index | 0.01 |
We apply branch-and-price guided search to a real-world maritime inventory routing problem, in which the inventory of a single product, which is produced and consumed at multiple sites, and its transport, which is done with a heterogeneous fleet of vessels, is managed over a finite horizon. Computational experiments demonstrate that branch-and-price guided search quickly produces solutions that are near-optimal and of better quality than those produced by a state-of-the-art, commercial integer programming solver that is given much more time. We also develop local search schemes to further reduce the time needed to find high quality solutions and present computational evidence of their efficacy.