Skip to main content
Top

2018 | OriginalPaper | Chapter

Collaborative Agent Teams (CAT): From the Paradigm to Implementation Guidelines

Authors : Marc-André Carle, Alain Martel, Nicolas Zufferey

Published in: Bioinspired Optimization Methods and Their Applications

Publisher: Springer International Publishing

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

Abstract

We propose a general solution method framework based on a Collaborative Agent Teams (CAT) architecture to tackle large-scale mixed-integer optimization problems with complex structures. This framework introduces several conceptual improvements over previous agent teams’ approaches. We discuss how to configure the three key components of a CAT solver for multidimensional optimization problems: the problem representation, the design of agents, and the information sharing mechanisms between agents. Implementation guidelines are also given.

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Literature
1.
go back to reference Murthy, S., Akkiraju, R., Goodwin, R., Keskinocak, P., Rachlin, J., Wu, F.: Cooperative multiobjective decision support for the paper industry. Interfaces 29(5), 5–30 (1999)CrossRef Murthy, S., Akkiraju, R., Goodwin, R., Keskinocak, P., Rachlin, J., Wu, F.: Cooperative multiobjective decision support for the paper industry. Interfaces 29(5), 5–30 (1999)CrossRef
2.
go back to reference Carle, M.A., Martel, A., Zufferey, N.: The CAT metaheuristic for the solution of multi-period activity-based supply chain network design problems. Int. J. Prod. Econ. 139(2), 664–677 (2012)CrossRef Carle, M.A., Martel, A., Zufferey, N.: The CAT metaheuristic for the solution of multi-period activity-based supply chain network design problems. Int. J. Prod. Econ. 139(2), 664–677 (2012)CrossRef
3.
go back to reference Silver, E., Zufferey, N.: Inventory control of an item with a probabilistic replenishment lead time and a known supplier shutdown period. Int. J. Prod. Res. 49, 923–947 (2011)CrossRef Silver, E., Zufferey, N.: Inventory control of an item with a probabilistic replenishment lead time and a known supplier shutdown period. Int. J. Prod. Res. 49, 923–947 (2011)CrossRef
4.
go back to reference Hertz, A., Schindl, D., Zufferey, N.: Lower bounding and tabu search procedures for the frequency assignment problem with polarization constraints. 4OR 3(2), 139–161 (2005)MathSciNetCrossRef Hertz, A., Schindl, D., Zufferey, N.: Lower bounding and tabu search procedures for the frequency assignment problem with polarization constraints. 4OR 3(2), 139–161 (2005)MathSciNetCrossRef
5.
go back to reference Zufferey, N.: Heuristiques pour les Problèmes de la Coloration des Sommets d’un Graphe et d’Affectation de Fréquences avec Polarités. Ph.D. thesis, École Polytechnique Fédérale de Lausanne (EPFL), Switzerland (2002) Zufferey, N.: Heuristiques pour les Problèmes de la Coloration des Sommets d’un Graphe et d’Affectation de Fréquences avec Polarités. Ph.D. thesis, École Polytechnique Fédérale de Lausanne (EPFL), Switzerland (2002)
6.
go back to reference Michel, L., Hentenryck, P.V.: A simple tabu search for warehouse location. Eur. J. Oper. Res. 157, 576–591 (2004)MathSciNetCrossRef Michel, L., Hentenryck, P.V.: A simple tabu search for warehouse location. Eur. J. Oper. Res. 157, 576–591 (2004)MathSciNetCrossRef
7.
go back to reference Melab, N., Talbi, E.G., Cahon, S., Alba, E., Luque, G.: Parallel metaheuristics: models and frameworks. Parallel Combinatorial Optimization, p. 330. Wiley, Hoboken (2006) Melab, N., Talbi, E.G., Cahon, S., Alba, E., Luque, G.: Parallel metaheuristics: models and frameworks. Parallel Combinatorial Optimization, p. 330. Wiley, Hoboken (2006)
8.
go back to reference Talbi, E.G.: A taxonomy of hybrid metaheuristics. J. Heuristics 8(5), 541–564 (2002)CrossRef Talbi, E.G.: A taxonomy of hybrid metaheuristics. J. Heuristics 8(5), 541–564 (2002)CrossRef
9.
go back to reference Blum, C., Puchinger, J., Raidl, G., Roli, A.: Hybrid metaheuristics in combinatorial optimization: a survey. Appl. Soft Comput. 11, 4135–4151 (2011)CrossRef Blum, C., Puchinger, J., Raidl, G., Roli, A.: Hybrid metaheuristics in combinatorial optimization: a survey. Appl. Soft Comput. 11, 4135–4151 (2011)CrossRef
12.
go back to reference Dantzig, G.B., Wolfe, P.: Decomposition principle for linear programs. Oper. Res. 8, 101–111 (1960)CrossRef Dantzig, G.B., Wolfe, P.: Decomposition principle for linear programs. Oper. Res. 8, 101–111 (1960)CrossRef
13.
go back to reference Benders, J.F.: Partitioning procedures for solving mixed variables programming problem. Numer. Math. 4, 238–252 (1962)MathSciNetCrossRef Benders, J.F.: Partitioning procedures for solving mixed variables programming problem. Numer. Math. 4, 238–252 (1962)MathSciNetCrossRef
14.
15.
go back to reference Melo, M., Nickel, S., da Gama, F.S.: An efficient heuristic approach for a multi-period logistics network redesign problem. TOP 22, 80–108 (2014)MathSciNetCrossRef Melo, M., Nickel, S., da Gama, F.S.: An efficient heuristic approach for a multi-period logistics network redesign problem. TOP 22, 80–108 (2014)MathSciNetCrossRef
16.
go back to reference Thanh, P., Péton, O., Bostel, N.: A linear relaxation-based heuristic approach for logistics network design. Comput. Ind. Eng. 59, 964–975 (2010)CrossRef Thanh, P., Péton, O., Bostel, N.: A linear relaxation-based heuristic approach for logistics network design. Comput. Ind. Eng. 59, 964–975 (2010)CrossRef
18.
go back to reference Talukdar, S., Murthy, S., Akkiraju, R.: Asynchronous teams. In: Handbook of Metaheuristics. Kluwer Academic Publishers (2003) Talukdar, S., Murthy, S., Akkiraju, R.: Asynchronous teams. In: Handbook of Metaheuristics. Kluwer Academic Publishers (2003)
19.
go back to reference Keskinocak, P., Wu, F., Goodwin, R., Murthy, S., Akkiraju, R., Kumaran, S.: Scheduling solutions for the paper industry. Oper. Res. 50(2), 249–259 (2002)CrossRef Keskinocak, P., Wu, F., Goodwin, R., Murthy, S., Akkiraju, R., Kumaran, S.: Scheduling solutions for the paper industry. Oper. Res. 50(2), 249–259 (2002)CrossRef
20.
go back to reference Aydin, M., Fogarty, T.: Teams of autonomous agents for job-shop scheduling problems: an experimental study. J. Intell. Manuf. 15, 455–462 (2004)CrossRef Aydin, M., Fogarty, T.: Teams of autonomous agents for job-shop scheduling problems: an experimental study. J. Intell. Manuf. 15, 455–462 (2004)CrossRef
22.
23.
go back to reference Beasley, J.E.: Lagrangean heuristics for location problems. Eur. J. Oper. Res. 65, 383–399 (1993)CrossRef Beasley, J.E.: Lagrangean heuristics for location problems. Eur. J. Oper. Res. 65, 383–399 (1993)CrossRef
25.
go back to reference Wu, T.H., Low, C., Bai, J.W.: Heuristic solutions to multi-depot location-routing problems. Comput. Oper. Res. 29, 1393–1415 (2002)CrossRef Wu, T.H., Low, C., Bai, J.W.: Heuristic solutions to multi-depot location-routing problems. Comput. Oper. Res. 29, 1393–1415 (2002)CrossRef
26.
go back to reference Zufferey, N.: Optimization by ant algorithms: possible roles for an individual ant. Optim. Lett. 6(5), 963–973 (2012)MathSciNetCrossRef Zufferey, N.: Optimization by ant algorithms: possible roles for an individual ant. Optim. Lett. 6(5), 963–973 (2012)MathSciNetCrossRef
28.
go back to reference Danna, E., Rothberg, E., Pape, C.L.: Exploring relaxation induced neighborhoods to improve MIP solutions. Math. Program. Ser. A 102, 71–90 (2005)MathSciNetCrossRef Danna, E., Rothberg, E., Pape, C.L.: Exploring relaxation induced neighborhoods to improve MIP solutions. Math. Program. Ser. A 102, 71–90 (2005)MathSciNetCrossRef
29.
go back to reference Ball, M.: Heuristics based on mathematical programming. Surv. Oper. Res. Manag. Sci. 16, 21–38 (2011) Ball, M.: Heuristics based on mathematical programming. Surv. Oper. Res. Manag. Sci. 16, 21–38 (2011)
Metadata
Title
Collaborative Agent Teams (CAT): From the Paradigm to Implementation Guidelines
Authors
Marc-André Carle
Alain Martel
Nicolas Zufferey
Copyright Year
2018
DOI
https://doi.org/10.1007/978-3-319-91641-5_6

Premium Partner