Sciweavers

2343 search results - page 28 / 469
» The Locomotive Routing Problem
Sort
View
HEURISTICS
2010
13 years 5 months ago
An adaptive memory algorithm for the split delivery vehicle routing problem
Abstract The split delivery vehicle routing problem (SDVRP) relaxes routing restrictions forcing unique deliveries to customers and allows multiple vehicles to satisfy customer dem...
Rafael E. Aleman, Xinhui Zhang, Raymond R. Hill
IPPS
1998
IEEE
13 years 12 months ago
A Parallel Evolutionary Algorithm for the Vehicle Routing Problem with Heterogeneous Fleet
Abstract. Nowadays genetic algorithms stand as a trend to solve NPcomplete and NP-hard problems. In this paper, we present a new hybrid metaheuristic which uses Parallel Genetic Al...
Luiz Satoru Ochi, Dalessandro Soares Vianna, L&uac...
PPSN
2010
Springer
13 years 6 months ago
Optimizing Delivery Time in Multi-Objective Vehicle Routing Problems with Time Windows
The Vehicle Routing Problem with Time Windows involves finding the lowest-cost set of routes to deliver goods to customers, which have service time windows, using a homogeneous ...
Abel Garcia-Najera, John A. Bullinaria
NETWORKS
2007
13 years 7 months ago
Tailoring neighborhood search for the internet protocol network design problem with reliability and routing constraints
The Internet Protocol Network Design Problem with Reliability and Routing Constraints (IPRR) can be shortly stated as follows. A telecommunication network is given in terms of a s...
Luigi De Giovanni, Roberto Tadei
TON
2002
91views more  TON 2002»
13 years 7 months ago
The stable paths problem and interdomain routing
Abstract-Dynamic routing protocols such as RIP and OSPF essentially implement distributed algorithms for solving the Shortest Paths Problem. The Border Gateway Protocol (BGP) is cu...
Timothy Griffin, F. Bruce Shepherd, Gordon T. Wilf...