Network reconfiguration is a nonlinear optimization procedure which calculates a radial structure to optimize the power losses and improve the network reliability index while meeting practical constraints. In this paper, a multi-objective framework is proposed for optimal network reconfiguration with the objective functions of minimization of power losses and improvement of reliability index. T...

banking and financial services are important parts of the service industry. quality of service in the banking industry has a close relationship with customer satisfaction service system. banks could create competitive advantage by increasing customer satisfaction and reduce costs in today's competitive environment. this paper presents a decision-making model to obtain optimum tasks assigne...

in this paper, the application of neural networks for simulation and optimization of the cogeneration systems has been presented. cgam problem, a benchmark in cogeneration systems, is chosen as a casestudy. thermodynamic model includes precise modeling of the whole plant. for simulation of the steadysate behavior, the static neural network is applied. then using dynamic neural network, plant is...

time-dependent vehicle routing problem is one of the most applicable but least-studied variants of routing and scheduling problems. in this paper, a novel mathematical formulation of time-dependent vehicle routing problems with heterogeneous fleet, hard time widows and multiple depots, is proposed. to deal with the traffic congestions, we also considered that the vehicles are not forced to come...

in this paper, an efficient extension of network simplex algorithm is presented. in static scheduling problem, where there is no change in situation, the challenge is that the large problems can be solved in a short time. in this paper, the static scheduling problem of automated guided vehicles in container terminal is solved by network simplex algorithm (nsa) and nsa+, which extended the stand...

this paper presents a parameterization method to optimal trajectory planning and dynamic obstacle avoidance for omni-directional robots. the aim of trajectory planning is minimizing a quadratic cost function while a maximum limitation on velocity and acceleration of robot is considered. first, we parameterize the trajectory using polynomial functions with unknown coefficients which transforms t...

investment plays a vital role on economic growth. one of the main objectives of all countries is to achieve sustainable economic growth and development. nowadays, a considerable amount of activities performed by the managers and investors in general is to make a portfolio of assets effectively meeting demand goals. in this study, mean-variance markowitz model by cardinality constraints and also...

the travelling salesmen problem (tsp) is one of the most important and famous combinational optimization problems that aim to find the shortest tour. in this problem, the salesman starts to move from an arbitrary place called depot and after visiting all nodes, finally comes back to depot. solving this problem seems hard because program statement is simple and leads this problem belonging to np...

the traveling salesman problem (tsp) is a well-known combinatorial optimization problem and holds a central place in logistics management. the tsp has received much attention because of its practical applications in industrial problems. many exact, heuristic and metaheuristic approaches have been proposed to solve tsp in recent years. in this paper, a modified ant colony optimization (maco) is ...