A resource allocation game with identical preferences is considered where each player, as a node of an undirected unweighted network, tries to minimize her cost by caching an appropriate resource. Using a generalized ordinal potential function, a polynomial time algorithm is devised in order to obtain a pure-strategy Nash equilibrium (NE) when the number of resources is limited or the network h...

The Cumulative Capacitated Vehicle Routing Problem (CCVRP) is a variation of the classical Capacitated Vehicle Routing Problem in which the objective is the minimization of the sum of arrival times at customers, instead of the total routing cost. This paper presents an adaptive large neighborhood search heuristic for the CCVRP. This algorithm is applied to a set of benchmark instances and compa...

Hubs are facilities which are used to switch and transfer commodities between terminals (supplies and demands) in many-to-many distribution systems. The p-hub center allocation problem is concerned with allocating demand and supply nodes to hubs in order to route the traffic between origindestination pairs in minimum time. The capacities of the hubs are given. Most of the researches have discus...

7.

Facility location-allocation (FLA) problem, which has been proved to be a valuable method in siting service facility, is widely used in real life, such as emergency service systems, telecommunication networks, public services, etc. However, in real-world situations, the decision maker often lack the information about the customers’ demands, which leads to the FLA problem in uncertain environmen...

1997 ii ACKNOWLEDGEMENTS We would like mostly to thank Mr. Peter Keenan, who was as much a partner as a supervisor, for his invaluable time and erudite guidance during the summer. We must also pay tribute to our parents for their encouragement and support, not only for the duration of this dissertation, but throughout the year. ABSTRACT The Capacitated Arc Routing Problem is a NP-hard arc routi...

The Maximal Covering Location Problem (MCLP) has the objective of maximizing the total demand volume covered by a facility within a maximum allowable travel distance, S. In this paper, three sets of data 30-node, 324-node and 818-node networks with no existing facilities are analyzed as the capacitated model of MCLP (CMCLP) and first solved by the commercial optimization software, CPLEX. As the...

Although the use of multiple unmanned aerial vehicles (UAVs) has great potential for fast autonomous exploration, it received far too little attention. In this article, we present a RApid Collaborative ExploRation (RACER) approach using fleet decentralized UAVs. To effectively dispatch UAVs, pairwise interaction based on an online hgrid space decomposition is used. It ensures that all UAVs simu...