Selective and periodic inventory routing problem for waste vegetable oil collection

DOI10.1007/s11590-012-0444-1zbMath1254.90125MaRDI QIDQ1758051

Deniz Aksen, Onur Kaya, F. Sibel Salman, Yeliz Akça

Publication date: 7 November 2012

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-012-0444-1

zbMATH Keywords

collection; reverse logistics; mixed integer linear programming; periodic inventory routing; waste vegetable oil

Mathematics Subject Classification ID

90C11: Mixed integer programming

90B35: Deterministic scheduling theory in operations research

90B05: Inventory, storage, reservoirs

Related Items

An adaptive large neighborhood search algorithm for a selective and periodic inventory routing problem, Fleet routing position-based model for inventory pickup under production shutdown, Forty years of periodic vehicle routing

Uses Software

• VRP

Cites Work

• Recyclable waste collection planning -- a case study
• A note on the lifted Miller-Tucker-Zemlin subtour elimination constraints for the capacitated vehicle routing problem
• A comparative analysis of several asymmetric traveling salesman problem formulations
• A branch-and-price algorithm for an integrated production and inventory routing problem
• New tighter polynomial length formulations for the asymmetric traveling salesman problem with and without precedence constraints
• A web-based decision support system for waste lube oils collection and recycling
• An optimization algorithm for the inventory routing problem with continuous moves
• An Exact Algorithm for the Period Routing Problem
• The period routing problem
• Inventory routing problems: a logistical overview
• The asymmetric travelling salesman problem: on generalizations of disaggregated Miller-Tucker-Zemlin constraints
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item