An infeasible space exploring matheuristic for the production routing problem
type: Item
instance of: scholarly article
title: An infeasible space exploring matheuristic for the production routing problem
zbMATH Open document ID: 1490.90061
author: Eleftherios Manousakis
author: Grigoris A. Kasapidis
author: Chris T. Kiranoudis
author: Emmanouil E. Zachariadis
published in: European Journal of Operational Research
publication date: 2022-02-22T00:00:00Z
Mathematics Subject Classification ID: 90B06
Mathematics Subject Classification ID: 90B05
Mathematics Subject Classification ID: 90B30
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 7478833
zbMATH Keywords: transportation
zbMATH Keywords: integrated routing problem
zbMATH Keywords: production routing
zbMATH Keywords: matheuristic
zbMATH Keywords: infeasible space search
MaRDI profile type: Publication
full work available at URL: j.ejor.2021.05.037
OpenAlex ID: W3171555511
cites work: Comparing sequential and integrated approaches for the production routing problem
cites work: Benders Decomposition for Production Routing Under Demand Uncertainty
cites work: The production routing problem: a review of formulations and solution algorithms
cites work: Formulations and Branch-and-Cut Algorithms for Multivehicle Production and Inventory Routing Problems
cites work: Analysis of the maximum level policy in a production-distribution system
cites work: A survey on matheuristics for routing problems
cites work: The inventory routing problem: the value of integration
cites work: Tabu search with path relinking for an integrated production-distribution problem
cites work: A matheuristic solution approach for the production routing problem with visit spacing policy
cites work: A reactive GRASP and path relinking for a combined production-distribution problem
cites work: A memetic algorithm with dynamic population management for an integrated production-distribution problem
cites work: A Dynamic Distribution Model with Warehouse and Customer Replenishment Requirements
cites work: Coordination of production and distribution planning
cites work: A Unified Decomposition Matheuristic for Assembly, Production, and Inventory Routing
cites work: A guide to vehicle routing heuristics
cites work: A unified tabu search heuristic for vehicle routing problems with time windows
cites work: Sequential versus integrated optimization: production, location, inventory control, and distribution
cites work: Using intermediate infeasible solutions to approach vehicle routing problems with precedence and loading constraints
cites work: Greedy randomized adaptive search procedures
cites work: A Tabu Search Heuristic for the Vehicle Routing Problem
cites work: A Tabu Search Heuristic for the Vehicle Routing Problem with Stochastic Demands and Customers
cites work: An efficient three-level heuristic for the large-scaled multi-product production routing problem with outsourcing
cites work: Improved branch-and-cut for the inventory routing problem based on a two-commodity flow formulation
cites work: A decomposition heuristic for a rich production routing problem
cites work: The two-echelon production-routing problem
cites work: Heuristics based on genetic algorithms for the capacitated multi vehicle production distribution problem
cites work: A multi-phase heuristic for the production routing problem
DOI: 10.1016/J.EJOR.2021.05.037
description: scientific article; zbMATH DE number 7478833