Multi-constrained quality-of-service routing (QoSR) is to find a feasible path that satisfies multiple constraints simultaneously, as an NPC problem, which is also a big challenge for the upcoming next-generation networks. In this paper, we propose SA_MCP, a novel heuristic algorithm, by applying simulated annealing to Dijkstra's algorithm. This algorithm first uses a nonlinear energy function ...

In this paper we address a multi-objective scheduling problem for unrelated parallel machines. In unrelated parallel systems, the processing cost/time of a given job on different machines may vary. The objective of scheduling is to simultaneously determine the job-machine assignment and job sequencing on each machine. In such a way the total cost of the schedule is minimized. The cost function ...

mutual information (mi) is a widely used similarity metric for multimodality image registration. however, it involves an extremely high computational time especially when it is applied to volume images. moreover, its robustness is affected by existence of local maxima. the multi-resolution pyramid approaches have been proposed to speed up the registration process and increase the accuracy of th...

Transparent models search for a balance between interpretability and accuracy. This paper is about the estimation of transparent models of chaotic systems from data, which are accurate and simple enough for their expression to be understandable by a human expert. The models we propose are discrete, built upon common blocks in control engineering (gain, delay, sum, etc.) and optimized both in th...

We present a bi-objective model for a green truck scheduling and routing problem at a cross-docking system. This model determines three key decisions at the cross dock: (1) defining a sequence and schedule of inbound trucks at the receiving door, (2) specifying a sequence and a schedule of outbound trucks at the shipping door, and (3) determining the routes of the outbound truck while serving c...

In this paper we study a novel approach in networked robotics for optimal allocation with interchangeable objective functions, from minimizing the worst-case cost of any agent in a multi-robot team in time-critical missions, to minimizing the team usage of resources. We propose a general model for flexible mission planning, using hierarchical task networks as descriptive framework, the multiple...

This paper presents a new multi-objective Time-Cost Trade-Off (TCTO) model for Critical Chain Project Management (CCPM) networks. The presented model helps crashing a project with little, or no, additional cost. As combinatorial optimization problems' finding optimal decisions are difficult and is time consuming; considering the number of possible permutations involved for TCTO optimization, th...

This paper presents a Simulated Annealing (SA) algorithm for solving the Environmental/Economic Dispatch Problem (EED). This problem is formulated as a multi-objective one with two competing functions, namely economic cost and emission functions, subject to different constraints. The inequality constraints considered are maximum and minimum limits of power generation while the equality constrai...