4.7 Article

A hybrid imperialist competitive-simulated annealing algorithm for a multisource multi-product location-routing-inventory problem

Journal

COMPUTERS & INDUSTRIAL ENGINEERING
Volume 101, Issue -, Pages 116-127

Publisher

PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.cie.2016.08.027

Keywords

Location-routing-inventory Problem; Split-sourcing; Facility location; Inventory control problem; Vehicle routing; Imperialist competitive algorithm

Ask authors/readers for more resources

This article studies a multi-product and multi-period location-routing-inventory problem in which location-allocation, inventory and routing decisions are to be taken in a three-level supply chain including suppliers, depots and customers. Products are distributed from depots to customers by a homogeneous fleet of vehicles. Backlogging is allowable on condition that the backlog quantity of each customer does not exceed a predefined fraction of his demand. A mixed-integer programming formulation is presented to describe the problem then a new hybrid heuristic algorithm based on the simulated annealing and imperialist competitive algorithm is designed to solve the model. Comprehensive numerical examples are presented to evaluate the efficiency of proposed algorithm. In addition, the proposed algorithm is compared with simulated annealing algorithm in small and large size instances. The results show that imperialist competitive-simulated annealing (IC-SA) algorithm outperforms simulated annealing (SA) algorithm in terms of solution quality and CPU time. (C) 2016 Elsevier Ltd. All rights reserved.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.7
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
Article Computer Science, Interdisciplinary Applications

Environmental cold chain distribution center location model in the semiconductor supply chain: A hybrid arithmetic whale optimization algorithm

Xiaolin Wang, Liyi Zhan, Yong Zhang, Teng Fei, Ming-Lang Tseng

Summary: This study proposes an environmental cold chain logistics distribution center location model to reduce transportation costs and carbon emissions. It also introduces a hybrid arithmetic whale optimization algorithm to overcome the limitations of the conventional algorithm.

COMPUTERS & INDUSTRIAL ENGINEERING (2024)

Article Computer Science, Interdisciplinary Applications

Blockchain-enabled integrated model for production-inventory-delivery problem in Physical Internet

Hong-yu Liu, Shou-feng Ji, Yuan-yuan Ji

Summary: This study proposes an architecture that utilizes Ethereum to investigate the production-inventory-delivery problem in Physical Internet (PI), and develops an iterative heuristic algorithm that outperforms other algorithms. However, due to gas prices and consumption, blockchain technology may not always be the optimal solution.

COMPUTERS & INDUSTRIAL ENGINEERING (2024)

Article Computer Science, Interdisciplinary Applications

The fuzzy human-robot collaboration assembly line balancing problem

Paraskevi Th. Zacharia, Elias K. Xidias, Andreas C. Nearchou

Summary: This article discusses the assembly line balancing problem in production lines with collaborative robots. Collaborative robots have the potential to improve automation, productivity, accuracy, and flexibility in manufacturing. The article explores the use of a problem-specific metaheuristic to solve this complex problem under uncertainty.

COMPUTERS & INDUSTRIAL ENGINEERING (2024)