An infeasible space exploring matheuristic for the production routing problem

DOI10.1016/j.ejor.2021.05.037zbMath1490.90061OpenAlexW3171555511MaRDI QIDQ2076821

Grigoris A. Kasapidis, Eleftherios Manousakis, Chris T. Kiranoudis, Emmanouil E. Zachariadis

Publication date: 22 February 2022

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2021.05.037

zbMATH Keywords

transportationmatheuristicproduction routinginfeasible space searchintegrated routing problem

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 (5)

The fish feed production routing problem ⋮ Rolling horizon-based heuristics for solving a production-routing problem with price-dependent demand ⋮ The consistent production routing problem ⋮ An adaptive memory matheuristic for the set orienteering problem ⋮ The effect of different mathematical formulations on a matheuristic algorithm for the production routing problem

Cites Work

• 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
• Coordination of production and distribution planning
• A decomposition heuristic for a rich production routing problem
• A multi-phase heuristic for the production routing problem
• Heuristics based on genetic algorithms for the capacitated multi vehicle production distribution problem
• Comparing sequential and integrated approaches for the production routing problem
• Sequential versus integrated optimization: production, location, inventory control, and distribution
• Greedy randomized adaptive search procedures
• An efficient three-level heuristic for the large-scaled multi-product production routing problem with outsourcing
• The two-echelon production-routing problem
• Improved branch-and-cut for the inventory routing problem based on a two-commodity flow formulation
• Using intermediate infeasible solutions to approach vehicle routing problems with precedence and loading constraints
• A matheuristic solution approach for the production routing problem with visit spacing policy
• A memetic algorithm with dynamic population management for an integrated production-distribution problem
• A survey on matheuristics for routing problems
• The inventory routing problem: the value of integration
• Formulations and Branch-and-Cut Algorithms for Multivehicle Production and Inventory Routing Problems
• Benders Decomposition for Production Routing Under Demand Uncertainty
• A Dynamic Distribution Model with Warehouse and Customer Replenishment Requirements
• A guide to vehicle routing heuristics
• A unified tabu search heuristic for vehicle routing problems with time windows
• A Tabu Search Heuristic for the Vehicle Routing Problem
• A Unified Decomposition Matheuristic for Assembly, Production, and Inventory Routing
• A Tabu Search Heuristic for the Vehicle Routing Problem with Stochastic Demands and Customers

This page was built for publication: An infeasible space exploring matheuristic for the production routing problem