Results 261 to 270 of about 12,176,108 (293)
Some of the next articles are maybe not open access.
2019 IEEE Intelligent Transportation Systems Conference (ITSC), 2019
In the recent years there has been an increasing interest in optimizing the vehicle matching problem in Ride Hailing (RH) services. The problem is closely related to the classical Dial a Ride Problem (DARP), for which various efficient metaheuristics exist in literature.
Arslan Ali Syed +3 more
openaire +2 more sources
In the recent years there has been an increasing interest in optimizing the vehicle matching problem in Ride Hailing (RH) services. The problem is closely related to the classical Dial a Ride Problem (DARP), for which various efficient metaheuristics exist in literature.
Arslan Ali Syed +3 more
openaire +2 more sources
Swarm and Evolutionary Computation, 2019
Abstract Green machine scheduling consists in the allocation of jobs in order to maximize production, in view of the sustainable use of energy. This work addresses the unrelated parallel machine scheduling problem with setup times, with the minimization of the makespan and the total energy consumption.
Luciano Perdigão Cota +6 more
openaire +2 more sources
Abstract Green machine scheduling consists in the allocation of jobs in order to maximize production, in view of the sustainable use of energy. This work addresses the unrelated parallel machine scheduling problem with setup times, with the minimization of the makespan and the total energy consumption.
Luciano Perdigão Cota +6 more
openaire +2 more sources
Memetic Computing
The file attached to this record is the author's final peer reviewed version. The Publisher's final version can be found by following the DOI link.
Deng, Jiawen +2 more
openaire +1 more source
The file attached to this record is the author's final peer reviewed version. The Publisher's final version can be found by following the DOI link.
Deng, Jiawen +2 more
openaire +1 more source
2017 8th IEEE International Conference on Software Engineering and Service Science (ICSESS), 2017
The heterogeneous fixed fleet vehicle routing problem (HFFVRP) is a variant problem of the ordinary capacitated vehicle routing problem (CVRP) when considering the fixed number of different vehicles, with distinct capacities and fixed or variable cost.
Yan Wu +3 more
openaire +1 more source
The heterogeneous fixed fleet vehicle routing problem (HFFVRP) is a variant problem of the ordinary capacitated vehicle routing problem (CVRP) when considering the fixed number of different vehicles, with distinct capacities and fixed or variable cost.
Yan Wu +3 more
openaire +1 more source
An Adaptive Large Neighborhood Search Algorithm for Wind Farm Inspection Using a Truck with a Drone
2022 Winter Simulation Conference (WSC), 2022Wenyu Tao, Xinjia Jiang, Dongqiang Zhao
openaire +2 more sources
Artificial bee colony algorithm based on adaptive neighborhood search and Gaussian perturbation
Applied Soft Computing Journal, 2021Axe Fy, Zhi-Kai Huang
exaly