Zobrazeno 1 - 10 of 85 pro vyhledávání: '"Ammar Oulamara"'
3
Hybrid Heuristic and Metaheuristic for Solving Electric Vehicle Charging Scheduling Problem
Autor: Michel Basset, Lhassane Idoumghar, Ammar Oulamara, Imene Zaidi
Publikováno v: Evolutionary Computation in Combinatorial Optimization
Evolutionary Computation in Combinatorial Optimization, 12692, Springer International Publishing, pp.219-235, 2021, Lecture Notes in Computer Science, 978-3-030-72903-5. ⟨10.1007/978-3-030-72904-2_14⟩
Evolutionary Computation in Combinatorial Optimization ISBN: 9783030729035
EvoCOP
The electric vehicle (EV) charging scheduling problem has become a research focus to mitigate the impact of large-scale deployment of EV in the near future. One of the main assumptions in literature is that there are enough charging points (CP) in th
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ef1d26c51e0fe678fa4eb2eca05899d7
https://hal.science/hal-03561746
Zobrazit plný text záznamu
4
The electric location-routing problem with heterogeneous fleet: Formulation and Benders decomposition approach
Autor: Said Salhi, Ammar Oulamara, Caroline Prodhon, Hatice Calik
Publikováno v: Computers and Operations Research
Computers and Operations Research, 2021, 131, pp.105251. ⟨10.1016/j.cor.2021.105251⟩
In this paper, we focus on a problem that requires the location of recharging stations and the routingof electric vehicles in a goods distribution system. The goods are disseminated from a depot anddistributed to the customers via a heterogeneous fle
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::de69ed1c390f7ae8e4c77d7aacca6e5e
https://kar.kent.ac.uk/87784/1/Paper2-pdfSalhi.pdf
Zobrazit plný text záznamu
6
New online reinsertion approaches for a dynamic Dial-A-Ride Problem
Autor: Sven Vallée, W. Ramdane Cherif-Khettaf, Ammar Oulamara
Publikováno v: Journal of computational science
Journal of computational science, 2020, 47, ⟨10.1016/j.jocs.2020.101199⟩
Journal of computational science, Elsevier, 2020, ⟨10.1016/j.jocs.2020.101199⟩
International audience; This study is inspired by a challenging dynamic Dial-a-Ride Problem (DARP) encountered in a mobility service operated by the company Padam.1 . Customers ask for a transportation service either in advance or in real-time and ge
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e3f24026ddbfce49a2a6209561e9efc4
https://hal.univ-lorraine.fr/hal-02981758
Zobrazit plný text záznamu
7
Optimal Online Electric Vehicle Charging Scheduling in Unbalanced Three-Phase Power System
Autor: Lhassane Idoumghar, Michel Basset, Imene Zaidi, Ammar Oulamara
Publikováno v: Computational Science and Its Applications – ICCSA 2020 ISBN: 9783030587987
ICCSA (1)
International Conference on Computational Science and Its ApplicationsICCSA 2020: Computational Science and Its Applications – ICCSA 2020
International Conference on Computational Science and Its Applications ICCSA 2020: Computational Science and Its Applications – ICCSA 2020, 12249, pp.90-106, 2020, ⟨10.1007/978-3-030-58799-4_7⟩
International audience; This paper studies the electric vehicle (EV) charging scheduling problem where EV arrive at random unknown instants during the day with different charging demands and departure times. We consider single-phase charging EV in a
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8e6aac67e4a05d18def213cbb54567d0
https://doi.org/10.1007/978-3-030-58799-4_7
Zobrazit plný text záznamu
9
Metaheuristics for Periodic Electric Vehicle Routing Problem
Autor: Wahiba Ramdane Cherif-Khettaf, Tayeb Oulad Kouider, Ammar Oulamara
Publikováno v: Communications in Computer and Information Science book series
Communications in Computer and Information Science book series, springer, 2019, ⟨10.1007/978-3-030-37584-3_8⟩
Operations Research and Enterprise Systems ISBN: 9783030375836
International audience; This paper proposes two metaheuristics based on large neighbourhood search for the PEVRP (Periodic Electric Vehicle Routing Problem). In the PEVRP a set of customers have to be visited, one times, on a given planning horizon.
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::24e743953d3e840f50c79c02b8e06109
https://hal.univ-lorraine.fr/hal-02982804
Zobrazit plný text záznamu
10
Metaheuristics for the Generalised Periodic Electric Vehicle Routing Problem
Autor: Wahiba Ramdane Cherif-Khettaf, Tayeb Oulad Kouider, Ammar Oulamara
Publikováno v: Computational Logistics. ICCL 2019
C. 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⟩
International Conference on Computational LogisticsICCL 2019: Computational Logistics
International Conference on Computational Logistics ICCL 2019: Computational Logistics, pp.219-232, 2019, ⟨10.1007/978-3-030-31140-7_14⟩
Lecture Notes in Computer Science ISBN: 9783030311391
ICCL
International audience; This paper presents the Generalized Periodic Electric Vehicle Routing Problem, named GPEVRP, which is an extension of the Periodic Electric Vehicle Routing Problem (PEVRP) proposed in previous research. The GPEVRP is defined b
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0381b2e7b282e6b3c7234d1b19312cc6
https://hal.univ-lorraine.fr/hal-02982806
Zobrazit plný text záznamu

Vyhledávací nástroje:

Upřesnit hledání

Omezení vyhledávání
Plný text Recenzováno Digitální knihovna AV ČR
Zdroje