An agent simulation heuristics for snowplowing problems

Satoshi Takahashi; Tokuro Matsuo

doi:10.1109/ICSEng.2011.36

An agent simulation heuristics for snowplowing problems

Satoshi Takahashi
, Tokuro Matsuo

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

Abstract

This paper proposes a heuristics method for huge task allocation problem over snowblower tasks. It is difficult to solve the huge task allocation problem. A snowblower problem includes a task allocation problem and agents scheduling problem. Given a directed graph as city map, we should consider some arc-disjoint partitions of the graph as allocation. A graph partition problem is a fundamental problem of combinatorics, there are some effective algorithms for the problem. However, in the case that we consider the task allocation and scheduling, the graph partition problem is too difficult. Because of this fact, we employ an agent simulation for solving the snowblower problem.

Original language	English
Title of host publication	Proceedings - ICSEng 2011
Subtitle of host publication	International Conference on Systems Engineering
Pages	159-161
Number of pages	3
DOIs	https://doi.org/10.1109/ICSEng.2011.36
Publication status	Published - 2011
Externally published	Yes
Event	21st International Conference on Systems Engineering, ICSEng 2011 - Las Vegas, NV, United States Duration: 16-08-2011 → 18-08-2011

Publication series

Name	Proceedings - ICSEng 2011: International Conference on Systems Engineering

Conference

Conference	21st International Conference on Systems Engineering, ICSEng 2011
Country/Territory	United States
City	Las Vegas, NV
Period	16-08-11 → 18-08-11

All Science Journal Classification (ASJC) codes

Control and Systems Engineering

Access to Document

10.1109/ICSEng.2011.36

Cite this

@inproceedings{c0abcfa8effd4c9597f79cf12529a856,

title = "An agent simulation heuristics for snowplowing problems",

abstract = "This paper proposes a heuristics method for huge task allocation problem over snowblower tasks. It is difficult to solve the huge task allocation problem. A snowblower problem includes a task allocation problem and agents scheduling problem. Given a directed graph as city map, we should consider some arc-disjoint partitions of the graph as allocation. A graph partition problem is a fundamental problem of combinatorics, there are some effective algorithms for the problem. However, in the case that we consider the task allocation and scheduling, the graph partition problem is too difficult. Because of this fact, we employ an agent simulation for solving the snowblower problem.",

keywords = "Agent Simulation Heuristics, Decision Making, Scheduling",

author = "Satoshi Takahashi and Tokuro Matsuo",

year = "2011",

doi = "10.1109/ICSEng.2011.36",

language = "English",

isbn = "9780769544953",

series = "Proceedings - ICSEng 2011: International Conference on Systems Engineering",

pages = "159--161",

booktitle = "Proceedings - ICSEng 2011",

note = "21st International Conference on Systems Engineering, ICSEng 2011 ; Conference date: 16-08-2011 Through 18-08-2011",

}

Takahashi, S & Matsuo, T 2011, An agent simulation heuristics for snowplowing problems. in Proceedings - ICSEng 2011: International Conference on Systems Engineering., 6041832, Proceedings - ICSEng 2011: International Conference on Systems Engineering, pp. 159-161, 21st International Conference on Systems Engineering, ICSEng 2011, Las Vegas, NV, United States, 16-08-11. https://doi.org/10.1109/ICSEng.2011.36

TY - GEN

T1 - An agent simulation heuristics for snowplowing problems

AU - Takahashi, Satoshi

AU - Matsuo, Tokuro

PY - 2011

Y1 - 2011

N2 - This paper proposes a heuristics method for huge task allocation problem over snowblower tasks. It is difficult to solve the huge task allocation problem. A snowblower problem includes a task allocation problem and agents scheduling problem. Given a directed graph as city map, we should consider some arc-disjoint partitions of the graph as allocation. A graph partition problem is a fundamental problem of combinatorics, there are some effective algorithms for the problem. However, in the case that we consider the task allocation and scheduling, the graph partition problem is too difficult. Because of this fact, we employ an agent simulation for solving the snowblower problem.

AB - This paper proposes a heuristics method for huge task allocation problem over snowblower tasks. It is difficult to solve the huge task allocation problem. A snowblower problem includes a task allocation problem and agents scheduling problem. Given a directed graph as city map, we should consider some arc-disjoint partitions of the graph as allocation. A graph partition problem is a fundamental problem of combinatorics, there are some effective algorithms for the problem. However, in the case that we consider the task allocation and scheduling, the graph partition problem is too difficult. Because of this fact, we employ an agent simulation for solving the snowblower problem.

KW - Agent Simulation Heuristics

KW - Decision Making

KW - Scheduling

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

UR - https://www.scopus.com/pages/publications/80055115011#tab=citedBy

U2 - 10.1109/ICSEng.2011.36

DO - 10.1109/ICSEng.2011.36

M3 - Conference contribution

AN - SCOPUS:80055115011

SN - 9780769544953

T3 - Proceedings - ICSEng 2011: International Conference on Systems Engineering

SP - 159

EP - 161

BT - Proceedings - ICSEng 2011

T2 - 21st International Conference on Systems Engineering, ICSEng 2011

Y2 - 16 August 2011 through 18 August 2011

ER -

An agent simulation heuristics for snowplowing problems

Abstract

Publication series

Conference

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this