Idle Time Optimization for Target Assignment and Path Finding in Sortation Centers
نویسندگان
چکیده
منابع مشابه
Optimal Target Assignment and Path Finding for Teams of Agents
We study the TAPF (combined target-assignment and pathfinding) problem for teams of agents in known terrain, which generalizes both the anonymous and non-anonymous multiagent path-finding problems. Each of the teams is given the same number of targets as there are agents in the team. Each agent has to move to exactly one target given to its team such that all targets are visited. The TAPF probl...
متن کاملGeneralized Target Assignment and Path Finding Using Answer Set Programming
In Multi-Agent Path Finding (MAPF), a team of agents needs to find collision-free paths from their starting locations to their respective targets. Combined Target Assignment and Path Finding (TAPF) extends MAPF by including the problem of assigning targets to agents as a precursor to the MAPF problem. A limitation of both models is their assumption that the number of agents and targets are equa...
متن کاملLayout Planning of Sortation Conveyors in Parcel Distribution Centers
Fully automated sortation processes play a crucial role in modern distribution networks of the parcel service industry. In this context, the paper on hand systematically investigates di erent design alternatives of closed-loop tilt tray sortation conveyors. Especially, the number of loading stations for feeding parcels into a conveyor system and the relation to the subordinate decision problem ...
متن کاملReducing the Idle Time of Parallel Shortest Path Algorithms
Shortest path computation is required by a large number of applications such as VLSI, transportation and communication networks. These applications, which are often very complex and have sparse networks, generally use parallel labeling shortest path algorithms. Such algorithms, when implemented on a distributed memory machine, require termination detection methods; these methods consist of some...
متن کاملFinding the Shortest Hamiltonian Path for Iranian Cities Using Hybrid Simulated Annealing and Ant Colony Optimization Algorithms
The traveling salesman problem is a well-known and important combinatorial optimization problem. The goal of this problem is to find the shortest Hamiltonian path that visits each city in a given list exactly once and then returns to the starting city. In this paper, for the first time, the shortest Hamiltonian path is achieved for 1071 Iranian cities. For solving this large-scale problem, tw...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the AAAI Conference on Artificial Intelligence
سال: 2020
ISSN: 2374-3468,2159-5399
DOI: 10.1609/aaai.v34i06.6547