An adaptive large neighborhood search heuristic for the electric vehicle scheduling problem
From MaRDI portal
Publication:342549
DOI10.1016/j.cor.2016.06.013zbMath1349.90417OpenAlexW2469644863MaRDI QIDQ342549
Publication date: 17 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://backend.orbit.dtu.dk/ws/files/125153260/An_adaptive_large_neighborhood_search_heuristic_for_the_Electric_Vehicle_Scheduling_Problem.post_print.pdf
Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (19)
A path-based solution approach for the green vehicle routing problem ⋮ Electric bus planning \& scheduling: a review of related problems and methodologies ⋮ A heuristic approach for a real-world electric vehicle routing problem ⋮ A hybrid algorithm for urban transit schedule optimization ⋮ Solution approaches for integrated vehicle and crew scheduling with electric buses ⋮ Fleet and charging infrastructure decisions for fast-charging city electric bus service ⋮ The traveling purchaser problem with fast service option ⋮ A survey of adaptive large neighborhood search algorithms and applications ⋮ Scheduling the vehicles of bus rapid transit systems: a case study ⋮ Multi-depot electric vehicle scheduling in in-plant production logistics considering non-linear charging models ⋮ An adaptive large neighbourhood search metaheuristic for hourly learning activity planning in personalised learning ⋮ A large neighborhood search-based matheuristic for the load-dependent electric vehicle routing problem with time windows ⋮ Electric vehicle routing problem with time-dependent waiting times at recharging stations ⋮ A matheuristic method for the electric vehicle routing problem with time windows and fast chargers ⋮ Scheduling of Electric Vehicles in the Police Fleet ⋮ Pickup and delivery problem with recharging for material handling systems utilising autonomous mobile robots ⋮ Meta-analysis of metaheuristics: quantifying the effect of adaptiveness in adaptive large neighborhood search ⋮ A matheuristic for AGV scheduling with battery constraints ⋮ An exact approach for the multi-depot electric bus scheduling problem with time windows
Cites Work
- Unnamed Item
- Unnamed Item
- Routing a mixed fleet of electric and conventional vehicles
- The electric fleet size and mix vehicle routing problem with time windows and recharging stations
- A comparison of five heuristics for the multiple depot vehicle scheduling problem
- Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints
- A parallel route building algorithm for the vehicle routing and scheduling problem with time windows
- Exact Algorithms for Electric Vehicle-Routing Problems with Time Windows
- A branch and bound algorithm for the multiple depot vehicle scheduling problem
This page was built for publication: An adaptive large neighborhood search heuristic for the electric vehicle scheduling problem
