A hybrid optimization approach for sustainable process planning and scheduling

Abstract

Abstract. Process planning and scheduling are important stages in manufacturing, and good strategies can significantly improve the energy performance of manufacturing to achieve sustainability. In this paper, an innovative optimization approach has been developed to facilitate sustainable process planning and scheduling. In the approach, honey-bee mating and annealing processes are simulated to optimize multi-objectives including energy consumption, makespan and the balanced machine utilization. Experiments on practical cases show that the optimization results from this approach are promising in comparison with those from a genetic algorithm, a honey bee mating optimization algorithm, ant colony optimization and a simulated annealing algorithm, respectively.

Diagrid: An innovative, sustainable, and efficient structural system

“…Nowadays, sustainable design is at the cutting edge of design of tall buildings . Sustainability can mean different things from generation of green energy on the site to water conservation and reuse to minimizing the carbon emission or footprint of the structure . Consequently, a multicriteria optimization is advocated where several different criteria are defined simultaneously such as (a) minimum cost, (b) minimum carbon emission, and (c) minimum drift.…”

Physics‐based search and optimization: Inspirations from nature

“…Job-shop scheduling problem (JSSP) is a typical NP-hard problem (Zhang, Luo & Dong, 2015;Li, Li, Cai, & He, 2015). EMO algorithm has been applied to JSSP by a number of researchers (Chao & Liao, 2012;Roshanaei, Balagh, Esfahani, & Vahdani, 2009).…”

Applications of Gravitational Search Algorithm in Engineering

“…The goal of TSP is to find a tour with the minimum total length among all such possible tours for the given graph where each city is visited only once. Many real world combinatorial optimisation problems can be formulated as an instance of the TSP such as scheduling (Li et al 2015), routing, placement of goods and machines in the warehouse, and printed circuit design. Dowlatshahi et al (2014) applied a discrete GSA to a set of 54 Euclidean benchmark instances of TSP with sizes ranging from 51 to 2392 nodes.…”