Dominance of fossil fuels in the transportation sector has led to environmental and economical problems and transition to Alternative Fuel Vehicle (AFV) has become a necessity. Electric Vehicle (EV) is one of the AFVs that deliver clear benefit of zero tailpipe emissions. The EVs have a limited range and their use is influenced by the location of recharging facilities. The charging time of EV is long and recharging in stations take a lot of time. In addition, the capacity of recharging stations is limited and if the capacity is occupied the vehicles must wait in queues. In this paper, a recharging station location model with queue is proposed which considers capacity, recharging time, and waiting time. The presented model is a set covering and can easily become a maximum cover model with or without predefined activities. A heuristic algorithm to solve the model is proposed and the model is evaluated using two networks under various conditions; a random generated and a network of Penghu County. The obtained results indicate that the model is able to identify the location and the number of the recharging stations and provide a good travel plan especially for tourism.
Service Function Chaining and Network Function Virtualization are enabling technologies that provide dynamic network services with diverse QoS requirements. Regarding the limited infrastructure resources, service providers need to prioritize service requests and even reject some of low-priority requests to satisfy the requirements of high-priority services. In this paper, we study the problem of deployment and reconfiguration of a set of chains with different priorities with the objective of maximizing the service provider's profit; wherein, we also consider management concerns including the ability to control the migration of virtual functions. We show the problem is more practical and comprehensive than the previous studies, and propose an MILP formulation of it along with two solving algorithms. The first algorithm is a fast polynomial-time heuristic that calculates an initial feasible solution to the problem. The second algorithm is an exact method that utilizes the initial feasible solution to achieve the optimal solution quickly. Using extensive simulations, we evaluate the algorithms and show the proposed heuristic can find a feasible solution in at least 83% of the simulation runs in less than 7 seconds, and the exact algorithm can achieve 25% more profit 8 times faster than the state-of-the-art MILP solving methods.