Sciweavers

38 search results - page 3 / 8
» Variable neighborhood search for the dial-a-ride problem
Sort
View
HEURISTICS
2002
88views more  HEURISTICS 2002»
13 years 5 months ago
The Parallel Variable Neighborhood Search for the p-Median Problem
Félix García-López, Bel&eacut...
HEURISTICS
2002
146views more  HEURISTICS 2002»
13 years 5 months ago
Using Constraint-Based Operators to Solve the Vehicle Routing Problem with Time Windows
This paper presents operators searching large neighborhoods in order to solve the vehicle routing problem. They make use of the pruning and propagation techniques of constraint pr...
Louis-Martin Rousseau, Michel Gendreau, Gilles Pes...
ICDIM
2007
IEEE
13 years 12 months ago
A novel Variable Neighborhood Particle Swarm Optimization for multi-objective Flexible Job-Shop Scheduling Problems
This paper introduces a hybrid metaheuristic, the Variable Neighborhood Particle Swarm Optimization (VNPSO), consisting of a combination of the Variable Neighborhood Search (VNS) ...
Hongbo Liu, Ajith Abraham, Crina Grosan
JUCS
2007
186views more  JUCS 2007»
13 years 5 months ago
An Hybrid Fuzzy Variable Neighborhood Particle Swarm Optimization Algorithm for Solving Quadratic Assignment Problems
: Recently, Particle Swarm Optimization (PSO) algorithm has exhibited good performance across a wide range of application problems. A quick review of the literature reveals that re...
Hongbo Liu, Ajith Abraham
LION
2009
Springer
145views Optimization» more  LION 2009»
14 years 9 days ago
A Variable Neighborhood Descent Search Algorithm for Delay-Constrained Least-Cost Multicast Routing
Abstract. The rapid evolution of real-time multimedia applications requires Quality of Service (QoS) based multicast routing in underlying computer networks. The constrained Steine...
Rong Qu, Ying Xu, Graham Kendall