CPL - Chalmers Publication Library
| Utbildning | Forskning | Styrkeområden | Om Chalmers | In English In English Ej inloggad.

New Models for and Numerical Tests of the Hamiltonian p-Median Problem

Stefan Gollowitzer ; Dilson Lucas Pereira ; Adam Wojciechowski (Institutionen för matematiska vetenskaper, matematik)
Lecture Notes in Computer Science (03029743). Vol. 6701/2011 (2011), p. 385-394.
[Konferensbidrag, refereegranskat]

The Hamiltonian p-median problem (HpMP) was introduced by [Branco90]. It is closely related to two well-known problems, namely the Travelling Salesman problem (TSP) and the Vehicle Routing problem (VRP). The HpMP is to find exactly p node-disjoint cycles of minimum edge cost, such that each node of the graph is contained in exactly one cycle. We present three new models for the HpMP problem which differ with regard to the constraints that enforce a maximum number of cycles. We demonstrate that one of the models (SEC) is dominated by another model (PCON) with regard to the LP relaxation. Further, we introduce a class of symmetry breaking constraints. We present results regarding the quality of the lower bounds provided by the respective LP relaxations for two of the models, and provide computational results that demonstrate the computational efficiency.

Nyckelord: Hamiltonian p-Median,

Denna post skapades 2012-01-18. Senast ändrad 2012-02-07.
CPL Pubid: 153575


Läs direkt!

Länk till annan sajt (kan kräva inloggning)

Institutioner (Chalmers)

Institutionen för matematiska vetenskaper, matematik (2005-2016)


Optimeringslära, systemteori

Chalmers infrastruktur