Pages that link to "Item:Q2147168"
From MaRDI portal
The following pages link to Branch-and-cut-and-price for the electric vehicle routing problem with time windows, piecewise-linear recharging and capacitated recharging stations (Q2147168):
Displaying 15 items.
- The electric fleet size and mix vehicle routing problem with time windows and recharging stations (Q323018) (← links)
- A three-phase matheuristic for the time-effective electric vehicle routing problem with partial recharges (Q1687653) (← links)
- Improved formulations and algorithmic components for the electric vehicle routing problem with nonlinear charging functions (Q1725617) (← links)
- Electric vehicle routing problem with time-dependent waiting times at recharging stations (Q1738821) (← links)
- A matheuristic method for the electric vehicle routing problem with time windows and fast chargers (Q1782172) (← links)
- Granular tabu search for the pickup and delivery problem with time windows and electric vehicles (Q1999625) (← links)
- A branch-and-cut-and-price algorithm for the electric vehicle routing problem with multiple technologies (Q2226503) (← links)
- A branch\&cut approach to recharging and refueling infrastructure planning (Q2315636) (← links)
- A variable neighborhood search branching for the electric vehicle routing problem with time windows (Q2631269) (← links)
- The electric location-routing problem with heterogeneous fleet: formulation and Benders decomposition approach (Q2668681) (← links)
- A column generation tailored to electric vehicle routing problem with nonlinear battery depreciation (Q2669635) (← links)
- The consistent electric-vehicle routing problem with backhauls and charging management (Q2672094) (← links)
- Exact Algorithms for Electric Vehicle-Routing Problems with Time Windows (Q2957464) (← links)
- A survey of attended home delivery and service problems with a focus on applications (Q6142935) (← links)
- A deterministic annealing local search for the electric autonomous dial-a-ride problem (Q6167858) (← links)