A lexicographic maximin approach to the selective assessment routing problem

DOI10.1007/S00291-022-00687-8zbMATH Open1517.90012arXiv2201.09599OpenAlexW4285083870MaRDI QIDQ6103191FDOQ6103191

Authors: Mohammadmehdi Hakimifar, V. C. Hemmelmayr, F. Tricoire 

Publication date: 26 June 2023

Published in: OR Spectrum (Search for Journal in Brave)

Abstract: Max-min approaches have been widely applied to address equity as an essential consideration in humanitarian operations. These approaches, however, have a significant drawback of being neutral when it comes to solutions with the same minimum values. These equivalent solutions, from a max-min point of view, might be significantly different. We address this problem using the lexicographic maximin approach, a refinement of the classic max-min approach. We apply this approach in the rapid needs assessment process, which is carried out immediately after the onset of a disaster, to investigate the disaster's impact on the affected community groups through field visits. We construct routes for an assessment plan to cover community groups, each carrying a distinct characteristic, such that the vector of coverage ratios are maximized. We define the leximin selective assessment problem, which considers the bi-objective optimization of total assessment time and coverage ratio vector maximization. We solve the bi-objective problem by a heuristic approach based on the multi-directional local search framework.

Full work available at URL: https://arxiv.org/abs/2201.09599

Recommendations

• On the lexicographic minimax approach to location problems
• On Equitable Resource Allocation Problems: A Lexicographic Minimax Approach
• A robust optimization approach for humanitarian needs assessment planning under travel time uncertainty
• Multicriteria optimization in humanitarian aid
• Emergency relief routing models for injured victims considering equity and priority

zbMATH Keywords

team orienteeringmulti-directional local searchequity in humanitarian logisticshumanitarian needs assessment

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27) Transportation, logistics and supply chain management (90B06) Discrete location and assignment (90B80)

Cites Work

• The orienteering problem: a survey
• A general heuristic for vehicle routing problems
• The team orienteering problem
• On the lexicographic minimax approach to location problems
• Heuristics for the lexicographic Max-ordering vehicle routing problem
• Fair optimization and networks: a survey
• Lexicographically Minimum and Maximum Load Linear Programming Problems
• Multi-directional local search
• A multi-criteria optimization model for humanitarian aid distribution
• A heuristic for the multiple tour maximum collection problem
• A lexicographical goal programming based decision support system for logistics of humanitarian aid
• Orienteering problem: a survey of recent variants, solution approaches and applications
• The Air Traffic Flow Management Problem: An Integer Optimization Approach
• A bi-objective metaheuristic for disaster relief operation planning
• Refinements of the maximum approach to decision-making in a fuzzy environment
• Computing leximin-optimal solutions in constraint networks
• Equity and deprivation costs in humanitarian logistics
• A robust optimization approach for humanitarian needs assessment planning under travel time uncertainty
• A lexicographic minimax approach to the vehicle routing problem with route balancing
• The Humanitarian pickup and distribution problem
• A multi-cover routing problem for planning rapid needs assessment under different information-sharing settings

This page was built for publication: A lexicographic maximin approach to the selective assessment routing problem

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