scholarly journals A Multi Logistics Network Optimization Model of Power System based on Stochastic Demand and Inventory Decision

2021 ◽  
Vol 15 ◽  
pp. 1057-1061
Author(s):  
Youpeng Zhang ◽  
Jibin Zhu ◽  
Yunxin Chang ◽  
Yonghao Guo ◽  
Chaofeng Zhu
Keyword(s):  
Double Layer ◽  
Optimization Model ◽  
Ant Colony Algorithm ◽  
Transportation Cost ◽  
Arc Routing ◽  
Routing Problem ◽  
Logistics Network ◽  
Purchase Cost ◽  
Inventory Decision ◽  
Capacitated Arc Routing

According to the disposal demand for packets and all kinds of constraints in the current condition, this paper discusses a modeling method of extended double-layer capacitated arc routing problems with Capacitated Arc Routing Problem (CARP) optimization model based on express logistics. The model is described in detail, and the solution of the model is discussed. The paper analyses and discusses the solution to complexity of the model, and proposes a better solution to the double-layer CARP optimization model. According to the scheme, the paper chooses a sort of improved ant colony algorithm to solve the model. And the results show that the scheme is beneficial to controlling the cost of logistics links, to minimizing purchase cost, transportation cost and delivery time. The scheme plays a very imperative role in enhancing the competitiveness of enterprises

scholarly journals Open capacitated arc routing problem by hybridized ant colony algorithm

2021 ◽  
Author(s):  
Bilal Kanso ◽  
Ali Kansou ◽  
Adnan Yassine
Keyword(s):  
Ant Colony Algorithm ◽  
Search Algorithm ◽  
Ant Colony ◽  
Arc Routing ◽  
Local Search Algorithm ◽  
Routing Problem ◽  
Capacitated Arc Routing Problem ◽  
Cost Distance ◽  
Benchmark Instances ◽  
Capacitated Arc Routing

The Open Capacitated Arc Routing Problem OCARP is a well-known NP-hard real-world combinatorial optimization problem. It consists of determining optimal routes for vehicles in a given service area at a minimal cost distance. The main real application for OCARP is the Meter Reader Routing Problem (MRRP). In MRRP problem, each worker in the electric (or gas) company must visit and read the electric (or gas) meters to a set of customers by starting his route from the first customer on his visit list and finishing with the last one. The worker leaves where he wants once all the associated customers have been visited. In this paper, a meta-heuristic called an Hybridized Ant Colony Algorithm (HACA) is developed and hybridized with a local search algorithm that involves the 2-opt, Swap, Relocate and Cross-exchange moves to solve OCARP problem. Computational results conducted on five different sets of OCARP-instances showed that our proposed algorithm HACA has reached good and competitive results on  benchmark instances for the problem.

Sign in / Sign up

Export Citation Format

Share Document