The two-echelon production-routing problem

DOI10.1016/j.ejor.2020.05.054zbMath1487.90166OpenAlexW3033405475WikidataQ115162819 ScholiaQ115162819MaRDI QIDQ2028880

Leandro C. Coelho, Cassius T. Scarpin, Cleder M. Schenekemberg, Thiago A. Guimarães, José Eduardo jun. Pécora

Publication date: 3 June 2021

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

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

zbMATH Keywords

local searchparallel computingbranch-and-cutlogisticstwo-echelon production-routing

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Transportation, logistics and supply chain management (90B06) Production models (90B30) Inventory, storage, reservoirs (90B05)

Related Items (8)

Stochastic production routing problem for perishable products: modeling and a solution algorithm ⋮ Rolling horizon-based heuristics for solving a production-routing problem with price-dependent demand ⋮ A hybrid collaborative framework for integrated production scheduling and vehicle routing problem with batch manufacturing and soft time windows ⋮ Split demand and deliveries in an integrated three-level lot sizing and replenishment problem ⋮ Pre-auction lane selection in an integrated production–distribution planning problem ⋮ The effect of different mathematical formulations on a matheuristic algorithm for the production routing problem ⋮ An infeasible space exploring matheuristic for the production routing problem ⋮ Two-echelon vehicle routing problems: a literature review

Uses Software

• CVRPSP

Cites Work

• The production routing problem: a review of formulations and solution algorithms
• The exact solution of several classes of inventory-routing problems
• 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
• Local branching
• The two-echelon multi-depot inventory-routing problem
• Analysis of an improved branch-and-cut formulation for the inventory-routing problem with transshipment
• A variable MIP neighborhood descent algorithm for managing inventory and distribution of cash in automated Teller machines
• A multi-phase heuristic for the production routing problem
• Alternative formulations and improved bounds for the multi-depot fleet size and mix vehicle routing problem
• Sequential versus integrated optimization: production, location, inventory control, and distribution
• A new branch-and-cut algorithm for the capacitated vehicle routing problem
• An efficient three-level heuristic for the large-scaled multi-product production routing problem with outsourcing
• Exact solution methods for the multi-period vehicle routing problem with due dates
• The integrated production-inventory-distribution-routing problem
• Industrial aspects and literature survey: Combined inventory management and routing
• A memetic algorithm with dynamic population management for an integrated production-distribution problem
• 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
• A Unified Decomposition Matheuristic for Assembly, Production, and Inventory Routing

This page was built for publication: The two-echelon production-routing problem