Different kinds of networks, such as transportation, communication, computer, and supply networks, are susceptible to similar kinds of inefficiencies. These arise when congestion externalities make the cost for each user depend on the other users’ choice of routes. If each user chooses the least expensive (e.g., the fastest) route from the users’ common point of origin to the common destination...

1 Traffic Engineering We describe a Traffic Engineering (TE) solution which can incorporate non-linear link costs. TE decides on the actual assignment of requests’ flow to (time, path) pairs. Formulation. A byte request, indexed by i, has a quantity of data di to be routed, and a value per byte vi. The request indicates the source Si and target Ti; data must be transmitted along a path from Si ...

The current forest road design systems are not capable of making computer-aided design judgments such as automated generation of alternative grade lines, best fitting vertical alignment for minimizing the total road costs, or consider environmental impact. A three dimensional (3D) forest road design model was developed as a decision support tool that provides a designer with a quick evaluation ...

In the Petrol Station Replenishment Problem with Time Windows (PSRPTW) the aim is to optimize the delivery of several petroleum products to a set of petrol stations using a limited heterogeneous fleet of tank-trucks. More specifically, one must determine the quantity of each product to deliver, the assignment of products to truck compartments, delivery routes, and schedules. The objective is to...

We propose to demonstrate a practical alternative approach to the current state-of-the-art query processing techniques, called the “Query Mesh” (or QM, for short). The main idea of QM is to compute multiple routes (i.e., query plans), each designed for a particular subset of data with distinct statistical properties. Based on the execution routes and the data characteristics, a classifier model...

We propose to demonstrate a practical alternative approach to the current state-of-the-art query processing techniques, called the “Query Mesh” (or QM, for short). The main idea of QM is to compute multiple routes (i.e., query plans), each designed for a particular subset of data with distinct statistical properties. Based on the execution routes and the data characteristics, a classifier model...

short-term prediction of traffic flow is central to alleviating congestion and controlling the negative impacts of environmental pollution resulting from vehicle emissions on both inter- and intra-urban highways. the strong need to monitor and control congestion time and costs for metropolis in developing countries has therefore motivated the current study. this paper establishes the applicatio...

Given a set of m resources and n tasks, the dynamic capacity acquisition and assignment problem seeks a minimum cost schedule of capacity acquisitions for the resources and the assignment of resources to tasks, over a given planning horizon of T periods. This problem arises, for example, in the integrated planning of locations and capacities of distribution centers (DCs), and the assignment of ...

0

The problem of task assignment is one of the most fundamental among combinatorial optimization problems. Solving the Task Assignment Problem is very important for many real time and computational scenarios where a lot of small tasks need to be solved by multiple processors simultaneously. A classic problem that confronts computer scientists across the globe pertaining to the effective assignmen...