A general heuristic for vehicle routing problems

DOI10.1016/J.COR.2005.09.012MaRDI QIDQ869003zbMATHOpenAlexDBLPWikidataFDO

Authors David Pisinger, S. Ropke

Publication date 26 February 2007

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.cor.2005.09.012

zbMATH Keywords

metaheuristicsvehicle routing problemlarge neighborhood search

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Traffic problems in operations research (90B20)

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)

• An efficient transformation of the generalized vehicle routing problem
• The capacitated vehicle routing problem with stochastic demands and time windows
• 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
• Very large-scale vehicle routing: new test problems, algorithms, and results
• Gossip algorithms for heterogeneous multi-vehicle routing problems
• Local search neighbourhoods for dealing with a novel nurse rostering model
• Restricted dynamic programming: a flexible framework for solving realistic VRPs
• 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
• A template-based adaptive large neighborhood search for the consistent vehicle routing problem
• The electric two-echelon vehicle routing problem
• 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 stochastic local search algorithm with adaptive acceptance for high-school timetabling
• Elective course student sectioning at Danish high schools
• An efficient variable neighborhood search with tabu shaking for a class of multi-depot vehicle routing problems
• A general heuristic for vehicle routing problems
• An efficient variable neighborhood search heuristic for very large scale vehicle routing problems
• Recent models and algorithms for one-to-one pickup and delivery problems
• Hyper-heuristic approaches for the response time variability problem
• A hybrid approach to solve the periodic home health care problem
• Managing platelet supply through improved routing of blood collection vehicles
• Robust vehicle routing problem with hard time windows under demand and travel time uncertainty
• Integrating multi-product production and distribution in newspaper logistics
• Scheduling technicians and tasks in a telecommunications company
• A scatter search for multi-depot vehicle routing problem with weight-related cost
• A comparison of three metaheuristics for the workover rig routing problem
• Multiple pickup and delivery traveling salesman problem with last-in-first-out loading and distance constraints
• A unified exact method for solving different classes of vehicle routing problems
• Mid-term and short-term planning support for home health care services
• Effective learning hyper-heuristics for the course timetabling problem
• Implicit depot assignments and rotations in vehicle routing heuristics
• MEFISTO: A pragmatic metaheuristic framework for adaptive search with a special application to pickup and delivery transports
• Stochastic single vehicle routing problem with delivery and Pick up and a predefined customer sequence
• An adaptive large neighborhood search heuristic for the pollution-routing problem
• Fast heuristics for the Steiner tree problem with revenues, budget and hop constraints
• A large neighbourhood search heuristic for ship routing and scheduling with split loads
• Vehicle routing with compartments: applications, modelling and heuristics
• A parallel matheuristic for the technician routing and scheduling problem
• Heuristic-based truck scheduling for inland container transportation
• A hybrid algorithm for the capacitated vehicle routing problem with three-dimensional loading constraints
• Heuristics for multi-attribute vehicle routing problems: a survey and synthesis
• A powerful route minimization heuristic for the vehicle routing problem with time windows
• Decomposition, reformulation, and diving in university course timetabling
• Local search intensified: very large-scale variable neighborhood search for the multi-resource generalized assignment problem
• Routing a heterogeneous fleet of vehicles
• Edge assembly-based memetic algorithm for the capacitated vehicle routing problem
• The dynamic multi-period vehicle routing problem
• An adaptive large neighborhood search for a vehicle routing problem with multiple routes
• A branch-and-price-based large neighborhood search algorithm for the vehicle routing problem with time windows
• An ALNS-based matheuristic algorithm for a multi-product many-to-many maritime inventory routing problem
• Alternative formulations and improved bounds for the multi-depot fleet size and mix vehicle routing problem
• A bi-objective home care scheduling problem: analyzing the trade-off between costs and client inconvenience
• A unified modeling and solution framework for vehicle routing and local search-based metaheuristics
• 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 variable neighbourhood search algorithm for the open vehicle routing problem
• A rich vehicle routing problem dealing with perishable food: a case study
• Recent progress of local search in handling the time window constraints of the vehicle routing problem
• Bilevel model for production-distribution planning solved by using ant colony optimization
• GLNS: an effective large neighborhood search heuristic for the generalized traveling salesman problem
• The synchronized arc and node routing problem: application to road marking
• A stochastic vehicle routing problem with travel time uncertainty: trade-off between cost and customer service
• An ILP improvement procedure for the open vehicle routing problem
• Industrial aspects and literature survey: fleet composition and routing
• A hybrid metaheuristic approach for the rollon-rolloff vehicle routing problem
• Battery swap station location-routing problem with capacitated electric vehicles
• Multi-directional local search
• The dial-A-ride problem with transfers
• The multi-district team orienteering problem
• The multi-depot vehicle routing problem with heterogeneous vehicle fleet: formulation and a variable neighborhood search implementation
• The inventory-routing problem with transshipment
• The consultation timetabling problem at Danish high schools
• Branch-and-price and constraint programming for solving a real-life technician dispatching problem
• A hybrid evolutionary algorithm for heterogeneous fleet vehicle routing problems with time windows
• A unified solution framework for multi-attribute vehicle routing problems
• An adaptive large neighborhood search heuristic for the cumulative capacitated 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
• An open vehicle routing problem metaheuristic for examining wide solution neighborhoods
• The Migratory Beekeeping Routing Problem: Model and an Exact Algorithm
• A hybrid heuristic for a broad class of vehicle routing problems with heterogeneous fleet
• A hybrid adaptive large neighborhood search heuristic for the team orienteering problem
• An adaptive large neighborhood search for an E-grocery delivery routing problem
• An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows and scheduled lines
• A unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems
• Models and algorithms for the delivery and installation routing problem
• scientific article; zbMATH DE number 1082107 (Why is no real title available?)
• Shipper collaboration in forward and reverse logistics
• Metaheuristics for the tabu clustered traveling salesman problem
• Adaptive large neighborhood search heuristics for multi-tier service deployment problems in clouds
• An integer linear programming local search for capacitated vehicle routing problems
• Urban regional logistics distribution path planning considering road characteristics

Describes a project that uses

Uses Software

• BoneRoute
• VRP
• CVRPSP

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)