Results 91 to 100 of about 1,727,456 (275)
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
Farmer Ants Optimization Algorithm: A Novel Metaheuristic for Solving Discrete Optimization Problems
Currently, certain complex issues are classified as NP-hard problems, for which there is no exact solution, or they cannot be solved in a reasonable amount of time. As a result, metaheuristic algorithms have been developed as an alternative.
Ali Asghari +4 more
doaj +1 more source
Evacuation planning is an important activity in disaster management to reduce the effects of disasters on urban communities. It is regarded as a multi-objective optimization problem that involves conflicting spatial objectives and constraints in a ...
Pilesjö, Petter +15 more
core +1 more source
ABSTRACT Distributed manufacturing enabled by additive manufacturing (AM) allows supply chains to rapidly adapt to changing market conditions through flexible facility relocation and capacity adjustment. However, existing studies largely overlook the logistical aspects of AM‐based supply chains and typically treat facility location and logistics ...
Behrang Bootaki, Guoqing Zhang
wiley +1 more source
This paper explores the integration of metaheuristic artificial intelligence (AI) optimization algorithms into the process of curriculum evaluation, proposing a novel approach that could enhance educational outcomes.
Volkan Duran, Gülay Ekici
doaj +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
The Active‐Passive Vehicle Routing Problem With Item Transshipments
ABSTRACT This paper addresses a vehicle routing problem with synchronization constraints, in which pickup‐and‐delivery requests for single items are carried out using two types of vehicles: active and passive. The vehicles operate jointly, as passive vehicles, which are capacitated trailers, require active vehicles, which are autonomous trucks without ...
Biljana Roljić +2 more
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
The current state of Association Rule Mining (ARM) technology is heading towards a critical yet profitable direction. The ARM process uncovers numerous association rules, determining correlations between itemsets, forming building blocks that have led to
Shahad S. Aljehani, Youseef A. Alotaibi
doaj +1 more source
A review of the Tabu Search Literature on Traveling Salesman Problems [PDF]
The Traveling Salesman Problem (TSP) is one of the most widely studied problems inrncombinatorial optimization. It has long been known to be NP-hard and hence research onrndeveloping algorithms for the TSP has focused on approximate methods in addition ...
Sumanta Basu, Ghosh, Diptesh
core

