Project CEMAPRE internal
| Title | Two index formulations - part II |
| Participants | Raquel Bernardino (Principal Investigator) |
| Summary | Incompatibility constraints in routing problems represent an emerging area of research in Operations Research. These constraints arise from practical needs, such as ensuring that food and toxic products are not transported together or meeting client demands for exclusive services. Traditionally, three-index variables have been used to model these constraints, but recent research ([1]) introduced a two-index formulation, showing potential for improved performance. Further exploration of modeling techniques for incompatibility constraints can enrich the literature on routing problems. 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. [1] Bernardino, R., & Paias, A. (2022). The family traveling salesman problem with incompatibility constraints. Networks, 79(1), 47-82. |