2015
DOI: 10.1016/j.ifacol.2015.06.313
|View full text |Cite
|
Sign up to set email alerts
|

Shapley-based side payments and simulated annealing for distributed lot-sizingÕ

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
4
0

Year Published

2017
2017
2024
2024

Publication Types

Select...
6
1

Relationship

0
7

Authors

Journals

citations
Cited by 9 publications
(4 citation statements)
references
References 13 publications
0
4
0
Order By: Relevance
“…Another alternative to speed up searches among alternatives is to use metaheuristics or mathematical decomposition tools as coordination mechanisms. Metaheuristic coordination mechanisms can use the ant colony [43], simulated annealing [22,[44][45][46][47], neighbourhood search [48], genetic algorithms [49] or immune systems [50]. They all allow searches for better coordination according to preestablished rules, but do not guarantee optimality or knowing the assumed gap.…”
Section: Coordination Mechanism Reviewmentioning
confidence: 99%
“…Another alternative to speed up searches among alternatives is to use metaheuristics or mathematical decomposition tools as coordination mechanisms. Metaheuristic coordination mechanisms can use the ant colony [43], simulated annealing [22,[44][45][46][47], neighbourhood search [48], genetic algorithms [49] or immune systems [50]. They all allow searches for better coordination according to preestablished rules, but do not guarantee optimality or knowing the assumed gap.…”
Section: Coordination Mechanism Reviewmentioning
confidence: 99%
“…A generic mechanism to coordinate decentral planning of a group of independent and self-interested decision makers, who are searching for an agreeable contract regarding multiple interdependent issues, in the case of asymmetric information is presented by Homberger (2011). Shapley-based side payments and simulated annealing for distributed lot-sizing are researched by Eslikizi et al (2015). Buer, Ziebuhr, and Kopfer (2015) are the first to present the collaborative lot-sizing problem with rivalling agents, where the assignment of items to agents is flexible.…”
Section: Literature Reviewmentioning
confidence: 99%
“…For example, hierarchical coordination mechanisms without compensations or renegotiations, both upstream and downstream, achieve better alignment of flows (material) in the SC and improve against noncoordination ( Agnetis et al, 2016), "alignment" in Table 8. On the other hand, other mechanisms seek to get closer to the optimal global results, knowing that it may incur worse local results of some of its members that must compensate with compensations or discounts (Eslikizi et al, 2015), "near opt." in Table 8.…”
Section: Objectives Of Coordination Mechanismmentioning
confidence: 99%
“…Another alternative of a coordinating mechanism has been meta-heuristics, such as ant colony or pheromone (Silva et al, 2009) or Simulated Annealing (Buer et al, 2015;Dudek et al, 2007;Eslikizi et al, 2015;Ziebuhr et al, 2013Ziebuhr et al, , 2015 or variable neighbourhood search (Reiss et al, 2014) that allow to seek a better coordination according to pre-established rules but without guarantees of being optimal.…”
Section: Characteristics Of the Implementation Of The Mechanismmentioning
confidence: 99%