Sciweavers

2343 search results - page 39 / 469
» The Locomotive Routing Problem
Sort
View
HICSS
2005
IEEE
157views Biometrics» more  HICSS 2005»
14 years 1 months ago
A Two-Stage Heuristic for the Vehicle Routing Problem with Time Windows and a Limited Number of Vehicles
The Vehicle Routing Problem with Time Windows (VRPTW) is an important problem in logistics. The problem is to serve a number of customers at minimum cost without violating the cus...
Andrew Lim, Xingwen Zhang
EVOW
2004
Springer
14 years 1 months ago
Solving the Vehicle Routing Problem by Using Cellular Genetic Algorithms
Cellular Genetic Algorithms (cGAs) are a subclass of Genetic Algorithms (GAs) in which the population diversity and exploration are enhanced thanks to the existence of small overla...
Enrique Alba, Bernabé Dorronsoro
KES
2010
Springer
13 years 6 months ago
Solving real-world vehicle routing problems with time windows using virus evolution strategy
This paper proposes a new solution to the vehicle routing problem with time windows using an evolution strategy adopting viral infection. The problem belongs to the NP-hard class a...
Hitoshi Kanoh, Souichi Tsukahara
CEC
2009
IEEE
14 years 2 months ago
Improved memetic algorithm for Capacitated Arc Routing Problem
— Capacitated Arc Routing Problem (CARP) has attracted much interest because of its wide applications in the real world. Recently, a memetic algorithm proposed by Lacomme et al. ...
Yi Mei, Ke Tang, Xin Yao
GECCO
2005
Springer
156views Optimization» more  GECCO 2005»
14 years 1 months ago
The blob code is competitive with edge-sets in genetic algorithms for the minimum routing cost spanning tree problem
Among the many codings of spanning trees for evolutionary search are those based on bijections between Pr¨ufer strings—strings of n−2 vertex labels—and spanning trees on th...
Bryant A. Julstrom