Anand Subramanian

Orcid: 0000-0002-9244-9969

Affiliations:
  • Universidade Federal da Paraíba, Brazil


According to our database1, Anand Subramanian authored at least 65 papers between 2008 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
A unified exact approach for a broad class of vehicle routing problems with simultaneous pickup and delivery.
Comput. Oper. Res., February, 2024

2023
Hybrid genetic search for the traveling salesman problem with hybrid electric vehicle and time windows.
Comput. Oper. Res., July, 2023

Exponential-Size Neighborhoods for the Pickup-and-Delivery Traveling Salesman Problem.
Transp. Sci., March, 2023

Improving Buffer Storage Performance in Ceramic Tile Industry Via Simulation.
Proceedings of the Winter Simulation Conference, 2023

2022
Minimizing energy consumption in a real-life classroom assignment problem.
OR Spectr., 2022

Scheduling the Brazilian OR conference.
J. Oper. Res. Soc., 2022

Exact Approaches for Single Machine Total Weighted Tardiness Batch Scheduling.
INFORMS J. Comput., 2022

Intersections management for autonomous vehicles: a heuristic approach.
J. Heuristics, 2022

Conference scheduling: A clustering-based approach.
Eur. J. Oper. Res., 2022

2021
Personnel scheduling during Covid-19 pandemic.
Optim. Lett., 2021

Exact and metaheuristic approaches for identical parallel machine scheduling with a common server and sequence-dependent setup times.
J. Oper. Res. Soc., 2021

Integer programming formulations and efficient local search for relaxed correlation clustering.
J. Glob. Optim., 2021

Iterated local search for single machine total weighted tardiness batch scheduling.
J. Heuristics, 2021

A satisfiability and workload-based exact method for the resource constrained project scheduling problem with generalized precedence constraints.
Eur. J. Oper. Res., 2021

Share-a-ride problems: Models and Solution Algorithms.
CoRR, 2021

A simple and effective hybrid genetic search for the job sequencing and tool switching problem.
Comput. Oper. Res., 2021

A hybrid algorithm for the multi-depot heterogeneous dial-a-ride problem.
Comput. Oper. Res., 2021

An Integrated Task and Personnel Scheduling Problem to Optimize Distributed Services in Hospitals.
Proceedings of the 23rd International Conference on Enterprise Information Systems, 2021

2020
On the exact solution of a large class of parallel machine scheduling problems.
J. Sched., 2020

Solution strategies for the vehicle routing problem with backhauls.
Optim. Lett., 2020

On the exact solution of vehicle routing problems with backhauls.
Eur. J. Oper. Res., 2020

Optimizing single-finger keyboard layouts on smartphones.
Comput. Oper. Res., 2020

On solving the capacitated routing and spectrum allocation problem for flexgrid optical networks.
Comput. Networks, 2020

2019
The Static Bike Sharing Rebalancing Problem with Forbidden Temporary Operations.
Transp. Sci., 2019

A unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems.
J. Sched., 2019

A multi-objective evolutionary algorithm for a class of mean-variance portfolio selection problems.
Expert Syst. Appl., 2019

A hybrid heuristic for a broad class of vehicle routing problems with heterogeneous fleet.
Ann. Oper. Res., 2019

2018
A hybrid iterated local search heuristic for the maximum weight independent set problem.
Optim. Lett., 2018

A two-phase Pareto local search heuristic for the bi-objective pollution-routing problem.
Networks, 2018

Mathematical models and decomposition algorithms for makespan minimization in plastic rolls production.
J. Oper. Res. Soc., 2018

Generating guitar solos by integer programming.
J. Oper. Res. Soc., 2018

Exact solution of the single-machine scheduling problem with periodic maintenances and sequence-dependent setup times.
Eur. J. Oper. Res., 2018

The static bike relocation problem with multiple vehicles and visits.
Eur. J. Oper. Res., 2018

