A Heuristic Branch-Cut-and-Price Algorithm for the ROADEF/EURO Challenge on Inventory Routing

Absi, Nabil; Cattaruzza, Diego; Feillet, Dominique; Ogier, Maxime; Semet, Frédéric

doi:10.1287/trsc.2019.0961

Cited by 8 publications

(5 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Constraint (6) ensures the maximum allowable loss of products and constraint (7) shows the supply capacity. Constraint (8) implies that products with different ages can be used to satisfy demand.…”

Section: Tgs Imentioning

confidence: 99%

“…The integrated supply and distribution management of blood is more sophisticated than the other products. This includes making joint decisions on the number of products to be supplied and distributed to blood centers, the level of inventory to be held, and the vehicle routing [8]. However, the efficient coordination of these decisions is a challenging task due to product shortage and waste, especially when it comes to uncertain situations [9][10][11].…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

A solution algorithm for integrated production-inventory-routing of perishable goods with transshipment and uncertain demand

Лю

Hendalianpour²,

Razmi

et al. 2021

Complex Intell. Syst.

View full text Add to dashboard Cite

Supply and distribution management of blood products is a challenging task due to their short lifespan. The problem is even more sophisticated considering uncertain demand for these products. This paper addresses integrated inventory-routing of blood in a supply chain network consisting of a single supplier and a group of blood centers. Transshipment among blood centers is allowed to decrease the cost of excess inventory and shortage of goods. A mathematical model is developed that decides on the optimal quantity of supplied blood, delivery plan, inventory level, and quantity of products transshipped between blood centers with the objective of minimizing total costs. In addition, a robust optimization approach is adopted to deal with uncertainty in demand. Since the proposed model is NP-hard, a heuristic solution algorithm is developed that improves solution quality by determining the most efficient change in vehicle routes in each search stage. The efficiency of the proposed algorithm is examined in a set of numerical experiments and using data from a real case of supply and distribution management of blood platelets. The results indicated that allowing transshipment reduces the need for supply capacity at the supplier, product shortage, inventory level, and the total cost.

show abstract

Section: Tgs Imentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

A solution algorithm for integrated production-inventory-routing of perishable goods with transshipment and uncertain demand

Лю

Hendalianpour²,

Razmi

et al. 2021

Complex Intell. Syst.

View full text Add to dashboard Cite

show abstract

“…For each simplified instance k, columns 2 and 3 of Table 3 indicate, respectively, the value of the best known solution obtained in [1], and the best value obtained by us. In the Table 4, HBCP is the Heuristic Branch-Cut-and-Price Algorithm developed in [17]. They used a computer with Intel(R) Core(TM) i7-5600U CPU @ 2.60 GHz and Cplex 12.6 to run their algorithm.…”

Section: Resultsmentioning

confidence: 99%

“…One of them, ref. [17], developed a branch-cut-and-price algorithm was developed. They used a surrogate relaxation in the constraints.…”

Section: Related Workmentioning

confidence: 99%

Iterated Local Search Approach to a Single-Product, Multiple-Source, Inventory-Routing Problem

Alonso-Pecina,

Hérnandez-Báez,

López-Díaz

et al. 2024

Mathematics

View full text Add to dashboard Cite

We address an inventory-routing problem that arises in a liquid oxygen-producing company. Decisions must be made for the efficient transport of the product from sources to destinations by means of a heterogeneous fleet of trucks. This combinatorial problem has been stated as a constrained minimization one, whose objective function is the quotient of the operating cost divided by the total amount of delivered product. The operating cost comes from the distances traveled, the drivers’ salary, and the drivers’ overnight accommodation. The constraints include time windows for drivers and destinations, inventory safety levels, lower bounds for the quantity of product delivered to destinations, and maximum driving times. To approximate the optimal solution of this challenging problem, we developed a heuristic algorithm that first finds a feasible solution, and then iteratively improves it by combining the Metropolis criterion with local search. Our results are competitive with the best proposals in the literature.

show abstract

“…Other recent literature include an inventory routing challenge raised in Adrei et al ( 2020) that a single-product, heterogeneous fleet, variable but deterministic demand, finite horizon problem is considered. Kheiri (2020), Absi et al (2020), Su et al (2020), and He et al (2020 proposed solutions to this complex problem, where Kheri (2020) proposed a sequence-based selection hyper-heuristic, Absi et al (2020) proposed a branch-cut-and-price heuristic and Su et al (2020) proposed a search-based heuristic. Anily and Federgruen (1990a) was the first to propose a clustering approach to the Integrated Inventory and Vehicle Routing Problem.…”

Section: Literature Surveymentioning

confidence: 99%

A bin-packing based heuristic for the integrated inventory and vehicle routing problem

Yang

View full text Add to dashboard Cite

A Heuristic Branch-Cut-and-Price Algorithm for the ROADEF/EURO Challenge on Inventory Routing

Cited by 8 publications

References 14 publications

A solution algorithm for integrated production-inventory-routing of perishable goods with transshipment and uncertain demand

A solution algorithm for integrated production-inventory-routing of perishable goods with transshipment and uncertain demand

Iterated Local Search Approach to a Single-Product, Multiple-Source, Inventory-Routing Problem

A bin-packing based heuristic for the integrated inventory and vehicle routing problem

Contact Info

Product

Resources

About