A general heuristic for vehicle routing problems

From MaRDI portal

Publication:869003

Jump to:navigation, search

DOI10.1016/j.cor.2005.09.012zbMath1144.90318OpenAlexW2109101401WikidataQ58826425 ScholiaQ58826425MaRDI QIDQ869003

Stefan Ropke, David Pisinger

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

metaheuristics vehicle routing problem large neighborhood search

Mathematics Subject Classification ID

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

Related Items

Mixed integer linear programming for a multi-attribute technician routing and scheduling problem, A metaheuristic approach to fisheries survey route planning, Multi-trip vehicle routing problem with order release time, Vehicle routing problem with limited refueling halts using particle swarm optimization with greedy mutation operator, Fuzzy green vehicle routing problem with simultaneous pickup – delivery and time windows, Hybrid adaptive large neighborhood search for vehicle routing problems with depot location decisions, A survey of adaptive large neighborhood search algorithms and applications, Mathematical programming formulations and metaheuristics for biological sample transportation problems in healthcare, A hybrid collaborative framework for integrated production scheduling and vehicle routing problem with batch manufacturing and soft time windows, An adaptive large neighbourhood search algorithm for a real-world home care scheduling problem with time windows and dynamic breaks, Hybridizing adaptive large neighborhood search with kernel search: a new solution approach for the nurse routing problem with incompatible services and minimum demand, An ALNS-based matheuristic algorithm for a multi-product many-to-many maritime inventory routing problem, A general VNS for the multi-depot open vehicle routing problem with time windows, The time‐consistent dial‐a‐ride problem, Biased‐randomized iterated local search for a multiperiod vehicle routing problem with price discounts for delivery flexibility, A biased‐randomized algorithm for redistribution of perishable food inventories in supermarket chains, Adaptive large neighborhood search for the vehicle routing problem with synchronization constraints at the delivery location, Solving dynamic satellite image data downlink scheduling problem via an adaptive bi-objective optimization algorithm, Two-echelon collaborative routing problem with heterogeneous crowd-shippers, Multi-armed bandit-based hyper-heuristics for combinatorial optimization problems, Large neighborhood search for the bike request scheduling problem, Solving the multidepot vehicle routing problem with limited depot capacity and stochastic demands, Same‐day deliveries in omnichannel retail: Integrated order picking and vehicle routing with vehicle‐site dependencies, A multilevel evaluation method for heuristics with an application to the VRPTW, Secure and efficient routing on nodes, edges, and arcs of simple‐graphs and of multi‐graphs, Delivery systems with crowd‐sourced drivers: A pickup and delivery problem with transfers, Exact and hyper‐heuristic solutions for the distribution‐installation problem from the VeRoLog 2019 challenge, A lexicographic maximin approach to the selective assessment routing problem, Minimizing earliness-tardiness costs in supplier networks -- a just-in-time truck routing problem, Modelling and heuristically solving many-to-many heterogeneous vehicle routing problem with cross-docking and two-dimensional loading constraints, Recent advances in integrating demand management and vehicle routing: a methodological review, A sampling-based matheuristic for the continuous-time stochastic inventory routing problem with time-windows, The vehicle routing problem with time windows and flexible delivery locations, Small and large neighborhood search for the park-and-loop routing problem with parking selection, Efficient feasibility checks and an adaptive large neighborhood search algorithm for the time-dependent green vehicle routing problem with time windows, A survey of attended home delivery and service problems with a focus on applications, Drone location and vehicle fleet planning with trucks and aerial drones, A metaheuristic algorithm for a locomotive routing problem arising in the steel industry, Route efficiency implications of time windows and vehicle capacities in first- and last-mile logistics, A rolling horizon framework for the time‐dependent multi‐visit dynamic safe street snow plowing problem, An adaptive large neighborhood search heuristic for multi-commodity two-echelon vehicle routing problem with satellite synchronization, Recent progress of local search in handling the time window constraints of the vehicle routing problem, A Hybrid Approach to Solve the Periodic Home Health Care Problem, A selective adaptive large neighborhood search heuristic for the profitable tour problem with simultaneous pickup and delivery services, A SCATTER SEARCH FOR MULTI-DEPOT VEHICLE ROUTING PROBLEM WITH WEIGHT-RELATED COST, Routing a Heterogeneous Fleet of Vehicles, An Integer Linear Programming Local Search for Capacitated Vehicle Routing Problems, Recent Models and Algorithms for One-to-One Pickup and Delivery Problems, Vehicle Routing Problems with Inter-Tour Resource Constraints, Recent progress of local search in handling the time window constraints of the vehicle routing problem, A branch-and-price-based large neighborhood search algorithm for the vehicle routing problem with time windows, Edge assembly-based memetic algorithm for the capacitated vehicle routing problem, Combining biased randomization with iterated local search for solving the multidepot vehicle routing problem, Scheduling issues in vehicle routing, Multi-depot vehicle routing problem with time windows under shared depot resources, An improved formulation for the multi-depot open vehicle routing problem, Pre-selection Strategies for Dynamic Collaborative Transportation Planning Problems, A template-based adaptive large neighborhood search for the consistent vehicle routing problem, The Migratory Beekeeping Routing Problem: Model and an Exact Algorithm, A stochastic vehicle routing problem with travel time uncertainty: trade-off between cost and customer service, Simultaneous product and service delivery vehicle routing problem with time windows and order release dates, Shared capacity routing problem -- an omni-channel retail study, Elective course student sectioning at Danish high schools, A stochastic local search algorithm with adaptive acceptance for high-school timetabling, The two-echelon multi-depot inventory-routing problem, Effective learning hyper-heuristics for the course timetabling problem, Branch-and-price and constraint programming for solving a real-life technician dispatching problem, An optimization approach for communal home meal delivery service: A case study, The electric two-echelon vehicle routing problem, A bi-objective home care scheduling problem: analyzing the trade-off between costs and client inconvenience, The vehicle-routing problem with time windows and driver-specific times, 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, 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, The synchronized arc and node routing problem: application to road marking, A hybrid metaheuristic approach for the rollon-rolloff vehicle routing problem, Lifted and local reachability cuts for the vehicle routing problem with time windows, Single string planning problem arising in liner shipping industries: a heuristic approach, A hybrid algorithm for a class of vehicle routing problems, The dial-A-ride problem with transfers, The multi-district team orienteering problem, An adaptive large neighborhood search for a vehicle routing problem with multiple routes, Multi-start iterated local search for the periodic vehicle routing problem with time windows and time spread constraints on services, The multi-depot vehicle routing problem with heterogeneous vehicle fleet: formulation and a variable neighborhood search implementation, An adaptive large neighborhood search for the full truckload pickup and delivery problem with resource synchronization, Battery swap station location-routing problem with capacitated electric vehicles, Dynamic design of sales territories, Hybrid metaheuristics for the clustered vehicle routing problem, Large neighborhood search with constraint programming for a vehicle routing problem with synchronization constraints, An adaptive large neighborhood search for the discrete and continuous berth allocation problem, Managing platelet supply through improved routing of blood collection vehicles, Analysis of an improved branch-and-cut formulation for the inventory-routing problem with transshipment, Vehicle routing with cross-dock selection, A VNS approach to multi-location inventory redistribution with vehicle routing, A large neighborhood search heuristic for supply chain network design, An iterated tabu search for the multi-compartment vehicle routing problem, Fast machine reassignment, An exact hybrid method for the vehicle routing problem with time windows and multiple deliverymen, A multi-start iterated local search algorithm for the generalized quadratic multiple knapsack problem, An open source spreadsheet solver for vehicle routing problems, A matheuristic based on large neighborhood search for the vehicle routing problem with cross-docking, An adaptive large neighborhood search metaheuristic for agile satellite scheduling with time-dependent transition time, GLNS: an effective large neighborhood search heuristic for the generalized traveling salesman problem, Metaheuristics for the tabu clustered traveling salesman problem, A choice function hyper-heuristic framework for the allocation of maintenance tasks in Danish railways, Robust vehicle routing problem with hard time windows under demand and travel time uncertainty, An adaptive large neighbourhood search for asset protection during escaped wildfires, A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time-windows, Non-myopic vehicle and route selection in dynamic DARP with travel time and workload objectives, Multi-directional local search, Lower and upper bounds for the two-echelon capacitated location-routing problem, An adaptive large neighborhood search heuristic for two-echelon vehicle routing problems arising in city logistics, A hybrid evolutionary algorithm for heterogeneous fleet vehicle routing problems with time windows, 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 general heuristic for vehicle routing problems, A parallel matheuristic for the technician routing and scheduling problem, The open vehicle routing problem: algorithms, large-scale test problems, and computational results, Active-guided evolution strategies for large-scale capacitated vehicle routing problems, Designing sustainable mid-haul logistics networks with intra-route multi-resource facilities, Multi-depot vessel routing problem in a direction dependent wavefield, Resource constrained routing and scheduling: review and research prospects, Designing granular solution methods for routing problems with time windows, Stochastic single vehicle routing problem with delivery and Pick up and a predefined customer sequence, Optimizing yard assignment in an automotive transshipment terminal, Alternative formulations and improved bounds for the multi-depot fleet size and mix vehicle routing problem, A hybrid adaptive large neighborhood search heuristic for lot-sizing with setup times, 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, A rich vehicle routing problem dealing with perishable food: a case study, Knowledge-guided local search for the vehicle routing problem, The optimization of transportation costs in logistics enterprises with time-window constraints, Vehicle routing with compartments: applications, modelling and heuristics, A hybrid heuristic for a broad class of vehicle routing problems with heterogeneous fleet, Product-oriented time window assignment for a multi-compartment vehicle routing problem, Enhanced multi-directional local search for the bi-objective heterogeneous vehicle routing problem with multiple driving ranges, The multi-pickup and delivery problem with time windows, Adaptive large neighborhood search heuristics for multi-tier service deployment problems in clouds, A metaheuristic for the time-dependent pollution-routing problem, Models and algorithms for reliability-oriented dial-a-ride with autonomous electric vehicles, The capacitated vehicle routing problem with stochastic demands and time windows, Scheduling technicians and tasks in a telecommunications company, An improved multi-objective evolutionary algorithm for the vehicle routing problem with time windows, Bilevel model for production-distribution planning solved by using ant colony optimization, A large neighbourhood search heuristic for ship routing and scheduling with split loads, Heuristic-based truck scheduling for inland container transportation, Industrial aspects and literature survey: fleet composition and routing, An ILP improvement procedure for the open vehicle routing problem, A way to optimally solve a time-dependent vehicle routing problem with time windows, A powerful route minimization heuristic for the vehicle routing problem with time windows, A hybrid evolution strategy for the open vehicle routing problem, Decomposition, reformulation, and diving in university course timetabling, Local search intensified: very large-scale variable neighborhood search for the multi-resource generalized assignment problem, An open vehicle routing problem metaheuristic for examining wide solution neighborhoods, A penalty-based edge assembly memetic algorithm for the vehicle routing problem with time windows, Shipper collaboration in forward and reverse logistics, Urban regional logistics distribution path planning considering road characteristics, The consultation timetabling problem at Danish high schools, An ALNS algorithm for the static dial-a-ride problem with ride and waiting time minimization, Min-Max vs. Min-Sum vehicle routing: a worst-case analysis, The mixed capacitated general routing problem under uncertainty, A hybrid metaheuristic algorithm for the multi-depot covering tour vehicle routing problem, A variable neighbourhood search algorithm for the open vehicle routing problem, Adaptive large neighborhood search for mixed integer programming, Integrating order delivery and return operations for order fulfillment in an online retail environment, A unified exact method for solving different classes of vehicle routing problems, A time-dependent vessel routing problem with speed optimization, Adaptive large neighborhood search for the curriculum-based course timetabling problem, The two-echelon inventory-routing problem with fleet management, The distributionally robust machine scheduling problem with job selection and sequence-dependent setup times, A hybrid adaptive large neighborhood search heuristic for the team orienteering problem, Simultaneously exploiting two formulations: an exact Benders decomposition approach, A new constraint programming model and a linear programming-based adaptive large neighborhood search for the vehicle routing problem with synchronization constraints, A metaheuristic based on tabu search for solving a technician routing and scheduling problem, A memory-based iterated local search algorithm for the multi-depot open vehicle routing problem, Exact algorithms for the multi-pickup and delivery problem with time windows, Large multiple neighborhood search for the soft-clustered vehicle-routing problem, Adaptive neighborhood simulated annealing for the heterogeneous fleet vehicle routing problem with multiple cross-docks, Time-dependent multi-depot green vehicle routing problem with time windows considering temporal-spatial distance, Cyclic inventory routing with dynamic safety stocks under recurring non-stationary interdependent demands, Solution approaches for integrated vehicle and crew scheduling with electric buses, An efficient variable neighborhood search with tabu shaking for a class of multi-depot vehicle routing problems, The aquaculture service vessel routing problem with time dependent travel times and synchronization constraints, Heuristic approaches for a vehicle routing problem with an incompatible loading constraint and splitting deliveries by order, Adaptive large neighborhood search for vehicle routing problems with transshipment facilities arising in city logistics, The traveling purchaser problem with fast service option, Optimizing access to drinking water in remote areas. Application to Nepal, Mid-term and short-term planning support for home health care services, A comparison of three metaheuristics for the workover rig routing problem, The close-open mixed vehicle routing problem, Multiple pickup and delivery traveling salesman problem with last-in-first-out loading and distance constraints, Optimizing two-dimensional vehicle loading and dispatching decisions in freight logistics, Recent advances in selection hyper-heuristics, Decision making on post-disaster rescue routing problems from the rescue efficiency perspective, The vehicle routing problem with arrival time diversification on a multigraph, The fuel replenishment problem: a split-delivery multi-compartment vehicle routing problem with multiple trips, The two-echelon vehicle routing problem with covering options: city logistics with cargo bikes and parcel lockers, MIRHA: multi-start biased randomization of heuristics with adaptive local search for solving non-smooth routing problems, Solving the tractor and semi-trailer routing problem based on a heuristic approach, A decision framework for automatic guided vehicle routing problem with traffic congestions, A hybrid genetic algorithm for the multi-depot open vehicle routing problem, Integrating multi-product production and distribution in newspaper logistics, Adaptive large neighborhood search algorithm for route planning of freight buses with pickup and delivery, Integrated order batching and vehicle routing operations in grocery retail -- a general adaptive large neighborhood search algorithm, An adaptive large neighborhood search heuristic for the vehicle routing problem with time windows and delivery robots, A matheuristic approach to large-scale avionic scheduling, Exact and heuristic algorithms for the fleet composition and periodic routing problem of offshore supply vessels with berth allocation decisions, The two-echelon capacitated electric vehicle routing problem with battery swapping stations: formulation and efficient methodology, Consistent vehicle routing problem with service level agreements: a case study in the pharmaceutical distribution sector, Scheduling identical parallel machines with tooling constraints, Large multiple neighborhood search for the clustered vehicle-routing problem, The line-haul feeder vehicle routing problem: mathematical model formulation and heuristic approaches, A multi-objective vehicle routing and scheduling problem with uncertainty in customers' request and priority, Gossip algorithms for heterogeneous multi-vehicle routing problems, An adaptive large neighborhood search heuristic for the pollution-routing problem, A time-based pheromone approach for the ant system, A multi-start local search heuristic for the green vehicle routing problem based on a multigraph reformulation, A study on the effect of the asymmetry on real capacitated vehicle routing problems, A hybrid algorithm for the capacitated vehicle routing problem with three-dimensional loading constraints, The inventory-routing problem with transshipment, Fast heuristics for the Steiner tree problem with revenues, budget and hop constraints, Local search neighbourhoods for dealing with a novel nurse rostering model, An adaptive large neighborhood search heuristic for the cumulative capacitated vehicle routing problem, Restricted dynamic programming: a flexible framework for solving realistic VRPs, Analysing the effect of partner characteristics on the performance of horizontal carrier collaborations, A method of estimating computational complexity based on input conditions for \(N\)-vehicle problem, The dynamic multi-period vehicle routing problem, An adaptive VNS algorithm for vehicle routing problems with intermediate stops, Hyper-heuristic approaches for the response time variability problem, An adaptive large neighbourhood search heuristic for routing and scheduling feeder vessels in multi-terminal ports, An improved adaptive large neighborhood search algorithm for multiple agile satellites scheduling, A matheuristic method for the electric vehicle routing problem with time windows and fast chargers, Genetic algorithm with variable neighborhood search for the optimal allocation of goods in shop shelves, Prioritized single nurse routing and scheduling for home healthcare services, Models and algorithms for the delivery and installation routing problem, Meta-analysis of metaheuristics: quantifying the effect of adaptiveness in adaptive large neighborhood search, Integrated planning for electric commercial vehicle fleets: a case study for retail mid-haul logistics networks, A lexicographic minimax approach to the vehicle routing problem with route balancing, A metaheuristic algorithm and structured analysis for the Line-haul Feeder vehicle routing problem with time windows, A GVNS algorithm for solving the multi-depot vehicle routing problem, Matheuristics for slot planning of container vessel bays, A unified solution framework for multi-attribute vehicle routing problems, Implicit depot assignments and rotations in vehicle routing heuristics, A new efficient approach for solving the capacitated vehicle routing problem using the gravitational emulation local search algorithm, Vehicle routing with transportable resources: using carpooling and walking for on-site services, A unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems, An adaptive large neighborhood search algorithm for vehicle routing problem with multiple time windows constraints, A matheuristic for a 2-echelon vehicle routing problem with capacitated satellites and reverse flows, The synchronized multi-assignment orienteering problem, 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, Ant colony system with characterization-based heuristics for a bottled-products distribution logistics system, Iterated greedy algorithms for a complex parallel machine scheduling problem, Learning surrogate functions for the short-horizon planning in same-day delivery problems, Short-term scheduling of production fleets in underground mines using CP-based LNS, A heuristic algorithm for the free newspaper delivery problem, Heuristics for multi-attribute vehicle routing problems: a survey and synthesis, The nuclear medicine production and delivery problem

Uses Software

Cites Work

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:869003&oldid=12814118"