A parallel heuristic for the vehicle routing problem with simultaneous pickup and delivery
From MaRDI portal
Publication:976005
DOI10.1016/J.COR.2009.10.011zbMATH Open1188.90041OpenAlexW2167890839MaRDI QIDQ976005FDOQ976005
Authors: Lúcia M. A. Drummond, C. Bentes, A. Subramanian, Luiz S. Ochi, 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
Recommendations
- A parallel algorithm for the vehicle routing problem
- Saving-based algorithms for vehicle routing problem with simultaneous pickup and delivery
- GENVNS-TS-CL-PR: a heuristic approach for solving the vehicle routing problem with simultaneous pickup and delivery
- Parallel solution methods for vehicle routing problems
- A parallel variable neighborhood search for the vehicle routing problem with divisible deliveries and pickups
Approximation methods and heuristics in mathematical programming (90C59) Parallel algorithms in computer science (68W10) Transportation, logistics and supply chain management (90B06)
Cites Work
- A library hierarchy for implementing scalable parallel search algorithms
- A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows
- Variable neighborhood search
- A unified heuristic for a large class of vehicle routing problems with backhauls
- A cluster insertion heuristic for single and multiple depot vehicle routing problems with backhauling
- A dynamic model and parallel tabu search heuristic for real-time ambulance relocation
- 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
- Parallel solution methods for vehicle routing problems
- Parallel Tabu Search for Real-Time Vehicle Routing and Dispatching
- General solutions to the single vehicle routing problem with pickups and deliveries
- A tabu search algorithm for the vehicle routing problem with simultaneous pick-up and delivery service
- Heuristic algorithms for single and multiple depot vehicle routing problems with pickups and deliveries
- A cooperative parallel meta-heuristic for the vehicle routing problem with time windows
- Title not available (Why is that?)
- Metaheuristics applied to mixed and simultaneous extensions of vehicle routing problems with backhauls
- An asynchronous parallel metaheuristic for the period vehicle routing problem
- Vehicle routing problem with simultaneous deliveries and pickups
- Vehicle routing and reverse logistics: The vehicle routing problem with simultaneous delivery and pick-up
- 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
- A reactive tabu search algorithm for the vehicle routing problem with simultaneous pickups and deliveries
- Evolutionary Computation in Combinatorial Optimization
- Title not available (Why is that?)
- A parallel algorithm for the vehicle routing problem with time window constraints
- Parallelization of a two-phase metaheuristic for routing problems with time windows
- Parallel branch, cut, and price for large-scale discrete optimization
- Evolutionary Computation in Combinatorial Optimization
Cited In (75)
- Exact and heuristic algorithms for minimizing the makespan on a single machine scheduling problem with sequence-dependent setup times and release dates
- A variable neighborhood search for the green vehicle routing problem with two-dimensional loading constraints and split delivery
- 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
- Adaptive large neighborhood search for vehicle routing problems with transshipment facilities arising in city logistics
- A metaheuristic algorithm for a locomotive routing problem arising in the steel industry
- Planification des tournées dans le domaine de la messagerie rapide
- A general VNS for the multi-depot open vehicle routing problem with time windows
- A bi-objective two-echelon pollution routing problem with simultaneous pickup and delivery under multiple time windows constraint
- Improving a state‐of‐the‐art heuristic for the minimum latency problem with data mining
- GENVNS-TS-CL-PR: a heuristic approach for solving the vehicle routing problem with simultaneous pickup and delivery
- A hybrid heuristic based on general variable neighborhood search for the single vehicle routing problem with deliveries and selective pickups
- Solution approaches for the vehicle routing problem with occasional drivers and time windows
- Ils-based algorithms for the profit maximizing uncapacitated hub network design problem with multiple allocation
- Parallel computational optimization in operations research: a new integrative framework, literature review and research directions
- A mathematical formulation and heuristic approach for the heterogeneous fixed fleet vehicle routing problem with simultaneous pickup and delivery
- A parallel algorithm for the vehicle routing problem
- A perturbation based variable neighborhood search heuristic for solving the vehicle routing problem with simultaneous pickup and delivery with time limit
- Title not available (Why is that?)
- A review of vehicle routing with simultaneous pickup and delivery
- A hybrid algorithm for the multi-depot heterogeneous dial-a-ride problem
- Exact and heuristic approaches for the set cover with pairs problem
- An on-demand same-day delivery service using direct peer-to-peer transshipment strategies
- Parallel metaheuristics: recent advances and new trends
- A multi-start iterated local search algorithm for the generalized quadratic multiple knapsack problem
- Efficient local search limitation strategy for single machine total weighted tardiness scheduling with sequence-dependent setup times
- Large neighborhood-based metaheuristic and branch-and-price for the pickup and delivery problem with split loads
- New neighborhoods and an iterated local search algorithm for the generalized traveling salesman 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
- Scatter search for the stochastic travel-time vehicle routing problem with simultaneous pick-ups and deliveries
- Exact algorithms for the multi-pickup and delivery problem with time windows
- Vehicle routing with multiple deliverymen: modeling and heuristic approaches for the VRPTW
- An asynchronous parallel metaheuristic for the period vehicle routing problem
- A fast randomized algorithm for the heterogeneous vehicle routing problem with simultaneous pickup and delivery
- A matheuristic approach for the pollution-routing 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
- A parallel clustering technique for the vehicle routing problem with split deliveries and pickups
- Order matters -- a variable neighborhood search for the swap-body vehicle routing problem
- A parallel hybrid metaheuristic for bicluster editing
- A parallel implementation of the TSSP+1 decomposition for the capacity-constrained vehicle routing problem
- A GVNS algorithm for solving the multi-depot vehicle routing problem
- The multi-pickup and delivery problem with time windows
- Route and speed optimization for autonomous trucks
- Improved bounds for large scale capacitated arc routing problem
- A selective adaptive large neighborhood search heuristic for the profitable tour problem with simultaneous pickup and delivery services
- Using parallel \& distributed computing for real-time solving of vehicle routing problems with stochastic demands
- Branch-cut-and-price for the vehicle routing problem with simultaneous pickup and delivery
- Heuristics for multi-attribute vehicle routing problems: a survey and synthesis
- 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
- A unified solution framework for multi-attribute vehicle routing problems
- The static bike relocation problem with multiple vehicles and visits
- A study on intelligent user-centric logistics service model using ontology
- Hybrid genetic search for the traveling salesman problem with hybrid electric vehicle and time windows
- An adaptive memory methodology for the vehicle routing problem with simultaneous pick-ups and deliveries
- Integrated ant colony and tabu search approach for time dependent vehicle routing problems with simultaneous pickup and delivery
- Shipper collaboration in forward and reverse logistics
- Heuristic algorithms for the vehicle routing problem with simultaneous pick-up and delivery
- Bi-objective optimization model for the heterogeneous dynamic dial-a-ride problem with no rejects
- A unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems
- Parallel solution methods for vehicle routing problems
- A tabu search algorithm for the vehicle routing problem with discrete split deliveries and pickups
- Optimizing energy consumption of robotic cells by a branch \& bound algorithm
- The road train optimization problem with load assignment
- A hybrid GRASP+VND heuristic for the two-echelon vehicle routing problem arising in city logistics
- A simple and effective metaheuristic for the minimum latency problem
- Iterated greedy algorithms for a complex parallel machine scheduling problem
- Parallel local search algorithms for high school timetabling problems
- Multiobjective vehicle routing problem with fixed delivery and optional collections
- Branch-and-cut with lazy separation for the vehicle routing problem with simultaneous pickup and delivery
- Heuristic algorithms for a vehicle routing problem with simultaneous delivery and pickup and time windows in home health care
- Saving-based algorithms for vehicle routing problem with simultaneous pickup and delivery
Uses Software
This page was built for publication: A parallel heuristic for the vehicle routing problem with simultaneous pickup and delivery
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q976005)
