2013
DOI: 10.1007/978-3-642-40776-5_16
|View full text |Cite
|
Sign up to set email alerts
|

Agent-Negotiation of Lot-Sizing Contracts by Simulated Annealing with Part-Way Resets

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
5
0

Year Published

2014
2014
2021
2021

Publication Types

Select...
2
2
2

Relationship

2
4

Authors

Journals

citations
Cited by 7 publications
(5 citation statements)
references
References 26 publications
0
5
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%
“…But if it is wanted to delve deeper it is necessary to consider situations of several agents, 1-n, a supplier with several clients, which is a divergent SC (Dudek et al, 2007;Zoghlami et al, 2016) or n-1, several providers for a single client, which would be a considered a convergent one (Wenzel et al, 2016a(Wenzel et al, , 2016b. But also intercompany cases, where there is no customer or supplier, identified as an n, in which it is necessary to coordinate among the agents, as in negotiation between workplace tasks for the fulfilment of orders as proposed by Ziebuhr et al (2013), auctions between jobs for production scheduling (Tang et al, 2016b). And when several agents have to agree on how to share a common resource without the figure of a coordinator or mediator (Lu et al, 2012).…”
Section: Structure and Relationship Between The Members Of The Scmentioning
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%
See 1 more Smart Citation
“…The distributed MLULSP (DMLULSP) was presented by [26] and assumes several local and selfish agents with private information instead of a single agent with full information. The existing collaborative solution approaches for the DMLULSP differ by their used metaheuristic search principles and the techniques used to aggregate the agents' preferences ( [26], [27] use simulated annealing, [28] uses an evolutionary strategy, and [3], [29], [30] use ant colony optimization). The DM-LULSP covers some important features of real world problems.…”
Section: Review Of the Literaturementioning
confidence: 99%