Distributed Energy-Efficient Assembly Scheduling Problem with Transportation Capacity
The real-life assembly production often has transportation between fabrication and assembly, and the capacity of transportation machine is often considered; however, the previous works are mainly about two-stage distributed assembly scheduling problems. In this study, a distributed energy-efficient...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2022-10-01
|
| Series: | Symmetry |
| Subjects: | |
| Online Access: | https://www.mdpi.com/2073-8994/14/11/2225 |
| _version_ | 1797466375900364800 |
|---|---|
| author | Deming Lei Jinlin Li |
| author_facet | Deming Lei Jinlin Li |
| author_sort | Deming Lei |
| collection | DOAJ |
| description | The real-life assembly production often has transportation between fabrication and assembly, and the capacity of transportation machine is often considered; however, the previous works are mainly about two-stage distributed assembly scheduling problems. In this study, a distributed energy-efficient assembly scheduling problem (DEASP) with transportation capacity is investigated, in which dedicated parallel machines with symmetry under the given conditions, transportation machines and an assembly machine are used. An adaptive imperialist competitive algorithm (AICA) is proposed to minimize makespan and total energy consumption. A heuristic and an energy-saving rule are used to produce initial solutions. An adaptive assimilation with adaptive global search and an adaptive revolution are implemented, in which neighborhood structures are chosen dynamically, and revolution probability and search times are decided by using the solution quality. The features of the problem are also used effectively. Computational experiments are conducted on a number of instances. The computational results demonstrate that the new strategies of AICA are effective and efficient and AICA can provide promising results for the considered DEASP. |
| first_indexed | 2024-03-09T18:36:03Z |
| format | Article |
| id | doaj.art-498bddb814dc407d9f5da9f2ff654128 |
| institution | Directory Open Access Journal |
| issn | 2073-8994 |
| language | English |
| last_indexed | 2024-03-09T18:36:03Z |
| publishDate | 2022-10-01 |
| publisher | MDPI AG |
| record_format | Article |
| series | Symmetry |
| spelling | doaj.art-498bddb814dc407d9f5da9f2ff6541282023-11-24T07:06:54ZengMDPI AGSymmetry2073-89942022-10-011411222510.3390/sym14112225Distributed Energy-Efficient Assembly Scheduling Problem with Transportation CapacityDeming Lei0Jinlin Li1School of Automation, Wuhan University of Technology, Wuhan 430062, ChinaSchool of Automation, Wuhan University of Technology, Wuhan 430062, ChinaThe real-life assembly production often has transportation between fabrication and assembly, and the capacity of transportation machine is often considered; however, the previous works are mainly about two-stage distributed assembly scheduling problems. In this study, a distributed energy-efficient assembly scheduling problem (DEASP) with transportation capacity is investigated, in which dedicated parallel machines with symmetry under the given conditions, transportation machines and an assembly machine are used. An adaptive imperialist competitive algorithm (AICA) is proposed to minimize makespan and total energy consumption. A heuristic and an energy-saving rule are used to produce initial solutions. An adaptive assimilation with adaptive global search and an adaptive revolution are implemented, in which neighborhood structures are chosen dynamically, and revolution probability and search times are decided by using the solution quality. The features of the problem are also used effectively. Computational experiments are conducted on a number of instances. The computational results demonstrate that the new strategies of AICA are effective and efficient and AICA can provide promising results for the considered DEASP.https://www.mdpi.com/2073-8994/14/11/2225schedulingassemblymeta-heuristicimperialist competitive algorithmenergy consumption |
| spellingShingle | Deming Lei Jinlin Li Distributed Energy-Efficient Assembly Scheduling Problem with Transportation Capacity Symmetry scheduling assembly meta-heuristic imperialist competitive algorithm energy consumption |
| title | Distributed Energy-Efficient Assembly Scheduling Problem with Transportation Capacity |
| title_full | Distributed Energy-Efficient Assembly Scheduling Problem with Transportation Capacity |
| title_fullStr | Distributed Energy-Efficient Assembly Scheduling Problem with Transportation Capacity |
| title_full_unstemmed | Distributed Energy-Efficient Assembly Scheduling Problem with Transportation Capacity |
| title_short | Distributed Energy-Efficient Assembly Scheduling Problem with Transportation Capacity |
| title_sort | distributed energy efficient assembly scheduling problem with transportation capacity |
| topic | scheduling assembly meta-heuristic imperialist competitive algorithm energy consumption |
| url | https://www.mdpi.com/2073-8994/14/11/2225 |
| work_keys_str_mv | AT deminglei distributedenergyefficientassemblyschedulingproblemwithtransportationcapacity AT jinlinli distributedenergyefficientassemblyschedulingproblemwithtransportationcapacity |