A Relative Comparison between BAP and JSSP using Two Heuristics AFSA and ACO
International Journal of Science and Research (IJSR)

International Journal of Science and Research (IJSR)
www.ijsr.net | Open Access | Fully Refereed | Peer Reviewed International Journal

ISSN: 2319-7064

Research Paper | Cluster Computing | India | Volume 2 Issue 3, March 2013

A Relative Comparison between BAP and JSSP using Two Heuristics AFSA and ACO

K.Sumangala, S. Sulthani Begum

Scheduling is the allocation of shared resources over time to competing activities. Job Shop Scheduling Problem (JSSP) and Berth Scheduling or Berth Allocation Problem (BAP) is two of NP-Complete problems in Operations research. BAP can be modeled as an unrelated parallel machine-scheduling problem (Pinedo, 2002), where a vessel is treated as a job and a berth as a machine. Thus JSSP and BAP are related with each other and solved using two different Meta heuristics. The Ant colony Optimization (ACO) is used to solve JSSP and Artificial Fish Schooling Algorithm (AFSA) is used to solve BAP. The experimental results are compared. The performance evaluation shows, the AFSA converges more quickly than ACO.

Keywords: JSSP, BAP, ACO, AFSA

Edition: Volume 2 Issue 3, March 2013

Pages: 97 - 100

Share this Article

How to Cite this Article?

K.Sumangala, S. Sulthani Begum, "A Relative Comparison between BAP and JSSP using Two Heuristics AFSA and ACO", International Journal of Science and Research (IJSR), https://www.ijsr.net/search_index_results_paperid.php?id=IJSROFF2013072, Volume 2 Issue 3, March 2013, 97 - 100

90 PDF Views | 82 PDF Downloads

Download Article PDF



Top