Effective local search approaches for the single-vehicle cyclic inventory routing problem

Zhong, Yan; Aghezzaf, El‐Houssaine

doi:10.1504/ijsoi.2012.052179

Cited by 8 publications

(38 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…To deal with larger instances of the SV-CIRP, Zhong and Aghezzaf (2012) present an iterated local search (ILS) metaheuristic. This is the best (meta)heuristic currently available to deal with the SV-CIRP.…”

Section: Literature Reviewmentioning

confidence: 99%

“…Since we also use the ILS framework for our algorithm, we will now discuss its general structure in more detail. However, our implementation of this framework is totally different from the implementation of Zhong and Aghezzaf (2012) and so will be the performance. We discuss the most important differences when we explain our algorithm in Section 5.…”

Section: Literature Reviewmentioning

confidence: 99%

“…In the improvement phase of Zhong and Aghezzaf (2012), four local search moves are considered that insert, remove and/or relocate customers in order to reduce the total cost. In order to diversify the search, pairs of customers are swapped randomly.…”

Section: Literature Reviewmentioning

confidence: 99%

“…A class of routing problems that currently gets a lot of attention are the Inventory Routing Problems (IRP), e.g. Dror and Ball (1987), Andersson et al (2010), Schmid et al (2013) and Zhong and Aghezzaf (2012). A typical characteristic of these routing problems is that inventory and handling costs at the customers are also taken into account.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

An iterated local search algorithm for the single-vehicle cyclic inventory routing problem

Vansteenwegen

Mateo

2014

European Journal of Operational Research

View full text Add to dashboard Cite

The Single-Vehicle Cyclic Inventory Routing Problem (SV-CIRP) belongs to the class of Inventory Routing Problems (IRP) in which the supplier optimises both the distribution costs and the inventory costs at the customers. The goal of the SV-CIRP is to minimise both kinds of costs and to maximise the collected rewards, by selecting a subset of customers from a given set and determining the quantity to be delivered to each customer and the vehicle routes, while avoiding stockouts. A cyclic distribution plan should be developed for a single vehicle.; We present an iterated local search (ILS) metaheuristic that exploits typical characteristics of the problem and opportunities to reduce the computation time. Experimental results on 50 benchmark instances show that our algorithm improves the results of the best available algorithm on average with 16.02%. Furthermore, 32 new best known solutions are obtained. A sensitivity analysis demonstrates that the performance of the algorithm is not influenced by small changes in the parameter settings of the ILS. (C) 2014 Elsevier B.V. All rights reserved.Peer ReviewedPostprint (published version

show abstract

Section: Literature Reviewmentioning

confidence: 99%

Section: Literature Reviewmentioning

confidence: 99%

Section: Literature Reviewmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

An iterated local search algorithm for the single-vehicle cyclic inventory routing problem

Vansteenwegen

Mateo

2014

European Journal of Operational Research

View full text Add to dashboard Cite

show abstract

“…They propose an adaptive large neighbourhood search heuristic for the routing and use a network flow algorithm to determine the delivery quantities and transhipment moves. Zhong and Aghezzaf (2012) propose a single-vehicle cyclic IRP, their objective was to select a subset of retailers to replenish quantities to be delivered to each, and design delivery routes that minimise the expected total distribution and inventory cost while maximising the total collected rewards. A mixed integer program with linear constraints and a nonlinear objective function and an effective iterated local search-based algorithm was developed to solve the problem.…”

Section: Introductionmentioning

confidence: 99%

An integrated production and distribution problem with direct shipment: a case from Moroccan bottled-water market

Lmariouh

Hachemi

Jamali

et al. 2019

IJOR

View full text Add to dashboard Cite

We consider an industrial application encountered in the Moroccan context that involves the production and distribution of bottled water. Our industrial partner owns one plant from which all requests are delivered in direct shipments and usually full truckloads to the customers (a set of regional depots and wholesalers). We must take into account the production, the delivery requirements, multiple products, and inventory levels. The objective is to minimise the sum of the production, transportation, and inventory costs. We propose a mixed integer linear program for a variant of the multi-vehicle, multi-product production routing problem. Experiments have been conducted using CPLEX 12.3.0, and almost all instances were solved with a reasonable optimality gap. The results show that significant savings can be obtained by using our approach with respect to the current company practice.

show abstract

The Multi-Vehicle Cyclic Inventory Routing Problem: Formulation and a Metaheuristic Approach

Widjaja

Gunawan

et al. 2021

Computers & Industrial Engineering

View full text Add to dashboard Cite

This paper presents a new variant of the Multi-Vehicle Cyclic Inventory RoutingProblem (MV-CIRP) which aims to determine a subset of customers to be visited, the appropriate number of vehicles used, and the corresponding cycle time and route sequence, such that the total cost (e.g. transportation, inventory, and rewards) is minimized. The MV-CIRP is formulated as a mixed-integer nonlinear programming model. We propose a Simulated Annealing (SA) based algorithm to solve the problem. SA is first tested on the available benchmark Single-Vehicle CIRP (SV-CIRP) instances and compared to the state-of-the-art algorithms. SA is then tested on the benchmark MV-CIRP instances and compared to optimization solver and a standard Iterated Local Search (MV-ILS) approach. Experimental results show that SA is able to obtain 9 new best known solutions when solving the SV-CIRP instances and outperforms both the optimization solver and the MV-ILS when solving the MV-CIRP instances. Furthermore, insights in the complexity of the MV-CIRP are discussed and illustrated.

show abstract

Effective local search approaches for the single-vehicle cyclic inventory routing problem

Cited by 8 publications

References 15 publications

An iterated local search algorithm for the single-vehicle cyclic inventory routing problem

An iterated local search algorithm for the single-vehicle cyclic inventory routing problem

An integrated production and distribution problem with direct shipment: a case from Moroccan bottled-water market

The Multi-Vehicle Cyclic Inventory Routing Problem: Formulation and a Metaheuristic Approach

Contact Info

Product

Resources

About