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

DOI10.1016/J.COR.2023.106232MaRDI QIDQ6164609zbMATH OpenOpenAlexFDO

Authors Mohamed Ben Ahmed, Lars Magnus Hvattum, Agostinho Agra

Publication date 4 July 2023

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

Copyright license Creative Commons Attribution 4.0 International

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

zbMATH Keywords

lot sizingexperimental analysisproximity searchinventory routingvalid inequalitymixed integer formulation

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Recommendations

• An infeasible space exploring matheuristic for the production routing problem
• A matheuristic solution approach for the production routing problem with visit spacing policy
• A mathematical programming-based heuristic for the production routing problem with transshipments
• A multi-phase heuristic for the production routing problem
• The production routing problem: a review of formulations and solution algorithms

Cites work

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

Cited in

(2)

• A mathematical programming-based heuristic for the production routing problem with transshipments
• The production routing problem: a review of formulations and solution algorithms

This page was built for publication: The effect of different mathematical formulations on a matheuristic algorithm for the production routing problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6164609)