در هنگام جستجو کلمه در قسمت عنوان میتوانید کلمات مورد جستجو را با کاراکتر (-) جدا کنید.
کاربرد نوع شرط:
- جایگاه : پژوهشی
- مجله: Journal of Information Technology Management
- نوع مقاله: Journal Article
- کلمات کلیدی: Firefly Algorithm,clustering,Wireless sensor networks,Shuffled Frog Leaping Algorithm,Bio-inspired Algorithm
- چکیده:
- چکیده انگلیسی: In order to achieve the sensing, communication and processing tasks of Wireless Sensor Networks, an energy-efficient routing protocol is required to manage the dissipated energy of the network and to minimalize the traffic and the overhead during the data transmission stages. Clustering is the most common technique to balance energy consumption amongst all sensor nodes throughout the network. In this paper, a multi-objective bio-inspired algorithm based on the Firefly and the Shuffled frog-leaping algorithms is presented as a clustering-based routing protocol for Wireless Sensor Networks. The multi-objective fitness function of the proposed algorithm has been performed on different criteria such as residual energy of nodes, inter-cluster distances, cluster head distances to the sink and overlaps of clusters, to select the proper cluster heads at each round. The parameters of the proposed approach in the clustering phase can be adaptively tuned to achieve the best performance based on the network requirements. Simulation outcomes have displayed average lifetime improvements of up to 33.95%, 32.62%, 12.1%, 13.85% compared with LEACH, ERA, SIF and FSFLA respectively, in different network scenarios.
- انتشار مقاله: 02-08-1398
- نویسندگان: Amirhossein Barzin,Ahmad Sadeghieh,Hassan Khademi Zare,Mahboobeh Honarvar
- مشاهده
- جایگاه : پژوهشی
- مجله: Advances in Industrial Engineering
- نوع مقاله: Journal Article
- کلمات کلیدی: Complementary product package,Heuristic algorithm,Hierarchical planning,Lot-sizing,Production Scheduling
- چکیده:
- چکیده انگلیسی: The lot sizing and scheduling problems for quick response to the diverse customers’ demands through the optimal utilization of resources and reducing the costs has a particular importance. In this paper, it is investigated the lot sizing and scheduling problem for complementary products. Each package consists of several complementary products with certain portions and different processing times, producing on the parallel production lines in a make-to-stock environment. To solve the problem, it is proposed a hierarchical approach with the objectives of minimizing the package costs, bound and stock, and maximizing the capacity utilization at the first level, and the aim of minimizing the completion time of complementary products at the second level. The second level model is difficult-to-solve in the large-sized instances; therefore, a rolling horizon heuristic solution algorithm is developed whose comparing performance to the exact solution as well as a proposed lower bound in different numerical examples, show the solution quality and its appropriate computation time. To validate the model, the actual data of a tile factory have been employed. Results show that the production plan, costs and times to complete the packages are improved, compared to the current process in the factory.
- انتشار مقاله: 22-01-1395
- نویسندگان: Najmeh Abbasi Hafshejani,Mohammad Mahdi Lotfi,Mahboobe Honarvar
- مشاهده
- جایگاه : پژوهشی
- مجله: Advances in Industrial Engineering
- نوع مقاله: Journal Article
- کلمات کلیدی: Complementary product package,Heuristic algorithm,Hierarchical planning,Lot-sizing,Production Scheduling
- چکیده:
- چکیده انگلیسی: The lot sizing and scheduling problems for quick response to the diverse customers’ demands through the optimal utilization of resources and reducing the costs has a particular importance. In this paper, it is investigated the lot sizing and scheduling problem for complementary products. Each package consists of several complementary products with certain portions and different processing times, producing on the parallel production lines in a make-to-stock environment. To solve the problem, it is proposed a hierarchical approach with the objectives of minimizing the package costs, bound and stock, and maximizing the capacity utilization at the first level, and the aim of minimizing the completion time of complementary products at the second level. The second level model is difficult-to-solve in the large-sized instances; therefore, a rolling horizon heuristic solution algorithm is developed whose comparing performance to the exact solution as well as a proposed lower bound in different numerical examples, show the solution quality and its appropriate computation time. To validate the model, the actual data of a tile factory have been employed. Results show that the production plan, costs and times to complete the packages are improved, compared to the current process in the factory.
- انتشار مقاله: 22-01-1395
- نویسندگان: Najmeh Abbasi Hafshejani,Mohammad Mahdi Lotfi,Mahboobe Honarvar
- مشاهده