A mathematical programming-based heuristic for the production routing problem with transshipments

DOI10.1016/j.cor.2020.105042zbMath1458.90008OpenAlexW3037565592MaRDI QIDQ2664374

Seyda Topaloglu Yildiz, Mustafa Avci

Publication date: 20 April 2021

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2020.105042

zbMATH Keywords

heuristicstransshipmentproduction routing

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Production models (90B30) Inventory, storage, reservoirs (90B05)

Related Items (4)

A rolling horizon approach for a multi-stage stochastic fixed-charge transportation problem with transshipment ⋮ Stochastic production routing problem for perishable products: modeling and a solution algorithm ⋮ Rolling horizon-based heuristics for solving a production-routing problem with price-dependent demand ⋮ The effect of different mathematical formulations on a matheuristic algorithm for the production routing problem

Cites Work

• Unnamed Item
• Heuristics for dynamic and stochastic inventory-routing
• The production routing problem: a review of formulations and solution algorithms
• The exact solution of several classes of inventory-routing problems
• Analysis of the maximum level policy in a production-distribution system
• Tabu search with path relinking for an integrated production-distribution problem
• A reactive GRASP and path relinking for a combined production-distribution problem
• A branch-and-price algorithm for an integrated production and inventory routing problem
• A tabu search heuristic for the vehicle routing problem with private fleet and common carrier
• Coordination of production and distribution planning
• Local branching
• Analysis of an improved branch-and-cut formulation for the inventory-routing problem with transshipment
• A decomposition heuristic for a rich production routing problem
• Multiscale production routing in multicommodity supply chains with complex production facilities
• A multi-phase heuristic for the production routing problem
• Comparing sequential and integrated approaches for the production routing problem
• The value of integrating loading and routing
• The inventory-routing problem with transshipment
• A heuristic algorithm for the truckload and less-than-truckload problem
• An efficient three-level heuristic for the large-scaled multi-product production routing problem with outsourcing
• The integrated production-inventory-distribution-routing problem
• A branch-and-cut algorithm for an assembly routing problem
• A matheuristic solution approach for the production routing problem with visit spacing policy
• Optimal solutions in the multi-location inventory system with transshipments
• A memetic algorithm with dynamic population management for an integrated production-distribution problem
• Synchronized Development of Production, Inventory, and Distribution Schedules
• The inventory routing problem: the value of integration
• A Hybrid Heuristic for an Inventory Routing Problem
• Formulations and Branch-and-Cut Algorithms for Multivehicle Production and Inventory Routing Problems
• Modelling Emergency Lateral Transshipments in Inventory Systems
• Benders Decomposition for Production Routing Under Demand Uncertainty
• A Two-Echelon Inventory System with Priority Shipments
• A Dynamic Distribution Model with Warehouse and Customer Replenishment Requirements
• Alternative Inventory and Distribution Policies of a Food Manufacturer
• A Unified Decomposition Matheuristic for Assembly, Production, and Inventory Routing

This page was built for publication: A mathematical programming-based heuristic for the production routing problem with transshipments