Catalogo Articoli (Spogli Riviste)

OPAC HELP

Titolo:
A PARALLEL IMPLEMENTATION OF THE TSSP-CONSTRAINED VEHICLE-ROUTING PROBLEM(1 DECOMPOSITION FOR THE CAPACITY)
Autore:
BOWERS M; NOON CE; THOMAS B;
Indirizzi:
UNIV TENNESSEE,MANAGEMENT SCI PROGRAM KNOXVILLE TN 37996 LOCKHEED MARTIN ENERGY SYST,DATA SYST RES & DEV,INFORMAT SYST ENGN DEPT OAK RIDGE TN 37830
Titolo Testata:
Computers & operations research
fascicolo: 7, volume: 23, anno: 1996,
pagine: 723 - 732
SICI:
0305-0548(1996)23:7<723:APIOTT>2.0.ZU;2-8
Fonte:
ISI
Lingua:
ENG
Tipo documento:
Article
Natura:
Periodico
Settore Disciplinare:
CompuMath Citation Index
Science Citation Index Expanded
Science Citation Index Expanded
Science Citation Index Expanded
Citazioni:
16
Recensione:
Indirizzi per estratti:
Citazione:
M. Bowers et al., "A PARALLEL IMPLEMENTATION OF THE TSSP-CONSTRAINED VEHICLE-ROUTING PROBLEM(1 DECOMPOSITION FOR THE CAPACITY)", Computers & operations research, 23(7), 1996, pp. 723-732

Abstract

Vehicle routing problems (VRPs) are known to be computationally intractable. The amount of time required to solve a VRP increases significantly given a modest increase in problem size. Only small VRPs may be solved exactly using existing mathematical programming techniques on single processor computers. In recent years, multiple processor computers have emerged as powerful tools for solving computationally difficultproblems. Problems are divided into several smaller parts or modules that can be solved simultaneously (or in parallel) to decrease computation time. The degree of speedup depends on the particular parallelization strategy as well as the system architecture. This paper presents a parallel optimization technique for solving the basic, capacity-constrained VRP. It includes: (1) a description of a decomposition algorithm for the VRP; (2) a description of the serial algorithm and the strategy used to implement the decomposition in parallel; (3) validation of the effectiveness of the parallel implementation; and (4) performance analysis comparing the parallel and serial implementations. The parallel approach to the VRP significantly reduces computation time and maintains solution quality. Copyright (C) 1996 Elsevier Science Ltd

ASDD Area Sistemi Dipartimentali e Documentali, Università di Bologna, Catalogo delle riviste ed altri periodici
Documento generato il 01/04/20 alle ore 20:28:52