A New Ant Colony Optimization Algorithm to Solve the Periodic Capacitated Arc Routing Problem with Continuous Moves
نویسندگان
چکیده
منابع مشابه
Ant Colony System for the Periodic Capacitated Arc Routing Problem
In this paper, we present a new Ant Colony System (ACS) approach for the Periodic Capacitated Arc Routing Problem (PCARP) on a mixed network. In the CARP problem the objective is to find routes starting from the depot such that each required arc/edge (called task) is serviced, capacity constraints are satisfied and total travel cost is minimized. The PCARP extends the classical CARP problem to ...
متن کاملA hybrid ant colony optimization algorithm to optimize capacitated lot-sizing problem
The economical determination of lot size with capacity constraints is a frequently complex, problem in the real world. In this paper, a multi-level problem of lotsizing with capacity constraints in a finite planning horizon is investigated. A combination of ant colony algorithm and a heuristic method called shifting technique is proposed for solving the problem. The parameters, including the co...
متن کاملA Hybrid Heuristic Algorithm to Solve Capacitated Location-routing Problem With Fuzzy Demands
In this paper, the capacitated location-routing problem with fuzzy demands (CLRP-FD) is considered. The CLRP-FD is composed of two well-known problems: facility location problem and vehicle routing problem. The problem has many real-life applications of which some have been addressed in the literature such as management of hazardous wastes and food and drink distribution. In CLRP-FD, a set of c...
متن کاملAnt Colony Algorithm for the Single Loop Routing Problem
In this paper, a new algorithm for solving the single loop routing problem is presented. The purpose of the single loop routing problem(SLRP) is to find the shortest loop for an automated guided vehicle covering at least one edge of each department of a block layout. First it shown that this problem can be represented as a graph model. Then a meta-heuristic algorithm based on and colony system ...
متن کاملAnt Colony Algorithm for the Single Loop Routing Problem
In this paper, a new algorithm for solving the single loop routing problem is presented. The purpose of the single loop routing problem(SLRP) is to find the shortest loop for an automated guided vehicle covering at least one edge of each department of a block layout. First it shown that this problem can be represented as a graph model. Then a meta-heuristic algorithm based on and colony system ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Problems in Engineering
سال: 2019
ISSN: 1024-123X,1563-5147
DOI: 10.1155/2019/3201656