Abstract
Abstract To improve working conditions at sorting centers and to reduce the burden, La Poste wants to automate a part of the container-handling process. This mainly concerns containers that belong to the destinations with highest traffic since they demand an important effort and time amount from the operators especially in critical times like truck-departure times, when the operators must quickly load the containers in carts to be transported in trucks so that no delay will occur to the delivery date of the mail items. In this paper, we give a mixed integer linear program to assign the tasks to the robots, in order to maximize the workload of the robots and minimize the effort made by the operators. In addition, a greedy heuristic is proposed. Experiments performed on realistic data confirm the performance of the greedy algorithm. In addition, a sensitivity analysis of the heuristic is given to test its robustness on noisy data.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
