MARC details
| 000 -LEADER |
|---|
| fixed length control field |
02117nam a22003133a 4500 |
| 001 - CONTROL NUMBER |
|---|
| control field |
UPMIN-00004780428 |
| 003 - CONTROL NUMBER IDENTIFIER |
|---|
| control field |
UPMIN |
| 005 - DATE AND TIME OF LATEST TRANSACTION |
|---|
| control field |
20221020172042.0 |
| 008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION |
|---|
| fixed length control field |
221020b |||||||| |||| 00| 0 eng d |
| 040 ## - CATALOGING SOURCE |
|---|
| Original cataloging agency |
DLC |
| Transcribing agency |
UPMin |
| Modifying agency |
upmin |
| 041 ## - LANGUAGE CODE |
|---|
| Language code of text/sound track or separate title |
eng |
| 090 #0 - LOCALLY ASSIGNED LC-TYPE CALL NUMBER (OCLC); LOCAL CALL NUMBER (RLIN) |
|---|
| Classification number (OCLC) (R) ; Classification number, CALL (RLIN) (NR) |
LG993.5 2010 |
| Local cutter number (OCLC) ; Book number/undivided call number, CALL (RLIN) |
C6 M67 |
| 100 ## - MAIN ENTRY--PERSONAL NAME |
|---|
| Personal name |
Morales, Francis Marie D. |
| 245 ## - TITLE STATEMENT |
|---|
| Title |
Discrete adaptation of the artificial bee colony algorithm applied to time-cost trade-off problem / |
| Statement of responsibility, etc. |
Francis Marie D. Morales |
| 260 ## - PUBLICATION, DISTRIBUTION, ETC. |
|---|
| Date of publication, distribution, etc. |
2010 |
| 300 ## - PHYSICAL DESCRIPTION |
|---|
| Extent |
76 leaves. |
| 502 ## - DISSERTATION NOTE |
|---|
| Dissertation note |
Thesis (BS Computer Science) -- University of the Philippines Mindanao, 2010 |
| 520 3# - SUMMARY, ETC. |
|---|
| Summary, etc. |
Time cost optimization (TCO) may be define as a process to identify suitable construction activities for speeding up, and for deciding "by how much" so as to attain the best possible savings in both time and cost. It is generally realized that when project duration is compressed, the project will call for an increase in labor and more productive equipment, and require more demanding procurement and construction management, resulting to increase of cost. On the other hand, using fewer resources will result in extended duration of activities. In this papare, we have proposed a discrete adaptation of the artificial bee colony (ABC) algorithm for the time-cost trade-off problem. The ABC algorithm is a new metaheuristic approach inspired by intelligent foraging behavior of honeybee swarm.We have compared the performance of our discretely adapted ABC against three algorithms: Particle Swarm Optimization (PSO), Ant Colony Optimization (ACO) and genetic algorithm (GA). Computational results demonstrate the superiority of the discrete ABC over the three algorithms. It obtained better qualtiy solutions in shorter time. |
| 650 17 - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Topical term or geographic name entry element |
Time-cost optimization |
| 650 17 - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Topical term or geographic name entry element |
Artificial bee colony algorithm |
| 650 17 - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Topical term or geographic name entry element |
Time-cost trade-off |
| 650 17 - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Topical term or geographic name entry element |
Particle swarm optimization |
| 650 17 - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Topical term or geographic name entry element |
Genetic Algorithm |
| 650 17 - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Topical term or geographic name entry element |
Ant colony optimization |
| 658 ## - INDEX TERM--CURRICULUM OBJECTIVE |
|---|
| Main curriculum objective |
Undergraduate Thesis |
| Curriculum code |
CMSC200, |
| Source of term or code |
BSCS |
| 905 ## - LOCAL DATA ELEMENT E, LDE (RLIN) |
|---|
| a |
Fi |
| 905 ## - LOCAL DATA ELEMENT E, LDE (RLIN) |
|---|
| a |
UP |
| 942 ## - ADDED ENTRY ELEMENTS (KOHA) |
|---|
| Source of classification or shelving scheme |
Library of Congress Classification |
| Koha item type |
Thesis |
