- 62
- 5
- 2
- 1
- 1
- 1
Wahiba Ramdane Cherif-Khettaf
72
Documents
Présentation
Ecole des Mines de Nancy, Université de Lorraine
Optimist/Loria
Publications
- 5
- 5
- 5
- 5
- 4
- 3
- 3
- 3
- 3
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 31
- 21
- 18
- 6
- 5
- 4
- 4
- 4
- 4
- 4
- 3
- 3
- 3
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 25
- 36
- 6
- 4
- 3
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
Un algorithme mémétique pour le problème de tournées de techniciens : Cas industriel d'un GRD25ème congrès annuel de la Société Française de Recherche Opérationnelle et d'Aide à la Décision ROADEF 2024, Mar 2024, Amiens, France
Communication dans un congrès
hal-04525873v1
|
|
Computing Robust Solutions for the Stochastic CARPODYSSEUS 2003 Second International Workshop on Freight Transportation and Logistics Mondello (Palermo), Sicily, Italy, May 27-30, 2003, Jun 2023, Palermo, France
Communication dans un congrès
hal-04146655v1
|
|
Optimization of Direct Transportation Flows for the Removal of Construction Waste Bins with both Resource and Task Availability Interval ConstraintsThe optimization of the Big-bag removal is studied in (Jaballah and Ramdane Cherif-Khettaf, 2021; Ramdane Cherif-Khettaf et al., 2022) where a new vehicle routing model called the Multi-Trip Pickup and Delivery Problem, with Split loads, Profits and Multiple Time Windows was proposed. This model allowed mutualization of material delivery with Big- Bag waste removal, using tail-lift truck fleet. In this study, we focus only on waste bin removal, which consists in performing a set of direct trips from the platform to the construction sites to satisfy construction site requests for full bins removal and their replacement by empty bins. The remainder of the paper is organized as follows. Section 2 describes the problem and related literature; two MIP models are presented in section 3. Experimental results with the definition of benchmarks are given in section 4. Finally, concluding remarks are given in section 5. 2 PROBLEM DESCRIPTION AND RELATED LITERATURE A limited heterogeneous fleet of tipper trucks (vehicles) situated at the platform must perform multiple direct trips between the platform and the construction sites. The vehicles differ by their speed and their distance limit. Each trip consists of loading an empty bin at the platform, delivering it to a given construction site, collecting a full waste bin from this construction site, and unloading it in the recycling center located just next to the platform. Each vehicle has one or more periods of availability, which represent the time windows when the vehicles are available at the platform and so can move to the construction sites to collect waste bins, outside of these periods of availability, the vehicles can be mobilized for other tasks external to the platform and can’t satisfy the request of bin removal. The platform also has a period of availability, that is given by the platform's opening hours. The construction sites have one or more types of bins depending on the specificity of the works in progress in the construction site (bin for wood, bin for metals, bin for plaster, bin for inert materials, etc.). Each site has only one bin per type, and must therefore send to the platform requests for bin removal. The platform must manage the bins waste removal with the available resources and ensure the replacement of each full bin with an empty one. The construction sites also have one or more periods of availability during which vehicles access is allowed, and thus the arrival and departure of vehicles at the construction site location must be within one of the availability time windows allowed by the construction site. We denote by a bin removal task, all operations that consists of loading the vehicle with an empty bin at the platform, travelling from the platform to the construction site, unloading the empty bin at the construction site, loading the full bin, travelling back to the platform and unloading the full bin at the platform's recycling center. Platform service time is the time required for loading and unloading the bin on the platform. This problem can be modelled as unrelated parallel machine scheduling problem in which the vehicles can be represented as machines with multiple periods of availability and the bin removal tasks as jobs that have one or multiple periods of availability, and require a certain amount of processing time, that depends on the vehicle that is used. In addition, the constraint of availability of the tasks in our case concerns only a part of the task processing time, it is the loading and unloading part at the location of the construction site and does not concern the part of the travel to and from the site. The objective is to perform the maximum number of bin removal tasks, to determine the assignment of tasks to the availability intervals of the vehicles; and to define the sequence of satisfied tasks per available interval of each used vehicle. In terms of computational complexity (Lenstra et al., 1977) proved that the single machine scheduling problem with only release dates, which is a special case of our problem is NP-hard. In literature, extensive studies have been conducted in the area of parallel machine scheduling with time constraints without availability constraints (Arik et al.,2022; Osorio-Valenzuela et al., 2019). In most of the research reviewed in the area of parallel machine scheduling, the availability constraints are defined on resources (Such-Jeng, 2013). Very few studies consider the availability intervals of tasks as in (Gedik et al.,2016). A survey on parallel machine scheduling under availability constraints can be found (Kaabi and Harrath, 2014). Despite the abundant literature on parallel machine scheduling, the problem that we present here is in our knowledge a novel one and allows us to model a new constraint in unrelated parallel machine scheduling problems, that is both resource and task multiple availability interval constraint. Our contribution can be summarized in the two following issues: ─ Modeling a real problem of direct transportation of bin waste in the construction sector as a parallel machine scheduling problem with a new specific constraint that is multiple periods ofICORES 2023 - 12th International Conference on Operations Research and Enterprise Systems, Feb 2023, Lisbon, Portugal. pp.221-228, ⟨10.5220/0011821900003396⟩
Communication dans un congrès
hal-04056131v1
|
|
Memetic Algorithms for the Workforce Routing and Scheduling Problem: case study of Energy Distribution System Operator (DSO)9th International Conference on Metaheuristics and Nature Inspired Computing META 2023, Nov 2023, Marrakech (MA), Morocco
Communication dans un congrès
hal-04521142v1
|
|
|
|
Multi-trip pickup and delivery problem, with split loads, profits and multiple time windows to model a real case problem in the construction industry10th International Conference on Operations Research and Enterprise Systems (ICORES), Feb 2021, Online streaming, France. ⟨10.5220/0010253002000207⟩
Communication dans un congrès
hal-02985164v1
|
Un algorithme génétique pour le problème de tournées de véhicules électriques périodiques20ème congrès annuel de la société Française de Recherche Opérationnelle et d'Aide à la Décision, Feb 2019, Havre, France
Communication dans un congrès
hal-02982816v1
|
|
Large Neighborhood Search for Periodic Electric Vehicle Routing Problem8th International Conference on Operations Research and Enterprise Systems, Feb 2019, Prague, Czech Republic. pp.169-178, ⟨10.5220/0007409201690178⟩
Communication dans un congrès
hal-02982812v1
|
|
Constructive Heuristics for Periodic Electric Vehicle Routing Problem7th International Conference on Operations Research and Enterprise Systems, Jan 2018, Funchal, Portugal. pp.264-271, ⟨10.5220/0006630502640271⟩
Communication dans un congrès
hal-02982813v1
|
|
Behaviour of a Hybrid ILS Heuristic on the Capacitated Profitable Tour Problem7th International Conference on Operations Research and Enterprise Systems, Jan 2018, Funchal, Portugal. pp.115-123, ⟨10.5220/0006630401150123⟩
Communication dans un congrès
hal-02982814v1
|
|
Analyse du comportement des métaheuristiques sur un problème de rééquilibrage de lignes d’assemblage18ème Congrès de la Société Française de Recherche Opérationnelle et d'Aide à la Décision, Feb 2017, Metz, France
Communication dans un congrès
hal-02982819v1
|
|
Variable Neighborhood Search Procedures for the Multi-Period Technician Routing and Scheduling Problem4th International Conference on Control, Decision and Information Technologies, Apr 2017, Barcelone, Spain. ⟨10.1109/CoDIT.2017.8102699⟩
Communication dans un congrès
hal-02982815v1
|
|
Tournées de véhicules électriques avec flotte mixte et chargement partielROADEF 2016, 10-12 février, Compiègne., Feb 2016, Compiègne, France
Communication dans un congrès
hal-01307637v1
|
|
Algorithme d'optimisation adaptatif pour un service de mobilité intégréROADEF 2016, Feb 2016, Compiègne, France
Communication dans un congrès
hal-01307644v1
|
|
Vehicle Routing Problem with Mixed Fleet of Conventional and Heterogenous Electric Vehicles and Time Dependent Charging Costs17th International Conference on Applied Mathematics and Operation Research, Mar 2015, Miami, United States
Communication dans un congrès
hal-01307995v1
|
|
Un nouvel outil pour la classification des problèmes de tournéesROADEF 2015, Feb 2015, Marseille, France
Communication dans un congrès
hal-01307667v1
|
|
Multi-start Iterated Local Search for the Mixed Fleet Vehicle Routing Problem with Heterogenous Electric VehiclesEVOCOP 2015, Apr 2015, Copenhagen Denmark. pp.138-149
Communication dans un congrès
hal-01307986v1
|
|
Iterated Tabu Search for the Mix Fleet Vehicle Routing Problem with Heterogenous Electric Vehicles3rd International Conference on Modelling, Computation and Optimization in Information Systems and Management Sciences, May 2015, Metz, France. pp.57-68
Communication dans un congrès
hal-01308010v1
|
|
Using clustering method to solve Two Echelon Multi-products Location-Routing problem with Pickup and Delivery3rd International Conference on Operations Research and Enterprise Systems, Mar 2014, Angers, France
Communication dans un congrès
hal-01307469v1
|
|
Multi-products Location-Routing problem with Pickup and DeliveryICALT - International Conference on Advanced Logistics and Transport - 2013, May 2013, Sousse, Tunisia. pp.115-122, ⟨10.1109/ICAdLT.2013.6568445⟩
Communication dans un congrès
hal-00841498v1
|
|
Integrated model for electric vehicles routing and optimal charging26th European Conference on Operational Research, Jul 2013, Rome, Italy
Communication dans un congrès
hal-01307615v1
|
|
Approche flexible pour l’ordonnancement des tâches de maintenance distribuéeCPI’2013, Oct 2013, Tlemcen, Algeria
Communication dans un congrès
hal-01307576v1
|
|
Multi-products Location-Routing problem with Pickup and Delivery: Two-Echelon model11th IFAC Workshop on Intelligent Manufacturing Systems - 2013, May 2013, São Paulo, Brazil. pp.198-203, ⟨10.3182/20130522-3-BR-4036.00039⟩
Communication dans un congrès
hal-00841500v1
|
|
problème de Localisation-Routage Multi-produits avec collecte et livraisonROADEF, Feb 2013, Troyes, France
Communication dans un congrès
hal-01307676v1
|
|
Planification conjointe des tournées et de la recharge des véhicules électriquesROADEF, Feb 2013, Troyes, France
Communication dans un congrès
hal-01307682v1
|
|
Etude d’un service de transport à la demande urbain12e congrès annuel de la Société française de Recherche Opérationnelle et d’Aide à la Décision, Mar 2011, Saint Etienne, France
Communication dans un congrès
hal-01307699v1
|
|
Etude d'un service de transport à la demande urbain12e congrès annuel de la Société française de Recherche Opérationnelle et d'Aide à la Décision - ROADEF 2011, Mar 2011, St-Etienne, France
Communication dans un congrès
inria-00606500v1
|
|
|
|
Scheduling problems for logistic platforms with fixed staircase component arrivals and various deliveries hypotheses2nd International Conference on Applied Operational Research - ICAOR 2010, Institute for Advanced Management Systems Research and Tadbir Institute for Operational Research, Aug 2010, Turku, Finland. pp.517-528
Communication dans un congrès
inria-00523289v1
|
|
|
Scheduling supply chain node with fixed component arrivals and two partially flexible deliveries5th International Conference on Management and Control of Production and Logistics - MCPL 2010, APCA-Portuguese Association for Automatic Control and IFAC National Member Organization, Sep 2010, Coimbra, Portugal. pp.6, ⟨10.3182/20100908-3-PT-3007.00030⟩
Communication dans un congrès
inria-00523287v1
|
|
|
Outils d'aide à la décision pour le lissage de charges des plateformes logistiques8ème Congrès International de Génie Industriel - CIGI 2009, Ecole Nationale d'Ingénieurs de Tarbes à Bagnères de Bigorre, Jun 2009, Tarbes, France. 8 p
Communication dans un congrès
inria-00464831v1
|
|
|
Negotiation models for logistic plarform planning and scheduling11th International Workshop on Project Management and Scheduling, Apr 2008, Istanbul, Turkey. pp.43-46
Communication dans un congrès
inria-00339199v1
|
|
|
Evolutionary Algorithms for Capacitated Arc Routing problems with Time Windows12th IFAC Symposium on Information Control Problems in Manufacturing - INCOM, Jun 2006, Saint-Etienne/France
Communication dans un congrès
inria-00104110v1
|
Approche par décomposition pour le problème de planification de tournées de personnel6ème congrès de la Société Française de Recherche Opérationnelle et d'Aide à la Décision - ROADEF'2005, Feb 2005, Tours/France, pp.285-286
Communication dans un congrès
inria-00000296v1
|
|
Méthodes d'optimisation combinatoire pour un problème d'optimisation de maintenance corrective6ème congrès de la Société Française de Recherche Opérationnelle et d'Aide à la Décision - ROADEF 2005, Feb 2005, Tours/France
Communication dans un congrès
inria-00000298v1
|
|
Heuristics and Lower Bound for the Mixed Capacitated Arc Routing ProblemConference on Routing and Location, 2003, Puerto de la Cruz (Ténérife), Spain
Communication dans un congrès
hal-02082005v1
|
|
Computing Robust Solutions for the Stochastic CARPODYSSEUS 2003, 2003, Palermo, Italy
Communication dans un congrès
hal-02082002v1
|
|
Evolutionary Algorithms for Arc Routing ProblemsConference on Routing and Location (CORAL 2003)), 2003, Puerto de la Cruz, Spain
Communication dans un congrès
hal-02082004v1
|
|
An overview of evolutionary algorithms for arc routing problemsCORAL 2003 (Third Conf. on Routing and Location), Feb 2003, Tenerife, Spain
Communication dans un congrès
hal-02895749v1
|
|
Realistic arc routing problems: fast heuristics and instance generatoractes de CO2002 (International Sympsium on Combinatorial Optimization), 2002, Paris, France. pp.112
Communication dans un congrès
hal-02082011v1
|
|
Robustness evaluation of solutions for the Capacitated Arc Routing ProblemSimulation and Planning in High Autonomy Systems, 2002, Lisbon, Portugal. pp.290-295
Communication dans un congrès
hal-02082012v1
|
|
Evolutionary Algorithms for Multiperiods Arc Routing ProblemsIPMU'2002, 2002, Annecy, France. pp.845-852
Communication dans un congrès
hal-02082010v1
|
|
Planning problems in arc routingActes de PMS 2002 (EURO Working Group on Project Management and Scheduling), 2002, Valencia, Spain. pp.232-235
Communication dans un congrès
hal-02082013v1
|
|
Etude de la robustesse des solutions pour le CARPCongrès de la ROADEF 2002, 2002, Paris, France
Communication dans un congrès
hal-02895758v1
|
|
General Arc Routing Problems Solved by a Cutting Plane Algorithm and a Genetic AlgorithmIFAC'2002, 2002, Barcelona, Spain
Communication dans un congrès
hal-02082009v1
|
|
Fast algorithms for general arc routing problemsJuillet 2002, 2002, Edimbourg, United Kingdom
Communication dans un congrès
hal-02082007v1
|
|
Les problèmes de tournées sur arcs : application à la collecte des déchets ménagersJournée Technique Transport Urbain et Multimodalité 2001, Jun 2001, Belfort, France
Communication dans un congrès
hal-02895760v1
|
|
Algorithmes génétiques pour le CARPMOSIM'01 (3ème Conférence Francophone de Modélisation et Simulation), Apr 2001, Troyes, France
Communication dans un congrès
hal-02895342v1
|
|
Algorithmes génétiques pour les problèmes de tournées sur arcsConférence MOdélisation et SIMulation ( MOSIM'01), 2001, Troyes, France. pp.117-124
Communication dans un congrès
hal-02082016v1
|
|
An integer linear model for general arc routing problems13th European Simulation Symposium, 2001, Marseille, France. pp.427-431
Communication dans un congrès
hal-02082014v1
|
|
A Genetic Algorithm for the Capacitated Arc Routing Problem and Its ExtensionsEvoWorkshops 2001, Apr 2001, Côme, Italy. pp.473-483, ⟨10.1007/3-540-45365-2_49⟩
Communication dans un congrès
hal-00119863v1
|
ILS-RVND Algorithm for Multi-trip Pickup and Delivery Problem, with Split Loads, Profits and Multiple Time WindowsDe Armas, J.; Ramalhinho, H.; Voß, S. Computational Logistics, 13557, Springer International Publishing, pp.105-119, 2022, Lecture Notes in Computer Science, 978-3-031-16579-5. ⟨10.1007/978-3-031-16579-5_8⟩
Chapitre d'ouvrage
hal-04056151v1
|
|
Impact of Iterated Local Search Heuristic Hybridization on Vehicle Routing Problems: Application to the Capacitated Profitable Tour ProblemCommunications in Computer and Information Science, 966, springer, pp.80-101, 2019, In: Parlier G., Liberatore F., Demange M. (eds) Operations Research and Enterprise Systems. ICORES 2018., ⟨10.1007/978-3-030-16035-7_5⟩
Chapitre d'ouvrage
hal-02982808v1
|
|
Metaheuristics for Periodic Electric Vehicle Routing ProblemCommunications in Computer and Information Science book series, springer, 2019, ⟨10.1007/978-3-030-37584-3_8⟩
Chapitre d'ouvrage
hal-02982804v1
|
|
Reinsertion Algorithm Based on Destroy and Repair Operators for Dynamic Dial a Ride ProblemsLecture Notes in Computer Science book series, 11536, springer, pp.81-95, 2019, Computational Science – ICCS 2019 19th International Conference, Faro, Portugal, June 12–14, 2019, Proceedings, Part I, ⟨10.1007/978-3-030-22734-0_7⟩
Chapitre d'ouvrage
hal-02982807v1
|
|
Metaheuristics for the Generalised Periodic Electric Vehicle Routing ProblemC. Paternina-Arboleda; S. Voß. Computational Logistics. ICCL 2019, 11756, springer, pp.219-232, 2019, Lecture Notes in Computer Science book series, ⟨10.1007/978-3-030-31140-7_14⟩
Chapitre d'ouvrage
hal-02982806v1
|
|
Maximizing the Number of Served Requests in an Online Shared Transport System by Solving a Dynamic DARPBektaş T.; Coniglio S.; Martinez-Sykora A.; Voß S. Computational Logistics 8th International Conference, 10572, springer, pp.64-78, 2017, ⟨10.1007/978-3-319-68496-3_5⟩
Chapitre d'ouvrage
hal-02982809v1
|
|
Iterated Tabu Search for the Mix Fleet Vehicle Routing Problem with Heterogenous Electric VehiclesAdvances in Intelligent Systems and Computing, Springer, Cham, 359, , pp.57-68, 2015, In: Le Thi H., Pham Dinh T., Nguyen N. (eds) Modelling, Computation and Optimization in Information Systems and Management Sciences, 978-3-319-18161-5. ⟨10.1007/978-3-319-18161-5_6⟩
Chapitre d'ouvrage
hal-02982821v1
|
|
Multi-Start Iterated Local Search for the Mixed fleet Vehicle Routing Problem with Heterogeneous Electric VehiclesEvolutionary Computation in Combinatorial Optimization, 9026, Springer, pp.138-149, 2015, 978-3-319-16467-0. ⟨10.1007/978-3-319-16468-7_12⟩
Chapitre d'ouvrage
hal-01306896v1
|
|
|
The Two-Echelon Multi-products Location-Routing problem with Pickup and Delivery: Formulation and heuristic approaches2014
Pré-publication, Document de travail
hal-01088960v1
|
New Algorithms for the General Arc Routing Problems[Intern report] A04-R-340 || lacomme04c, LORIA - Université de Lorraine. 2004, 15 p
Rapport
inria-00100227v1
|