4 papers
Solving the minimum labeling global cut problem by mathematical programming
Thiago Gouveia da Silva, Gilberto F. de Sousa Filho, Luiz Satoru Ochi +3
Let G = (V, E, L) be an edge-labeled graph such that V is the set of vertices, E is the set of edges, L is the set of labels (colors) and each edge e \in E has a label l(e) associa…
A Hybrid Heuristic for a Broad Class of Vehicle Routing Problems with Heterogeneous Fleet
Puca Huachi Vaz Penna, Anand Subramanian, Luiz Satoru Ochi +2
We consider a family of Rich Vehicle Routing Problems (RVRP) which have the particularity to combine a heterogeneous fleet with other attributes, such as backhauls, multiple depots…
Large Neighborhood-Based Metaheuristic and Branch-and-Price for the Pickup and Delivery Problem with Split Loads
Matheus Nohra Haddad, Rafael Martinelli, Thibaut Vidal +4
We consider the multi-vehicle one-to-one pickup and delivery problem with split loads, a NP-hard problem linked with a variety of applications for bulk product transportation, bike…
A study on exponential-size neighborhoods for the bin packing problem with conflicts
Renatha Capua, Yuri Frota, Luiz Satoru Ochi +1
We propose an iterated local search based on several classes of local and large neighborhoods for the bin packing problem with conflicts. This problem, which combines the character…