scispace - formally typeset
Journal ArticleDOI

Solving a large multi-product production-routing problem with delivery time windows

Reads0
Chats0
TLDR
This work proposes a novel three-phase methodology to tackle a large Production-Routing Problem (PRP) combining realistic features for the first time and achieves global cost savings of 21.73% compared to the company’s solution.
Abstract
Even though the joint optimization of sequential activities in supply chains is known to yield significant cost savings, the literature concerning optimization approaches that handle the real-life features of industrial problems is scant. The problem addressed in this work is inspired by industrial contexts where vendor-managed inventory policies are applied. In particular, our study is motivated by a meat producer whose supply chain comprises a single meat processing centre with several production lines and a fleet of vehicles that is used to deliver different products to meat stores spread across the country. A considerable set of characteristics, such as product family setups, perishable products, and delivery time windows, needs to be considered in order to obtain feasible integrated plans. However, the dimensions of the problem make it impossible to be solved exactly by current solution methods. We propose a novel three-phase methodology to tackle a large Production-Routing Problem (PRP) combining realistic features for the first time. In the first phase, we attempt to reduce the size of the original problem by simplifying some dimensions such as the number of products, locations and possible routes. In the second phase, an initial PRP solution is constructed through a problem decomposition comprising several inventory-routing problems and one lot-sizing problem. In the third phase, the initial solution is improved by different mixed-integer programming models which focus on small parts of the original problem and search for improvements in the production, inventory management and transportation costs. Our solution approach is tested both on simpler instances available in the literature and on real-world instances containing additional details, specifically developed for a European company’s case study. By considering an integrated approach, we achieve global cost savings of 21.73% compared to the company’s solution.

read more

Citations
More filters
Journal ArticleDOI

A concise guide to existing and emerging vehicle routing problem variants

TL;DR: Vehicle routing problems have been the focus of extensive research over the past sixty years, driven by their economic importance and their theoretical interest as mentioned in this paper, and the diversity of applications has motivated the study of a myriad of problem variants with different attributes.
Posted Content

A concise guide to existing and emerging vehicle routing problem variants.

TL;DR: This article provides a concise overview of existing and emerging problem variants of vehicle routing problems and organizes the main problem attributes within this structured framework.

Optimization-Based Adaptive Large Neighborhood Search for the Production Routing Problem

TL;DR: In this paper, an optimization-based adaptive large neighborhood search heuristic for the production routing problem (PRP) is introduced, where binary variables representing setup and routing decisions are handled by an enumeration scheme and upper-level search operators, respectively, and continuous variables associated with production, inventory, and shipment quantities are set by solving a network flow subproblem.
Journal ArticleDOI

Environmental effect for a complex green supply-chain management to control waste: A sustainable approach

TL;DR: In this article, a multi-stage green supply-chain management of a highly perishable blood product is proposed to minimize duplication by successful decision-making about location allocation of blood facilities and develop an efficient network for blood platelet collection and distribution.
Journal ArticleDOI

Integrated Production and Distribution Problem of Perishable Products with a Minimum Total Order Weighted Delivery Time

Ling Liu, +1 more
TL;DR: The computational results show that the proposed improved large neighborhood search algorithm can provide higher quality solutions than the genetic algorithm.
References
More filters
Journal ArticleDOI

Benchmarking optimization software with performance profiles

TL;DR: It is shown that performance profiles combine the best features of other tools for performance evaluation to create a single tool for benchmarking and comparing optimization software.
Journal ArticleDOI

The Truck Dispatching Problem

TL;DR: A procedure based on a linear programming formulation is given for obtaining a near optimal solution to the optimum routing of a fleet of gasoline delivery trucks between a bulk terminal and a large number of service stations supplied by the terminal.
Journal ArticleDOI

Dynamic Version of the Economic Lot Size Model

TL;DR: Disjoint planning horizons are shown to be possible which eliminate the necessity of having data for the full N periods and desire a minimum total cost inventory management scheme which satisfies known demand in every period.

DYNAMIC VERSION OF THE ECONOMIC LOT SIZE MODEL*t

TL;DR: In this paper, a forward algorithm for a solution to the following dynamic version of the economic lot size model is given: allowing the possibility of demands for a single item,,inventory holding charges, anid setup costs to vary over N periods, we desire a minimum total cost inventory management scheme which satisfies known demand in every period.
Related Papers (5)