38 search results - page 1 / 8 » Variable neighborhood search for the dial-a-ride problem |
70
Voted
COR
2010
14 years 10 months ago
2010
In dial-a-ride problems passengers have to be transported between pre-specified pickup and delivery locations under user inconvenience considerations. The problem variant consider...
95
Voted
HEURISTICS
2008
14 years 10 months ago
2008
In this article we investigate a new variant of Variable Neighborhood Search (VNS): Relaxation Guided Variable Neighborhood Search. It is based on the general VNS scheme and a new...
106
Voted
SAINT
2008
IEEE
15 years 4 months ago
2008
IEEE
We present a Variable Neighborhood Search approach for a network design problem occurring in real world when the bandwidth of an existing network shall be enhanced. Using two diff...
94
Voted
PPSN
2010
Springer
14 years 8 months ago
2010
Springer
Abstract. The rooted delay-constrained minimum spanning tree problem is an NP-hard combinatorial optimization problem arising for example in the design of centralized broadcasting ...
127
Voted
EVOW
2012
Springer
13 years 6 months ago
2012
Springer
Abstract. We consider the two-echelon location-routing problem (2ELRP), a well-known problem in freight distribution arising when establishing a two-level transport system with lim...