A unified heuristic for a large class of vehicle routing problems with backhauls

From MaRDI portal

Publication:819067

Jump to:navigation, search

DOI10.1016/j.ejor.2004.09.004zbMath1116.90019OpenAlexW2166484956WikidataQ58826442 ScholiaQ58826442MaRDI QIDQ819067

David Pisinger, Stefan Ropke

Publication date: 22 March 2006

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.139.3734

zbMATH Keywords

metaheuristics large neighborhood search vehicle routing problems

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items

A unified heuristic for a large class of vehicle routing problems with backhauls, An ALNS algorithm for the static dial-a-ride problem with ride and waiting time minimization, An ant colony system (ACS) for vehicle routing problem with simultaneous delivery and pickup, Rich vehicle routing problems: from a taxonomy to a definition, A deterministic iterated local search algorithm for the vehicle routing problem with backhauls, A perturbation based variable neighborhood search heuristic for solving the vehicle routing problem with simultaneous pickup and delivery with time limit, Multi-ant colony system (MACS) for a vehicle routing problem with backhauls, An effective hybrid harmony search for the asymmetric travelling salesman problem, Hybrid algorithms for the vehicle routing problem with clustered backhauls and 3D loading constraints, A variable neighborhood search for the capacitated vehicle routing problem with two-dimensional loading constraints, Integrating order delivery and return operations for order fulfillment in an online retail environment, The fleet size and mix location-routing problem with time windows: formulations and a heuristic algorithm, A long-haul freight transportation problem: synchronizing resources to deliver requests passing through multiple transshipment locations, Large neighborhood search for multi-trip vehicle routing, A biased-randomised large neighbourhood search for the two-dimensional vehicle routing problem with backhauls, A hybrid algorithm for a class of vehicle routing problems, An adaptive large neighborhood search for the full truckload pickup and delivery problem with resource synchronization, A hybrid method for the probabilistic maximal covering location-allocation problem, Route planning for a seaplane service: the case of the Greek islands, An adaptive large neighborhood search for the discrete and continuous berth allocation problem, Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder), The multiple trip vehicle routing problem with backhauls: formulation and a two-level variable neighbourhood search, Metaheuristics for the tabu clustered traveling salesman problem, Vehicle routing with backhauls: review and research perspectives, Hybrid column generation and large neighborhood search for the dial-a-ride problem, 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, A general heuristic for vehicle routing problems, A review of vehicle routing with simultaneous pickup and delivery, A simulation-based heuristic for the electric vehicle routing problem with time windows and stochastic waiting times at recharging stations, Large multiple neighborhood search for the soft-clustered vehicle-routing problem, Adaptive large neighborhood search for vehicle routing problems with transshipment facilities arising in city logistics, A comparison of three metaheuristics for the workover rig routing problem, A hybrid of adaptive large neighborhood search and tabu search for the order-batching problem, Optimizing two-dimensional vehicle loading and dispatching decisions in freight logistics, A sample average approximation approach for the stochastic dial-a-ride problem on a multigraph with user satisfaction, Heuristic optimisation in financial modelling, A survey of adaptive large neighborhood search algorithms and applications, Factors affecting the final solution of the bike-sharing rebalancing problem under heuristic algorithms, Activity propagation in systems of linear inequalities and its relation to block-coordinate descent in linear programs, An iterative biased‐randomized heuristic for the fleet size and mix vehicle‐routing problem with backhauls, The electric vehicle routing problem with shared charging stations, On the exact solution of vehicle routing problems with backhauls, Upper and lower bounds for the vehicle-routing problem with private fleet and common carrier, 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, Multi-trip pickup and delivery problem with time windows and synchronization, Metaheuristics with variable diversity control and neighborhood search for the heterogeneous site-dependent multi-depot multi-trip periodic vehicle routing problem, 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 rich vehicle routing problem dealing with perishable food: a case study, Comparing backhauling strategies in vehicle routing using ant colony optimization, A hybrid heuristic for a broad class of vehicle routing problems with heterogeneous fleet, Solution strategies for the vehicle routing problem with backhauls, A selective adaptive large neighborhood search heuristic for the profitable tour problem with simultaneous pickup and delivery services, Electric vehicle routing problem with time-dependent waiting times at recharging stations, Single vehicle routing with a predefined customer sequence and multiple depot returns, 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, A general framework for assessing the value of social data for disaster response logistics planning, A metaheuristic for the time-dependent pollution-routing problem, A hybrid method based on linear programming and tabu search for routing of logging trucks, Large multiple neighborhood search for the clustered vehicle-routing problem, An adaptive large neighborhood search heuristic for the pollution-routing problem, The inventory-routing problem with transshipment, Fast heuristics for the Steiner tree problem with revenues, budget and hop constraints, An adaptive large neighborhood search heuristic for the cumulative capacitated vehicle routing problem, A parallel heuristic for the vehicle routing problem with simultaneous pickup and delivery, Validating vehicle routing zone construction using Monte Carlo simulation, Scheduling technicians and tasks in a telecommunications company, A large neighbourhood search heuristic for ship routing and scheduling with split loads, An adaptive large neighborhood search approach for multiple traveling repairman problem with profits, A matheuristic method for the electric vehicle routing problem with time windows and fast chargers, Performances improvement of the column generation algorithm: application to vehicle routing problems, Metaheuristic for the Vehicle Routing Problem with Backhauls and Time Windows, A metaheuristic algorithm and structured analysis for the Line-haul Feeder vehicle routing problem with time windows, Optimizing logistics routings in a network perspective of supply and demand nodes, A unified solution framework for multi-attribute vehicle routing problems, HPS_PSP: HIGH PERFORMANCE SYSTEM FOR PROTEIN STRUCTURE PREDICTION, An iterated local search algorithm for the vehicle routing problem with backhauls, The vehicle routing problem with simultaneous pickup and delivery and handling costs, A new efficient approach for solving the capacitated vehicle routing problem using the gravitational emulation local search algorithm, A template-based adaptive large neighborhood search for the consistent vehicle routing problem, Order batching and batch sequencing in an AMR-assisted picker-to-parts system, Shipper collaboration in forward and reverse logistics, A unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems, A matheuristic for a 2-echelon vehicle routing problem with capacitated satellites and reverse flows, New Notation and Classification Scheme for Vehicle Routing Problems, Waste collection inventory routing with non-stationary stochastic demands, Generic Constraint-based Block Modeling using Constraint Programming, Effective loading in combined vehicle routing and container loading problems, Finite and infinite-horizon single vehicle routing problems with a predefined customer sequence and pickup and delivery, Heuristics for multi-attribute vehicle routing problems: a survey and synthesis

Uses Software

VRP

Cites Work

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