Results 241 to 250 of about 6,794 (285)
Some of the next articles are maybe not open access.
Expert Systems With Applications, 2022
Abstract This paper aims to solve the large-scale heterogeneous container loading problem (HCLP), which is an extensive form of the multiple container loading problem, in a limited time. The target is to choose a set of containers of different sizes to accommodate all products and minimize the wasted space rate.
Mingzhou Chen, Jiazhen Huo
exaly +2 more sources
Abstract This paper aims to solve the large-scale heterogeneous container loading problem (HCLP), which is an extensive form of the multiple container loading problem, in a limited time. The target is to choose a set of containers of different sizes to accommodate all products and minimize the wasted space rate.
Mingzhou Chen, Jiazhen Huo
exaly +2 more sources
Adaptive large neighborhood search algorithm for the rural postman problem with time windows
Networks, 2017 The rural postman problem with time windows is the problem of serving some required edges with one vehicle; the vehicle must visit these edges during established time windows. This article presents a competitive adaptive large neighborhood search algorithm to solve the problem. Computational experiments are performed on a large set of instances with up
Marcela Monroy-Licht +2 more
openaire +3 more sources
An improved adaptive large neighborhood search algorithm for multiple agile satellites scheduling
Computers and Operations Research, 2018zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lei He, Xiaolu Liu, Gilbert Laporte
exaly +2 more sources
Sustainable group tourist trip planning: An adaptive large neighborhood search algorithm
Expert Systems with ApplicationsThe tourism industry is a key driver of economic growth and contributes to the achievement of sustainability goals. This paper presents a multi-objective group tourist planning problem that considers economic, environmental, and social dimensions simultaneously.
Mansoureh Hasannia Kolaee +2 more
openaire +3 more sources
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
European Journal of Operational Research, 2021 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Heinrich Kuhn +2 more
openaire +4 more sources
Memetic ComputingThe 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 +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 P Cota +2 more
exaly +3 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 P Cota +2 more
exaly +3 more sources
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 +2 more sources