The biobjective inventory routing problem: problem solution and decision support

Authors:
Martin Josef Geiger;Marc Sevaux
Affiliations:
Helmut Schmidt University, Logistics Management Department, Hamburg, Germany;Helmut Schmidt University, Logistics Management Department, Hamburg, Germany and Université de Bretagne-Sud, Lab-STICC, Lorient, France
Venue:
INOC'11 Proceedings of the 5th international conference on Network optimization
Year:
2011

Citing 10
Cited 0

Deterministic Order-Up-To Level Policies in an Inventory Routing Problem

Transportation Science
The Stochastic Inventory Routing Problem with Direct Deliveries

Transportation Science
Rendezvous Search on the Labeled Line

Operations Research
Efficient Insertion Heuristics for Vehicle Routing and Scheduling Problems

Transportation Science
A record-to-record travel algorithm for solving the heterogeneous fleet vehicle routing problem

Computers and Operations Research
Performance Measurement for Inventory Routing

Transportation Science
A Decomposition Approach for the Inventory-Routing Problem

Transportation Science
Fuzzy rule generation for adaptive scheduling in a dynamic manufacturing environment

Applied Soft Computing
A Branch-and-Cut Algorithm for a Vendor-Managed Inventory-Routing Problem

Transportation Science
Heuristic approaches for the inventory-routing problem with backlogging

Computers and Industrial Engineering

Quantified Score

Hi-index	0.04

Visualization

Abstract

The article presents a study on a biobjective generalization of the inventory routing problem, an important optimization problem found in logistical networks in which aspects of inventory management and vehicle routing intersect. A compact solution representation and a heuristic optimization approach are presented, and experimental investigations involving novel benchmark instances are carried out. As the investigated problem is computationally very demanding, only a small subset of solutions can be computed within reasonable time. Decision support is nevertheless obtained by means of a set of reference points, which guide the search towards the Pareto-front.