Results 161 to 170 of about 1,501,275 (273)

An effective and efficient matheuristic for the electric vehicle routing problem with capacitated recharging stations

open access: yesInternational 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

Integrated location–inventory planning for slow‐moving demands with waiting time limitations

open access: yesInternational 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 unified formulation for home healthcare routing and scheduling problems

open access: yesInternational 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

Tight lower bounds for block-structured integer programs. [PDF]

open access: yesMath Program
Hunkenschröder C   +4 more
europepmc   +1 more source

Exact and metaheuristic approaches to minimizing makespan in parallel machine scheduling with conflicting jobs

open access: yesInternational 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

Optimization of structural assembly scheduling in the aeronautics industry

open access: yesInternational Transactions in Operational Research, EarlyView.
Abstract In the aeronautical industry, structural assembly refers to the stage in which parts, subassemblies, and main aircraft structures are fitted together, forming aerostructures. Aircraft structural assembly requires many complex activities to be performed over an intricate precedence network and is subject to interactions among the various ...
Bruno Jensen Virginio da Silva   +3 more
wiley   +1 more source

A path‐based two‐commodity flow model and a branch‐price‐and‐cut algorithm for the inventory routing problem with time windows

open access: yesInternational Transactions in Operational Research, EarlyView.
Abstract We study an inventory routing problem with time windows (IRPTW). A single supplier serves a set of customers to fulfill their demand throughout a planning horizon. Each customer can be visited only within designated time windows, assuming each customer provides a single delivery time window valid for all periods.
Sara Charaf   +5 more
wiley   +1 more source

Home - About - Disclaimer - Privacy