Libo Ren
University of Auvergne
27 Papers
65 Citations
Libo Ren is an academic researcher from University of Auvergne. The author has contributed to research in topics: Shortest path problem & Computer science. The author has an hindex of 7, co-authored 25 publications. Previous affiliations of Libo Ren include Centre national de la recherche scientifique & Blaise Pascal University.
Chat about Author
Papers
A Multi-Start Split based Path Relinking (MSSPR) approach for the vehicle routing problem with route balancing
TL;DR: A multi-start approach based on two search spaces each of them using a different solution presentation that allows tackling a variant of the problem ignored by the previous works on VRPRB, which integrates limitation on vehicle service time.
45
Resolution of a Job‐Shop Problem with Transportation Constraints: A Master/slave Approach
TL;DR: In this paper, the authors propose a framework based on an alternate resolution of the scheduling problem (master) modeled on a disjunctive graph by introducing a time lag (i.e., a delay between operations), and of the routing problem (slave).
19
An acceleration vector variance based method for energy expenditure estimation in real-life environment with a smartphone/smartwatch integration
TL;DR: An intelligent wearable system, which combines the use of two complementary devices: smartphone and smartwatch to collect accelerometry data that can precisely discriminate real-world human sedentary and active behaviors and their duration and estimate energy expenditure in real time and in free-living conditions is proposed.
18
A GRASP×ELS approach for the job-shop with a web service paradigm packaging
Maxime Chassaing,Jonathan Fontanel,Philippe Lacomme,Libo Ren,Nikolay Tchernev,Pierre Villechenon. +5 more
TL;DR: The GRASPxELS provided in the web service, is a state of the art method which competes with previously published methods and which has the advantage of being available for free, in any languages, everywhere contributing in spreading operational research contribution.
18
A population-based metaheuristic for the capacitated lot-sizing problem with unrelated parallel machines
TL;DR: An efficient population-based metaheuristic to tackle the capacitated lot-sizing problem with multiple items, setup time and unrelated parallel machines is proposed and yields competitive results in terms of solution quality.
16