Aesthetic considerations for the min-max \(K\)-windy rural postman problem

DOI10.1002/NET.21748MaRDI QIDQ6496353

José María Sanchis, Isaac Plana, Oliver Lum, Angel Corberán, Bruce L. Golden

Publication date: 3 May 2024

Published in: Networks (Search for Journal in Brave)

zbMATH Keywords

multi-objective problemsarc routing problemsmin-max objectiveaesthetic objective

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Deterministic network models in operations research (90B10)

Cites Work

• Unnamed Item
• The mixed capacitated arc routing problem with non-overlapping routes
• Multi-objective microzone-based vehicle routing for courier companies: from tactical to operational planning
• A metaheuristic for the min-max windy rural postman problem with K vehicles
• New heuristic algorithms for the windy rural postman problem
• A new insertion-based construction heuristic for solving the pickup and delivery problem with time windows
• A branch-price-and-cut algorithm for the min-maxk-vehicle windy rural postman problem
• Min-Max K -vehicles windy rural postman problem
• New facets and an enhanced branch-and-cut for the min-max K -vehicles windy rural postman problem
• A Branch-and-Cut Algorithm for the Dial-a-Ride Problem
• A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
• Cut-First Branch-and-Price-Second for the Capacitated Arc-Routing Problem

This page was built for publication: Aesthetic considerations for the min-max \(K\)-windy rural postman problem