The multi-depot electric vehicle scheduling problem with power grid characteristics

نویسندگان

چکیده

• A bi-objective multi-depot electric transit vehicle scheduling problem. Time-of-use electricity tariffs and peak load risk for power grids are explicitly considered. lexicographic method to reformulate the optimization model achieve win-win situations. tailored branch-and-price algorithm that embeds heuristics a trip chain pool strategy. Higher solution quality computation efficiency compared off-the-shelf solver. Electric buses can bring significant environmental social benefits in future public transportation systems. However, large-scale adoption of faces major technical challenges caused by not only limited running range long charging time, but also complex grid characteristics, such as time-of-use (TOU) risk. On one hand, operation cost is determined TOU pricing schedule. other unbalanced demand resulting from schedule will cause pose potential threat safety. With increasing penetration buses, there real need carefully design manage bus reduce system costs ensure In this paper, we introduce problem, new generalization problem where effects The dual objectives minimize total concurrent recharging activities, constrained capacity depots/stations. time-expanded network devised represent while reformulated method. We propose solve Heuristics strategy embedded into expedite time. Our validated through benchmark real-world Guangzhou, China. results demonstrate our effective savings leveling, far outperforms solver with respect efficiency. application show state-of-the-practice, be significantly reduced, on top fleet size savings.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Development of Model and Algorithm for Depot Balancing Multi-Depot Vehicle Scheduling Problem Considering Depot Balancing

The main of multi-depot vehicle scheduling problem (MDVSP) is to schedule the timetabled trips using limited resources, optimally. The problem is very important in the management of the transportation systems. One of the most useful ways to better manage these systems is to consider the real conditions including depot balancing constraints. To normalize the number of vehicles departed from each...

متن کامل

capacitated multi-depot vehicle routing problem with inter-depot routes

in this paper, we study the multi-depot vehiclerouting problem with inter-depot routes, in which the vehicles can replenish atintermediate depots. vehicles leave the origin depot with load on-board andserve customers until out of load. they may visit an intermediate depot toreplenish and finally return to the origin depot, completing their route. weinitiate a mathematical mixed integer programm...

متن کامل

The Multi-Depot Vehicle Routing Problem with Inter-Depot Routes

This article addresses an extension of the multi-depot vehicle routing problem in which vehicles may be replenished at intermediate depots along their route. It proposes a heuristic combining the adaptative memory principle, a tabu search method for the solution of subproblems, and integer programming. Tests are conducted on randomly generated instances.

متن کامل

Solving the multiple-depot vehicle scheduling problem

The Multiple-Depot Vehicle Scheduling Problem (MDVSP) is the problem where one wants to assign timetabled tasks to vehicles which are housed in multiple depots. This problem is highly relevant for the public transport domain, as competition grows fierce and companies need to stay competitive to survive. As solving the MDVSP optimally is difficult in practice, the aim of this thesis is to give a...

متن کامل

Vehicle Routing Problem with Multi-depot and Multi-task

This paper presents a new mathematical model of the vehicle routing problem in the context of city distribution, which considers multi-depot, multi-model vehicles and multi-task. The objective function includes three parts: transport cost, deadheading cost and time cost. To solve this mathematical model, a self-adaptive and polymorphic ant colony algorithm (APACA) has been introduced. Finally, ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Transportation Research Part B-methodological

سال: 2022

ISSN: ['1879-2367', '0191-2615']

DOI: https://doi.org/10.1016/j.trb.2021.11.007