The vehicle routing problem (VRP) is one of the most famous combinatorial optimization problems and has been intensively studied due to many practical applications in field distribution, collection, logistics, etc. We study a generalization VRP called generalized (GVRP) where given partition nodes graph into node sets we want find optimal routes from depot number predefined clusters which include exactly each cluster. purpose this paper present heuristic algorithms solve approximately....

The clustered shortest-path tree problem (CluSPTP) is an extension of the classical single-source problem, in which, given a graph with set nodes partitioned into predefined, mutually exclusive and exhaustive clusters, we are looking for spanning from source to all other graph, property that each cluster should induce connected subtree. CluSPTP belongs class generalized combinatorial optimization problems, and, general, proved be non-deterministic polynomial time hard (NP-hard) problem. In...

This paper is focusing on an important transportation application encountered in supply chains, namely the capacitated two-stage fixed-charge problem. For solving this complex optimization problem we described a novel hybrid heuristic approach obtained by combining genetic algorithm based hash table coding of individuals with powerful local search procedure. The proposed was implemented and tested often used collection benchmark instances computational results showed that our delivered...

Views Icon Article contents Figures & tables Video Audio Supplementary Data Peer Review Share Twitter Facebook Reddit LinkedIn Tools Reprints and Permissions Cite Search Site Citation Petrica Claudiu Pop, Camelia Pintea, Ioana Zelina, Dan Dumitrescu; Solving the Generalized Vehicle Routing Problem with an ACS‐based Algorithm. AIP Conf. Proc. 16 April 2009; 1117 (1): 157–162. https://doi.org/10.1063/1.3130618 Download citation file: Ris (Zotero) Reference Manager EasyBib Bookends Mendeley...

The clustered shortest-path tree problem is an extension of the classical single-source problem, in which, given a graph with set nodes divided into redefined, mutually exclusive and exhaustive clusters, we want to determine spanning from source all other graph, property that each cluster should induce connected subtree. investigated proved be NP-hard therefore proposed efficient genetic algorithm order solve it. preliminary computational results reported on benchmark instances literature...

The security of networks systems is nowadays a very challenging issue. artificial intelligence mechanisms applied to are rather scarce. aim the present article describe new general defence mechanism, based on multi-agents in order stop jamming attacks Wireless Sensor Network (WSN). We analyse and discuss reaction sensitive agents several stigmergic variables keep tracks intruders sensor network. As well, it illustrated way which detected isolated using groups direct communication. proposed...

Nowadays, demicontractive operators in terms of admissible perturbation are used to solve difficult tasks. The current research uses several order enhance the quality edge detection results when using ant-based algorithms. Two new introduced, χ -operator and K H -operator, latter one is a Krasnoselskij operator. In test efficiency operators, comparison made with trigonometric Ant Colony Optimization (ACO) solver chosen for images problem. Demicontractive during construction phase matrix ants...

The interconnection network is an essential component of a distributed system or supercomputer based on large-sale parallel processing.Because in systems the communication between processors message exchange, topology great importance.The can be seen as graph and properties studied using combinatorics theory.A number topologies have been studied.The Extended Fibonacci Cube, EFC, which provides good for regarding diameter, node degree, recursive decomposition, embeddability algorithms.In this...

In this paper we aim to use a demicontractive operator in terms of admissible perturbations an ant colony optimization (ACO) algorithm for edge detection medical images. Two are used. Practical results presented. Comparison with using different operators made.

The interconnection network is an essential aspect of a distributed system or supercomputer based on large-sale parallel processing. In the case direct processor communicates using links only with its neighbors that means topology great importance. can be seen as graph and properties studied combinatorics theory. communication very important issue in networks for systems because exchange information message exchange. A number hypercube, cube connected cycles, de Bruijn, star-graph, pancake...

The hypercube is one of the best model for network topology a distributed system. In this paper we determine cube polynomial Extended Fibonacci Cubes, which counting number induced k-dimensional hypercubes in Cubes.

Just about everything changes, and so should a software quality model in order to provide better understanding of for any product which is applied. But how can we develop such model? A pattern that be adapted different products, an accurate evaluation the overall quality. This paper presents adaptable intended used products.

This paper investigates the clustered shortest-path tree (CluSPT) problem, a generalized network design problem that has several applications in various areas such as design, agricultural irrigation settings, distribution of goods and products, etc. The main characteristic investigated is its hierarchical structure with nodes underlying graph split up into given number clusters aim finding spanning from predefined source node to all other graph, property every cluster should generate...