Sciweavers

2343 search results - page 33 / 469
» The Locomotive Routing Problem
Sort
View
FLAIRS
2004
13 years 9 months ago
A Local Search/Constraint Propagation Hybrid for a Network Routing Problem
This paper presents a hybrid algorithm that combines local search and constraint programming techniques to solve a network routing problem. The problem considered is that of routi...
Jonathan Lever
INFORMS
2008
55views more  INFORMS 2008»
13 years 7 months ago
Mathematical Programming Algorithms for Two-Path Routing Problems with Reliability Considerations
Most traditional routing problems assume perfect operability of all arcs and nodes. However, when independent arc failure probabilities exist, a secondary objective must be presen...
April K. Andreas, J. Cole Smith
EVOW
2012
Springer
12 years 3 months ago
A Variable Neighborhood Search Approach for the Two-Echelon Location-Routing Problem
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...
Martin Schwengerer, Sandro Pirkwieser, Günthe...
EVOW
2009
Springer
14 years 2 months ago
Discrete Particle Swarm Optimization for Multiple Destination Routing Problems
This paper proposes a discrete particle swarm optimization (DPSO) to solve the multiple destination routing (MDR) problems. The problem has been proven to be NP-complete and the tr...
Zhi-hui Zhan, Jun Zhang
AMC
2006
115views more  AMC 2006»
13 years 7 months ago
A memetic algorithm for a vehicle routing problem with backhauls
This paper considers an extension of a vehicle routing problem with backhauls (VRPB). In this problem, a set of costumers are divided in two subsets consisting of linehaul and bac...
Reza Tavakkoli-Moghaddam, A. R. Saremi, M. S. Ziae...