In most deterministic manufacturing decision models, demand is either known or induced by pricing decisions in the period that the demand is experienced. However, in more realistic market scenarios consumers make purchase decisions with respect to price, not only in the current period, but also in past and future periods. We model a joint manufacturing/pricing decision problem, accounting for t...

The con uence of technical advances and multimedia service needs is intensifying the need for high throughput and low latency. Future communication networks will face an increase in tra c driven by multimedia requirements with stringent delay and jitter requirements. Wavelength Division Multiplexing (WDM) optical networks have the potential for meeting these goals by o ering unprecedented high ...

To the degree that citizens have participated in, or derived benefits from, social institutions that have helped cause serious, life-threatening, or rights-threatening environmental injustice (EIJ), this article argues that they have duties either to stop their participation in these institutions or to compensate for it by helping to reform them. (EIJ occurs whenever children, poor people, mino...

It is confirmed through information users’ daily activities that they apply many shortcuts, ignore some information and use heuristics – particularly in electronic social networking environments. The critical analysis of the literature and research findings are used as a base to identify and create a short (preliminary) inventory of information heuristics that people use at various stages of se...

This paper describes a Benders decomposition algorithm capable of efficiently solving large-scale instances of the well-known multi-commodity capacitated network design problem with demand uncertainty. The problem is important because it models many real-world applications, including telecommunications, transportation, and logistics. This problem has been tackled in the literature with meta-heu...

This paper browses through some well-known meta-heuristic search strategies, and briefly discusses some of their recent applications to the VLSI layout design process. It starts with very brief description of the different phases of VLSI layout design, and a brief overview of Meta-Heuristic search strategies. Since most of the VLSI layout design problems are hard optimization problems, the conc...

Conflict-Based Search (CBS) and its enhancements are among the strongest algorithms for the multi-agent pathfinding problem. However, existing variants of CBS do not use any heuristics that estimate future work. In this paper, we introduce different admissible heuristics for CBS by aggregating cardinal conflicts among agents. In our experiments, CBS with these heuristics outperforms previous st...

A hierarchical classifier (cascade) is proposed for target detections. In building an optimal cascade, three heuristics are considered: (1) frontier following approximation, (2) controlling error rates, and (3) weighting. Simulations on synthetic data with various underlying distributions are carried out. It is found that weighting heuristic is optimal in both computational complexity and error...

ÐTask scheduling is essential for the proper functioning of parallel processor systems. Scheduling of tasks onto networks of parallel processors is an interesting problem that is well-defined and documented in the literature. However, most of the available techniques are based on heuristics that solve certain instances of the scheduling problem very efficiently and in reasonable amounts of time...

This paper presents a new hyper-heuristic method using Case-Based Reasoning (CBR) for solving course timetabling problems. The term Hyperheuristics has recently been employed to refer to “heuristics that choose heuristics” rather than heuristics that operate directly on given problems. One of the overriding motivations of hyper-heuristic methods is the attempt to develop techniques that can ope...