A general heuristic for vehicle routing problems
From MaRDI portal
Publication:869003
DOI10.1016/J.COR.2005.09.012zbMATH Open1144.90318DBLPjournals/cor/PisingerR07OpenAlexW2109101401WikidataQ58826425 ScholiaQ58826425MaRDI QIDQ869003FDOQ869003
Recommendations
- A unified modeling and solution framework for vehicle routing and local search-based metaheuristics
- A unified heuristic for a large class of vehicle routing problems with backhauls
- A heuristic for the vehicle routing problem with time windows
- A unified tabu search heuristic for vehicle routing problems with time windows
- A hybrid heuristic for a broad class of vehicle routing problems with heterogeneous fleet
Cites Work
- scientific article; zbMATH DE number 3643061 (Why is no real title available?)
- scientific article; zbMATH DE number 40470 (Why is no real title available?)
- scientific article; zbMATH DE number 1488097 (Why is no real title available?)
- scientific article; zbMATH DE number 1749224 (Why is no real title available?)
- scientific article; zbMATH DE number 1749225 (Why is no real title available?)
- scientific article; zbMATH DE number 1749226 (Why is no real title available?)
- scientific article; zbMATH DE number 1749228 (Why is no real title available?)
- scientific article; zbMATH DE number 1452993 (Why is no real title available?)
- 2-path cuts for the vehicle routing problem with time windows
- A Computational Study Of A New Heuristic For The Site-Dependent Vehicle Routing Problem
- A New Heuristic for the Multi-Depot Vehicle Routing Problem that Improves upon Best-Known Solutions
- A Route-Directed Hybrid Genetic Approach For The Vehicle Routing Problem With Time Windows
- A Tabu Search Algorithm For The Site Dependent Vehicle Routing Problem With Time Windows
- A cooperative parallel meta-heuristic for the vehicle routing problem with time windows
- A general heuristic for vehicle routing problems
- A heuristic method for the open vehicle routing problem
- A multi-start local search algorithm for the vehicle routing problem with time windows
- A new branch-and-cut algorithm for the capacitated vehicle routing problem
- A new hybrid genetic algorithm for the capacitated vehicle routing problem
- A parallel route building algorithm for the vehicle routing and scheduling problem with time windows
- A reactive variable neighborhood search for the vehicle-routing problem with time windows
- A simple and effective evolutionary algorithm for the vehicle routing problem
- A survey of very large-scale neighborhood search techniques
- A tabu search algorithm for the open vehicle routing problem
- A tabu search heuristic for periodic and multi-depot vehicle routing problems
- A tabu search heuristic for the multi-depot vehicle routing problem
- A two-phase hybrid metaheuristic for the vehicle routing problem with time windows
- A unified heuristic for a large class of vehicle routing problems with backhauls
- A unified tabu search heuristic for vehicle routing problems with time windows
- Active guided evolution strategies for large-scale vehicle routing problems with time windows
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
- An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems
- BoneRoute: An adaptive memory-based method for effective fleet management
- D-Ants: Savings Based Ants divide and conquer the vehicle routing problem.
- Integer Programming and Combinatorial Optimization
- New heuristics for the vehicle routing problem
- Parallel iterative search methods for vehicle routing problems
- Record breaking optimization results using the ruin and recreate principle
- The granular tabu search and its application to the vehicle-routing problem
- The shortest-path problem with resource constraints and \(k\)-cycle elimination for \(k\geq 3\)
- Upper bounds and exact algorithms for \(p\)-dispersion problems
- Vehicle routing problem with elementary shortest path based column generation
- Very large-scale vehicle routing: new test problems, algorithms, and results
Cited In (only showing first 100 items - show all)
- Fuzzy green vehicle routing problem with simultaneous pickup – delivery and time windows
- Heuristics for vehicle routing problems: sequence or set optimization?
- Knowledge-guided local search for the vehicle routing problem
- The optimization of transportation costs in logistics enterprises with time-window constraints
- A metaheuristic for the time-dependent pollution-routing problem
- An iterated tabu search for the multi-compartment vehicle routing problem
- A hybrid genetic algorithm for the multi-depot open vehicle routing problem
- Product-oriented time window assignment for a multi-compartment vehicle routing problem
- Title not available (Why is no real title available?)
- Chain partitioning as a key element for building vehicle routing problem heuristics
- An adaptive large neighborhood search algorithm for vehicle routing problem with multiple time windows constraints
- Enhanced multi-directional local search for the bi-objective heterogeneous vehicle routing problem with multiple driving ranges
- Using global search heuristics for the capacity vehicle routing problem.
- Combining biased randomization with iterated local search for solving the multidepot vehicle routing problem
- Meta-analysis of metaheuristics: quantifying the effect of adaptiveness in adaptive large neighborhood search
- Shared capacity routing problem -- an omni-channel retail study
- The two-echelon capacitated electric vehicle routing problem with battery swapping stations: formulation and efficient methodology
- A multi-start iterated local search algorithm for the generalized quadratic multiple knapsack problem
- Consistent vehicle routing problem with service level agreements: a case study in the pharmaceutical distribution sector
- Adaptive large neighborhood search for the vehicle routing problem with synchronization constraints at the delivery location
- An adaptive large neighborhood search for the full truckload pickup and delivery problem with resource synchronization
- An exact hybrid method for the vehicle routing problem with time windows and multiple deliverymen
- Models and algorithms for reliability-oriented dial-a-ride with autonomous electric vehicles
- A matheuristic method for the electric vehicle routing problem with time windows and fast chargers
- A matheuristic based on large neighborhood search for the vehicle routing problem with cross-docking
- Vehicle routing with cross-dock selection
- An adaptive VNS algorithm for vehicle routing problems with intermediate stops
- An adaptive large neighborhood search for the discrete and continuous berth allocation problem
- Analysis of an improved branch-and-cut formulation for the inventory-routing problem with transshipment
- Large neighborhood search with constraint programming for a vehicle routing problem with synchronization constraints
- A VNS approach to multi-location inventory redistribution with vehicle routing
- A large neighborhood search heuristic for supply chain network design
- An open source spreadsheet solver for vehicle routing problems
- An adaptive large neighborhood search metaheuristic for agile satellite scheduling with time-dependent transition time
- A choice function hyper-heuristic framework for the allocation of maintenance tasks in Danish railways
- An adaptive large neighbourhood search for asset protection during escaped wildfires
- A decision framework for automatic guided vehicle routing problem with traffic congestions
- Large multiple neighborhood search for the clustered vehicle-routing problem
- Scheduling identical parallel machines with tooling constraints
- An improved adaptive large neighborhood search algorithm for multiple agile satellites scheduling
- A GVNS algorithm for solving the multi-depot vehicle routing problem
- The close-open mixed vehicle routing problem
- Adaptive large neighborhood search algorithm for route planning of freight buses with pickup and delivery
- Prioritized single nurse routing and scheduling for home healthcare services
- A framing link based tabu search algorithm for large-scale multidepot vehicle routing problems
- An improved formulation for the multi-depot open vehicle routing problem
- Designing sustainable mid-haul logistics networks with intra-route multi-resource facilities
- Minimizing earliness-tardiness costs in supplier networks -- a just-in-time truck routing problem
- Designing granular solution methods for routing problems with time windows
- MIRHA: multi-start biased randomization of heuristics with adaptive local search for solving non-smooth routing problems
- Iterated greedy algorithms for a complex parallel machine scheduling problem
- Vehicle Routing Problems with Inter-Tour Resource Constraints
- A unified matheuristic for solving multi-constrained traveling salesman problems with profits
- Adaptive large neighborhood search on the graphics processing unit
- A matheuristic for the driver scheduling problem with staff cars
- Adaptive large neighborhood search for the curriculum-based course timetabling problem
- A template-based adaptive large neighborhood search for the consistent vehicle routing problem
- A hybrid metaheuristic algorithm for the multi-depot covering tour vehicle routing problem
- Min-Max vs. Min-Sum vehicle routing: a worst-case analysis
- The mixed capacitated general routing problem under uncertainty
- A stochastic vehicle routing problem with travel time uncertainty: trade-off between cost and customer service
- Implicit depot assignments and rotations in vehicle routing heuristics
- An efficient variable neighborhood search with tabu shaking for a class of multi-depot vehicle routing problems
- A branch-and-price-based large neighborhood search algorithm for the vehicle routing problem with time windows
- Bilevel model for production-distribution planning solved by using ant colony optimization
- The capacitated vehicle routing problem with stochastic demands and time windows
- A unified modeling and solution framework for vehicle routing and local search-based metaheuristics
- Edge assembly-based memetic algorithm for the capacitated vehicle routing problem
- A stochastic local search algorithm with adaptive acceptance for high-school timetabling
- Elective course student sectioning at Danish high schools
- A general heuristic for vehicle routing problems
- An efficient variable neighborhood search heuristic for very large scale vehicle routing problems
- Effective learning hyper-heuristics for the course timetabling problem
- An adaptive large neighborhood search for a vehicle routing problem with multiple routes
- A hybrid evolution strategy for the open vehicle routing problem
- A penalty-based edge assembly memetic algorithm for the vehicle routing problem with time windows
- Scheduling technicians and tasks in a telecommunications company
- Branch-and-price and constraint programming for solving a real-life technician dispatching 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
- A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time-windows
- An adaptive large neighborhood search heuristic for two-echelon vehicle routing problems arising in city logistics
- Lower and upper bounds for the two-echelon capacitated location-routing problem
- A parallel matheuristic for the technician routing and scheduling problem
- A hybrid algorithm for the capacitated vehicle routing problem with three-dimensional loading constraints
- Vehicle routing with compartments: applications, modelling and heuristics
- The inventory-routing problem with transshipment
- Multi-directional local search
- Stochastic single vehicle routing problem with delivery and Pick up and a predefined customer sequence
- An ILP improvement procedure for the open vehicle routing problem
- Industrial aspects and literature survey: fleet composition and routing
- An open vehicle routing problem metaheuristic for examining wide solution neighborhoods
- A bi-objective home care scheduling problem: analyzing the trade-off between costs and client inconvenience
- A two-stage solution method for the annual dairy transportation problem
- Adaptive large neighborhood search for the pickup and delivery problem with time windows, profits, and reserved requests
- The vehicle-routing problem with time windows and driver-specific times
- An adaptive large neighborhood search for the two-echelon multiple-trip vehicle routing problem with satellite synchronization
- Large neighborhood search for multi-trip vehicle routing
- A method of estimating computational complexity based on input conditions for \(N\)-vehicle problem
- A hybrid metaheuristic approach for the rollon-rolloff vehicle routing problem
This page was built for publication: A general heuristic for vehicle routing problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q869003)
