The effect of different mathematical formulations on a matheuristic algorithm for the production routing problem

DOI10.1016/j.cor.2023.106232MaRDI QIDQ6164609

Mohamed Ben Ahmed, Agostinho Agra, Lars Magnus Hvattum

Publication date: 4 July 2023

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

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

zbMATH Keywords

lot sizing; experimental analysis; proximity search; inventory routing; valid inequality; mixed integer formulation

Mathematics Subject Classification ID

90Bxx: Operations research and management science

Cites Work

• The production routing problem: a review of formulations and solution algorithms
• Proximity search for 0--1 mixed-integer convex programming
• Coordination of production and distribution planning
• A decomposition heuristic for a rich production routing problem
• A computational comparison of flow formulations for the capacitated location-routing problem
• A simple and effective evolutionary algorithm for the vehicle routing problem
• A new branch-and-cut algorithm for the capacitated vehicle routing problem
• The two-echelon production-routing problem
• Improved branch-and-cut for the inventory routing problem based on a two-commodity flow formulation
• An infeasible space exploring matheuristic for the production routing problem
• Stochastic production routing problem for perishable products: modeling and a solution algorithm
• Comparison of formulations for the inventory routing problem
• A matheuristic solution approach for the production routing problem with visit spacing policy
• Mathematical programming based heuristics for the 0--1 MIP: a survey
• Measuring the impact of primal heuristics
• A survey on matheuristics for routing problems
• A mathematical programming-based heuristic for the production routing problem with transshipments
• Compact formulations for multi-depot routing problems: theoretical and computational comparisons
• Formulations and Branch-and-Cut Algorithms for Multivehicle Production and Inventory Routing Problems
• A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
• Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
• A Dynamic Distribution Model with Warehouse and Customer Replenishment Requirements
• Formulations for an inventory routing problem
• A Unified Decomposition Matheuristic for Assembly, Production, and Inventory Routing
• Evaluating the importance of randomization in adaptive large neighborhood search
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem