Learn More
Computer-based visual systems are now used to support the planning of urban areas. A good example of such systems are the virtual models of Bath and Edinburgh which play a key role in urban planning in these historic cities. Such systems are exceptional in that few local authorities regularly use them for planning; however, it is widely argued that new(More)
In practice, cutting large number of pieces with different shapes often requires a well plan of assigning number of shapes on the cut template. The working arrangement of the cut-template is treated as Cut order plan (COP). The aim is to optimize cutting templates of fabric cutting function in apparel manufacturing firms when the cut order requirement is(More)
Nature inspired algorithms for their powerfulness, acquire a unique place among the algorithms for optimization. This paper intends to provide a comparison of firefly algorithm (FA) with 3 other nature inspired algorithms; genetic algorithms (GA), particle swarm optimization algorithm (PSO) and ant colony systems (ACS). Traveling salesman problem (TSP) has(More)
Extracting the actual boundary of a tooth is useful in order to obtain an accurate shape to design a false tooth. A tooth in a dental X-ray image, however, exhibits sharp corners at its root making the boundary extraction task difficult. In this paper, a new technique based on active contours is presented along with a novel modification to detect sharp(More)
Ant colony system (ACS) is a promising approach which has been widely used in problems such as Travelling Salesman Problems (TSP), Job shop scheduling problems (JSP) and Quadratic Assignment problems (QAP). In its original implementation, parameters of the algorithm were selected by trial and error approach. Over the last few years, novel approaches have(More)
The paper examines the combination the conventional heuristic of COP generation and Genetic algorithm (GA) to optimize Cut order plan (COP) solutions in apparel industry. Cut planners in apparel organizations need to decide the cut templates of fabric cutting when the cut order requirement is known. As NP-hard problem with several constrains, COP requires a(More)
  • 1