The Capacitated Arc Routing Problem (CARP) occurs in applications like urban waste collection or winter gritting. It is usually defined in literature on an undirected graph ( ) E V G , = , with a set V of n nodes and a set E of m edges. A fleet of identical vehicles of capacity Q is based at a depot node. Each edge i has a cost (length) i c and a demand i q (e.g. an amount of waste), and it may...

In our cooperation with a Portuguese paper producer, Respicio et al. (2002), we identified two major sequencing objectives: (1) the minimisation of the maximum number of open stacks and (2) the minimisation of the average order spread. The space around the cutting saw is narrow. As the number of produced items increase, packing mistakes arise. Objective (1) concerns the minimisation of these mi...

In this paper the multi-mode resource-constrained project scheduling problem with discounted cash flows is considered. Minimizing the makespan and maximization the net present value (NPV) are the two common objectives that have been investigated in the literature. We apply one evolutionary algorithm named multiobjective particle swarm optimization (MOPSO) to find Pareto front solutions. We used...

This paper presents a new method that effectively determines a Pareto front for biobjective optimization with potential application to multiple objectives. A traditional method for multiobjective optimization is the weighted sum method, which seeks Pareto optimal solutions one by one by systematically changing the weights among the objective functions. Previous research has shown that this meth...

In Pareto bi-objective integer optimization the optimal result corresponds to a set of nondominated solutions. We propose a generic bi-objective branch-and-bound algorithm that uses a problem-independent branching rule exploiting available integer solutions, and cutting plane generation taking advantage of integer objective values. The developed algorithm is applied to the bi-objective team ori...

Bi-Objective Combinatorial Optimization problems are ubiquitous in real-world applications and designing approaches to solve them efficiently is an important research area of Artificial Intelligence. In Constraint Programming, the recently introduced bi-objective Pareto constraint allows one to solve bi-objective combinatorial optimization problems exactly. Using this constraint, every non-domi...

The task scheduling is a key process in large-scale distributed systems like cloud computing infrastructures which can have much impressed on system performance. This problem is referred to as a NP-hard problem because of some reasons such as heterogeneous and dynamic features and dependencies among the requests. Here, we proposed a bi-objective method called DWSGA to obtain a proper solution f...

Communications satellites are designed to provide services by forwarding signals to customers. Uplink signals are filtered and amplified to ensure signal output quality. This is ensured by the payload part of the satellite. Reconfigurable hardware components like switches are embedded in the payload to route signals through the satellite. By setting switch positions, satellite engineers are abl...

Preventive health care is unlike health care for acute ailments, as people are less alert to their unknown medical problems. In order to motivate public and to attain desired participation levels for preventive programs, the attractiveness of the health care facility is a major concern. Health economics literature indicates that attractiveness of a facility is significantly influenced by proxim...

In the pharmaceutical industry, clinical trials constitute a critically important and very expensive part of the new drug development process. A clinical trial supply chain will terminate after 1-2 years, and leftovers at the end of clinical trials constitute an important financial cost since all the unused materials should be disposed after clinical trial completion. Normally, extra safety sto...