A Decentralized Heuristic for Multiple-Choice Combinatorial Optimization Problems

Christian Hinrichs (), Sebastian Lehnhoff () and Michael Sonnenschein ()
Additional contact information
Christian Hinrichs: University of Oldenburg
Sebastian Lehnhoff: Institute for Information Technology
Michael Sonnenschein: University of Oldenburg

A chapter in Operations Research Proceedings 2012, 2014, pp 297-302 from Springer

Abstract: Abstract We present a decentralized heuristic applicable to multi-agent systems (MAS), which is able to solve multiple-choice combinatorial optimization problems (MC-COP). First, the MC-COP problem class is introduced and subsequently a mapping to MAS is shown, in which each class of elements in MC-COP corresponds to a single agent in MAS. The proposed heuristic “COHDA” is described in detail, including evaluation results from the domain of decentralized energy management systems.

Keywords: Decentralized Energy Management; Small World Paradigm; Adaptive Communication Networks; Dynamic Objective Function; Considered Problem Instances (search for similar items in EconPapers)
Date: 2014
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:oprchp:978-3-319-00795-3_43

Ordering information: This item can be ordered from
http://www.springer.com/9783319007953

DOI: 10.1007/978-3-319-00795-3_43

Access Statistics for this chapter

More chapters in Operations Research Proceedings from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().