Parallel simulated annealing for the set-partitioning problem

Parallel simulated annealing for the set-partitioning problem

A delivery problem which reduces to the NP-complete set-partitioning problem is investigated. The sequential and parallel simulated annealing algorithms to solve the delivery problem are discussed. The objective is to improve the quality of solutions to the problem by applying parallelism.

Gespeichert in:
Bibliographische Detailangaben
1. Verfasser: Czech, Z.J.
Format: Tagungsbericht
Sprache:eng
Schlagworte:
Computational modeling
Computer science
Computer simulation
Costs
Helium
Postal services
Simulated annealing
Transportation
Vehicles
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:A delivery problem which reduces to the NP-complete set-partitioning problem is investigated. The sequential and parallel simulated annealing algorithms to solve the delivery problem are discussed. The objective is to improve the quality of solutions to the problem by applying parallelism.
DOI:10.1109/EMPDP.2000.823429