Robust optimization for the electric vehicle pickup and delivery problem with time windows and uncertain demands
From MaRDI portal
Publication:6164316
DOI10.1016/j.cor.2022.106119OpenAlexW4311969341MaRDI QIDQ6164316
Xiaochang Liu, Yunqiang Yin, Du-Juan Wang, Cheng, T. C. Edwin
Publication date: 4 July 2023
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2022.106119
Related Items
Cites Work
- Routing a mixed fleet of electric and conventional vehicles
- The electric fleet size and mix vehicle routing problem with time windows and recharging stations
- The robust vehicle routing problem with time windows
- A particle swarm optimization for the vehicle routing problem with simultaneous pickup and delivery
- On the one-commodity pickup-and-delivery traveling salesman problem with stochastic demands
- Robust discrete optimization and network flows
- The electric location routing problem with time windows and partial recharging
- Bidirectional labeling in column-generation algorithms for pickup-and-delivery problems
- The two-echelon capacitated electric vehicle routing problem with battery swapping stations: formulation and efficient methodology
- Granular tabu search for the pickup and delivery problem with time windows and electric vehicles
- A large neighborhood search for the pickup and delivery problem with time windows, split loads and transshipments
- Coordinated routing of electric commercial vehicles with intra-route recharging and en-route battery swapping
- The pickup and delivery problem with time windows, multiple stacks, and handling operations
- Exact algorithms for the multi-pickup and delivery problem with time windows
- A branch-and-cut-and-price algorithm for the multi-trip separate pickup and delivery problem with time windows at customers and facilities
- A two-stage hybrid algorithm for pickup and delivery vehicle routing problems with time windows
- A review of vehicle routing with simultaneous pickup and delivery
- Valid inequalities and branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks
- Exact Algorithms for Electric Vehicle-Routing Problems with Time Windows
- An Exact Algorithm for the Pickup and Delivery Problem with Time Windows
- Subset-Row Inequalities Applied to the Vehicle-Routing Problem with Time Windows
- Recent Models and Algorithms for One-to-One Pickup and Delivery Problems
- The Price of Robustness
- Models and branch‐and‐cut algorithms for pickup and delivery problems with time windows