Leandro C. Coelho

Orcid: 0000-0002-9797-1019

According to our database1, Leandro C. Coelho authored at least 61 papers between 2012 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Mechanisms for feasibility and improvement for inventory-routing problems.
J. Oper. Res. Soc., January, 2024

2023
The impact of time aggregation and travel time models on time-dependent routing solutions.
INFOR Inf. Syst. Oper. Res., November, 2023

Measuring fuel consumption in vehicle routing: new estimation models using supervised learning.
Int. J. Prod. Res., 2023

An improved model and exact algorithm using local branching for the inventory-routing problem with time windows.
Int. J. Prod. Res., 2023

Order assignment and scheduling under processing and distribution time uncertainty.
Eur. J. Oper. Res., 2023

Modeling and solving the waste valorization production and distribution scheduling problem.
Eur. J. Oper. Res., 2023

2022
Novel Formulations and Logic-Based Benders Decomposition for the Integrated Parallel Machine Scheduling and Location Problem.
INFORMS J. Comput., 2022

Guest editorial: Big data-driven analytics for smart cities: technology-based insight.
Ind. Manag. Data Syst., 2022

Novel efficient formulation and matheuristic for large-sized unrelated parallel machine scheduling with release dates.
Int. J. Prod. Res., 2022

A cutting plane method and a parallel algorithm for packing rectangles in a circular container.
Eur. J. Oper. Res., 2022

Exact and matheuristic methods for the parallel machine scheduling and location problem with delivery time and due date.
Comput. Oper. Res., 2022

The dial-a-ride problem with private fleet and common carrier.
Comput. Oper. Res., 2022

An exact method for the combinatorial bids generation problem with uncertainty on clearing prices, bids success, and contracts materialization.
Comput. Oper. Res., 2022

2021
Asymmetric Multidepot Vehicle Routing Problems: Valid Inequalities and a Branch-and-Cut Algorithm.
Oper. Res., 2021

The time-dependent shortest path and vehicle routing problem.
INFOR Inf. Syst. Oper. Res., 2021

Quadratic assignment problem variants: A survey and an effective parallel memetic iterated tabu search.
Eur. J. Oper. Res., 2021

Heuristics for the dynamic facility location problem with modular capacities.
Eur. J. Oper. Res., 2021

The two-echelon production-routing problem.
Eur. J. Oper. Res., 2021

Models and algorithms for the delivery and installation routing problem.
Eur. J. Oper. Res., 2021

Bus Trajectory Optimization With Holding, Speed and Traffic Signal Actuation in Controlled Transit Systems.
IEEE Access, 2021

2020
Optimizing drinking water distribution system operations.
Eur. J. Oper. Res., 2020

The exact solutions of several types of container loading problems.
Eur. J. Oper. Res., 2020

Exact algorithms for the multi-pickup and delivery problem with time windows.
Eur. J. Oper. Res., 2020

The two-echelon inventory-routing problem with fleet management.
Comput. Oper. Res., 2020

The vehicle routing problem with simultaneous pickup and delivery and handling costs.
Comput. Oper. Res., 2020

Replenishment and denomination mix of automated teller machines with dynamic forecast demands.
Comput. Oper. Res., 2020

A hybrid adaptive large neighborhood search heuristic for the team orienteering problem.
Comput. Oper. Res., 2020

2019
Analyse spatiotemporelle des tournées de livraison d'une entreprise de livraison à domicile.
Rev. Int. Géomatique, 2019

A hybrid adaptive large neighbourhood search for multi-depot open vehicle routing problems.
Int. J. Prod. Res., 2019

Flexible two-echelon location routing problem.
Eur. J. Oper. Res., 2019

Benchmark Instances and Branch-and-Cut Algorithm for the Hashiwokakero Puzzle.
CoRR, 2019

Exact solution methods for the multi-period vehicle routing problem with due dates.
Comput. Oper. Res., 2019

Determining time-dependent minimum cost paths under several objectives.
Comput. Oper. Res., 2019

The two-echelon multi-depot inventory-routing problem.
Comput. Oper. Res., 2019

Matheuristics for solving the Multiple Knapsack Problem with Setup.
Comput. Ind. Eng., 2019

2018
Alternative formulations and improved bounds for the multi-depot fleet size and mix vehicle routing problem.
OR Spectr., 2018

The Traveling Backpacker Problem: A computational comparison of two formulations.
J. Oper. Res. Soc., 2018

Mathematical model, heuristics and exact method for order picking in narrow aisles.
J. Oper. Res. Soc., 2018

A simultaneous facility location and vehicle routing problem arising in health care logistics in the Netherlands.
Eur. J. Oper. Res., 2018

The multi-pickup and delivery problem with time windows.
Eur. J. Oper. Res., 2018

Sequential versus integrated optimization: Production, location, inventory control, and distribution.
Eur. J. Oper. Res., 2018

The open vehicle routing problem with decoupling points.
Eur. J. Oper. Res., 2018

2017
A survey on the inventory-routing problem with stochastic lead times and demands.
J. Appl. Log., 2017

Order picking problems under weight, fragility and category constraints.
Int. J. Prod. Res., 2017

The pickup and delivery traveling salesman problem with handling costs.
Eur. J. Oper. Res., 2017

A Variable MIP Neighborhood Descent algorithm for managing inventory and distribution of cash in automated teller machines.
Comput. Oper. Res., 2017

2016
A Branch-Price-and-Cut Algorithm for the Inventory-Routing Problem.
Transp. Sci., 2016

An Inventory-Routing Problem with Pickups and Deliveries Arising in the Replenishment of Automated Teller Machines.
Transp. Sci., 2016

Solving the vehicle routing problem with lunch break arising in the furniture delivery industry.
J. Oper. Res. Soc., 2016

Road-based goods transportation: a survey of real-world logistics applications from 2000 to 2015.
INFOR Inf. Syst. Oper. Res., 2016

Robustness of inventory replenishment and customer selection policies for the dynamic and stochastic inventory-routing problem.
Comput. Oper. Res., 2016

2015
Classification, models and exact algorithms for multi-compartment delivery problems.
Eur. J. Oper. Res., 2015

A hybrid method for the Probabilistic Maximal Covering Location-Allocation Problem.
Comput. Oper. Res., 2015

2014
Thirty Years of Inventory Routing.
Transp. Sci., 2014

A comparison of several enumerative algorithms for Sudoku.
J. Oper. Res. Soc., 2014

Optimal joint replenishment, delivery and inventory management policies for perishable products.
Comput. Oper. Res., 2014

Heuristics for dynamic and stochastic inventory-routing.
Comput. Oper. Res., 2014

Exact formulations and algorithm for the train timetabling problem with dynamic demand.
Comput. Oper. Res., 2014

2013
The exact solution of several classes of inventory-routing problems.
Comput. Oper. Res., 2013

Flexibility and consistency in inventory-routing.
4OR, 2013

2012
The inventory-routing problem with transshipment.
Comput. Oper. Res., 2012


  Loading...