most citedA GRASPxELS with Depth First Search Split Procedure for the HVRP

6 citations · 7 across the 5 of their papers we have counts for

collaborators

5 papers

cs.NE20221 cited

Stochastic Capacitated Arc Routing Problem

Fleury Gérard, Lacomme Philippe, Christian Prins

This paper deals with the Stochastic Capacitated Arc Routing Problem (SCARP), obtained by randomizing quantities on the arcs in the CARP. Optimization problems for the SCARP are ch…

cs.NE2022

First Competitive Ant Colony Scheme for the CARP

Lacomme Philippe, Prins Christian, Tanguy Alain

This paper addresses the Capacitated Arc Routing Problem (CARP) using an Ant Colony Optimization scheme. Ant Colony schemes can compute solutions for medium scale instances of VRP.…

physics.soc-ph20226 cited

A GRASPxELS with Depth First Search Split Procedure for the HVRP

Christophe Duhame, Philippe Lacomme, Caroline Prodhon

Split procedures have been proved to be efficient within global framework optimization for routing problems by splitting giant tour into trips. This is done by generating optimal s…

quant-ph2022

Description of the Grover algorithm based on geometric considerations

Gérard Fleury, Philippe Lacomme

This paper concerns the Grover algorithm that permits to make amplification of quantum states previously tagged by an Oracle. Grover's algorithm allows searches in an unstructure d…

math.OC2017

A Statistical Comparison of Objective Functions for the Vehicle Routing Problem with Route Balancing

Jairo Lozano, Luis C. González-Gurrola, Eduardo Rodríguez-Tello +1

The Vehicle Routing Problem with Route Balancing (VRPRB) is a biobjective version of the original Vehicle Routing Problem (VRP) in which, besides minimizing the total distance trav…