نتایج جستجو برای: multi objective simulated annealing algorithm

تعداد نتایج: 1747895  

2007
LINET OZDAMAR

We propose a dual sequence Simulated Annealing algorithm, DSAC, for solving constrained optimization problems. This approach eliminates the need for imposing penalties in the objective function by tracing feasible and infeasible solution sequences independently. We compare DSAC with a similar single sequence algorithm, PSAC, where the objective function is augmented by various penalty forms rel...

In most real world application and problems, a homogeneous product is carried from an origin to a destination by using different transportation modes (e.g., road, air, rail and water). This paper investigates a fixed charge transportation problem (FCTP), in which there are different routes with different capacities between suppliers and customers. To solve such a NP-hard problem, four meta-heur...

Journal: :Computers & Industrial Engineering 2008
Asif S. Raza Ali Akgunduz

The Economic Lot Scheduling Problem (ELSP) has been well-researched for more than 40 years. As the ELSP has been generally seen as NP-hard, researchers have focused on the development of efficient heuristic approaches. In this paper, we consider the time-varying lot size approach to solve the ELSP. A computational study of the existing solution algorithms, Dobson’s heuristic, Hybrid Genetic alg...

امامی میبدی, لیلا, زارع مهرجردی, یحیی, فریدونی, سفیده ,

Since the determination of efficient scheduling plans in sequencing problems with various criterions is considered an important problem, hence in this article a single machine sequencing problem with the minimization type delay and the total weighted lateness objectives are being studied. In this article, the applications of new optimization techniques in sequencing problems and scheduling are ...

2015
F. Musharavati A.M.S. Hamouda

In this paper, three simulated annealing based algorithms that exploit auxiliary knowledge in different ways are devised and employed to handle a manufacturing process planning problem for reconfigurable manufacturing. These algorithms are configured based on a generic combination of the simulated annealing technique with; (a) heuristic knowledge, and (b) metaknowledge. Capabilities of the impl...

Set covering problem has many applications such as emergency systems, retailers’ facilities, hospitals, radar devices, and military logistics, and it is considered as Np-Hard problems. The goal of set covering problem is to find a subset such that :::::::::union::::::::: of the subset members covered the whole set. In this paper, we present a new heuristic algorithm to solve the set covering pr...

Journal: :Fundam. Inform. 2010
Ujjwal Maulik Anasua Sarkar

A hybrid unsupervised learning algorithm, which is termed as Parallel Rough-based Archived Multi-Objective Simulated Annealing (PARAMOSA), is proposed in this article. It comprises a judicious integration of the principles of the rough sets theory and the scalable distributed paradigm with the archived multi-objective simulated annealing approach. While the concept of boundary approximations of...

Journal: :Annals of Operations Research 2022

Abstract According to the increasing carbon dioxide released through vehicles and shortage of water resources, decision-makers decided combine environmental economic effects in Agri-Food Supply Chain Network (AFSCN) developing countries. This paper focuses on citrus fruit supply chain network. The novelty this study is proposal a mathematical model for three-echelon AFSCN considering simultaneo...

2002
Emin Aydin C. Fogarty

The aim of this paper is to examine two new simulated annealing approaches for Uncapacitated Facility Location (UFL) problems with some useful comparisons with the latest genetic algorithm approach (Jaramillo et al, 2002) to the problem. As it is mentioned in various publications, the simulated annealing approach may be very successful in terms of quality of the solution but not so impressive w...

Journal: :J. Applied Mathematics 2013
Xibin Zhao Hehua Zhang Yu Jiang Songzheng Song Xun Jiao Ming Gu

As being one of the most crucial steps in the design of embedded systems, hardware/software partitioning has received more concern than ever. The performance of a system design will strongly depend on the efficiency of the partitioning. In this paper, we construct a communication graph for embedded system and describe the delay-related constraints and the cost-related objective based on the gra...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید