Sciweavers

1090 search results - page 21 / 218
» Priority Algorithms for Graph Optimization Problems
Sort
View
AISS
2010
161views more  AISS 2010»
13 years 5 months ago
Two GRASP Metaheuristic for the Capacitated Vehicle Routing Problem Considering Split Delivery and Solving the Three Dimensional
The vehicle routing problem consists in determining a group of optimal delivery routes that allow satisfaction of the demand from customers spread along a network, which can be re...
Joseph Gallart Suarez, Manuel Tupia Anticona
COCOON
2005
Springer
14 years 1 months ago
Power Domination Problem in Graphs
To monitor an electric power system by placing as few phase measurement units (PMUs) as possible is closely related to the famous vertex cover problem and domination problem in gr...
Chung-Shou Liao, Der-Tsai Lee
CEC
2008
IEEE
14 years 2 months ago
Path optimization for multiple objectives in directed graphs using genetic algorithms
Abstract— This paper presents a genetic algorithmic approach for finding efficient paths in directed graphs when optimizing multiple objectives. Its aim is to provide solutions...
Juan Rada, Ruben Parma, Wilmer Pereira
ICGA
1993
296views Optimization» more  ICGA 1993»
13 years 9 months ago
A Genetic Algorithm Applied to the Maximum Flow Problem
A genetic algorithms is applied to find a maximum flow from the source to sink in a weighted directed graph, where the weight associated with each edge represents its flow capacit...
Toshinori Munakata, David J. Hashier
ICPP
2008
IEEE
14 years 2 months ago
A List-Based Strategy for Optimal Replica Placement in Data Grid Systems
—Data replications is a typical strategy for improving access performance and data availability in Data Grid systems. Current works on data replication in Grid systems focus on t...
Yi-Fang Lin, Jan-Jan Wu, Pangfeng Liu