88 citations · 91 across the 6 of their papers we have counts for
10 papers
Exponential-Size Neighborhoods for the Pickup-and-Delivery Traveling Salesman Problem
Toni Pacheco, Rafael Martinelli, Anand Subramanian +2
Neighborhood search is a cornerstone of state-of-the-art traveling salesman and vehicle routing metaheuristics. While neighborhood exploration procedures are well developed for pro…
A simple and effective hybrid genetic search for the job sequencing and tool switching problem
Jordana Mecler, Anand Subramanian, Thibaut Vidal
The job sequencing and tool switching problem (SSP) has been extensively studied in the field of operations research, due to its practical relevance and methodological interest. Gi…
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…
A heuristic algorithm for a single vehicle static bike sharing rebalancing problem
Fábio Cruz, Anand Subramanian, Bruno P. Bruck +1
The static bike rebalancing problem (SBRP) concerns the task of repositioning bikes among stations in self-service bike-sharing systems. This problem can be seen as a variant of th…
A unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems
Arthur Kramer, Anand Subramanian
This work proposes a unified heuristic algorithm for a large class of earliness-tardiness (E-T) scheduling problems. We consider single/parallel machine E-T problems that may or ma…
Efficient local search limitation strategy for single machine total weighted tardiness scheduling with sequence-dependent setup times
Anand Subramanian, Katyanne Farias
This paper concerns the single machine total weighted tardiness scheduling with sequence-dependent setup times, usually referred as . In this -h…
A speed and departure time optimization algorithm for the Pollution-Routing Problem
Raphael Kramer, Nelson Maculan, Anand Subramanian +1
We propose a new speed and departure time optimization algorithm for the Pollution-Routing Problem (PRP), which runs in quadratic time and returns a certified optimal schedule. Thi…
Hybrid Metaheuristics for the Clustered Vehicle Routing Problem
Thibaut Vidal, Maria Battarra, Anand Subramanian +1
The Clustered Vehicle Routing Problem (CluVRP) is a variant of the Capacitated Vehicle Routing Problem in which customers are grouped into clusters. Each cluster has to be visited…
A matheuristic approach for the Pollution-Routing Problem
Raphael Kramer, Anand Subramanian, Thibaut Vidal +1
This paper deals with the Pollution-Routing Problem (PRP), a Vehicle Routing Problem (VRP) with environmental considerations, recently introduced in the literature by [Bektas and L…
On Solving Manufacturing Cell Formation via Bicluster Editing
Rian G. S. Pinheiro, Ivan C. Martins, Fábio Protti +3
This work investigates the Bicluster Graph Editing Problem (BGEP) and how it can be applied to solve the Manufacturing Cell Formation Problem (MCFP). We develop an exact method for…