Results 101 to 110 of about 52,700 (290)
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
An iterated greedy‐based metaheuristic with local search for the rank pricing problem
International Transactions in Operational Research, EarlyView.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
Integrated location–inventory planning for slow‐moving demands with waiting time limitations
International Transactions in Operational Research, EarlyView.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
A study on exponential-size neighborhoods for the bin packing problem with conflicts
, 2017 We propose an iterated local search based on several classes of local and large neighborhoods for the bin packing problem with conflicts. This problem, which combines the characteristics of both bin packing and vertex coloring, arises in various ...
Capua, Renatha +3 more
core +1 more source
Multi Depot Traveling Repairmen Problem with Time Windows: A Mathematical Model and a Metaheuristic [PDF]
, 2021 Gözde Önder Uzun +3 more
openalex +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
A recent review of solution approaches for green vehicle routing problem and its variants
Operations Research PerspectivesThe green vehicle routing problem (GVRP) has been a prominent topic in the literature on logistics and transportation, leading to extensive research and previous review studies covering various aspects.
Annisa Kesy Garside +2 more
doaj +1 more source
Free Lunch or No Free Lunch: That is not Just a Question?
, 2012 The increasing popularity of metaheuristic algorithms has attracted a great deal of attention in algorithm analysis and performance evaluations. No-free-lunch theorems are of both theoretical and practical importance, while many important studies on ...
Yang, Xin-She
core +1 more source
A unified formulation for home healthcare routing and scheduling problems
International Transactions in Operational Research, EarlyView.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
Evolutionary Algorithms and Quantum Computing: Recent Advances, Opportunities, and Challenges
IEEE AccessQuantum computers have made significant progress in the last two decades showing great potential in tackling some of the most challenging problems in computing.
Junaid Ur Rehman +8 more
doaj +1 more source