Results 101 to 110 of about 36,801 (217)
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
Metaheuristics for the Order Batching Problem in Manual Order Picking Systems [PDF]
In manual order picking systems, order pickers walk or drive through a distribution warehouse in order to collect items which are requested by (internal or external) customers.
Christine Strauss +4 more
core
New efficient constructive heuristics for the hybrid flowshop to minimise makespan: A computational evaluation of heuristics [PDF]
This paper addresses the hybrid flow shop scheduling problem to minimise makespan, a well-known scheduling problem for which many constructive heuristics have been proposed in the literature. Nevertheless, the state of the art is not clear due to partial
Fernández-Viagas Escudero, Víctor +2 more
core
An iterated greedy‐based metaheuristic with local search for the rank pricing problem
Abstract The rank pricing problem involves determining optimal prices for a set of products while accounting for customers' budgets and preferences. This study develops an iterated greedy‐based metaheuristic to efficiently solve this problem. The core idea is to generate a sequence of solutions by iteratively applying destruction and reconstruction ...
Herminia I. Calvete +3 more
wiley +1 more source
Multicompare Tests of the Performance of Different Metaheuristics in EEG Dipole Source Localization
We study the use of nonparametric multicompare statistical tests on the performance of simulated annealing (SA), genetic algorithm (GA), particle swarm optimization (PSO), and differential evolution (DE), when used for electroencephalographic (EEG ...
Diana Irazú Escalona-Vargas +2 more
doaj +1 more source
Integrated location–inventory planning for slow‐moving demands with waiting time limitations
Abstract This paper studies a stochastic facility location problem integrated with inventory and transportation decisions (SFLPIT) for supply chains with slow‐moving stock‐keeping units (SKUs). Local stores often avoid maintaining such SKUs, resulting in customer demand being fulfilled directly by a central distribution center (DC), where the ...
Jie Chu +4 more
wiley +1 more source
Portfolio optimization (selection) problem is an important and hard optimization problem that, with the addition of necessary realistic constraints, becomes computationally intractable.
Nebojsa Bacanin, Milan Tuba
doaj +1 more source
A matheuristic for the traveling salesman problem with positional consistency constraints
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
A unified formulation for home healthcare routing and scheduling problems
Abstract Home Healthcare is an essential component of healthcare systems, where caregivers visit patients' homes to deliver services. While presenting advantages with respect to institutional care, such as being cost‐effective and alleviating family burdens, it presents challenges in scheduling and routing caregivers efficiently.
Sara Ceschia +7 more
wiley +1 more source
The subject of the 5th challenge proposed by the French Society of Operations Research and Decision Analysis (ROADEF) consists in scheduling technicians and interventions for telecommunications (http://www.g-scop.inpg.fr/ChallengeROADEF2007/ or http ...
Boussier, Sylvain +2 more
core +1 more source

