Niching Pareto Ant Colony Optimization Algorithm for Bi-Objective Pathfinding Problem
نویسندگان
چکیده
منابع مشابه
Solving a Bi-objective Vehicle Routing Problem by Pareto-Ant Colony Optimization
In this paper we propose the application of Pareto ant colony optimization (PACO) in solving a bi-objective capacitated vehicle routing problem with route balancing (CVRPRB). The objectives of the problem are minimization of the tour length and balancing the routes. We propose PACO as our response to the deficiency of the Pareto-based local search (P-LS) approach which we also developed to solv...
متن کاملPareto Set-based Ant Colony Optimization for Multi-Objective Surgery Scheduling Problem
Surgery scheduling determines the individual surgery’s sequence and assigns required resources. This task plays a decisive role in providing timely treatment for the patients while ensuring a balanced hospital resources’ utilization. Considering several real life constraints associated with multiple resources during the complete 3-stage surgery flow, a surgery scheduling model is presented with...
متن کاملAnt Colony Optimization for Multi-objective Digital Convergent Product Network
Convergent product is an assembly shape concept integrating functions and sub-functions to form a final product. To conceptualize the convergent product problem, a web-based network is considered in which a collection of base functions and sub-functions configure the nodes and each arc in the network is considered to be a link between two nodes. The aim is to find an optimal tree of functionali...
متن کاملA New Algorithm for Constructing the Pareto Front of Bi-objective Optimization Problems
Here, scalarization techniques for multi-objective optimization problems are addressed. A new scalarization approach, called unified Pascoletti-Serafini approach, is utilized and a new algorithm to construct the Pareto front of a given bi-objective optimization problem is formulated. It is shown that we can restrict the parameters of the scalarized problem. The computed efficient points provide...
متن کامل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 ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2018
ISSN: 2169-3536
DOI: 10.1109/access.2018.2822824