A lexicographic minimax approach to the vehicle routing problem with route balancing

DOI10.1016/j.ejor.2019.09.010zbMath1430.90099OpenAlexW2972450492MaRDI QIDQ2282498

Olivier Péton, Fabien Tricoire, Fabien Lehuédé

Publication date: 8 January 2020

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

Full work available at URL: https://doi.org/10.1016/j.ejor.2019.09.010

zbMATH Keywords

vehicle routing problemlarge neighborhood searchworkload balancingmulti-directional local searchequity in route duration

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Transportation, logistics and supply chain management (90B06) Deterministic network models in operations research (90B10)

Related Items (5)

Planning sustainable routes: economic, environmental and welfare concerns ⋮ A lexicographic maximin approach to the selective assessment routing problem ⋮ Memetic search for the minmax multiple traveling salesman problem with single and multiple depots ⋮ A matheuristic for tactical locomotive and driver scheduling for the swiss national railway company SBB Cargo AG ⋮ The multiple shortest path problem with path deconfliction

Uses Software

• VRP
• Cvrplib

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Inequity averse optimization in operational research
• The bi-objective mixed capacitated general routing problem with different route balance criteria
• Multi-directional local search
• Computing leximin-optimal solutions in constraint networks
• A general heuristic for vehicle routing problems
• An algorithm for the capacitated vehicle routing problem with route balancing
• A simplex based algorithm for the lexicographically extended linear maxmin problem
• On the lexicographic minimax approach to location problems
• An adaptive memory heuristic for a class of vehicle routing problems with minmax objective
• Refinements of the maximum approach to decision-making in a fuzzy environment
• Fair optimization and networks: a survey
• An evolutionary algorithm for the vehicle routing problem with route balancing
• Heuristics for the lexicographic Max-ordering vehicle routing problem
• Min-Max vs. Min-Sum vehicle routing: a worst-case analysis
• The Vehicle Routing Problem
• The Price of Fairness
• Lexicographically Minimum and Maximum Load Linear Programming Problems
• The Air Traffic Flow Management Problem: An Integer Optimization Approach
• Equitable bandwidth allocation in content distribution networks
• On Direct Methods for Lexicographic Min-Max Optimization

This page was built for publication: A lexicographic minimax approach to the vehicle routing problem with route balancing