Efficient routing of mobile agents for agent-based integrated enterprise management: A general acceleration technique

Amir Elalouf; Eugene Levner; T. C.Edwin Cheng

doi:10.1007/978-3-642-24175-8_1

Efficient routing of mobile agents for agent-based integrated enterprise management: A general acceleration technique

Amir Elalouf
, Eugene Levner
, T. C.Edwin Cheng

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

11 Scopus citations

Abstract

Modern manufacturing enterprises are steadily moving towards open architectures wherein manufacturing activities are integrated with the activities of suppliers, customers, and partners within complex supply chains. Agent-based technology provides a natural way to design and implement such integration. We model the supply chain as a directed graph in which the vertices represent computers or individual agents and edges represent links. Thus the problem of enhancing the efficiency of mobile agents reduces to the problem of finding resource-constrained extremal paths in the graph. We study ε-approximation algorithms for solving the considered problems. We suggest a general three-stage technique, which follows and extends an earlier computational scheme in the literature for the constrained path problems (CPP). The new technique essentially improves on several earlier algorithms and also provides new aproach for contructing FPTAS for the CPP.

Original language	English
Title of host publication	Enterprise and Organizational Modeling and Simulation - 7th International Workshop, EOMAS 2011, Held at CAiSE 2011, Selected Papers
Publisher	Springer Verlag
Pages	1-20
Number of pages	20
ISBN (Print)	9783642241741
DOIs	https://doi.org/10.1007/978-3-642-24175-8_1
State	Published - 1 Jan 2011
Externally published	Yes
Event	7th International Workshop on Enterprise and Organizational Modeling and Simulation, EOMAS 2011, in Conjunction with CAiSE 2011 - London, United Kingdom Duration: 20 Jun 2011 → 21 Jun 2011

Publication series

Name	Lecture Notes in Business Information Processing
Volume	88 LNBIP
ISSN (Print)	1865-1348

Conference

Conference	7th International Workshop on Enterprise and Organizational Modeling and Simulation, EOMAS 2011, in Conjunction with CAiSE 2011
Country/Territory	United Kingdom
City	London
Period	20/06/11 → 21/06/11

UN SDGs

This output contributes to the following UN Sustainable Development Goals (SDGs)

SDG 9 Industry, Innovation, and Infrastructure

Keywords

Agent-based architecture
FPTAS
Fast routing algorithm
Integrated enterprise
Mobile agent

ASJC Scopus subject areas

Management Information Systems
Control and Systems Engineering
Business and International Management
Information Systems
Modeling and Simulation
Information Systems and Management

Access to Document

10.1007/978-3-642-24175-8_1

Cite this

Elalouf, A., Levner, E., & Cheng, T. C. E. (2011). Efficient routing of mobile agents for agent-based integrated enterprise management: A general acceleration technique. In Enterprise and Organizational Modeling and Simulation - 7th International Workshop, EOMAS 2011, Held at CAiSE 2011, Selected Papers (pp. 1-20). (Lecture Notes in Business Information Processing; Vol. 88 LNBIP). Springer Verlag. https://doi.org/10.1007/978-3-642-24175-8_1

Elalouf, Amir ; Levner, Eugene ; Cheng, T. C.Edwin. / Efficient routing of mobile agents for agent-based integrated enterprise management : A general acceleration technique. Enterprise and Organizational Modeling and Simulation - 7th International Workshop, EOMAS 2011, Held at CAiSE 2011, Selected Papers. Springer Verlag, 2011. pp. 1-20 (Lecture Notes in Business Information Processing).

@inproceedings{4bae95a0d30e4600ad9f13fb4b16d43a,

title = "Efficient routing of mobile agents for agent-based integrated enterprise management: A general acceleration technique",

abstract = "Modern manufacturing enterprises are steadily moving towards open architectures wherein manufacturing activities are integrated with the activities of suppliers, customers, and partners within complex supply chains. Agent-based technology provides a natural way to design and implement such integration. We model the supply chain as a directed graph in which the vertices represent computers or individual agents and edges represent links. Thus the problem of enhancing the efficiency of mobile agents reduces to the problem of finding resource-constrained extremal paths in the graph. We study ε-approximation algorithms for solving the considered problems. We suggest a general three-stage technique, which follows and extends an earlier computational scheme in the literature for the constrained path problems (CPP). The new technique essentially improves on several earlier algorithms and also provides new aproach for contructing FPTAS for the CPP.",

keywords = "Agent-based architecture, FPTAS, Fast routing algorithm, Integrated enterprise, Mobile agent",

author = "Amir Elalouf and Eugene Levner and Cheng, \{T. C.Edwin\}",

year = "2011",

month = jan,

day = "1",

doi = "10.1007/978-3-642-24175-8\_1",

language = "English",

isbn = "9783642241741",

series = "Lecture Notes in Business Information Processing",

publisher = "Springer Verlag",

pages = "1--20",

booktitle = "Enterprise and Organizational Modeling and Simulation - 7th International Workshop, EOMAS 2011, Held at CAiSE 2011, Selected Papers",

address = "Germany",

note = "7th International Workshop on Enterprise and Organizational Modeling and Simulation, EOMAS 2011, in Conjunction with CAiSE 2011 ; Conference date: 20-06-2011 Through 21-06-2011",

}

