Results 71 to 80 of about 4,843,664 (223)
Generative AI, Linguistic Hierarchies and Unequal Access in Under‐Resourced Educational Contexts
International Journal of Applied Linguistics, EarlyView.ABSTRACT Despite growing enthusiasm around generative AI (GenAI) as a transformative force in education, access to these technologies remains profoundly unequal. This qualitative study examines how educators and students in under‐resourced Chinese educational contexts experience unequal access to GenAI and interpret its consequences for language ...
Jinming Du, Qinghua Chen, Wei Wei
wiley +1 more source
A fast metaheuristic approach for the planar multiple obnoxious facility location problem
International Transactions in Operational Research, EarlyView.Abstract The multiple obnoxious facility location problem is one of the most studied problems in the literature of the obnoxious facility location problems family. In this work, we propose an alternative algorithmic approach for this problem, based on an efficient metaheuristic procedure over a discretization of the plane based on Voronoi diagrams ...
Sergio Salazar +2 more
wiley +1 more source
A fuzzy interval optimization approach for p-hub median problem under uncertain information.
PLoS ONEStochastic and robust optimization approaches often result in sub-optimal solutions for the uncertain p-hub median problem when continuous design parameters are discretized to form different environmental scenarios.
Yu Wang, Tao Zhu, Kaibo Yuan, Xin Li
doaj +1 more source
International Transactions in Operational Research, EarlyView.Abstract In this paper, we address the problem of routing a fleet of electric vehicles (EVs) to serve a set of customers, geographically distributed, within their time windows. We assume that EVs may also be recharged en route, and the amount of energy recharged at a recharging station (RS) is a decision variable itself, that is, partial recharges are ...
Maurizio Bruglieri +3 more
wiley +1 more source
A matheuristic for the traveling salesman problem with positional consistency constraints
International Transactions in Operational Research, EarlyView.Abstract We propose a matheuristic for the traveling salesman problem with positional consistency constraints, where we seek to generate a set of routes with minimum total cost, in which the nodes visited in more than one route (consistent nodes) must occupy the same relative position in all routes.
Luís Gouveia, Ana Paias, Mafalda Ponte
wiley +1 more source
International Transactions in Operational Research, EarlyView.Abstract This research evaluates the effectiveness of a hybrid crowdshipping system that integrates occasional drivers with traditional delivery services (OD+TD) to improve the efficiency of freight distribution. By implementing the team orienteering problem with occasional drivers model, we develop a mathematical model and an agile optimization ...
Alisson Garcia‐Herrera +4 more
wiley +1 more source
Human Resource Scheduling Model and Algorithm with Time Windows and Multi-Skill Constraints
Mathematics, 2019 In situations where an organization has limited human resources and a lack of multi-skilled employees, organizations pay more and more attention to cost control and personnel arrangements. Based on the consideration of the service personnel scheduling as
Zhiping Zuo +3 more
doaj +1 more source
International Transactions in Operational Research, EarlyView.Abstract We address the scheduling conflicting jobs on parallel identical machines problem with makespan minimization, a classical and computationally challenging variant of parallel machine scheduling. We develop and evaluate three distinct solution methodologies: a novel constraint programming (CP) formulation, and two metaheuristics: a multi ...
Roberto Maria Rosati +3 more
wiley +1 more source
Distribution Network Expansion Using Hybrid SA/TS Algorithm
Iranian Journal of Electrical and Electronic Engineering, 2009 Optimal expansion of medium-voltage power networks is a common issue in electrical distribution planning. Minimizing total cost of the objective function with technical constraints and reliability limits, make it a combinatorial problem which should be ...
Mahdi Sedghi, Masoud Aliakbar-Golkar
doaj
Park‐and‐multi‐loop with autonomous delivery robots in last‐mile logistics
International Transactions in Operational Research, EarlyView.Abstract This paper deals with the park‐and‐multi‐loop routing problem, in the context of last‐mile logistics, in which a fleet of traditional vehicles equipped with several autonomous delivery robots leaves from a depot to service a set of customer requests.
Tommaso Adamo +4 more
wiley +1 more source