Pickup and delivery problem with recharging for material handling systems utilising autonomous mobile robots
DOI10.1016/j.ejor.2020.07.049zbMath1487.90121OpenAlexW3046666013MaRDI QIDQ2029292
Yuehwern Yih, Sungbum Jun, Seokcheon Lee
Publication date: 3 June 2021
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2020.07.049
memetic algorithmmixed-integer linear programmingautonomous mobile robotspickup and delivery problemmaterial handling
Mixed integer programming (90C11) Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (1)
Uses Software
Cites Work
- Adaptive large neighborhood search for the pickup and delivery problem with time windows, profits, and reserved requests
- The electric fleet size and mix vehicle routing problem with time windows and recharging stations
- An adaptive large neighborhood search heuristic for the electric vehicle scheduling problem
- CLOVES: a cluster-and-search heuristic to solve the vehicle routing problem with delivery and pick-up
- The pickup and delivery problem with time windows
- A three-phase matheuristic for the time-effective electric vehicle routing problem with partial recharges
- An energy-efficient green-vehicle routing problem with mixed vehicle fleet, partial battery recharging and time windows
- The electric location routing problem with time windows and partial recharging
- A matheuristic method for the electric vehicle routing problem with time windows and fast chargers
- A Branch-and-Cut Algorithm for the Dial-a-Ride Problem
- The General Pickup and Delivery Problem
This page was built for publication: Pickup and delivery problem with recharging for material handling systems utilising autonomous mobile robots
