An efficient generalised opposition-based multi-objective optimisation method for factory cranes with time-space constraints
by Binghai Zhou; Xiumei Liao
European J. of Industrial Engineering (EJIE), Vol. 14, No. 5, 2020

Abstract: In order to improve the performance of large manufacturing enterprises, besides the adoption of new technologies, it is also feasible to efficiently schedule logistics equipment such as cranes, which costs much less since only software changes are involved. In this research, the objectives of minimising total waiting cost and total delay cost are optimised simultaneously when executing crane-delivery tasks in factories. Given the time-space constraints and NP-hard nature of the problem, a generalised opposition-based learning (GOBL) mechanism and two problem-based searching strategies are developed and fused into the multi-objective differential evolution approach, namely GOMODE. The introduction of GOBL mechanism enables the proposed algorithm to search in a more extensive solution space, which improves the population diversity and avoids the premature problem. The performance of the GOMODE has been compared with classical multi-objective optimisation algorithms. The experimental results indicate that the GOMODE achieves a better performance both on solutions' quality and diversity. [Received: 11 December 2018; Accepted: 23 December 2019]

Online publication date: Tue, 29-Sep-2020

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the European J. of Industrial Engineering (EJIE):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com