Variable Neighborhood Search heuristic for the Inventory Routing Problem in fuel delivery

Popović, Dražen; Vidović, Milorad; Radivojević, Gordana

doi:10.1016/j.eswa.2012.05.064

Cited by 125 publications

(52 citation statements)

References 37 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Recently, Vidovic et al [13] also proposed a similar approach to Popovic et al [12], but the way they obtained the initial solution, as well as improving the solution are different. Firstly, they partially solved the MIP model (relaxed MIP model) to obtain the initial solution, and then improving the solution by using a variable neighborhood descent (VND) search.…”

Section: Related Literaturementioning

confidence: 99%

See 1 more Smart Citation

Optimization Approach for Multi-Period Fuel Replenishment

Charusakwong¹,

Lohatepanont²

2016

View full text Add to dashboard Cite

Abstract. This paper proposes mathematical models and solution approaches for solving the multi-period fuel replenishment planning problem. The model aims to search for a set of routes, determining the quantity of several petroleum products to be loaded on individual vehicle compartments, and specifying the quantity to be discharged to customer tanks over a given planning horizon in which multiple constraints are satisfied. The objective function is to minimize the transportation unit cost, equal to the total transportation cost divided by the sum of replenished quantity. As the model size grows exponentially when the number of customers, vehicles, and time period increases, an exact algorithm is not feasible. Hence, in this study, we propose two heuristic approaches: twophase method (2PM) and three-phase method (3PM). The 2PM is primarily designed for solving small problems whereas the 3PM adopts a similar approach but has the ability to solve larger problems. The proposed solutions were tested using a real-life scenario and randomly generated test instance. The results showed that our solution outperforms the solution constructed by experienced planners and also proved that considering multiple periods when devising the fuel replenishment plan, gives superior results in comparison to single periods.

show abstract

Section: Related Literaturementioning

confidence: 99%

“…Popovic et al [12] proposed VNS heuristics to solve multi-product multi-period inventory routing problem in fuel delivery. Their proposed technique is based on a constructive heuristic or random feasible solution.…”

Section: Related Literaturementioning

confidence: 99%

Optimization Approach for Multi-Period Fuel Replenishment

Charusakwong¹,

Lohatepanont²

2016

View full text Add to dashboard Cite

show abstract

“…A heuristic algorithm was devised to solve the problem. Popovic et al [16] aimed at IRP in the refined oil logistics. An improved variable neighborhood search algorithm was introduced to solve the joint optimization model of the inventory and routing.…”

Section: Refined Oil Distribution Optimizationmentioning

confidence: 99%

Optimization of Inventory Routing Problem in Refined Oil Logistics with the Perspective of Carbon Tax

2018

View full text Add to dashboard Cite

Abstract:In order to solve the optimization problem of the refined oil distribution system from the perspectives of low-carbon and environmental protection, this paper focuses on the characteristics of the secondary distribution of refined oil and combines it with the integrated optimization concept of refined oil distribution network, where a low-carbon inventory routing problem (LCIRP) model is constructed with the minimum total costs as the objective function on the basis of considering carbon emissions. An adaptive genetic algorithm combined with greedy algorithm is designed to solve the model, and an example is given to verify the effectiveness of the algorithm. Then, this paper solves the model with two parts by introducing a practical numerical example: in the first part, the LCIRP models with different carbon tax values are solved, which verifies the effectiveness of the model and proves that carbon tax policies can effectively reduce the carbon emissions in the secondary distribution network of refined oil; in the second part, the LCIRP models with the different maximum load capacity of oil tank trucks are solved, which provides the economic and environmentally friendly distribution schemes for refined oil distribution enterprises under the premise of carbon tax policies and load limitation. Finally, the emission reduction proposals that take into account both economic and environmental benefits are given respectively from the aspect of government environmental protection agencies and from the aspect of refined oil distribution enterprises.

show abstract

“…The objective is the minimization of the summation of the inventory and transportation costs. Popović et al (2012) developed a Variable Neighborhood Search (VNS) heuristic for solving a multi-product multi-period IRP in fuel delivery with multi-compartment homogeneous vehicles, and deterministic consumption that varies with each petrol station and each fuel type.…”

Section: Heuristic Algorithmmentioning

confidence: 99%

A simulation optimization approach to apply value at risk analysis on the inventory routing problem with backlogged demand

Abdollahi¹,

Arvan²,

Omidvar³

et al. 2014

10.5267/j.ijiec

View full text Add to dashboard Cite

Inventory Routing Problem (IRP) is defined as the combination of vehicle routing, inventory management and delivery scheduling decisions. In this study, a model for a basic inventory routing problem is proposed, which controls the risk of exceeding capital dedicated to an IRP with a value at risk (VaR) measure. It is assumed that the structure of the basic model is one to many, the time horizon is single period and fleet composition is homogeneous. The objective of the model is to minimize the expected total cost over a planning horizon at the same time considering the affordable risk. Since a stochastic IRP is an NP-hard problem and considering VaR makes it more complex, it is not feasible to solve the large-scale problems through an exact model. Hence, a new simulation optimization procedure is proposed to solve the problem. Finally, a numerical example is presented to demonstrate its accuracy and applicability.

show abstract

Variable Neighborhood Search heuristic for the Inventory Routing Problem in fuel delivery

Cited by 125 publications

References 37 publications

Optimization Approach for Multi-Period Fuel Replenishment

Optimization Approach for Multi-Period Fuel Replenishment

Optimization of Inventory Routing Problem in Refined Oil Logistics with the Perspective of Carbon Tax

A simulation optimization approach to apply value at risk analysis on the inventory routing problem with backlogged demand

Contact Info

Product

Resources

About