A Planning Algorithm with Temporal Constraints in the Working Procedures

Xiao Long Chai

doi:10.4028/www.scientific.net/AMR.760-762.1786

Paper Titles

Semantic Annotation of CAD Model Based on Ontology
p.1767

Design of the B/S Model-Based Automated Course Scheduling System of Universities
p.1773

Single Point Blow-Up and Regional Blow-Up of Solutions for a Degenerate Semilinear Parabolic Equation
p.1777

Research on the Application of College Automated Course Scheduling System Based on Genetic Algorithm
p.1782

A Planning Algorithm with Temporal Constraints in the Working Procedures
p.1786

Fast Tabu Search Algorithm for Capacitated Vehicle Routing Problem
p.1790

Design and Implementation of Online Photos Collection of B/S Based Registration Systems
p.1794

Research of Personalized Information Service Based on Association Rules
p.1800

The Architecture of Digital Library Platform Based on Cloud Computing
p.1804

HomeAdvanced Materials ResearchAdvanced Materials Research Vols. 760-762A Planning Algorithm with Temporal Constraints in...

A Planning Algorithm with Temporal Constraints in the Working Procedures

Abstract:

Temporal planning is a broad research area in automated planning. In most real-world applications such as the problems of working procedures planning, many real planning problems often require the planning goals can be satisfied in shorter time and some temporal constraints should be satisfied in the planning answer. In this paper, the ant colony algorithm under the temporal constraints is presented which with the heuristic control rules and the evaluation tactics in the framework of the ant colony planning algorithm. The searching way of the algorithm has the character of global and parallel. And it has the ability of convergence acceleration in the solution searching.

You might also be interested in these eBooks

View Preview

Info:

Periodical:

Advanced Materials Research (Volumes 760-762)

Pages:

1786-1789

DOI:

https://doi.org/10.4028/www.scientific.net/AMR.760-762.1786

Citation:

Cite this paper

Online since:

September 2013

Authors:

Xiao Long Chai

Keywords:

Ant Colony Planning Algorithm, Heuristic Tactics, Intelligence Planning, Temporal Constraints, Working Procedures Planning

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

References

[1] C A Silvaa, J M C Sousa, T A Runkler. Rescheduling and optimization of logistic processes using GA and ACO. Engineering Applications of Artificial Intelligence. 2008, 21: 343-352.

DOI: 10.1016/j.engappai.2007.08.006

Google Scholar

[2] Serap Ulusam Sec_kiner, Mustafa Kurt. Ant colony optimization for the job rotation scheduling problem. Applied Mathematics and Computation. 2008, 201: 149-160.

DOI: 10.1016/j.amc.2007.12.006

Google Scholar

[3] Liangjun Ke, Zuren Feng, Zhigang Ren. An efficient ant colony optimization approach to attribute reduction in rough set theory. Pattern Recognition Letters. 2008, 29: 1351-1357.

DOI: 10.1016/j.patrec.2008.02.006

Google Scholar

[4] Kwee Kim Lim, Yew-Soon Ong, Meng Hiot Lim, etc. Hybrid ant colony algorithms for path planning in sparse graphs. Soft Computing. 2008, 12: 981–994.

DOI: 10.1007/s00500-007-0264-x

Google Scholar

[5] Kwang Mong Sim, Weng Hong Sun. Ant Colony Optimization for Routing and Load-Balancing: Survey and New Directions. IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans, 2003. 33(5): 560-572.

DOI: 10.1109/tsmca.2003.817391

Google Scholar