A parallel heuristic for the vehicle routing problem with simultaneous pickup and delivery
From MaRDI portal
Publication:976005
DOI10.1016/j.cor.2009.10.011zbMath1188.90041OpenAlexW2167890839MaRDI QIDQ976005
L. M. A. Drummond, C. Bentes, Luiz Satoru Ochi, Anand Subramanian, Ricardo L. S. Farias
Publication date: 11 June 2010
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2009.10.011
Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Parallel algorithms in computer science (68W10)
Related Items
Optimizing energy consumption of robotic cells by a branch \& bound algorithm, A perturbation based variable neighborhood search heuristic for solving the vehicle routing problem with simultaneous pickup and delivery with time limit, Solution approaches for the vehicle routing problem with occasional drivers and time windows, A matheuristic approach for the pollution-routing problem, A bi-objective two-echelon pollution routing problem with simultaneous pickup and delivery under multiple time windows constraint, Improved bounds for large scale capacitated arc routing problem, A hybrid algorithm for a class of vehicle routing problems, Multi-start iterated local search for the periodic vehicle routing problem with time windows and time spread constraints on services, An iterated local search heuristic for the split delivery vehicle routing problem, Hybrid metaheuristics for the clustered vehicle routing problem, Improving the quality of heuristic solutions for the capacitated vertex \(p\)-center problem through iterated greedy local search with variable neighborhood descent, Efficient local search limitation strategy for single machine total weighted tardiness scheduling with sequence-dependent setup times, A multi-start iterated local search algorithm for the generalized quadratic multiple knapsack problem, An open source spreadsheet solver for vehicle routing problems, A parallel variable neighborhood search for the vehicle routing problem with divisible deliveries and pickups, Exact and heuristic algorithms for order acceptance and scheduling with sequence-dependent setup times, Using parallel \& distributed computing for real-time solving of vehicle routing problems with stochastic demands, Multiobjective vehicle routing problem with fixed delivery and optional collections, Branch-cut-and-price for the vehicle routing problem with simultaneous pickup and delivery, A review of vehicle routing with simultaneous pickup and delivery, Exact algorithms for the multi-pickup and delivery problem with time windows, A hybrid algorithm for the multi-depot heterogeneous dial-a-ride problem, Adaptive large neighborhood search for vehicle routing problems with transshipment facilities arising in city logistics, A simple and effective metaheuristic for the minimum latency problem, Parallel local search algorithms for high school timetabling problems, The static bike relocation problem with multiple vehicles and visits, A general VNS for the multi-depot open vehicle routing problem with time windows, Improving a state‐of‐the‐art heuristic for the minimum latency problem with data mining, Parallel computational optimization in operations research: a new integrative framework, literature review and research directions, Integrated ant colony and tabu search approach for time dependent vehicle routing problems with simultaneous pickup and delivery, Branch-and-cut with lazy separation for the vehicle routing problem with simultaneous pickup and delivery, Ils-based algorithms for the profit maximizing uncapacitated hub network design problem with multiple allocation, New neighborhoods and an iterated local search algorithm for the generalized traveling salesman problem, Order matters -- a variable neighborhood search for the swap-body vehicle routing problem, Planification des tournées dans le domaine de la messagerie rapide, The road train optimization problem with load assignment, Hybrid genetic search for the traveling salesman problem with hybrid electric vehicle and time windows, A metaheuristic algorithm for a locomotive routing problem arising in the steel industry, Vehicle routing with multiple deliverymen: modeling and heuristic approaches for the VRPTW, A hybrid GRASP+VND heuristic for the two-echelon vehicle routing problem arising in city logistics, A selective adaptive large neighborhood search heuristic for the profitable tour problem with simultaneous pickup and delivery services, A mathematical formulation and heuristic approach for the heterogeneous fixed fleet vehicle routing problem with simultaneous pickup and delivery, The multi-pickup and delivery problem with time windows, Exact and heuristic approaches for the set cover with pairs problem, Parallel metaheuristics: recent advances and new trends, Scatter search for the stochastic travel-time vehicle routing problem with simultaneous pick-ups and deliveries, A fast randomized algorithm for the heterogeneous vehicle routing problem with simultaneous pickup and delivery, An on-demand same-day delivery service using direct peer-to-peer transshipment strategies, Route and speed optimization for autonomous trucks, A tabu search algorithm for the vehicle routing problem with discrete split deliveries and pickups, Large neighborhood-based metaheuristic and branch-and-price for the pickup and delivery problem with split loads, A GVNS algorithm for solving the multi-depot vehicle routing problem, A unified solution framework for multi-attribute vehicle routing problems, A parallel hybrid metaheuristic for bicluster editing, Bi-objective optimization model for the heterogeneous dynamic dial-a-ride problem with no rejects, A hybrid heuristic based on General Variable Neighborhood Search for the Single Vehicle Routing Problem with Deliveries and Selective Pickups, GENVNS-TS-CL-PR: A heuristic approach for solving the vehicle routing problem with simultaneous pickup and delivery, Shipper collaboration in forward and reverse logistics, A unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems, A study on intelligent user-centric logistics service model using ontology, A variable neighborhood search-based algorithm with adaptive local search for the vehicle routing problem with time windows and multi-depots aiming for vehicle fleet reduction, Iterated greedy algorithms for a complex parallel machine scheduling problem, Heuristic algorithms for a vehicle routing problem with simultaneous delivery and pickup and time windows in home health care, Heuristics for multi-attribute vehicle routing problems: a survey and synthesis
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Heuristic algorithms for single and multiple depot vehicle routing problems with pickups and deliveries
- A unified heuristic for a large class of vehicle routing problems with backhauls
- An ant colony system (ACS) for vehicle routing problem with simultaneous delivery and pickup
- Heuristic algorithms for the vehicle routing problem with simultaneous pick-up and delivery
- General solutions to the single vehicle routing problem with pickups and deliveries
- A reactive tabu search algorithm for the vehicle routing problem with simultaneous pickups and deliveries
- A parallel algorithm for the vehicle routing problem with time window constraints
- Variable neighborhood search
- Parallel branch, cut, and price for large-scale discrete optimization
- A library hierarchy for implementing scalable parallel search algorithms
- A cooperative parallel meta-heuristic for the vehicle routing problem with time windows
- Parallelization of a two-phase metaheuristic for routing problems with time windows
- A parallel hybrid genetic algorithm for the vehicle routing problem with time windows
- Probabilistic diversification and intensification in local search for vehicle routing
- Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
- A tabu search algorithm for the vehicle routing problem with simultaneous pick-up and delivery service
- A cluster insertion heuristic for single and multiple depot vehicle routing problems with backhauling
- Metaheuristics applied to mixed and simultaneous extensions of vehicle routing problems with backhauls
- Parallel Solution Methods for Vehicle Routing Problems
- A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows
- An asynchronous parallel metaheuristic for the period vehicle routing problem
- Parallel Tabu Search for Real-Time Vehicle Routing and Dispatching
- Vehicle routing problem with simultaneous deliveries and pickups
- Evolutionary Computation in Combinatorial Optimization
- Evolutionary Computation in Combinatorial Optimization
- Vehicle routing and reverse logistics: The vehicle routing problem with simultaneous delivery and pick-up
- A dynamic model and parallel tabu search heuristic for real-time ambulance relocation
