A population-based metaheuristic for the pickup and delivery problem with time windows and LIFO loading
From MaRDI portal
Publication:337617
DOI10.1016/j.cor.2015.04.002zbMath1348.90075OpenAlexW2089432311MaRDI QIDQ337617
Marilène Cherkesly, Gilbert Laporte, Guy Desaulniers
Publication date: 10 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2015.04.002
genetic algorithmadaptive large neighborhood searchgrasplast-in-first-out loadingvehicle routing with pickup and delivery
Related Items
The pickup and delivery problem with time windows, multiple stacks, and handling operations, A population-based metaheuristic for the pickup and delivery problem with time windows and LIFO loading, The pickup and delivery problem with time windows and handling operations, An exact decomposition method to save trips in cooperative pickup and delivery based on scheduled trips and profit distribution, Multi-restart iterative search for the pickup and delivery traveling salesman problem with FIFO loading, Exact algorithms for the double vehicle routing problem with multiple stacks, Exact algorithms for the multi-pickup and delivery problem with time windows, A survey of adaptive large neighborhood search algorithms and applications, Adaptive large neighborhood search for the time-dependent profitable dial-a-ride problem, A mixed rebalancing strategy in bike sharing systems, The daily routing and scheduling problem of home health care: based on costs and participants’ preference satisfaction, The electric vehicle routing problem with shared charging stations, A metaheuristic algorithm for a locomotive routing problem arising in the steel industry, Verification of Correctness of Parallel Algorithms in Practice, Competition and Cooperation in Pickup and Multiple Delivery Problems, Consideration of triple bottom line objectives for sustainability in the optimization of vehicle routing and loading operations: a systematic literature review, Dynamic courier routing for a food delivery service, The pickup and delivery traveling salesman problem with handling costs, Vehicle routing problems with loading constraints: state-of-the-art and future directions, The vehicle routing problem with simultaneous pickup and delivery and handling costs, A mathematical model and algorithms for the aircraft hangar maintenance scheduling problem, Urban regional logistics distribution path planning considering road characteristics
Cites Work
- A population-based metaheuristic for the pickup and delivery problem with time windows and LIFO loading
- A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time-windows
- The tree representation for the pickup and delivery traveling salesman problem with LIFO loading
- A penalty-based edge assembly memetic algorithm for the vehicle routing problem with time windows
- A probabilistic heuristic for a computationally difficult set covering problem
- Metaheuristics for the traveling salesman problem with pickups, deliveries and handling costs
- Greedy randomized adaptive search procedures
- A simple and effective evolutionary algorithm for the vehicle routing problem
- Probabilistic diversification and intensification in local search for vehicle routing
- Multiple pickup and delivery traveling salesman problem with last-in-first-out loading and distance constraints
- Heuristics for multi-attribute vehicle routing problems: a survey and synthesis
- A two-stage hybrid algorithm for pickup and delivery vehicle routing problems with time windows
- Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder)
- Variable Neighborhood Search for the Pickup and Delivery Traveling Salesman Problem with LIFO Loading
- A Hybrid Genetic Algorithm for Multidepot and Periodic Vehicle Routing Problems
