Presenting a Joint Replenishment-location Model Under all-units Quantity Discount and Solving by Genetic Algorithm and Harmony Search Algorithm

Authors

Abstract:

In this paper a model is proposed for distribution centers location and joint replenishment of a distribution system that is responsible for orders and product delivery to distribution centers. This distribution centers are under limitedwarehouse space and this can determine amount of requirement product by considering proposed discount.The proposed model is develop to minimize total costs consists of location, ordering, purchaseunder All-units quantity discount condition and items maintenance by adjustment Frequency of replenishment in each distribution center. To solve this model, first we solve the model with genetic algorithm by confining the time between too replenishments then by use of the Quantity Discount RAND algorithm method the upper and lower limits of the time between two replenishments will be determined. After obtaining the optimal upper and lower limits, the model will be resolved by harmony search and genetic algorithms. The results show that the presented chromosome structure is so efficient so that the statistical experiments result indicates there isn’t much difference between solution means after finding the optimal upper and lower limits. We used response surface methodology for tune proposed algorithms parameters. Efficiency of proposed algorithms is examined by diverse examples in different dimensions. Results of these experiments are compared by using of ANOVA and TOPSIS with indexes of objective function value and algorithms runtime. In both comparisons harmony search algorithm has more efficiency than genetic algorithm.

Upgrade to premium to download articles

Sign up to access the full text

Already have an account?login

similar resources

Solving Unit Commitment Problem in Microgrids by Harmony Search Algorithm in Comparison with Genetic Algorithm and Improved Genetic Algorithm

This article presents a Harmony Search Algorithm to solve the unit commitment (UC) problem. A micro grid includes various types of smart distributed generators, renewable generators, storage devices and controllable load. A micro grid must satisfy its local needs and should be under the hierarchical control of management system. Due to this combination of conventional and renewable sources, the...

full text

The freight allocation problem with all-units quantity-based discount: A heuristic algorithm

This paper studies a problem encountered by a buying office for one of the largest retail distributors in the world. An important task for the buying office is to plan the distribution of goods from Asia to various destinations across Europe. The goods are transported along shipping lanes by shipping companies, which offer different discount rates depending on the freight quantity. To increase ...

full text

Multiple sourcing under supplier failure risk and quantity discount: A genetic algorithm approach

This paper investigates an order allocation problem of a manufacturer/buyer among multiple suppliers under the risks of supply disruption. A mixed integer non-linear programming (MINLP) model is developed for order allocation considering different capacity, failure probability and quantity discounts for each supplier. We have shown that the formulated problem is NP-hard in nature and genetic al...

full text

A joint pricing-network design model for a resilient closed-loop supply chain under quantity discount

In this paper, a novel resilient multi-echelon closed-loop location-allocation-inventory problem (RMCLIP) is addressed that optimizes strategic and tactical decisions simultaneously. In order to represent the purchasing cost of raw material from the supplier, a pricing model under quantity discounts is employed in the closed-loop supply chain (CLSC). Considering the capability of returning the ...

full text

A Hybrid Algorithm using Firefly, Genetic, and Local Search Algorithms

In this paper, a hybrid multi-objective algorithm consisting of features of genetic and firefly algorithms is presented. The algorithm starts with a set of fireflies (particles) that are randomly distributed in the solution space; these particles converge to the optimal solution of the problem during the evolutionary stages. Then, a local search plan is presented and implemented for searching s...

full text

An improved self-adaptive harmony search algorithm for joint replenishment problems

To solve joint replenishment problems (JRPs) effectively and efficiently which are typical NP-hard problems, an improved self-adaptive harmony search algorithm (ISHS) is designed. The proposed algorithm applies differential evolution mutation strategies to HS. Experimental results show that ISHS outperforms other start-of-art algorithms on both tested benchmark functions and typical JRPs.

full text

My Resources

Save resource for easier access later

Save to my library Already added to my library

{@ msg_add @}


Journal title

volume 13  issue 1

pages  55- 66

publication date 2020-03-01

By following a journal you will be notified via email when a new issue of this journal is published.

Hosted on Doprax cloud platform doprax.com

copyright © 2015-2023