Application of Ant Colony Algorithm and Grey Relation Theory in Selecting Cooperative Manufacturing Partner

2006 ◽  
Vol 532-533 ◽  
pp. 1104-1107
Author(s):  
Ya Dong Fang ◽  
Wei Ping He ◽  
Lai Hong Du ◽  
Jin Liang Chen ◽  
Feng Zhao ◽  
...  
Keyword(s):  
Ant Colony Algorithm ◽  
Partner Selection ◽  
Transportation Cost ◽  
Ant Colony ◽  
Selection Problem ◽  
Relation Theory ◽  
Cooperative Enterprise ◽  
Grey Relation Coefficient ◽  
Working Procedure ◽  
Grey Relation

According to requirement of cooperative manufacturing partner selection based on networked manufacturing environment, the paper resolves cooperative manufacturing partner selection problem by ant colony algorithm and grey relation theory: Firstly, manufacturing task is divided into series of working procedure in time order by technologic planning. Secondly, considerable candidate enterprises are selected in terms of multi-hierarchy grey relation coefficient at each working procedure node to reduce the size of problem. Lastly, cooperative enterprise selecting path is decided by making use of ant colony algorithm in light of transportation cost.

scholarly journals Optimal path selection of multimodal transport based on Ant Colony Algorithm

2021 ◽  
Vol 2083 (3) ◽  
pp. 032011
Author(s):  
Dayun Ge
Keyword(s):  
Ant Colony Algorithm ◽  
Optimal Path ◽  
Minimum Cost ◽  
Transportation Cost ◽  
Path Selection ◽  
Transport Network ◽  
Ant Colony ◽  
Practical Significance ◽  
Container Transportation ◽  
Multimodal Transport

Abstract In the process of multimodal transport, the cost and time of transportation are particularly important. In order to avoid unreasonable container transportation and unnecessary waste of transportation capacity and transportation cost, we must effectively integrate the advantages of various transportation modes, select the most suitable transportation mode and the most reasonable transportation path, and take the minimum cost and time as the goal to ensure the smooth transportation of goods to the destination. Therefore, optimizing multimodal transport network has very important practical significance. This paper starts with the multimodal transport network under a single task, designs the solution method of the model combined with ant colony algorithm, and gives an example. Finally, the model and algorithm design are proved to be reasonable by using MATLAB solution algorithm.

scholarly journals Modeling Multilevel Supplier Selection Problem Based on Weighted-Directed Network and Its Solution

2017 ◽  
Vol 2017 ◽  
pp. 1-12 ◽  
Author(s):  
Chia-Te Wei ◽  
Hong Zuo ◽  
Chang-Bing Jiang ◽  
Shu-fang Li
Keyword(s):  
Supply Chain ◽  
Tabu Search ◽  
Evaluation System ◽  
Supplier Selection ◽  
Ant Colony Algorithm ◽  
Ant Colony ◽  
Selection Problem ◽  
Global Network ◽  
Directed Network ◽  
The Right

With the rapid development of economy, the supplier network is becoming more and more complicated. It is important to choose the right suppliers for improving the efficiency of the supply chain, so how to choose the right ones is one of the important research directions of supply chain management. This paper studies the partner selection problem from the perspective of supplier network global optimization. Firstly, this paper discusses and forms the evaluation system to estimate the supplier from the two indicators of risk and greenness and then applies the value as the weight of the network between two nodes to build a weighted-directed supplier network; secondly, the study establishes the optimal combination model of supplier selection based on the global network perspective and solves the model by the dynamic programming-tabu search algorithm and the improved ant colony algorithm, respectively; finally, different scale simulation examples are given to testify the efficiency of the two algorithms. The results show that the ant colony algorithm is superior to the tabu search one as a whole, but the latter is slightly better than the former when network scale is small.

scholarly journals Route Optimization of Electric Vehicle considering Soft Time Windows and Two Ways of Power Replenishment

2020 ◽  
Vol 2020 ◽  
pp. 1-10 ◽  
Author(s):  
Ming Meng ◽  
Yun Ma
Keyword(s):  
Vehicle Routing ◽  
Electric Vehicle ◽  
Ant Colony Algorithm ◽  
Time Windows ◽  
Transportation Cost ◽  
Ant Colony ◽  
Route Optimization ◽  
Research Experience ◽  
Penalty Cost ◽  
Routing Optimization

Under the background of severe air pollution and energy shortage, electric vehicles (EVs) are promising vehicles to support green supply chain and clean production. In the world, the renewal of EVs has become a general trend. Therefore, the concern about EVs is a hot issue at present, but EVs have the characteristics of limited driving distance and long charging time. When the EVs are used in logistics transportation, these characteristics have a significant impact on the vehicle routing problems. Therefore, based on the research experience of traditional vehicle routing optimization, combining with the characteristics of EVs, this paper presents an optimal problem of electric vehicle routes with time windows based on two charging methods and it also designs a mathematical model which was caused by early and late arrival as the objective function to minimize the transportation cost, vehicle use cost, power supply cost, and penalty cost. The model is solved using an ant colony algorithm. Finally, the ant colony algorithm is tested and analysed with an example.

Ant Colony Algorithm for Two Stage Supply Chain

2014 ◽  
pp. 143-155
Author(s):  
R. Sridharan ◽  
Vinay V. Panicker
Keyword(s):  
Supply Chain ◽  
Ant Colony Optimization ◽  
Ant Colony Algorithm ◽  
Transportation Cost ◽  
Allocation Problem ◽  
Ant Colony ◽  
Computational Time ◽  
Fixed Cost ◽  
Two Stage ◽  
Transportation Routes

This chapter focuses on the distribution-allocation problem with fixed cost for transportation routes in a two-stage supply chain. The supply chain considered in this research consists of suppliers, distributors and customers. Each transportation route is associated with a fixed charge (or a fixed cost) and a transportation cost per unit transported. The presence of this fixed cost makes the problem difficult to solve. This motivates the researchers to develop heuristics based on non-traditional optimization techniques that can provide near-optimal solutions in reasonable time. In this research, an ant colony optimization based heuristic is proposed to solve a distribution-allocation problem with fixed cost for transportation routes in a two-stage supply chain. The comparative analysis carried out in this study reveals that the solutions obtained using proposed heuristic are better than those obtained using an existing heuristic in terms of total cost and computational time. In addition, special emphasis is placed in developing heuristics based on ant colony optimization for solving supply chain related problems and identifying opportunities for further research in this area.

Sign in / Sign up

Export Citation Format

Share Document