A population-based metaheuristic for the pickup and delivery problem with time windows and LIFO loading

DOI10.1016/J.COR.2015.04.002MaRDI QIDQ337617zbMATH OpenOpenAlexFDO

Authors Marilène Cherkesly, Guy Desaulniers, G. Laporte

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

zbMATH Keywords

genetic algorithmadaptive large neighborhood searchgrasplast-in-first-out loadingvehicle routing with pickup and delivery

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06)

Recommendations

• The multiple vehicle pickup and delivery problem with LIFO constraints
• A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with LIFO loading
• The pickup and delivery problem with time windows and handling operations
• Variable neighborhood search for the pickup and delivery traveling salesman problem with LIFO loading
• Branch-price-and-cut algorithms for the pickup and delivery problem with time windows and multiple stacks

Cites work

• A Hybrid Genetic Algorithm for Multidepot and Periodic Vehicle Routing Problems
• A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time-windows
• A penalty-based edge assembly memetic algorithm for the vehicle routing problem with time windows
• A population-based metaheuristic for the pickup and delivery problem with time windows and LIFO loading
• A probabilistic heuristic for a computationally difficult set covering problem
• A simple and effective evolutionary algorithm for the vehicle routing problem
• A two-stage hybrid algorithm for pickup and delivery vehicle routing problems with time windows
• Greedy randomized adaptive search procedures
• Heuristics for multi-attribute vehicle routing problems: a survey and synthesis
• Metaheuristics for the traveling salesman problem with pickups, deliveries and handling costs
• Multiple pickup and delivery traveling salesman problem with last-in-first-out loading and distance constraints
• Probabilistic diversification and intensification in local search for vehicle routing
• Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder)
• The tree representation for the pickup and delivery traveling salesman problem with LIFO loading
• Variable neighborhood search for the pickup and delivery traveling salesman problem with LIFO loading

Cited in

(24)

• Consideration of triple bottom line objectives for sustainability in the optimization of vehicle routing and loading operations: a systematic literature review
• Vehicle routing problems with loading constraints: state-of-the-art and future directions
• The pickup and delivery problem with time windows and handling operations
• The pickup and delivery traveling salesman problem with handling costs
• Urban regional logistics distribution path planning considering road characteristics
• Adaptive large neighborhood search for the time-dependent profitable dial-a-ride problem
• 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
• A mixed rebalancing strategy in bike sharing systems
• A metaheuristic algorithm for a locomotive routing problem arising in the steel industry
• The daily routing and scheduling problem of home health care: based on costs and participants’ preference satisfaction
• Verification of correctness of parallel algorithms in practice
• The multiple vehicle pickup and delivery problem with LIFO constraints
• A mathematical model and algorithms for the aircraft hangar maintenance scheduling problem
• Competition and cooperation in pickup and multiple delivery problems
• A survey of adaptive large neighborhood search algorithms and applications
• The electric vehicle routing problem with shared charging stations
• The vehicle routing problem with simultaneous pickup and delivery and handling costs
• Dynamic courier routing for a food delivery service
• 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
• Exact algorithms for the double vehicle routing problem with multiple stacks
• A multicommodity pickup and delivery problem with time windows and handling time in the omni-channel last-mile delivery
• Exact algorithms for the multi-pickup and delivery problem with time windows

This page was built for publication: A population-based metaheuristic for the pickup and delivery problem with time windows and LIFO loading

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q337617)