Project CEMAPRE internal
| Title | Variants of the FTSP |
| Participants | Raquel Bernardino (Principal Investigator) |
| Summary | Warehouse activities, especially order picking, constitute the most expensive operations in warehouse management. Routing decisions in this context have gained significant attention; however, only a fraction of the literature (28%) involves mathematical programming formulations or metaheuristics. Advanced methods like branch-and-cut remain underexplored. The rise of e-commerce has further complicated warehouse operations, necessitating innovative solutions. For instance, mixed-shelve storage, prevalent in business-to-consumer (B2C) warehouses, inspired the Family Traveling Salesman Problem (FTSP). This problem aims to optimize routes for collecting specified products efficiently, but practical variants, such as those involving precedence constraints, remain under-researched. |