We present a capacity constrained network flow optimization approach for finding evacuation paths, flows and schedules so as to maximize the total evacuees for short notice evacuation planning (SNEP). Due to dynamic nature of this optimization problem, we first construct a time-expanded network...

For the class of shortest path games, we propose a family of new cost sharing rules satisfying core selection. These rules allocate shares according to some lexicographic preference relation. A computational procedure is provided. Our results relate to those of Tijs et al. (2011).

In recent years, online social networks (OSN) have emerged as a platform of sharing variety of information about people, and their interests, activities, events and news from real worlds. Due to the large scale and access limitations (e.g., privacy policies) of online social network services...

Split Delivery Vehicle Routing Problem (SDVRP) is a relaxation of the Capacitated Vehicle Routing Problem (CVRP) that allows the same customer to be served by more than one vehicle. Existing literature has applied Ant Colony Optimization (ACO) and Genetic Algorithm (GA) to other variants of VRP...

This article describes how cloud computing and the convergence toward “Everything as a service” have encouraged the proliferation of services ready for use. These facilities have increased the requests of the companies for the development of the applications. In this context, where the...

This paper proposes an alternative model to deliver vital signs of patients in a hospital indoor environment where a large number of patients exist and the traffic generated rapidly changes over time using Body Area Network (BAN). The methodology for finding an optimal path includes a...

In Mobile Ad Hoc Network (MAC), the existing MAC protocol based on the short busy advertisement is not an efficient method for data fragmentation. In addition, the data-fragment length adjustment according to the network environments is still an issue. In order to overcome this issue, in this...