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

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

2012
Shih-Wei Lin Chien-Yi Huang Chung-Cheng Lu Kuo-Ching Ying

The permutation flowshop scheduling problem with the objective of minimizing total flow time is known as a NP-hard problem, even for the two-machine cases. Because of the computational complexity of this problem, a multi-start simulated annealing (MSA) heuristic, which adopts a multi-start hill climbing strategy in the simulated annealing (SA) heuristic, is proposed to obtain close-to-optimal s...

2009
Ana I. Pereira

This paper presents a new simulated annealing algorithm to solve constrained multi-global optimization problems. To compute all global solutions in a sequential manner, we combine the function stretching technique with the adaptive simulated annealing variant. Constraint-handling is carried out through a nondifferentiable penalty function. To benchmark our penalty stretched simulated annealing ...

Journal: :مهندسی صنایع 0
زهرا مفاخری کارشناس ارشد مهندسی صنایع، دانشگاه تربیت مدرس علی حسین زاده کاشان استادیار دانشکدة مهندسی صنایع و سیستم ها، دانشگاه تربیت مدرس مجید شیخ محمدی استادیار دانشکدة مهندسی صنایع و سیستم ها، دانشگاه تربیت مدرس

the aim of this paper is to present an efficient method for a rail freight car fleet sizing problem. this problem is modeled mathematically as a multi-period, dynamic and multi-objective, in which the rail freight wagons are assumed to be heterogeneous. demands for different wagons and all travel times are assumed deterministic. in order to increase the utilization of the available wagons in th...

Journal: :Math. Meth. of OR 2006
Mario Villalobos-Arias Carlos A. Coello Coello Onésimo Hernández-Lerma

In this paper we consider a simulated annealing algorithm for multiobjective optimization problems. With a suitable choice of the acceptance probabilities, the algorithm is shown to converge asymptotically, that is, the Markov chain that describes the algorithm converges with probability one to the Pareto optimal set.

A bi-objective mathematical model is developed to simultaneously consider the quay crane and yard truck scheduling problems at container terminals. Main real-world assumptions, such as quay cranes with non-crossing constraints, quay cranes’ safety margins and precedence constraints are considered in this model. This integrated approach leads to better efficiency and productivity at container te...

Reactive power dispatch for voltage profile modification has been of interest Abstract to powerr utilities. Usually local bus voltages can be altered by changing generator voltages, reactive shunts, ULTC transformers and SVCs. Determination of optimum values for control parameters, however, is not simple for modern power system networks. Heuristic and rather intelligent algorithms have to be so...

Journal: :international journal of industrial mathematics 0
m. farhangi faculty of industrial and mechanical engineering, qazvin branch, islamic azad university, qazvin, ‎iran. e. mehdizadeh faculty of industrial and mechanical engineering, qazvin branch, islamic azad university, qazvin, ‎iran.

‎this paper proposes a multi-supplier multi-product inventory model in which the suppliers have unlimited production capacity, allow delayed payment, and offer either an all-unit or incremental discount. the retailer can delay payment until after they have sold all the units of the purchased product. the retailer’s warehouse is limited, but the surplus can be stored in a rented warehouse at a...

From the most important issues in the design of large logistics network in times of crisis are providing a timely quick reaction for treating of injured people and the rapid distribution of medicines and medical equipment. In this paper, a multi-objective model is presented that aims to determine the location of transfer points and hospitals to provide timely quick reaction for treating injured...

2017
Seyed Mahmood Hashemi Jingsha He Alireza Ebrahimi Basabi

modeling of network security is useful approach to comprehend the status. In this paper, network is modeled in a graph. Security problem is solved in graph as Graph Coloring Problem (GCP). In GCP, two adjacent nodes must have different colors. Thus GCP provides the security in the network. One objective in GCP is chromatic number and another objective is total price. We present a multi-objectiv...

2014
VINCENT ROBERGE

An essential aspect of efficiency control of a three-phase induction motor is the ability to generate the optimal magnetic flux required for different operating modes. In this paper, we use the genetic algorithm (GA), the particle swarm optimization algorithm (PSO) and the simulated annealing (SA) to cope with the complexity of the problem and compute feasible and quasi-optimal magnetic flux ne...

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

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