The family capacitated vehicle routing problem

DOI10.1016/J.EJOR.2023.10.042MaRDI QIDQ6556080zbMATH OpenFDO

Authors Raquel Bernardino, Ana Paias

Publication date 17 June 2024

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

Full work available at URL https://doi.org/10.1016/J.EJOR.2023.10.042

zbMATH Keywords

branch-and-cut algorithmfamily traveling salesman problemiterated local search algorithmprojection resultsrouting

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites work

• A Branch-and-Bound Algorithm for the Capacitated Vehicle Routing Problem on Directed Graphs
• A hybrid adaptive iterated local search with diversification control to the capacitated vehicle routing problem
• A POPMUSIC matheuristic for the capacitated vehicle routing problem
• A result on projection for the vehicle routing problem
• A survey on optimization metaheuristics
• A unified solution framework for multi-attribute vehicle routing problems
• An ILS heuristic for the ship scheduling problem: application in the oil industry
• Dioïds and semirings: Links to fuzzy sets and other applications
• Exact algorithms for routing problems under vehicle capacity constraints
• Heuristic approaches for the family traveling salesman problem
• scientific article; zbMATH DE number 3895002 (Why is no real title available?)
• Improved branch-cut-and-price for capacitated vehicle routing
• Projection results for vehicle routing
• Randomized heuristics for the family traveling salesperson problem
• Solving the family traveling salesman problem
• The family traveling salesman problem with incompatibility constraints
• The multi‐depot family traveling salesman problem and clustered variants: Mathematical formulations and branch‐&‐cut based methods
• The traveling salesman problem. A computational study.
• The truck dispatching problem
• Vehicle Routing
• Warehousing in the e-commerce era: a survey

Cited in

(4)

• An ALNS metaheuristic for the family multiple traveling salesman problem
• Solving soft and hard-clustered vehicle routing problems: a bi-population collaborative memetic search approach
• An iterated local search algorithm for the traveling purchaser problem
• The covering tour problem with path upgrades

This page was built for publication: The family capacitated vehicle routing problem

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