Exact and heuristic algorithms for order acceptance and scheduling with sequence-dependent setup times.
Comput. Oper. Res., 2018

Continuous greedy randomized adaptive search procedure for data clustering.
Appl. Soft Comput., 2018

2017
New benchmark instances for the Capacitated Vehicle Routing Problem.
Eur. J. Oper. Res., 2017

Branch-and-cut approaches for p-Cluster Editing.
Discret. Appl. Math., 2017

Corrigendum to "Hybrid metaheuristics for the clustered vehicle routing problem [Comput. Oper. Res., 58 (2015): 87-99]".
Comput. Oper. Res., 2017

Efficient local search limitation strategy for single machine total weighted tardiness scheduling with sequence-dependent setup times.
Comput. Oper. Res., 2017

A heuristic algorithm for a single vehicle static bike sharing rebalancing problem.
Comput. Oper. Res., 2017

Branch-and-price for <i>p</i>-cluster editing.
Comput. Optim. Appl., 2017

2016
Efficient algorithms for cluster editing.
J. Comb. Optim., 2016

A Branch-and-Bound Algorithm for the Close-Enough Traveling Salesman Problem.
INFORMS J. Comput., 2016

On solving manufacturing cell formation via Bicluster Editing.
Eur. J. Oper. Res., 2016

2015
A matheuristic approach for the Pollution-Routing Problem.
Eur. J. Oper. Res., 2015

A speed and departure time optimization algorithm for the pollution-routing problem.
Eur. J. Oper. Res., 2015

Efficient local search limitation strategy for single machine total weighted tardiness scheduling with sequence-dependent setup times.
CoRR, 2015

Hybrid metaheuristics for the Clustered Vehicle Routing Problem.
Comput. Oper. Res., 2015

An iterated local search heuristic for the split delivery vehicle routing problem.
Comput. Oper. Res., 2015

Analysis of Path Planning Algorithms Based on Travelling Salesman Problem Embedded in UAVs.
Proceedings of the 2015 Brazilian Symposium on Computing Systems Engineering, 2015

2014
Exact algorithms for the traveling salesman problem with draft limits.
Eur. J. Oper. Res., 2014

2013
Branch-cut-and-price for the vehicle routing problem with simultaneous pickup and delivery.
Optim. Lett., 2013

An iterated local search algorithm for the Travelling Salesman Problem with Pickups and Deliveries.
J. Oper. Res. Soc., 2013

An Iterated Local Search heuristic for the Heterogeneous Fleet Vehicle Routing Problem.
J. Heuristics, 2013

An iterated local search heuristic for multi-capacity bin packing and machine reassignment problems.
Expert Syst. Appl., 2013

A hybrid algorithm for a class of vehicle routing problems.
Comput. Oper. Res., 2013

Improved bounds for large scale capacitated arc routing problem.
Comput. Oper. Res., 2013

2012
Exact and heuristic approaches for the set cover with pairs problem.
Optim. Lett., 2012

A hybrid algorithm for the Heterogeneous Fleet Vehicle Routing Problem.
Eur. J. Oper. Res., 2012

A simple and effective metaheuristic for the Minimum Latency Problem.
Eur. J. Oper. Res., 2012

A column generation approach for power-aware optimization of virtualized heterogeneous server clusters.
Comput. Ind. Eng., 2012

2011
Branch-and-cut with lazy separation for the vehicle routing problem with simultaneous pickup and delivery.
Oper. Res. Lett., 2011

2010
A parallel heuristic for the Vehicle Routing Problem with Simultaneous Pickup and Delivery.
Comput. Oper. Res., 2010

New Lower Bounds for the Vehicle Routing Problem with Simultaneous Pickup and Delivery.
Proceedings of the Experimental Algorithms, 9th International Symposium, 2010

2008
An ILS Based Heuristic for the Vehicle Routing Problem with Simultaneous Pickup and Delivery and Time Limit.
Proceedings of the Evolutionary Computation in Combinatorial Optimization, 2008


  Loading...