Methods for bi-objective routing and districting problems

DOI10.1111/ITOR.70050MaRDI QIDQ6918552zbMATH OpenFDO

Authors Margarida Aires de Abreu, Daniel Santos, José Rui Figueira

Publication date 10 October 2025

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

Full work available at URL https://doi.org/10.1111/ITOR.70050

zbMATH Keywords

\( \epsilon \)-constraintbi-objective problemcapacitated vehicle routing problemcompactnessdispersiondistricting problem

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Cites work

• A generalized variable neighborhood search heuristic for the capacitated vehicle routing problem with stochastic service times
• A multi-objective mixed integer linear programming model for thesis defence scheduling
• A note on the lifted Miller-Tucker-Zemlin subtour elimination constraints for the capacitated vehicle routing problem
• Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
• An improved version of the augmented \(\varepsilon\)-constraint method (AUGMECON2) for finding the exact Pareto set in multi-objective integer programming problems
• Clustered vehicle routing problem for waste collection with smart operational management approaches
• Compact formulations for multi-depot routing problems: theoretical and computational comparisons
• Dynamic design of sales territories
• Effective implementation of the \(\varepsilon \)-constraint method in multi-objective mathematical programming problems
• scientific article; zbMATH DE number 4085440 (Why is no real title available?)
• scientific article; zbMATH DE number 3193293 (Why is no real title available?)
• Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints
• Integer Programming Formulation of Traveling Salesman Problems
• Integrating territory design and routing problems
• Multiobjective scatter search for a commercial territory design problem
• New path elimination constraints for multi-depot routing problems
• Nonlinear multiobjective optimization
• Optimal Political Districting by Implicit Enumeration Techniques
• Solving a multi-objective dynamic stochastic districting and routing problem with a co-evolutionary algorithm
• Territory design for the multi-period vehicle routing problem with time windows
• The capacitated vehicle routing problem with stochastic demands and time windows
• The capacitated vehicle routing problem: stronger bounds in pseudo-polynomial time

This page was built for publication: Methods for bi-objective routing and districting problems

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