A decomposition heuristic for a rich production routing problem

DOI10.1016/j.cor.2018.05.004zbMath1391.90076OpenAlexW2800829962WikidataQ57719335 ScholiaQ57719335MaRDI QIDQ1651659

Reinaldo Morabito, Pedro L. Miranda, Jean-François Cordeau, Deisemera Ferreira, Raf Jans

Publication date: 12 July 2018

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

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

zbMATH Keywords

lot-sizingdecomposition heuristicintegrated production and distribution planningproduction routing problem

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Production models (90B30) Inventory, storage, reservoirs (90B05)

Related Items (9)

Stochastic production routing problem for perishable products: modeling and a solution algorithm ⋮ The fish feed production routing problem ⋮ A mathematical programming-based heuristic for the production routing problem with transshipments ⋮ Split demand and deliveries in an integrated three-level lot sizing and replenishment problem ⋮ Home healthcare staff dimensioning problem for temporary caregivers: a matheuristic solution approach ⋮ The effect of different mathematical formulations on a matheuristic algorithm for the production routing problem ⋮ Formulations, branch-and-cut and a hybrid heuristic algorithm for an inventory routing problem with perishable products ⋮ A matheuristic solution approach for the production routing problem with visit spacing policy ⋮ An infeasible space exploring matheuristic for the production routing problem

Uses Software

• VRP

Cites Work

• Unnamed Item
• Unnamed Item
• The production routing problem: a review of formulations and solution algorithms
• 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
• The vehicle routing problem. Latest advances and new challenges.
• A branch-and-price algorithm for an integrated production and inventory routing problem
• Coordination of production and distribution planning
• Local branching
• Optimization model for a production, inventory, distribution and routing problem in small furniture companies
• The integrated production-inventory-distribution-routing problem
• A memetic algorithm with dynamic population management for an integrated production-distribution problem
• Minimizing the total cost in an integrated vendor-managed inventory system
• Synchronized Development of Production, Inventory, and Distribution Schedules
• Vehicle Routing
• Formulations and Branch-and-Cut Algorithms for Multivehicle Production and Inventory Routing Problems
• Benders Decomposition for Production Routing Under Demand Uncertainty
• A tabu search procedure for coordinating production, inventory and distribution routing problems
• Modeling industrial lot sizing problems: a review
• Production Planning by Mixed Integer Programming

This page was built for publication: A decomposition heuristic for a rich production routing problem