Results 151 to 160 of about 3,788,182 (279)
Leveraging Public Transit for Robotic Deliveries: A Column Generation Approach
ABSTRACT Autonomous mobile robots (AMRs) are small, electric, wheeled vehicles that operate at pedestrian speeds. In the last‐mile delivery service considered in this study, a fleet of AMRs is deployed across multiple recharging depots within a service area, from which they depart to perform point‐to‐point deliveries. We consider an operational setting
Yishay Shapira, Mor Kaspi
wiley +1 more source
The tree labeling polytope: A unified approach to ancestral reconstruction problems. [PDF]
Schmidt H, Raphael BJ.
europepmc +1 more source
ABSTRACT This paper addresses two‐dimensional orthogonal packing within a confined space, integrating bin packing principles with facility layout concepts to address scenarios in which items must not only fit but also be arranged according to spatial priorities.
William K. Kirschenman +4 more
wiley +1 more source
We utilise a metaheuristic optimisation method, inspired by nature, called the Lévy‐flight firefly algorithm (LFA), to tackle the power regulation and user grouping in the NOMA systems. Abstract The non‐orthogonal multiple access strategies have shown promise to boost fifth generation and sixth generation wireless networks' spectral efficiency and ...
Zaid Albataineh +4 more
wiley +1 more source
Optimization of multi-objective flexible scheduling for container rail mounted gantry cranes in railway logistics yards. [PDF]
Wang H, Xu C, Hou Y, Zhang J, Liu Z.
europepmc +1 more source
Interdiction Models and Heuristics for Graph Propagation
ABSTRACT Given a graph G=(V,E)$$ G=\left(V,E\right) $$ and a set S⊂V$$ S\subset V $$ of activated/infected nodes, we consider the problem of determining the set of c$$ c $$ nodes that minimizes the network propagation on the subgraph that results from the removal of those c$$ c $$ nodes. To measure network propagation, we assume that a node i$$ i $$ is
Agostinho Agra, José Maria Samuco
wiley +1 more source
Exact Methods for the Cumulative Capacitated Vehicle Routing Problem With Time Windows
ABSTRACT This article studies the cumulative capacitated vehicle routing problem with time windows (CCVRPTW). The CCVRPTW consists of deciding the routing schedules for a set of homogeneous capacitated vehicles such that the latency, that is, the sum of the service start times at the customers, is minimized and the time windows as well as the vehicle ...
Alan Osorio‐Mora, Timo Gschwind
wiley +1 more source
Research on optimization of train routing problem for railway hubs considering passenger demand. [PDF]
Wang Y.
europepmc +1 more source
A Two‐Stage Optimization Approach for Selecting Electric‐Flight Airports
ABSTRACT The decarbonization of short‐haul air transport has gained increasing attention, with electric aircraft emerging as a promising alternative to conventional short‐haul aviation. However, given the substantial investment anticipated for the necessary infrastructure, a strategic and globally coordinated selection of airports is imperative.
Imke Joormann +2 more
wiley +1 more source
A multi-product, multi-period vaccine supply chain network planning with injection centers and storage conditions. [PDF]
Heydarpour R, Mokhtari H, Dehnavi S.
europepmc +1 more source

