A template-based adaptive large neighborhood search for the consistent vehicle routing problem

DOI10.1002/NET.21522zbMath1338.90053OpenAlexW2136007845WikidataQ59389580 ScholiaQ59389580MaRDI QIDQ2811324

Attila A. Kovacs, Sophie N. Parragh, Richard F. Hartl

Publication date: 10 June 2016

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://phaidra.univie.ac.at/o:397974

zbMATH Keywords

metaheuristicsvehicle routinglarge neighborhood searchperiodic distribution problems

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06)

Related Items (22)

On service consistency in multi-period vehicle routing ⋮ The multi-objective generalized consistent vehicle routing problem ⋮ A branch-and-cut framework for the consistent traveling salesman problem ⋮ The consistent vehicle routing problem with heterogeneous fleet ⋮ The consistent electric-vehicle routing problem with backhauls and charging management ⋮ A concise guide to existing and emerging vehicle routing problem variants ⋮ The vehicle routing problem with arrival time diversification on a multigraph ⋮ The time‐consistent dial‐a‐ride problem ⋮ Adaptive large neighborhood search for the vehicle routing problem with synchronization constraints at the delivery location ⋮ A case study of consistent vehicle routing problem with time windows ⋮ The vehicle routing problem with time windows and flexible delivery locations ⋮ Territorial design for customers with demand frequency ⋮ The multi-vehicle truck-and-robot routing problem for last-mile delivery ⋮ Product-oriented time window assignment for a multi-compartment vehicle routing problem ⋮ Consistent vehicle routing problem with service level agreements: a case study in the pharmaceutical distribution sector ⋮ The vehicle routing problem with profits and consistency constraints ⋮ Data-driven assignment of delivery patterns with handling effort considerations in retail ⋮ Consistent Inventory Routing with Split Deliveries ⋮ The collaborative consistent vehicle routing problem with workload balance ⋮ Meta-analysis of metaheuristics: quantifying the effect of adaptiveness in adaptive large neighborhood search ⋮ Discrete optimization model and algorithm for driver planning in periodic driver routing problem ⋮ Heuristics for multi-attribute vehicle routing problems: a survey and synthesis

Cites Work

• Optimization by Simulated Annealing
• On the shortest spanning subtree of a graph and the traveling salesman problem
• Scheduling technicians and tasks in a telecommunications company
• A unified heuristic for a large class of vehicle routing problems with backhauls
• A general heuristic for vehicle routing problems
• Record breaking optimization results using the ruin and recreate principle
• A parallel route building algorithm for the vehicle routing and scheduling problem with time windows
• Very large-scale vehicle routing: new test problems, algorithms, and results
• The balanced billing cycle vehicle routing problem
• Vehicle Routing for Small Package Delivery and Pickup Services
• Computer Solutions of the Traveling Salesman Problem

This page was built for publication: A template-based adaptive large neighborhood search for the consistent vehicle routing problem