Parallel implementation of branch and bound algorithm for solving vehicle routing problem on NOWs

3rd International Symposium on Parallel Architectures, Algorithms, and Networks, I-SPAN 1997

Volumn , Issue , 1997, Pages 247-253

  Lau, K K ^a   Kumar, M J ^a   Achuthan, N R ^a  

^a CURTIN UNIVERSITY   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

BRANCH AND BOUND METHOD; NETWORK ARCHITECTURE; PARALLEL ARCHITECTURES; ROUTING ALGORITHMS; VEHICLE ROUTING;

BRANCH-AND-BOUND ALGORITHMS; EXACT SOLUTION; LINEAR SPEED-UP; NETWORKS OF WORKSTATIONS; PARALLEL BRANCH AND BOUNDS; PARALLEL IMPLEMENTATIONS; VEHICLE ROUTING PROBLEM; VEHICLE ROUTING PROBLEMS;

PROBLEM SOLVING;

EID: 1442344546     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISPAN.1997.645104     Document Type: Conference Paper

References (10)

1. N. R. Achuthan, L. Caccetta, and S. P. Hill. A new subtour elimination constraint for the vehicle routing problem. European Journal of Operational Research, 91:573-586, 1996.
2. A. Bachem, W. Hochstattler, and M. Malich. The simulated trading heuristic for solving vehicle routing problems. Discrete Applied Mathematics, 65:47-72, 1996.
3. B. L. Garcia, J. Y. Potvin, and J. M. Rousseau. A parallel implementation of the tabu search heuristic for vehicle routing problems with time window constraints. Computers Ops Res., 21(9):1025-1033, 1994.
4. M. R. Garey and D. S. Johnson. Computers and Intractability - A Guild to the Theory of NP-Completeness. W. H. Freeman, 1979.
5. M. Gendreau, A. Hertz, and G. Laporte. A tabu search heuristic for the vehicle routing problem. Management Science, 40:1276-1290, 1994.
6. G. Laporte. The vehicle routing problem : An overview of exact and approximate algorithm. European Journal of Operations Research, 59:231-247, 1992.
7. G. Laporte and et.al. Two exact algorithms for the distance constrainted vehicle routing problem. Networks, 14:161-172, 1984.
8. G. Laporte, H. mercure, and Y. Nobert. A branch and bound algorithm for a class of asymmetrical vehicle routing problems. Journal of Operational Research Society, 43:469-481, 1992.
9. G. Laporte, Y. Norbert, and M. Desrochers. Optimal routing under capacity and distance restrictions. Operations Research, 33:1050-1073, 1985.
10. E. Taillard. Parallel iterative search methods for vehicle routing problems. Networks, 23:661-673, 1993.