Economic and environmental impacts of the energy source for the utility production system in the HDA process

The well-known benchmark process for hydrodealkylation of toluene (HDA) to produce benzene is revisited in a multi-objective approach for identifying environmentally friendly and cost-effective operation solutions. The paper begins with the presentation of the numerical tools used in this work, i.e., a multi-objective genetic algorithm and a Multiple Choice Decision Making procedure. Then, two studies related to the energy source involved in the utility production system (UPS), either fuel oil or natural gas, of the HDA process are carried out. In each case, a multi-objective optimization problem based on the minimization of the total annual cost of the process and of five environmental burdens, that are Global Warming Potential, Acidification Potential, Photochemical Ozone Creation Potential, Human Toxicity Potential and Eutrophication Potential, is solved and the best solution is identified by use of Multiple Choice Decision Making procedures. An assessment of the respective contribution of the HDA process and the UPS towards environmental impacts on the one hand, and of the environmental impacts generated by the main equipment items of the HDA process on the other hand is then performed to compare both solutions. This ‘‘gate-to-gate’’ environmental study is then enlarged by implementing a ‘‘cradle-togate’’ Life Cycle Assessment (LCA), for accounting of emission inventory and extraction. The use of a natural gas turbine, less economically efficient, turns out to be a more attractive alternative to meet the societal expectations concerning environment preservation and sustainable development

Multi-objective discrete particle swarm optimisation algorithm for integrated assembly sequence planning and assembly line balancing

In assembly optimisation, assembly sequence planning and assembly line balancing have been extensively studied because both activities are directly linked with assembly efficiency that influences the final assembly costs. Both activities are categorised as NP-hard and usually performed separately. Assembly sequence planning and assembly line balancing optimisation presents a good opportunity to be integrated, considering the benefits such as larger search space that leads to better solution quality, reduces error rate in planning and speeds up time-to-market for a product. In order to optimise an integrated assembly sequence planning and assembly line balancing, this work proposes a multi-objective discrete particle swarm optimisation algorithm that used discrete procedures to update its position and velocity in finding Pareto optimal solution. A computational experiment with 51 test problems at different difficulty levels was used to test the multi-objective discrete particle swarm optimisation performance compared with the existing algorithms. A statistical test of the algorithm performance indicates that the proposed multi-objective discrete particle swarm optimisation algorithm presents significant improvement in terms of the quality of the solution set towards the Pareto optimal set

Optimisation of Mobile Communication Networks - OMCO NET

The mini conference “Optimisation of Mobile Communication Networks” focuses on advanced methods for search and optimisation applied to wireless communication networks. It is sponsored by Research & Enterprise Fund Southampton Solent University. The conference strives to widen knowledge on advanced search methods capable of optimisation of wireless communications networks. The aim is to provide a forum for exchange of recent knowledge, new ideas and trends in this progressive and challenging area. The conference will popularise new successful approaches on resolving hard tasks such as minimisation of transmit power, cooperative and optimal routing

Recent Advances in Graph Partitioning

We survey recent trends in practical algorithms for balanced graph partitioning together with applications and future research directions

Bi-Objective Community Detection (BOCD) in Networks using Genetic Algorithm

A lot of research effort has been put into community detection from all corners of academic interest such as physics, mathematics and computer science. In this paper I have proposed a Bi-Objective Genetic Algorithm for community detection which maximizes modularity and community score. Then the results obtained for both benchmark and real life data sets are compared with other algorithms using the modularity and MNI performance metrics. The results show that the BOCD algorithm is capable of successfully detecting community structure in both real life and synthetic datasets, as well as improving upon the performance of previous techniques.Comment: 11 pages, 3 Figures, 3 Tables. arXiv admin note: substantial text overlap with arXiv:0906.061