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

DOI10.1016/J.COR.2024.106630MaRDI QIDQ6568438FDOQ6568438

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

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

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

Cites Work

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6568438)