An Effective Hybrid Differential Evolution Algorithm Incorporating Simulated Annealing for Joint Replenishment and Delivery Problem with Trade Credit

Abstract

In practice, suppliers often provide retailers with forward financing to increase demand or decrease inventory. This paper proposes a new and practical joint replenishment and delivery (JRD) model by considering trade credit. However, because of the complex mathematical properties of JRD, high-quality solutions to the problem have eluded researchers. We design an effective hybrid differential evolution algorithm based on simulated annealing (HDE-SA) that can resolve this non-deterministic polynomial hard problem in a robust and precise way. After determining the suitable parameters by a parameter-tuning test, we verify the performance of the HDE-SA through numerical JRD examples. Compared with the results of other popular evolutionary algorithms, results of randomly generated JRDs indicate that HDE-SA can always obtain slightly lower total costs than differential evolution algorithm (DE) and genetic algorithm (GA) under different situations. Moreover, the convergence rate of the HDE-SA is higher than that of DE and GA. Thus, the proposed HDE-SA is a potential tool for the JRD with trade credit.

Design and Simulation of a Fuzzy Controller for Automatic Train Driving Based on Multi-swarm Optimization

“…Being a multi-objective optimization problem, the ATD can be solved by various algorithms, ranging from multi-objective particle swarm optimization (PSO) [4][5][6], predictive fuzzy control [7], multi-modal dynamic programming [8], the hybrid algorithm of the differential evolution (DE) and simulated annealing (SA) [9] to cellular automata algorithm [10].…”

Optimization model for the new coordinated replenishment and delivery problem with multi-warehouse

“…Sets and parameters D i,m demand rate of item i distributed through warehouse m (deliver to retailer i) h R i inventory holding cost of item i in retailer i per unit per unit time integer number that decides the outbound schedule of item i distributed through warehouse m; the upper and lower bounds of f i,m are f UB i;m and f LB i;m ; the matrix for all f i,m is F k i,m integer number that decides the replenishment schedule of item i distributed through warehouse m; the upper and lower bounds of k i,m are k UB i;m and k LB i;m ; the matrix for all k i,m is K T basic cycle time; the upper and lower bounds of T are T max and T min x i,m 0-1 variable, if x i,m ¼ 1, the path of item i distributed through warehouse m exists; otherwise, 0 1. Introduction Over the past few years, the coordinated replenishment problem (CRP) has been heavily studied (Zeng et al, 2016). For a CRP procedure, the cost of placing an order for a number of different items comprises two parts: a major ordering cost incurred whenever an order is placed, and this cost is independent of the number of different items in the order; and a minor ordering cost, which is decided by the number of different items in the order.…”

Economic ordering policy for non‐instantaneous deteriorating items with price and advertisement dependent demand and permissible delay in payment under inflation

“…Chung 14 gave a complete proof on the solution procedure for non-instantaneous deteriorating items with permissible delay in payment. Zeng et al 15 gave an effective hybrid differential evolution algorithm incorporating simulated annealing for joint replenishment and delivery problem with trade credit. Liao et al 16,17 determined optimal inventory policies considering two levels of trade credit.…”