A matheuristic solution approach for the production routing problem with visit spacing policy

Avcı, Mustafa; Yildiz, Şeyda Topaloğlu

doi:10.1016/j.ejor.2019.05.021

Cited by 32 publications

(10 citation statements)

References 43 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Some examples are: vehicle routing (Fikar & Hirsch, 2015), patient admission scheduling problem with operating rooms (Guido, Solina, Mirabelli & Conforti, 2018), flow shop (Della-Croce, Grosso & Salassa, 2014), workforce planning (Valeva, Hewitt & Thomas, 2017), cloud manufacturing scheduling (Vahedi-Nouri, Tavakkoli-Moghaddam, Hanzalek, Arbabi & Rohanine-jad, 2020). There is a clear shortage of matheuristic strategies applied to integrated planning problems in perishable supply chains, although they are very promising and, in most cases, efficient (Archetti, Boland & Speranza, 2017;Avci & Yildiz, 2019).…”

Section: Referencementioning

confidence: 99%

Optimization strategies for the integrated management of perishable supply chains: A literature review

Mirabelli

2022

JIEM

View full text Add to dashboard Cite

Purpose: The main purpose of this article is to systematically review the papers published in the period 2005-2020 about the integration of production, inventory and distribution activities in perishable supply chains.Design/methodology/approach: The proposed research methodology is based on several steps. First, database and keywords are selected, with the aim to search and collect the main papers, dealing with the integration of production, inventory, distribution activities in perishable supply chains. Then, a bibliometric analysis is carried out, to detect: the main publishing sources, the chronological distribution, the most used keywords, the featured authors, about the selected papers. A five-dimension classification framework is proposed to carry out a content analysis, where the papers of the literature review are classified and discussed, according to: supply chain structure, objective, perishability issues, solution approach, approach validation. Findings: Interest in the application of optimization models for integrated decision-making along perishable supply chains is strongly growing. Integrating multiple stages of the supply chain into a single framework is complex, especially when referring to perishable products. The vast majority of the problems addressed are then NP-Hard. Only a limited quantity of the selected papers aims to solve real-life case studies. There is a need for further research, which is capable of modeling and quantitatively improving existing supply chains. The potentials of Industry 4.0 are currently little explored. Originality/value: Based on the analysis of the papers published, this article outlines the current state of the art on the optimization strategies for the integrated management of perishable supply chains, which are very complex to be managed. Research trends and gaps are discussed, future challenges are presented.

show abstract

Section: Referencementioning

confidence: 99%

Optimization strategies for the integrated management of perishable supply chains: A literature review

Mirabelli

2022

JIEM

View full text Add to dashboard Cite

show abstract

“…Likewise, constraints (8) allow positive delivery quantities only if a visit occurs, while (9) impose the transportation capacity of the vehicles. Constraints (10) and (11) require the number of edges incident to a node to be 2 if a customer is visited (for i ∈ ) or if the vehicle leaves its plant (for i ∈ ), respectively. Constraints (12) allow at most one visit to every customer in each time period and constraints (13) are subtour elimination constraints (SECs).…”

Section: Base Formulationmentioning

confidence: 99%

The consistent production routing problem

2022

View full text Add to dashboard Cite

This article introduces the consistent production routing problem in a setting with multiple plants and products. The problem consists in finding minimum‐cost production‐routing plans that also meet specific consistency requirements. In our context, consistency is defined as the degree to which some specified features of the solution remain invariant over time. We consider four forms of consistency, namely: driver, source, product, and plant consistency. For each of these consistency requirements, there is a target maximum value defining the decision‐maker's tolerance to deviations from a perfectly consistent solution. These targets are enforced as soft constraints whose violations need to be minimized when optimizing the integrated production and routing plan. We present a mathematical formulation for the problem and an exact branch‐and‐cut algorithm, enhanced with valid inequalities and specific branching priorities. We also propose a heuristic solution method based on iterated local search and several mathematical programming components. Experiments on a large benchmark set of newly introduced instances show that the enhancements substantially improve the performance of the exact algorithm and that the heuristic method performs robustly for production routing problems with different consistency requirements as well as for standard versions of the problem. We also analyze the cost‐consistency trade‐off of the solutions, confirming that it is possible to impose consistency without excessively increasing the cost. The results also reveal the impact of the first time period when optimizing and measuring the consistency features we study.

show abstract

“…Nananukul, 2009, 2010;Qiu et al, 2017), mixed integer programming (MIP) based heuristics (e.g. Absi et al, 2014;Brahimi and Aouam, 2016;Zhang et al, 2017;Solyalı and Süral, 2017;Russell, 2017;Miranda et al, 2018;Li et al, 2019), Lagrangian relaxation based heuristics (Fumero and Vercellis, 1999;Solyalı and Süral, 2009), and decomposition heuristics (Chandra, 1993;Chandra and Fisher, 1994;Lei et al, 2006;Boudia et al, 2008;Çetinkaya et al, 2009;Vahdani et al, 2017;Chitsaz et al, 2019;Avci and Yildiz, 2019). More recently, there has been interest in developing exact algorithms for the PRP.…”

Section: Literature Reviewmentioning

confidence: 99%

Solving a production-routing problem with price-dependent demand using an outer approximation method

Torkaman

Jokar

Mutlu

et al. 2020

Computers & Operations Research

View full text Add to dashboard Cite

DOI to the publisher's website.• The final author version and the galley proof are versions of the publication after peer review.• The final published version features the final layout of the paper including the volume, issue and page numbers. Link to publication General rightsCopyright and moral rights for the publications made accessible in the public portal are retained by the authors and/or other copyright owners and it is a condition of accessing publications that users recognise and abide by the legal requirements associated with these rights.• Users may download and print one copy of any publication from the public portal for the purpose of private study or research. • You may not further distribute the material or use it for any profit-making activity or commercial gain • You may freely distribute the URL identifying the publication in the public portal.If the publication is distributed under the terms of Article 25fa of the Dutch Copyright Act, indicated by the "Taverne" license above, please follow below link for the End User Agreement:

show abstract

A matheuristic solution approach for the production routing problem with visit spacing policy

Cited by 32 publications

References 43 publications

Optimization strategies for the integrated management of perishable supply chains: A literature review

Optimization strategies for the integrated management of perishable supply chains: A literature review

The consistent production routing problem

Solving a production-routing problem with price-dependent demand using an outer approximation method

Contact Info

Product

Resources

About