| 1 |
A lexicographic minimax approach to the vehicle routing problem with route balancing
|
|
|
|
In: ISSN: 0377-2217 ; European Journal of Operational Research ; https://hal.archives-ouvertes.fr/hal-02296076 ; European Journal of Operational Research, Elsevier, 2020, 282 (1), pp.129-147. ⟨10.1016/j.ejor.2019.09.010⟩ ; https://www.sciencedirect.com/science/article/pii/S0377221719307489 (2020)
|
|
Abstract:
International audience ; Vehicle routing problems generally aim at designing routes that minimize transportation costs. However, in practical settings, many companies also pay attention at how the workload is distributed among its drivers. Accordingly, two main approaches for balancing the workload have been proposed in the literature. They are based on minimizing the duration of the longest route, or the difference between the longest and the shortest routes, respectively. Recently, it has been shown on several occasions that both approaches have some flaws. In order to model equity we investigate the lexicographic minimax approach, which is rooted in social choice theory. We define the leximax vehicle routing problem which considers the bi-objective optimization of transportation costs and of workload balancing. This problem is solved by a heuristic based on the multi-directional local search framework. It involves dedicated large neighborhood search operators. Several LNS operators are proposed and compared in experimentations.
|
|
Keyword:
[INFO.INFO-RO]Computer Science [cs]/Operations Research [cs.RO]; equity in route duration; large neighborhood search; multi-directional local search; vehicle routing problem; workload balancing
|
|
URL: https://hal.archives-ouvertes.fr/hal-02296076/file/leximax%20VRP%20-%20HAL%20version.pdf
https://doi.org/10.1016/j.ejor.2019.09.010
https://hal.archives-ouvertes.fr/hal-02296076/document
https://hal.archives-ouvertes.fr/hal-02296076
|
|
BASE
|
|
Hide details
|
|
|
| 2 |
A lexicographic minimax approach to the vehicle routing problem with load balancing
|
|
|
|
In: https://hal.archives-ouvertes.fr/hal-01922934 ; 2018 (2018)
|
|
BASE
|
|
Show details
|
|
|
| 3 |
Multi-directional local search for a bi-objective vehicle routing problem with lexicographic minimax load balancing
|
|
|
|
In: TSL Conference 2017 ; https://hal.archives-ouvertes.fr/hal-01517255 ; TSL Conference 2017, Jul 2017, Chicago, United States (2017)
|
|
BASE
|
|
Show details
|
|
|
| 4 |
On stability of some lexicographic integer optimization problem
|
|
|
|
In: Control and Cybernetics ; https://hal.archives-ouvertes.fr/hal-01721621 ; Control and Cybernetics, 2010, 39 (3) (2010)
|
|
BASE
|
|
Show details
|
|
|
| 5 |
Postoptimal analysis of lexicographic combinatorial minimax problems
|
|
|
|
In: The Second International Conference "Problems of Cybernetics and Informatics (PCI'2008)" ; https://hal.archives-ouvertes.fr/hal-01713853 ; The Second International Conference "Problems of Cybernetics and Informatics (PCI'2008)", Sep 2008, Baku, Azerbaijan (2008)
|
|
BASE
|
|
Show details
|
|
|
| 6 |
On stability conditions of some vector lexicographic Boolean problem
|
|
|
|
In: The Russian Conference "Discrete Optimization and Operations Research (DOOR-2007)" ; https://hal.archives-ouvertes.fr/hal-01710986 ; The Russian Conference "Discrete Optimization and Operations Research (DOOR-2007)", Sep 2007, Vladivostok, Russia (2007)
|
|
BASE
|
|
Show details
|
|
|
|
|
