Routing games are one of the most successful domains of application of game theory. It is well understood that simple dynamics converge to equilibria, whose performance is nearly optimal regardless of the size of the network or the number of agents. These strong theoretical assertions prompt a natural question: How well do these pen-and-paper calculations agree with the reality of everyday traf...

centralizing and using proper transportation facilities cut down costs and traffic. hub facilities concentrate on flows to cause economic advantage of scale and multimodal transportation helps use the advantage of another transporter. a distinctive feature of this paper is proposing a new mathematical formulation for a three-stage p-hub location routing problem with simultaneous pick-ups and de...

Multicast routing is one of the most important services in Multi Radio Multi Channel (MRMC) Wireless Mesh Networks (WMN). Multicast routing performance in WMNs could be improved by choosing the best routes and the routes that have minimum interference to reach multicast receivers. In this paper we want to address the multicast routing problem for a given channel assignment in WMNs. The channels...

In this thesis, we develop an algorithm for the container loading problem (CLP) with multi-drop constraints. The CLP is the problem of loading the maximal value of a set of boxes into a container, while ensuring that the boxes neither overlap each other nor the container walls. By adding multi-drop constraints it is further demanded, that the relevant boxes must be available, without rearrangin...

This paper presents the development of a novel framework that optimizes the evacuation of large cities using multiple modes including vehicular traffic, rapid transit, and mass transit shuttle buses. A large-scale evacuation model is developed for the evacuation of the City of Toronto in cases of emergency. A demand estimation model is first designed to accurately quantify the evacuation demand...

one of the most important extensions of the capacitated vehicle routing problem (cvrp) is the vehicle routing problem with simultaneous pickup and delivery (vrpspd) where customers require simultaneous delivery and pick-up service. in this paper, we propose an effective ant colony optimization (eaco) which includes insert, swap and 2-opt moves for solving vrpspd that is different with common an...

The location-routing problem is the most significant and yet new research field in location problems that considers simultaneously vehicle routing problem features with original one for achieving high-quality integrated distribution systems in beside of the global optimum. Simultaneous pickup and delivery based on time windows are the two main characteristics of logistic management that have be...

Context-aware mobility has the potential to make way we travel more efficient, safer, and sustainable. Among possible contexts, safety, in terms of crime levels city regions, is one that been used calculate safer routes. Making a bus route important improve quality life passengers, who often are victims criminals during their journey. However, existing studies focus only on private vehicles do ...

optimal reactive power dispatch (orpd) is a multi-variable problem with nonlinear constraints and continuous/discrete decision variables. due to the stochastic behavior of loads, the orpd requires a probabilistic mathematical model. in this paper, monte carlo simulation (mcs) is used for modeling of load uncertainties in the orpd problem. the problem is formulated as a nonlinear constrained mul...