American Journal of Operations Research

Vol.9 No.4(2019), Paper ID 94072, 14 pages

DOI:10.4236/ajor.2019.94010

 

A Min-Max Strategy to Aid Decision Making in a Bi-Objective Discrete Optimization Problem Using an Improved Ant Colony Algorithm

 

Douglas Yenwon Kparib, Stephen Boakye Twum, Douglas Kwasi Boah

 

Department of Mathematics, Faculty of Mathematical Sciences, University for Development Studies, Navrongo, Ghana
Department of Mathematics, Faculty of Mathematical Sciences, University for Development Studies, Navrongo, Ghana
Department of Mathematics, Faculty of Mathematical Sciences, University for Development Studies, Navrongo, Ghana

 

Copyright © 2019 Douglas Yenwon Kparib, Stephen Boakye Twum, Douglas Kwasi Boah et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

 

How to Cite this Article


Kparib, D. , Twum, S. and Boah, D. (2019) A Min-Max Strategy to Aid Decision Making in a Bi-Objective Discrete Optimization Problem Using an Improved Ant Colony Algorithm. American Journal of Operations Research, 9, 161-174. doi: 10.4236/ajor.2019.94010.

Copyright © 2024 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.