Adaptive large neighborhood search for the pickup and delivery problem with time windows, profits, and reserved requests

DOI10.1016/j.ejor.2015.12.032zbMath1346.90147OpenAlexW2203572602MaRDI QIDQ322826

Christian Prins, Haoxun Chen, Yu'an Li

Publication date: 7 October 2016

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2015.12.032

zbMATH Keywords

vehicle routing problemprofittime windowadaptive large neighborhood searchpickup and delivery problem

Mathematics Subject Classification ID

Mixed integer programming (90C11) Transportation, logistics and supply chain management (90B06)

Related Items (28)

Simultaneous product and service delivery vehicle routing problem with time windows and order release dates ⋮ The multi-vehicle profitable pickup and delivery problem ⋮ Using decomposition-based multi-objective algorithm to solve selective pickup and delivery problems with time windows ⋮ A hybrid adaptive large neighborhood search heuristic for the team orienteering problem ⋮ Scheduling heterogeneous multi-load AGVs with battery constraints ⋮ A hybrid metaheuristic for smart waste collection problems with workload concerns ⋮ A survey of adaptive large neighborhood search algorithms and applications ⋮ Solving the winner determination problem in combinatorial auctions for fractional ownership of autonomous vehicles ⋮ Leader-based diffusion optimization model in transportation service procurement under heterogeneous drivers' collaboration networks ⋮ A benders decomposition algorithm for a bid generation problem in the procurement of three-echelon transportation services ⋮ The vehicle routing problem with time windows and flexible delivery locations ⋮ A general deep reinforcement learning hyperheuristic framework for solving combinatorial optimization problems ⋮ Efficient feasibility checks and an adaptive large neighborhood search algorithm for the time-dependent green vehicle routing problem with time windows ⋮ A metaheuristic algorithm for a locomotive routing problem arising in the steel industry ⋮ Transportation service procurement bid construction problem from less than truckload perspective ⋮ A selective adaptive large neighborhood search heuristic for the profitable tour problem with simultaneous pickup and delivery services ⋮ Adaptive large neighborhood search algorithm for route planning of freight buses with pickup and delivery ⋮ Timetable coordination in a rail transit network with time-dependent passenger demand ⋮ Collaborative vehicle routing: a survey ⋮ An adaptive large neighborhood search approach for multiple traveling repairman problem with profits ⋮ Transportation outsourcing problems considering feasible probabilities under stochastic demands ⋮ Pickup and delivery problem with recharging for material handling systems utilising autonomous mobile robots ⋮ Meta-analysis of metaheuristics: quantifying the effect of adaptiveness in adaptive large neighborhood search ⋮ The vehicle routing problem with simultaneous pickup and delivery and handling costs ⋮ A grouping genetic algorithm for multi depot pickup and delivery problems with time windows and heterogeneous vehicle fleets ⋮ Scheduling heterogeneous delivery tasks on a mixed logistics platform ⋮ An adaptive large neighborhood search algorithm for vehicle routing problem with multiple time windows constraints ⋮ Dynamic multi-stage failure-specific cooperative recourse strategy for logistics with simultaneous pickup and delivery

Uses Software

• VRP

Cites Work

• Unnamed Item
• Unnamed Item
• Operational transportation planning of freight forwarding companies in horizontal coalitions
• An adaptive large neighborhood search algorithm for a selective and periodic inventory routing problem
• Shipper collaboration
• A general heuristic for vehicle routing problems
• Transportation planning in freight forwarding companies: Tabu search algorithm for the integrated operational transportation planning problem
• The team orienteering problem
• A heuristic for the multiple tour maximum collection problem
• The team orienteering problem with time windows: an LP-based granular variable neighborhood search
• Optimal solutions for routing problems with profits
• The stochastic bid generation problem in combinatorial transportation auctions
• A two-stage hybrid algorithm for pickup and delivery vehicle routing problems with time windows
• Vehicle Routing
• The prize collecting traveling salesman problem
• On the worst-case performance of some algorithms for the asymmetric traveling salesman problem

This page was built for publication: Adaptive large neighborhood search for the pickup and delivery problem with time windows, profits, and reserved requests