Catalogo Articoli (Spogli Riviste)

OPAC HELP

Titolo:
A new method for solving capacitated location problems based on a set partitioning approach
Autore:
Baldacci, R; Hadjiconstantinou, E; Maniezzo, V; Mingozzi, A;
Indirizzi:
Univ Bologna, Dept Math, I-47023 Cesena, Italy Univ Bologna Cesena ItalyI-47023 ogna, Dept Math, I-47023 Cesena, Italy Univ London Imperial Coll Sci Technol & Med, Sch Management, London SW7 2PG, England Univ London Imperial Coll Sci Technol & Med London England SW72PG gland
Titolo Testata:
COMPUTERS & OPERATIONS RESEARCH
fascicolo: 4, volume: 29, anno: 2002,
pagine: 365 - 386
SICI:
0305-0548(200204)29:4<365:ANMFSC>2.0.ZU;2-0
Fonte:
ISI
Lingua:
ENG
Soggetto:
DISTANCE CONSTRAINTS;
Keywords:
capacitated p-median; facility location; set partitioning problem; dual heuristic solution;
Tipo documento:
Article
Natura:
Periodico
Settore Disciplinare:
Engineering, Computing & Technology
Citazioni:
24
Recensione:
Indirizzi per estratti:
Indirizzo: Mingozzi, A Univ Bologna, Dept Math, Via Sacchi 3, I-47023 Cesena, Italy Univ Bologna Via Sacchi 3 Cesena Italy I-47023 Cesena, Italy
Citazione:
R. Baldacci et al., "A new method for solving capacitated location problems based on a set partitioning approach", COMPUT OPER, 29(4), 2002, pp. 365-386

Abstract

We consider the capacitated p-median problem (CPMP) in which a set of n customers must be partitioned into p disjoint clusters so that the total dissimilarity within each cluster is minimized and constraints on maximum cluster capacities are met. The dissimilarity of a cluster is computed as the sum of the dissimilarities existing between each entity of the cluster and the median associated to such cluster. In this paper we present an exact algorithm for solving the CPMP based on a set partitioning formulation of the problem. A valid lower bound to the optimal solution cost is obtained by combining two different heuristic methods for solving the dual of the LP-relaxation of the exact formulation. Computational tests on problems proposed inthe literature and on new sets of test problems show the effectiveness of the proposed algorithm.

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