A matheuristic for the MinMax capacitated open vehicle routing problem

DOI10.1111/itor.12581OpenAlexW2886778514WikidataQ129423823 ScholiaQ129423823MaRDI QIDQ6066715

Unnamed Author, Jens Lysgaard, Alfredo G. Hernández-Díaz

Publication date: 16 November 2023

Published in: International Transactions in Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1111/itor.12581

zbMATH Keywords

vehicle routing problemmatheuristicminmax objectiveCOVRP

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A multi-start algorithm for a balanced real-world open vehicle routing problem
• Metaheuristics for bi-level optimization
• An adaptive memory heuristic for a class of vehicle routing problems with minmax objective
• Local branching
• A survey of scheduling problems with no-wait in process
• A new branch-and-cut algorithm for the capacitated vehicle routing problem
• Multi-objective vehicle routing problems
• A survey on matheuristics for routing problems
• Min-Max vs. Min-Sum vehicle routing: a worst-case analysis
• The Truck Dispatching Problem
• 2-Path Cuts for the Vehicle Routing Problem with Time Windows
• Solution of a Min-Max Vehicle Routing Problem
• A heuristic method for the open vehicle routing problem
• Tabu search for a multi-objective routing problem
• The m-Traveling Salesman Problem with Minmax Objective
• School bus routing—a column generation approach
• Matheuristics for the capacitated p‐median problem
• A set covering based matheuristic for a real‐world city logistics problem
• Approximations for minimum and min-max vehicle routing problems