Elalouf, A, Levner, E & Cheng, TCE 2011, Efficient routing of mobile agents for agent-based integrated enterprise management: A general acceleration technique. in Enterprise and Organizational Modeling and Simulation - 7th International Workshop, EOMAS 2011, Held at CAiSE 2011, Selected Papers. Lecture Notes in Business Information Processing, vol. 88 LNBIP, Springer Verlag, pp. 1-20, 7th International Workshop on Enterprise and Organizational Modeling and Simulation, EOMAS 2011, in Conjunction with CAiSE 2011, London, United Kingdom, 20/06/11. https://doi.org/10.1007/978-3-642-24175-8_1

Efficient routing of mobile agents for agent-based integrated enterprise management: A general acceleration technique. / Elalouf, Amir; Levner, Eugene; Cheng, T. C.Edwin.
Enterprise and Organizational Modeling and Simulation - 7th International Workshop, EOMAS 2011, Held at CAiSE 2011, Selected Papers. Springer Verlag, 2011. p. 1-20 (Lecture Notes in Business Information Processing; Vol. 88 LNBIP).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Efficient routing of mobile agents for agent-based integrated enterprise management

T2 - 7th International Workshop on Enterprise and Organizational Modeling and Simulation, EOMAS 2011, in Conjunction with CAiSE 2011

AU - Elalouf, Amir

AU - Levner, Eugene

AU - Cheng, T. C.Edwin

PY - 2011/1/1

Y1 - 2011/1/1

N2 - Modern manufacturing enterprises are steadily moving towards open architectures wherein manufacturing activities are integrated with the activities of suppliers, customers, and partners within complex supply chains. Agent-based technology provides a natural way to design and implement such integration. We model the supply chain as a directed graph in which the vertices represent computers or individual agents and edges represent links. Thus the problem of enhancing the efficiency of mobile agents reduces to the problem of finding resource-constrained extremal paths in the graph. We study ε-approximation algorithms for solving the considered problems. We suggest a general three-stage technique, which follows and extends an earlier computational scheme in the literature for the constrained path problems (CPP). The new technique essentially improves on several earlier algorithms and also provides new aproach for contructing FPTAS for the CPP.

AB - Modern manufacturing enterprises are steadily moving towards open architectures wherein manufacturing activities are integrated with the activities of suppliers, customers, and partners within complex supply chains. Agent-based technology provides a natural way to design and implement such integration. We model the supply chain as a directed graph in which the vertices represent computers or individual agents and edges represent links. Thus the problem of enhancing the efficiency of mobile agents reduces to the problem of finding resource-constrained extremal paths in the graph. We study ε-approximation algorithms for solving the considered problems. We suggest a general three-stage technique, which follows and extends an earlier computational scheme in the literature for the constrained path problems (CPP). The new technique essentially improves on several earlier algorithms and also provides new aproach for contructing FPTAS for the CPP.

KW - Agent-based architecture

KW - FPTAS

KW - Fast routing algorithm

KW - Integrated enterprise

KW - Mobile agent

UR - https://www.scopus.com/pages/publications/80053330934

U2 - 10.1007/978-3-642-24175-8_1

DO - 10.1007/978-3-642-24175-8_1

M3 - Conference contribution

AN - SCOPUS:80053330934

SN - 9783642241741

T3 - Lecture Notes in Business Information Processing

SP - 1

EP - 20

BT - Enterprise and Organizational Modeling and Simulation - 7th International Workshop, EOMAS 2011, Held at CAiSE 2011, Selected Papers

PB - Springer Verlag

Y2 - 20 June 2011 through 21 June 2011

ER -

Elalouf A, Levner E, Cheng TCE. Efficient routing of mobile agents for agent-based integrated enterprise management: A general acceleration technique. In Enterprise and Organizational Modeling and Simulation - 7th International Workshop, EOMAS 2011, Held at CAiSE 2011, Selected Papers. Springer Verlag. 2011. p. 1-20. (Lecture Notes in Business Information Processing). doi: 10.1007/978-3-642-24175-8_1

Efficient routing of mobile agents for agent-based integrated enterprise management: A general acceleration technique

Abstract

Publication series

Conference

UN SDGs

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this