General VNS for asymmetric vehicle routing problem with time and capacity constraints

DOI10.1016/j.cor.2024.106630MaRDI QIDQ6568438

Tatjana Davidović, Unnamed Author, Panos M. Pardalos, Tatjana Jakšić Krüger, Luka Matijević

Publication date: 8 July 2024

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

zbMATH Keywords

metaheuristicslocal searchmultiple neighborhoodssingle depotminimization of total distancerouting homogeneous vehicles

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Randomized algorithms (68W20) Operations research and management science (90Bxx)

Cites Work

• A genetic and set partitioning two-phase approach for the vehicle routing problem with time windows
• The vehicle routing problem. Latest advances and new challenges.
• Variable neighborhood search
• On the capacitated vehicle routing problem
• Literature review analytics (LRA) on sustainable cold-chain for perishable food products: research trends and future directions
• A branch-and-cut algorithm for the time window assignment vehicle routing problem
• A matheuristic for the asymmetric capacitated vehicle routing problem
• Variable neighborhood search: basics and variants
• Active guided evolution strategies for large-scale vehicle routing problems with time windows
• Variable neighborhood decomposition search
• A multi-stage algorithm for a capacitated vehicle routing problem with time constraints
• Requiem for the Miller-Tucker-Zemlin subtour elimination constraints?
• A conditional-logic interpretation for Miller-Tucker-Zemlin inequalities and extensions
• The Truck Dispatching Problem
• A Two-Stage Heuristic with Ejection Pools and Generalized Ejection Chains for the Vehicle Routing Problem with Time Windows
• Vehicle Routing
• Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
• Integer Programming Formulation of Traveling Salesman Problems
• Technical Note—An Effective Heuristic for the M-Tour Traveling Salesman Problem with Some Side Conditions
• Needed: An Empirical Science of Algorithms
• A Branch-and-Bound Algorithm for the Capacitated Vehicle Routing Problem on Directed Graphs
• A greedy look-ahead heuristic for the vehicle routing problem with time windows
• An R² statistic for fixed effects in the generalized linear mixed model
• Skewed general variable neighborhood search for the cumulative capacitated vehicle routing problem
• Variable neighborhood search: the power of change and simplicity
• An adaptive variable neighbourhood search approach for the dynamic vehicle routing problem

This page was built for publication: General VNS for asymmetric vehicle routing problem with time and capacity constraints