This paper deals with the Electric Vehicle (EV) Scheduling and Optimal Charging Problem. More precisely, given a fleet of EVs and Combustion Engine Vehicles (CVs), a set of tours to be processed by vehicles and a charging infrastructure, the problem aims to optimise the assignment of vehicles to tours and minimise the charging cost of EVs while considering several operational constraints mainly related to chargers, electricity grid and EVs driving range. We prove that the Electric Vehicle Scheduling and Charging Problem (EVSCP) is NP-hard in the ordinary sense. We provide a mixed-integer linear programming formulation to model the EVSCP and use CPLEX to solve small and medium instances. To solve large instances, we propose two heuristics: a Sequential Heuristic (SH) and a Global Heuristic (GH). The SH considers the EVs sequentially. To each EV, it assigns a set of tours and guarantees the feasibility of a charging schedule. Then, it generates an optimal charging schedule for this EV. However, the GH computes, in the first step, a feasible assignment of tours to all EVs. In the second step, it applies a global Min-Cost-Flow-based charging algorithm to minimise the charging cost of the EVs fleet. To evaluate the efficiency of our solving approaches, computational results on a large set of real and randomly generated test instances are reported and compared.
Abstract-Although there are few efficient algorithms in the literature for scientific workflow tasks allocation and scheduling for heterogeneous resources such as those proposed in grid computing context, they usually require a bounded number of computer resources that cannot be applied in Cloud computing environment. Indeed, unlike grid, elastic computing, such as Amazon's EC2, allows users to allocate and release compute resources on-demand and pay only for what they use. Therefore, it is reasonable to assume that the number of resources is infinite. This feature of Clouds has been called "illusion of infinite resources". However, despite the proven benefits of using Cloud to run scientific workflows, users lack guidance for choosing between multiple offering while taking into account several objectives which are often conflicting.On the other side, the workflow tasks allocation and scheduling have been shown to be NP-complete problems. Thus, it is convenient to use heuristic rather than deterministic algorithm. The objective of this paper is to design an allocation strategy for Cloud computing platform. More precisely, we propose three complementary bi-criteria approaches for scheduling workflows on distributed Cloud resources, taking into account the overall execution time and the cost incurred by using a set of resources.
The two-echelon location-routing problem (LRP-2E) considers the first-level routes that serve from one depot a set of processing centres, which must be located and the second-level routes that serve customers from the opened processing centres. In this paper, we consider an extension of the LRP-2E, where the second-level routes include three constraints that have not been considered simultaneously in the location routing literature, namely multi-product, pickup and delivery, and the use of the processing centre as intermediate facility in the second-level routes. This new variant is named two-Echelon Multi-products Location-Routing problem with Pickup and Delivery (LRP-MPPD-2E). The objective of LRP-MPPD-2E is to minimise both the location and the routing costs, considering the new constraints. The first echelon deals with the selection of processing centres from a set of potential sites simultaneously with the construction of the first-level routes, such that each route starts from the main depot, visits the selected processing centres and returns to the main depot. The second echelon aims at assigning customers to the selected processing centres and defining the second-level routes. Each second-level route, starts at a processing centre, visits a set of customers, through one or several processing centres, and then returns to the first processing centre. We present a mixed-integer linear model for the problem and use a Cplex solver to solve small-scale instances. Furthermore, we propose non-trivial extensions of the nearest neighbour and insertion approaches. We also develop clustering-based approaches that have not been extensively investigated with regards to location routing. Computational experiments are conducted to evaluate and to compare the performances of the proposed approaches. The results confirm the effectiveness of clustering approaches.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.