We present, analyze and benchmark two algorithms for simultaneous coalition structure generation assignment: one based entirely on dynamic programming, anytime hybrid approach that uses branch-and-bound together with programming. To evaluate the algorithms’ performance, we them against both CPLEX (an industry-grade solver) state-of-the-art using difficult randomized data sets of varying distrib...

This study investigates dynamic system-optimal (DSO) and user equilibrium (DUE) traffic assignment of departure/arrival-time choices in a corridor network. A morning commute problem with many-to-one pattern origin–destination (OD) demand an evening one-to-many OD are considered. Specifically, we first derive closed-form solution to the DSO based on regularities cost flow variables. By utilizing...

We examine load balancing in a simple pipeline computation, in which a large number of data sets is pipelined through a series of tasks and load balancing is performed by distributing several available processors among the tasks. We compare the performance of the optimal static processor assignment to the performances of three dynamic processor assignment algorithms. Models are derived which al...

Several low earth orbit (LEO) satellite constellations have been proposed for mobile satellite systems (MSS’s). Due to nonstationary coverage regions of individual LEO satellites, the offered traffic load for each cell varies continuously. The variation of the traffic load essentially requires dynamic channel assignment. Furthermore, extremely frequent handover requests require specific techniq...