[HTML][HTML] A survey of scheduling with parallel batch (p-batch) processing

JW Fowler, L Mönch - European journal of operational research, 2022 - Elsevier
Multiple jobs are processed simultaneously on a given batch processing machine in parallel
batching. The resulting batch is called a p-batch. Batching can lead to reduced production …

A critical review of state-of-the-art optimal pmu placement techniques

MM Ahmed, M Amjad, MA Qureshi, K Imran, ZM Haider… - Energies, 2022 - mdpi.com
Phasor measurement unit (PMU) technology is a need of the power system due to its better
resolution than conventional estimation devices used for wide-area monitoring. PMUs can …

Deadline-aware and energy-efficient IoT task scheduling in fog computing systems: A semi-greedy approach

S Azizi, M Shojafar, J Abawajy, R Buyya - Journal of network and computer …, 2022 - Elsevier
With the rapid advancement of Internet of Things (IoT) devices, a variety of IoT applications
that require a real-time response and low latency have emerged. Fog computing has …

Greedy randomized adaptive search procedures: advances and extensions

MGC Resende, CC Ribeiro - Handbook of metaheuristics, 2019 - Springer
A greedy randomized adaptive search procedure (GRASP) is a multi-start metaheuristic for
combinatorial optimization problems, in which each iteration consists basically of two …

A GRASP to solve the multi-constraints multi-modal team orienteering problem with time windows for groups with heterogeneous preferences

J Ruiz-Meza, J Brito, JR Montoya-Torres - Computers & Industrial …, 2021 - Elsevier
Improving the travel experience is a goal of tourist destinations. Tourists demand information
and services that help plan and organise the trips adapted to their preferences and …

Enhancing and extending the classical GRASP framework with biased randomisation and simulation

D Ferone, A Gruler, P Festa, AA Juan - Journal of the Operational …, 2019 - Taylor & Francis
Abstract Greedy Randomised Adaptive Search Procedure (GRASP) is one of the best-
known metaheuristics to solve complex combinatorial optimisation problems (COPs). This …

A review of heuristics and hybrid methods for green vehicle routing problems considering emissions

A Fernández Gil, E Lalla-Ruiz… - Journal of Advanced …, 2022 - Wiley Online Library
Road freight transport is one of the sectors with the highest greenhouse gas emissions and
fuel consumption in the logistics industry. In recent years, due to the increase in carbon …

Learning permutations with sinkhorn policy gradient

P Emami, S Ranka - arXiv preprint arXiv:1805.07010, 2018 - arxiv.org
Many problems at the intersection of combinatorics and computer science require solving for
a permutation that optimally matches, ranks, or sorts some data. These problems usually …

The two‐echelon routing problem with truck and drones

L Vu, DM Vu, MH Hà, VP Nguyen - International Transactions in …, 2022 - Wiley Online Library
In this paper, we study novel variants of the well‐known two‐echelon vehicle routing
problem in which a truck works on the first echelon to transport parcels and a fleet of drones …

A fuzzy GRASP for the tourist trip design with clustered POIs

A Expósito, S Mancini, J Brito, JA Moreno - Expert Systems with …, 2019 - Elsevier
In tourist sector, expert and intelligent systems should perform at least two main tasks or
services: point of interest recommendation and route generation. In this regard, the …