In this paper we present a genetic algorithm (GA) for solving NP-hard Multiple Warehouse Layout P... more In this paper we present a genetic algorithm (GA) for solving NP-hard Multiple Warehouse Layout Problem (MLWLP). New encoding scheme with appropriate objective functions is implemented. Specific representation and modified genetic operators keep individuals correct and help in restoring good genetic material and avoiding premature convergence in suboptimal solutions. The algorithm is tested on instances generated to simulate real life problems. Experimental results show that the algorithm reaches most of optimal solutions for problems containing up to 40 item types. The algorithm is successfully tested on large scale problem instances that can not be handled by CPLEX solver due to memory limits.
This paper presents a variable neighborhood search (VNS) algorithm for solving bandwidth coloring... more This paper presents a variable neighborhood search (VNS) algorithm for solving bandwidth coloring problem (BCP) and bandwidth multicoloring problem (BMCP). BCP and BMCP are generalizations of the well known vertex coloring problem and they are of a great interest from both theoretical and practical points of view. Presented VNS combines a shaking procedure which perturbs the colors for an increasing number of vertices and a specific variable neighborhood descent (VND) procedure, based on the specially designed arrangement of the vertices which are the subject of re-coloring. By this approach, local search is split in a series of disjoint procedures, enabling better choice of the vertices which are addressed to re-color. The experiments show that proposed method is highly competitive with the state-of-the-art algorithms and improves 2 out of 33 previous best known solutions for BMCP.
Computing curricula may differ across the universities due to different approaches to development... more Computing curricula may differ across the universities due to different approaches to development of the programs, as well as different historical background of the universities. This is especially true in developing countries, such as Bosnia and Herzegovina, that are going through implementation of new study programs and harmonization of high education system with the EU standards. These newly created programs being implemented often have limitations due the lack of both human and financial resources needed to implement them. In this paper, similar study programs existing at four public universities in Bosnia and Herzegovina are compared. A comparison of the results are proposed for further steps needed to modify these programs in order to match current and expected future industry needs.
In this paper we present a variable neighborhood search algorithm (VNS) for solving Multiple Leve... more In this paper we present a variable neighborhood search algorithm (VNS) for solving Multiple Level Warehouse Layout Problem (MLWLP). The algorithm deals with a specific representation of the solution, enabling the effective application of the shaking and local search procedures. System of neighborhoods changes the assignment ordering for an increasing number of items, while local search procedure tries to locally improve the solution by swapping the assignment ordering for pairs of items. Numerical experiments are ...
In this paper we present an electromagnetism (EM) metaheuristic for solving NP hard Maximum Betwe... more In this paper we present an electromagnetism (EM) metaheuristic for solving NP hard Maximum Betweenness Problem (MBP). A new encoding scheme with appropriate objective functions is implemented. Specific representation of the individuals enables the EM operators to explore the searching space in a way that achieves high quality solutions. An effective 1-swap based local search procedure improved by the specific caching technique is performed on each EM point. The algorithm is tested both on real and artificial instances ...
In this paper we present a genetic algorithm (GA) for solving NP-hard Multiple Warehouse Layout P... more In this paper we present a genetic algorithm (GA) for solving NP-hard Multiple Warehouse Layout Problem (MLWLP). New encoding scheme with appropriate objective functions is implemented. Specific representation and modified genetic operators keep individuals correct and help in restoring good genetic material and avoiding premature convergence in suboptimal solutions. The algorithm is tested on instances generated to simulate real life problems. Experimental results show that the algorithm reaches most of optimal solutions for problems containing up to 40 item types. The algorithm is successfully tested on large scale problem instances that can not be handled by CPLEX solver due to memory limits.
This paper presents a variable neighborhood search (VNS) algorithm for solving bandwidth coloring... more This paper presents a variable neighborhood search (VNS) algorithm for solving bandwidth coloring problem (BCP) and bandwidth multicoloring problem (BMCP). BCP and BMCP are generalizations of the well known vertex coloring problem and they are of a great interest from both theoretical and practical points of view. Presented VNS combines a shaking procedure which perturbs the colors for an increasing number of vertices and a specific variable neighborhood descent (VND) procedure, based on the specially designed arrangement of the vertices which are the subject of re-coloring. By this approach, local search is split in a series of disjoint procedures, enabling better choice of the vertices which are addressed to re-color. The experiments show that proposed method is highly competitive with the state-of-the-art algorithms and improves 2 out of 33 previous best known solutions for BMCP.
Computing curricula may differ across the universities due to different approaches to development... more Computing curricula may differ across the universities due to different approaches to development of the programs, as well as different historical background of the universities. This is especially true in developing countries, such as Bosnia and Herzegovina, that are going through implementation of new study programs and harmonization of high education system with the EU standards. These newly created programs being implemented often have limitations due the lack of both human and financial resources needed to implement them. In this paper, similar study programs existing at four public universities in Bosnia and Herzegovina are compared. A comparison of the results are proposed for further steps needed to modify these programs in order to match current and expected future industry needs.
In this paper we present a variable neighborhood search algorithm (VNS) for solving Multiple Leve... more In this paper we present a variable neighborhood search algorithm (VNS) for solving Multiple Level Warehouse Layout Problem (MLWLP). The algorithm deals with a specific representation of the solution, enabling the effective application of the shaking and local search procedures. System of neighborhoods changes the assignment ordering for an increasing number of items, while local search procedure tries to locally improve the solution by swapping the assignment ordering for pairs of items. Numerical experiments are ...
In this paper we present an electromagnetism (EM) metaheuristic for solving NP hard Maximum Betwe... more In this paper we present an electromagnetism (EM) metaheuristic for solving NP hard Maximum Betweenness Problem (MBP). A new encoding scheme with appropriate objective functions is implemented. Specific representation of the individuals enables the EM operators to explore the searching space in a way that achieves high quality solutions. An effective 1-swap based local search procedure improved by the specific caching technique is performed on each EM point. The algorithm is tested both on real and artificial instances ...
Uploads
Papers