The heterogeneous flexible periodic vehicle routing problem: mathematical formulations and solution algorithms

DOI10.1016/j.cor.2021.105662OpenAlexW4206477496MaRDI QIDQ2669729

Yanyan Li

Publication date: 9 March 2022

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

Full work available at URL: https://doi.org/10.1016/j.cor.2021.105662

zbMATH Keywords

vehicle routingmatheuristicsheterogeneous fleetkernel search

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Related Items (1)

Metaheuristics with variable diversity control and neighborhood search for the heterogeneous site-dependent multi-depot multi-trip periodic vehicle routing problem

Cites Work

• Unnamed Item
• A heuristic for BILP problems: the single source capacitated facility location problem
• Thirty years of heterogeneous vehicle routing
• Kernel search: a new heuristic framework for portfolio selection
• Kernel search: a general heuristic for the multi-dimensional knapsack problem
• A period vehicle routing case study
• The flexible periodic vehicle routing problem
• A two-phase solution algorithm for the flexible periodic vehicle routing problem
• A kernel search to the multi-plant capacitated lot sizing problem with setup carry-over
• Forty years of periodic vehicle routing
• The inventory routing problem: the value of integration
• Integer Programming Formulation of Traveling Salesman Problems
• The period routing problem
• The Period Vehicle Routing Problem and its Extensions
• Networks and vehicle routing for municipal waste collection
• Vehicle routing problems with split deliveries
• Flexibility and complexity in periodic distribution problems
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem

This page was built for publication: The heterogeneous flexible periodic vehicle routing problem: mathematical formulations and solution algorithms